Compact roundtrip routing in directed networks (extended abstract)

  • Authors:

  • Lenore J. Cowen;Christopher G. Wagner

  • Affiliations:

  • Department of Mathematical Sciences, Johns Hopkins University, Baltimore, MD;Department of Mathematical Sciences, Johns Hopkins University, Baltimore, MD

  • Venue:
  • Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

The first sublinear average space universal compact routing schemes for directed networks are presented. For each integer k ≥ 1, they use O(k log n) size addresses; O(kn 1/k+1)-sized routing tables on average at each node; and achieve roundtrip routes of stretch at most 2k+1-1 in any (weighted) directed network. We extend our results to yield universal compact roundtrip routing schemes with the stronger requirement that they use sublinear maximum space at every node. These schemes also use O(k log n) size addresses and achieve roundtrip routes of stretch at most 2k+1 - 1 in any (weighted) directed network, and they bound the maximum sized table at each node by O(kn 3k+1/2·3k).