Memory requirement for routing in distributed networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Compact routing with minimum stretch
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficiency for routing schemes of stretch factor three
Journal of Parallel and Distributed Computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
HAWAII: A Domain-Based Approach for Supporting Mobility in Wide-Area Wireless Networks
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Virtual ring routing: network routing inspired by DHTs
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Host Mobility Using an Internet Indirection Infrastructure
Proceedings of the 1st international conference on Mobile systems, applications and services
On compact routing for the internet
ACM SIGCOMM Computer Communication Review
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
S4: small state and small stretch routing protocol for large wireless sensor networks
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
IEEE Communications Magazine
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Scalable routing on flat names
Proceedings of the 6th International COnference
Trap array: a unified model for scalability evaluation of geometric routing
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
| Hi-index | 0.00 |
We propose a compact routing architecture to support mobility in a scalable manner. Our routing architecture requires a route table of size of O(√nlog(n)) in order to provide a path stretch with a provable upper bound of 3. This is the optimal path stretch. Our architecture is built upon the theory of compact routing, which has so far been utilized in static networks only. This is the first attempt to the best of our knowledge to transpose such architecture into a network with mobility support. Our contribution is to adapt the static theory of compact routing to a class of networks with mobile leaf nodes and a static core infrastructure.