Virtual ring routing: network routing inspired by DHTs

  • Authors:
  • Matthew Caesar;Miguel Castro;Edmund B. Nightingale;Greg O'Shea;Antony Rowstron

  • Affiliations:
  • University of California Berkeley;Microsoft Research;University of Michigan;Microsoft Research;Microsoft Research

  • Venue:
  • Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.