This paper studies the fundamental task of establishing routing paths in distributed networks. We prove the existence of compact routing tables that store in each network-node few simple forwarding rules tracing out hop-constrained and oblivious routing paths for any pair of nodes. For any collection of pairs the congestion of these paths is almost-optimal, i.e., competitive with the globally optimal solution up to a sub-polynomial factor. The key to this result is the algorithmic theory of hop-constrained expanders and expander decompositions developed in this paper. Informally, we say a graph is an h-hop †-expanders iff for any set of node-pairs, in which each node is paired to O(deg(v)) nodes at hop-distance O(h), there exists an (h)-hop...
We describe a distributed randomized algorithm to con-struct routing tables. Given 0 < ε ≤ 1/2, t...
We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency...
AbstractWe introduce an on-line protocol which routes any set ofNpackets along shortest paths with c...
Many distributed optimization algorithms achieve an existentially-optimal round complexity (of (O?(?...
We provide universally-optimal distributed graph algorithms for (1+∊)-approximate shortest path prob...
We describe a distributed randomized algorithm computing approximate distances and routes that appro...
Network design problems aim to compute low-cost structures such as routes, trees and subgraphs. Ofte...
Many distributed optimization algorithms achieve existentially-optimal running times, meaning that t...
In this paper we present routing algorithms that are universal in the sense that they route messages...
In this paper, we address a hop-constrained node survivable traffic engineering problem in the conte...
We present a distributed asynchronous algorithm that, for every undirected weighted n-node graph G, ...
Hierarchical graph decompositions play ail important role in the design of approximation and online ...
In this paper, we deal with the compact routing problem on distributed networks, that is implementi...
Abstract—Hop count limitation helps controlling the spread of messages as well as the protocol compl...
Consider a given network defined by an undirected graph with a capacity value associated with each e...
We describe a distributed randomized algorithm to con-struct routing tables. Given 0 < ε ≤ 1/2, t...
We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency...
AbstractWe introduce an on-line protocol which routes any set ofNpackets along shortest paths with c...
Many distributed optimization algorithms achieve an existentially-optimal round complexity (of (O?(?...
We provide universally-optimal distributed graph algorithms for (1+∊)-approximate shortest path prob...
We describe a distributed randomized algorithm computing approximate distances and routes that appro...
Network design problems aim to compute low-cost structures such as routes, trees and subgraphs. Ofte...
Many distributed optimization algorithms achieve existentially-optimal running times, meaning that t...
In this paper we present routing algorithms that are universal in the sense that they route messages...
In this paper, we address a hop-constrained node survivable traffic engineering problem in the conte...
We present a distributed asynchronous algorithm that, for every undirected weighted n-node graph G, ...
Hierarchical graph decompositions play ail important role in the design of approximation and online ...
In this paper, we deal with the compact routing problem on distributed networks, that is implementi...
Abstract—Hop count limitation helps controlling the spread of messages as well as the protocol compl...
Consider a given network defined by an undirected graph with a capacity value associated with each e...
We describe a distributed randomized algorithm to con-struct routing tables. Given 0 < ε ≤ 1/2, t...
We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency...
AbstractWe introduce an on-line protocol which routes any set ofNpackets along shortest paths with c...