6 search results - page 1 / 2 » Compact name-independent routing with minimum stretch |
SPAA
2003
ACM
13 years 9 months ago
2003
ACM
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 co...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
SPAA
2004
ACM
13 years 10 months ago
2004
ACM
MOBIHOC
2012
ACM
11 years 7 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
SPAA
2006
ACM
13 years 10 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...