Computing routing schemes that support both high throughput and low latency is one of the
core challenges of network optimization. Such routes can be formalized as h-length flows …

In the load-balancing problem, we have an n-vertex bipartite graph G=(L, R, E) between a
set of clients and servers. The goal is to find an assignment of all clients to the servers, while …

In the load balancing problem, each node in a network is assigned a load, and the goal is to
equally distribute the loads among the nodes, by preforming local load exchanges. While …

In the distributed backup-placement problem [9] each node of a network has to select one
neighbor, such that the maximum number of nodes that make the same selection is …

Abstract Wireless Sensor Networks (WSNs) frequently have distinguished amount of data
loss, causing data integrity issues. Sensor nodes are inherently a cheap piece of hardware …

Current-day data centers and high-volume cloud services employ a broad set of
heterogeneous servers. In such settings, client requests typically arrive at multiple entry …

In the load balancing problem, the input is an $ n $-vertex bipartite graph $ G=(C\cup S, E) $
and a positive weight for each client $ c\in C $. The algorithm must assign each client $ c\in …

We consider the Backup Placement problem in networks in the distributed setting. Given a
network graph G=(V, E), the goal of each vertex υ∊ V is selecting a neighbor, such that the …

In the weighted load balancing problem, the input is an $ n $-vertex bipartite graph between
a set of clients and a set of servers, and each client comes with some nonnegative real …

Graph matching is a fundamental graph theory problem which has a broad application
range including information retrieval, pattern recognition, graph partitioning, chemical …