Distributed routing in tree networks with few landmarks

Authors:
Ioannis Z. Emiris;Euripides Markou;Aris Pagourtzis
Affiliations:
Dept. Informatics & Telecoms, National University of Athens, Greece;Dept. Informatics & Telecoms, National University of Athens, Greece;School of Elec. and Comp. Eng., National Technical University of Athens, Greece
Venue:
CAAN'06 Proceedings of the Third international conference on Combinatorial and Algorithmic Aspects of Networking
Year:
2006

Citing 19
Cited 0

The landmark hierarchy: a new hierarchy for routing in very large networks

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A trade-off between space and efficiency for routing tables

Journal of the ACM (JACM)
Compact distributed data structures for adaptive routing

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Efficient message routing in planar networks

SIAM Journal on Computing
How to allocate network centers

Journal of Algorithms
Distance-dependent distributed directories

Information and Computation
Memory requirement for universal routing schemes

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Local memory requirement of universal routing schemes

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Landmarks in graphs

Discrete Applied Mathematics
Memory requirement for routing in distributed networks

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Optimal routing tables

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The Capacitated K-Center Problem

SIAM Journal on Discrete Mathematics
Compact routing schemes

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Routing in Trees

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Lower Bounds for Compact Routing (Extended Abstract)

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Compact and localized distributed data structures

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Name independent routing for growth bounded networks

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Separator-based strategies for efficient message routing

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Compact routing for graphs excluding a fixed minor

DISC'05 Proceedings of the 19th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situated in a starting node, has to walk to a target node traversing a path of minimum length. All information about adjacencies is distributed to certain nodes called landmarks. We wish to minimize the total memory requirements as well as keep the memory requirements per landmark to reasonable levels. We propose a landmark selection and information distribution scheme with overall memory requirement linear in the number of nodes, and constant memory consumption per non-landmark node. We prove that a navigation algorithm using this scheme attains a constant stretch factor overhead in tree topologies, compared to an optimal landmark-based routing algorithm that obeys certain restrictions. The flexibility of our approach allows for various trade-offs, such as between the number of landmarks and the size of the region assigned to each landmark.