Skip to main content
Article thumbnail
Location of Repository

Compact Routing With Name Independence

By Marta Arias, Lenore J. Cowen, Kofi A. Laing, Rajmohan Rajaraman and Orjeta Taka


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 Õ(n 1/2), O(log 2 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(log 2 n)-sized headers, Õ(k 2 n 2/k)-sized tables, and achieves a stretch of min{1 + (k − 1)(2 k/2 − 2), 16k 2 + 4k}, improving the best previously-known nameindependent scheme due to Awerbuch and Peleg [3]

Topics: General Terms Algorithms, Performance, Design, Theory. Keywords Compact Routing, Stretch, Distributed Lookup Tables
Year: 2003
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.