Compact distributed data structures for adaptive routing

  • Authors:

  • B. Awerbuch;A. Bar-Noy;N. Linial;D. Peleg

  • Affiliations:

  • Dept. of Mathematics and Lab. for Computer Science, MIT, Cambridge, MA;tcomputer Science Department, Stanford University, Stanford, CA;IBM Almaden Research Center 650 Harry Road, San Jose, CA;SDepartment of Applied Mathematics, The Weizmann Institute, Rehovot 76100, Israel

  • Venue:
  • STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

Abstract

In designing a routing scheme for a communication network it is desirable to use as short as possible paths for routing messages, while keeping the routing information stored in the processors' local memory as succinct as possible. The efficiency of a routing scheme is measured in terms of its stretch factor - the maximum ratio between the cost of a route computed by the scheme and that of a cheapest path connecting the same pair of vertices.This paper presents a family of adaptive routing schemes for general networks. The hierarchical schemes H Sk (for every fixed k ≥ 1) guarantee a stretch factor of O (k2 · 3k) and require storing at most O (knk log n) bits of routing information per vertex. The new important features, that make the schemes appropriate for adaptive use, areapplicability to networks with arbitrary edge costs;name-independence, i.e., usage of original names;a balanced distribution of the memory;an efficient on-line distributed preprocessing.