Matthew Caesar
Abstract
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in Distributed Hash Tables (DHTs) but it does not rely on an underlying network routing protocol. It is implemented directly on top of the link layer. VRR provides both raditional point-to-point network routing and DHT routing to the node responsible for a hash table key.VRR can be used with any link layer technology but this paper describes a design and several implementations of VRR that are tuned for wireless networks. We evaluate the performance of VRR using simulations and measurements from a sensor network and an 802.11a testbed. The experimental results show that VRR provides robust performance across a wide range of environments and workloads. It performs comparably to, or better than, the best wireless routing protocol in each experiment. VRR performs well because of its unique features: it does not require network flooding or trans-lation between fixed identifiers and location-dependent addresses.
- ns-2 network simulator. http://www.isi.edu/nsnam/ns/.Google Scholar
- J.-Y. Le Boudec and M. Vojnovic. Perfect simulation and stationarity of a class of mobility models. In Infocom, 2005.Google ScholarCross Ref
- J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Mobicom, October 1998. Google ScholarDigital Library
- M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Secure routing for structured peer-to-peer overlay networks. In OSDI, December 2002. Google ScholarDigital Library
- B. Chen and R. Morris. L+: scalable landmark routing and address lookup for multi-hop wireless networks. In Technical Report 837, MIT LCS, March 2002.Google Scholar
- T. Clausen and P. Jacquet. OLSR RFC3626, October 2003. http://ietf.org/rfc/rfc3626.txt.Google Scholar
- D. De Couto, D. Aguayo, J. Bicket, and R. Morris. A high-throughput path metric for multi-hop wireless routing. In Mobicom, 2003. Google ScholarDigital Library
- F. Delmastro. From Pastry to CrossROAD: Cross-layer ring overlay for ad hoc networks. In PerCom Workshops, 2005. Google ScholarDigital Library
- J. Douceur. The sybil attack. In IPTPS, March 2002. Google ScholarDigital Library
- R. Draves, J. Padhye, and B. Zill. Comparison of routing metrics for static multi-hop wireless networks. In SIGCOMM, August 2004. Google ScholarDigital Library
- R. Draves, J. Padhye, and B. Zill. Routing in multi-radio, multi-hop wireless mesh networks. In Mobicom, September 2004. Google ScholarDigital Library
- J. Dunagan, N. Harvey, M. Jones, D. Kostic, M. Theimer, and A. Wolman. Fuse: Lightweight guaranteed distributed failure notification. In OSDI, December 2004. Google ScholarDigital Library
- J. Eriksson, M. Faloutsos, and S. Krishnamurthy. Peernet: Pushing peer-to-peer down the stack. In IPTPS, February 2003.Google ScholarCross Ref
- R. Fonseca. Personal communication.Google Scholar
- R. Fonseca, S. Ratnasamy, J. Zhao, C. Ee, D. Culler, S. Shenker, and I. Stoica. Beacon vector routing: Scalable point-to-point in wireless sensornets. In NSDI, May 2005. Google ScholarDigital Library
- B. Ford. Unmanaged Internet Protocol: Taming the edge network management crisis. In HotNets II, November 2003.Google Scholar
- D. Gay, P. Levis, R. vonBehren, M. Welsh, E. Brewer, and D. Culler. The nesC Language: A Holistic Approach to Networked Embedded Systems. In PLDI, June 2003. Google ScholarDigital Library
- Z. J. Haas and M. R. Pearlman. The zone routing protocol (ZRP) for ad hoc networks. July 2002. Internet-draft, draft-ietf-manet-zone-zrp-04.txt.Google Scholar
- A. Haeberlen, J. Hoye, A. Mislove, and P. Druschel. Consistent Key Mapping in Structured Overlays. In Technical Report TR05-456, Rice CS department, August 2005.Google Scholar
- J. Hill and D. Culler. Mica: A wireless platform for deeply embedded networks. IEEE Micro, 2002. Google ScholarDigital Library
- Y. Hu, H. Pucha, and S. Das. Exploiting the synergy between peer- to-peer and mobile ad-hoc networks. In Hot-OS IX, May 2003. Google ScholarDigital Library
- D. Johnson and D. Maltz. Dynamic source routing in ad hoc wireless networks. In Ad Hoc Networking, 2001. Google ScholarDigital Library
- D.B. Johnson and D.A. Maltz. Dynamic source routing in ad hoc wireless networks. Mobile Computing, 353, 1996.Google Scholar
- B. Karp and H. Kung. Greedy perimeter stateless routing for wireless networks. In Mobicom, August 2000. Google ScholarDigital Library
- P. Key and G. Cope. Distributed Dynamic Routing Schemes. IEEE Communications Magazine, October 1990.Google Scholar
- Y-J Kim, R. Govindan, B. Karp, and S. Shenker. Geographic routing made practical. In NSDI, May 2005. Google ScholarDigital Library
- P. Levis, S. Madden, D. Gay, J. Polastre, R. Szewczyk, A. Woo, E. Brewer, and D. Culler. The Emergence of Networking Abstractions and Techniques in TinyOS. In NSDI, March 2004. Google ScholarDigital Library
- J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris. A scalable location service for geographic ad-hoc routing. In Mobicom, August 2000. Google ScholarDigital Library
- P. Maymounkov and D. Mazères. Kademlia: A Peer-to-peer Information System. In IPTPS, 2002. Google ScholarDigital Library
- R. Moskowitz, P. Nikander, P. Jokela, and T. Henderson. Host identity protocol (HIP), 2004. draft-moskowitz-hip-08.txt.Google Scholar
- S. Murthy and J.J. Garcia-Luna-Aceves. An efficient routing protocol for wireless networks. In Mobile Networks and Applications, 1996. Google ScholarDigital Library
- V. Park and M. Corson. Temporally-ordered routing algorithm (TORA) version 1: Functional specification. July 2001. Internet-draft, draft- etf-manet-tora-spec-04.txt.Google Scholar
- G. Pei, M. Gerla, and X. Hong. LANMAR: Landmark routing for large scale wireless ad hoc networks with group mobility. In MobiHoc, 2000. Google ScholarDigital Library
- C. Perkins and P. Bhagwat. Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers. In Sigcomm, August 1994. Google ScholarDigital Library
- C. Perkins and E. Royer. Ad hoc on-demand distance vector routing. In Mobile Computing Systems and Applications, February 1999. Google ScholarDigital Library
- H. Pucha, S. M. Das, and Y. C. Hu. Imposed route reuse in ad hoc network routing protocols using structured peer-to-peer overlay routing. IEEE Transactions on Parallel and Distributed Systems (to appear), 2006. Google ScholarDigital Library
- V. Ramasubramanian, Z. Haas, and E. Sirer. SHARP: A hybrid adaptive routing protocol for mobile ad hoc networks. In Mobihoc, June 2003. Google ScholarDigital Library
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Sigcomm, August 2001. Google ScholarDigital Library
- A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Middleware, November 2001. Google ScholarDigital Library
- I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Sigcomm, August 2001. Google ScholarDigital Library
- A. Woo, T. Tong, and D. Culler. Taming the underlying challenges of reliable multihop routing in sensor networks. In SenSys, November 2003. Google ScholarDigital Library
- J. Yoon, M. Liu, and B. Noble. Random waypoint considered harmful. In Infocom, 2003.Google ScholarCross Ref
- T. Zahn and J. Schiller. MADPastry: A DHT substrate for practicably sized MANETs. In ASWN, June 2005.Google Scholar
- B. Zhao, J. Kubiatowicz, and A. Joseph. Tapestry: an infrastructure for fault-resilient wide-area location and routing. In Technical report UCB//CSD-01-1141, U.C. Berkeley, April 2001. Google ScholarDigital Library
Index Terms
- Virtual ring routing: network routing inspired by DHTs
Recommendations
Virtual ring routing: network routing inspired by DHTs
SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communicationsThis paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in Distributed Hash Tables (DHTs) but it does not rely on an underlying ...
Virtual id routing: a scalable routing framework with support for mobility and routing efficiency
MobiArch '08: Proceedings of the 3rd international workshop on Mobility in the evolving internet architectureCurrent flat-id based routing schemes promise support for mobility and scalability. However, providing efficient routing with minimal overheads for mobility is still a challenge. In this paper we provide a solution to these problems by introducing ...
Low traffic overlay networks with large routing tables
Performance evaluation reviewThe routing tables of Distributed Hash Tables (DHTs) can vary from size O(1) to O(n). Currently, what is lacking is an analytic framework to suggest the optimal routing table size for a given workload. This paper (1) compares DHTs with O(1) to O(n) ...
Comments