Compact routing with name independence

This paper is concerned with compact routing schemes for arbitrary undirected networks in the name-independent model first introduced by Awerbuch, Bar-Noy, Linial and Peleg. A compact routing scheme that uses local routing tables of size ˜O(n1/2 ),1 O(log2 n)-sized packet headers, and stretch bounded by 5 is obtained, where n is the number of nodes in the network. Alternative schemes reduce the packet header size to O(log n) at the cost of either increasing the stretch to 7 or increasing the table size to ˜O(n2/3 ). For smaller table-size requirements, the ideas in these schemes are generalized to a scheme that uses O(log2 n)-sized headers, ˜O(k2 n2/k )-sized tables, and achieves a stretch of min{1 + (k − 1)(2k/2 − 2), 16k2 − 8k}, improving the best previously-known name-independent scheme due to Awerbuch and Peleg.

• Type: Conference
• Year: 2003
• Where: SPAA
• Authors: Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka
• Keywords: Arbitrary Undirected Networks, Compact Routing Scheme, Distributed And Parallel Computing, Packet Header, SPAA 2003