Upper and lower bounds for routing schemes in dynamic networks

Yehuda Afek*, Eli Gafni, Moty Ricklin

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

An algorithm and two lower bounds are presented for the problem of constructing and maintaining routing schemes in dynamic networks. The algorithm distributively assigns addresses to nodes and constructs routing tables in a dynamically growing tree. The resulting scheme routes data messages over the shortest path between any source and destination, assigns addresses of O(log2n) bits to each node, and uses in its routing table O(log3n) bits of memory per incident link, where n is the final number of nodes in the tree. The amortized communication cost of the algorithm is O(log n) messages per node. Also given are two lower bounds on the tradeoff between the quality of routing schemes (i.e., their stretch factor) and their amortized communication cost in general dynamic networks.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherPubl by IEEE
Pages370-375
Number of pages6
ISBN (Print)0818619821, 9780818619823
DOIs
StatePublished - 1989
Externally publishedYes
Event30th Annual Symposium on Foundations of Computer Science - Research Triangle Park, NC, USA
Duration: 30 Oct 19891 Nov 1989

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Conference

Conference30th Annual Symposium on Foundations of Computer Science
CityResearch Triangle Park, NC, USA
Period30/10/891/11/89

Fingerprint

Dive into the research topics of 'Upper and lower bounds for routing schemes in dynamic networks'. Together they form a unique fingerprint.

Cite this