activity
20122022
most citedConstrained In-network Computing with Low Congestion in Datacenter Networks

2 citations · 6 across the 9 of their papers we have counts for

collaborators

13 papers

cs.NI2022

Virtual Service Embedding with Time-Varying Load and Provable Guarantees

Gil Einziger, Gabriel Scalosub, Carla Fabiana Chiasserini +1

Deploying services efficiently while satisfying their quality requirements is a major challenge in network slicing. Effective solutions place instances of the services' virtual net…

cs.NI2022

False Negative Awareness in Indicator-based Caching Systems

Itamar Cohen, Gil Einziger, Gabriel Scalosub

Distributed caching systems such as content distribution networks often advertise their content via lightweight approximate indicators (e.g., Bloom filters) to efficiently inform c…

cs.NI2022★ 2 cited

Dynamic Service Provisioning in the Edge-cloud Continuum with Provable Guarantees

Itamar Cohen, Carla Fabiana Chiasserini, Paolo Giaccone +1

We consider a hierarchical edge-cloud architecture in which services are provided to mobile users as chains of virtual network functions. Each service has specific computation requ…

cs.NI2022

Parallel Virtual Machines Placement with Provable Guarantees

Itamar Cohen, Gil Einziger, Maayan Goldstein +3

Network Function Virtualization (NFV) carries the potential for on-demand deployment of network algorithms in virtual machines (VMs). In large clouds, however, VM resource allocati…

cs.DC2022★ 2 cited

Constrained In-network Computing with Low Congestion in Datacenter Networks

Raz Segal, Chen Avin, Gabriel Scalosub

Distributed computing has become a common practice nowadays, where the recent focus has been given to the usage of smart networking devices with in-network computing capabilities.…

cs.NI2021

SOAR: Minimizing Network Utilization with Bounded In-network Computing

Raz Segal, Chen Avin, Gabriel Scalosub

In-network computing via smart networking devices is a recent trend for modern datacenter networks. State-of-the-art switches with near line rate computing and aggregation capabili…

cs.NI2021★ 1 cited

Self-adjusting Advertisement of Cache Indicators with Bandwidth Constraints

Itamar Cohen, Gil Einziger, Gabriel Scalosub

Cache advertisements reduce the access cost by allowing users to skip the cache when it does not contain their datum. Such advertisements are used in multiple networked domains suc…

cs.NI2021

On the Power of False Negative Awareness in Indicator-based Caching Systems

Itamar Cohen, Gil Einziger, Gabriel Scalosub

Distributed caching systems such as content distribution networks often advertise their content via lightweight approximate indicators (e.g., Bloom filters) to efficiently inform c…

cs.NI2019

Reducing Service Deployment Cost Through VNF Sharing

Francesco Malandrino, Carla Fabiana Chiasserini, Gil Einziger +1

Thanks to its computational and forwarding capabilities, the mobile network infrastructure can support several third-party ("vertical") services, each composed of a graph of virtua…

cs.NI2017

Queueing in the Mist: Buffering and Scheduling with Limited Knowledge

Itamar Cohen, Gabriel Scalosub

Scheduling and managing queues with bounded buffers are among the most fundamental problems in computer networking. Traditionally, it is often assumed that all the properties of ea…

cs.NI2014

Bounded Delay Scheduling with Packet Dependencies

Michael Markovitch, Gabriel Scalosub

A common situation occurring when dealing with multimedia traffic is having large data frames fragmented into smaller IP packets, and having these packets sent independently throug…

cs.NI2013

On Quality of Monitoring for Multi-channel Wireless Infrastructure Networks

Huy Nguyen, Gabriel Scalosub, Rong Zheng

Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource managem…

cs.NI2012★ 1 cited

Balancing Work and Size with Bounded Buffers

Kirill Kogan, Alejandro Lopez-Ortiz, Sergey I. Nikolenko +2

We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, where each packet requires several rounds of processi…