TY - GEN

T1 - Upper and lower bounds for routing schemes in dynamic networks

AU - Afek, Yehuda

AU - Gafni, Eli

AU - Ricklin, Moty

PY - 1989

Y1 - 1989

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024766728&partnerID=8YFLogxK

U2 - 10.1109/sfcs.1989.63505

DO - 10.1109/sfcs.1989.63505

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0024766728

SN - 0818619821

SN - 9780818619823

T3 - Annual Symposium on Foundations of Computer Science (Proceedings)

SP - 370

EP - 375

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - Publ by IEEE

T2 - 30th Annual Symposium on Foundations of Computer Science

Y2 - 30 October 1989 through 1 November 1989

ER -