Compact name-independent routing with minimum stretch

Authors:
Ittai Abraham;Cyril Gavoille;Dahlia Malkhi;Noam Nisan;Mikkel Thorup
Affiliations:
Hebrew University of Jerusalem, Jerusalem, Israel;University of Bordeaux, Bordeaux, France;Hebrew University of Jerusalem, Jerusalem, Israel & Microsoft Research;Hebrew University of Jerusalem, Jerusalem, Israel;AT&T Labs - Research, Florham Park, NJ
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2008

Citing 19
Cited 11

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Compact distributed data structures for adaptive routing

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Improved routing strategies with succinct tables

Journal of Algorithms
Randomized algorithms

Randomized algorithms
Compact routing with minimum stretch

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Distributed computing: a locality-sensitive approach

Distributed computing: a locality-sensitive approach
Storing a sparse table

Communications of the ACM
Space-efficiency for routing schemes of stretch factor three

Journal of Parallel and Distributed Computing
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Deterministic dictionaries

Journal of Algorithms
Routing in distributed networks: overview and open problems

ACM SIGACT News
A Space Lower Bound for Routing in Trees

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Compact routing with name independence

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Compact routing schemes with low stretch factor

Journal of Algorithms
Compact and localized distributed data structures

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Approximate distance oracles

Journal of the ACM (JACM)
Sparse partitions

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Deterministic constructions of approximate distance oracles and spanners

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Compact Routing Schemes for Dynamic Trees in the Fixed Port Model

ICDCN '09 Proceedings of the 10th International Conference on Distributed Computing and Networking
Compact routing in power-law graphs

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Sparse spanners vs. compact routing

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Simulating Routing Schemes on Large-Scale Topologies

PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
On approximate distance labels and routing schemes with affine stretch

DISC'11 Proceedings of the 25th international conference on Distributed computing
k-chordal graphs: from cops and robber to compact routing via treewidth

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

PADS '12 Proceedings of the 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation
A compact routing scheme and approximate distance oracle for power-law graphs

ACM Transactions on Algorithms (TALG)
HDLBR: A name-independent compact routing scheme for power-law networks

Computer Communications
Fast routing table construction using small messages: extended abstract

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Shortest-path queries in static networks

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using aÕ(&sqrt;n,) space routing table at each node, and routing along paths of stretch 3, that is, at most thrice as long as the minimum cost paths. This is optimal in a very strong sense. It is known that no compact routing using o(n) space per node can route with stretch below 3. Also, it is known that any stretch below 5 requires Ω(&sqrt;n,)space per node.