Compact routing with name independence

Authors:
Marta Arias;Lenore J. Cowen;Kofi A. Laing;Rajmohan Rajaraman;Orjeta Taka
Affiliations:
Tufts University, Medford, MA;Tufts University, Medford, MA;Tufts University, Medford, MA;Northeastern University, Boston, MA;Tufts University, Medford, MA
Venue:
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2003

Citing 11
Cited 18

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
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Routing with polynomial communication-space trade-off

SIAM Journal on Discrete Mathematics
Distance-dependent distributed directories

Information and Computation
Compact routing schemes with low stretch factor (extended abstract)

PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Compact routing with minimum stretch

Journal of Algorithms
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Approximate distance oracles

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Distributed object location in a dynamic network

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures

Compact roundtrip routing with topology-independent node names

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Unmanaged Internet Protocol: taming the edge network management crisis

ACM SIGCOMM Computer Communication Review
Compact name-independent routing with minimum stretch

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Object location in realistic networks

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Brief announcement: name-independent compact routing in trees

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Name independent routing for growth bounded networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
On space-stretch trade-offs: upper bounds

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Name-independent compact routing in trees

Information Processing Letters
On compact routing for the internet

ACM SIGCOMM Computer Communication Review
Improved sparse covers for graphs excluding a fixed minor

Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Linked decompositions of networks and the power of choice in Polya urns

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Compact name-independent routing with minimum stretch

ACM Transactions on Algorithms (TALG)
Compact roundtrip routing with topology-independent node names

Journal of Computer and System Sciences
Scalable routing on flat names

Proceedings of the 6th International COnference
Exact distance labelings yield additive-stretch compact routing schemes

DISC'06 Proceedings of the 20th international conference on Distributed Computing
Robust locality-aware lookup networks

Self-star Properties in Complex Information Systems
HDLBR: A name-independent compact routing scheme for power-law networks

Computer Communications
Compact routing schemes with improved stretch

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with compact routing in the name independent model first introduced by Awerbuch et al. [1] for adaptive routing in dynamic networks. A compact routing scheme that uses local routing tables of size Õ(n1/2), O(log2 n)-sized packet headers, and stretch bounded by 5 is obtained. Alternative schemes reduce the packet header size to O(log n) at cost of either increasing the stretch to 7, or increasing the table size to Õ(n2/3). For smaller table-size requirements, the ideas in these schemes are generalized to a scheme that uses O(log2 n)-sized headers, Õ(k2n2/k)-sized tables, and achieves a stretch of min[1 + (k-1)(2k/2-2), 16k2+4k ], improving the best previously-known name-independent scheme due to Awerbuch and Peleg [3].