Fast routing table construction using small messages: extended abstract

Authors:
Christoph Lenzen;Boaz Patt-Shamir
Affiliations:
MIT, Cambridge, MA, Israel;Tel Aviv University, Tel Aviv, Israel
Venue:
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Year:
2013

Citing 21
Cited 1

A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
Greedy packet scheduling on shortest paths

Journal of Algorithms
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction

SIAM Journal on Computing
Exact and Approximate Distances in Graphs - A Survey

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
$(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs

SIAM Journal on Computing
Approximate distance oracles

Journal of the ACM (JACM)
An Unconditional Lower Bound on the Time-Approximation Trade-off for the Distributed Minimum Spanning Tree Problem

SIAM Journal on Computing
On space-stretch trade-offs: lower bounds

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs

Random Structures & Algorithms
Compact name-independent routing with minimum stretch

ACM Transactions on Algorithms (TALG)
A sub-linear time distributed algorithm for minimum-weight spanning trees

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Distributed verification and hardness of distributed approximation

Proceedings of the forty-third annual ACM symposium on Theory of computing
Computer Networks, Fifth Edition: A Systems Approach

Computer Networks, Fifth Edition: A Systems Approach
Networks cannot compute their diameter in sublinear time

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Simple distributed algorithms for approximating minimum steiner trees

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Efficient computation of distance sketches in distributed networks

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Optimal distributed all pairs shortest paths and applications

PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Distributed algorithms for network diameter and girth

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II

Efficient distributed source detection with limited bandwidth

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a distributed randomized algorithm to construct routing tables. Given 01/2+ε + HD), where n is the number of nodes and HD denotes the diameter of the network in hops (i.e., as if the network is unweighted). The weighted length of the produced routes is at most O(ε-1log ε-1) times the optimal weighted length. This is the first algorithm to break the Omega(n) complexity barrier for computing weighted shortest paths even for a single source. Moreover, the algorithm nearly meets the ~Omega(n1/2 + HD) lower bound for distributed computation of routing tables and approximate distances (with optimality, up to polylog factors, for ε=1/log n). The presented techniques have many applications, including improved distributed approximation algorithms for Generalized Steiner Forest, all-pairs distance estimation, and estimation of the weighted diameter.