52 citations · 106 across the 21 of their papers we have counts for
4 papers · 1 filter
An Approximation Algorithm for Path Computation and Function Placement in SDNs
Guy Even, Matthias Rost, Stefan Schmid
We consider the task of computing (combined) function mapping and routing for requests in Software-Defined Networks (SDNs). Function mapping refers to the assignment of nodes in th…
Competitive Path Computation and Function Placement in SDNs
Guy Even, Moti Medina, Boaz Patt-Shamir
We consider a task of serving requests that arrive in an online fashion in Software-Defined Networks (SDNs) with network function virtualization (NFV). Each request specifies an ab…
A Constant Approximation Algorithm for Scheduling Packets on Line Networks
Guy Even, Moti Medina, Adi Rosén
In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers, where the aim is that of maximizing the throughput. Ea…
Sublinear Random Access Generators for Preferential Attachment Graphs
Guy Even, Reut Levi, Moti Medina +1
We consider the problem of sampling from a distribution on graphs, specifically when the distribution is defined by an evolving graph model, and consider the time, space and random…