• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

Virtual ring routing: network routing inspired by DHTs (2006)

Cached

  • Download as a PDF

Download Links

  • [www.comp.nus.edu.sg]
  • [www.evernote.com]
  • [conferences.sigcomm.org]
  • [www.evernote.com]
  • [www.research.microsoft.com]
  • [www.research.microsoft.com]
  • [www.cs.ucl.ac.uk]
  • [research.microsoft.com]
  • [www.research.microsoft.com]
  • [research.microsoft.com]
  • [research.microsoft.com]
  • [www.stanford.edu]
  • [www0.cs.ucl.ac.uk]
  • [research.microsoft.com]
  • [www.cs.berkeley.edu]
  • [www.cs.uiuc.edu]
  • [www.cs.illinois.edu]
  • [www.cs.uiuc.edu]
  • [www.cs.illinois.edu]
  • [research.microsoft.com]
  • [web.engr.illinois.edu]
  • [research.microsoft.com]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Matthew Caesar , Miguel Castro , Edmund B. Nightingale
Venue:In Proc. of ACM SIGCOMM
Citations:150 - 13 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Caesar06virtualring,
    author = {Matthew Caesar and Miguel Castro and Edmund B. Nightingale},
    title = {Virtual ring routing: network routing inspired by DHTs},
    booktitle = {In Proc. of ACM SIGCOMM},
    year = {2006},
    pages = {351--362}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

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 traditional 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 translation between fixed identifiers and location-dependent addresses.

Keyphrases

virtual ring routing    distributed hash table    vrr performs    location-dependent address    traditional point-to-point network routing    underlying network    robust performance    several implementation    network flooding    link layer    unique point    unique feature    experimental result    new network    wide range    sensor network    hash table key    design space    link layer technology    wireless network   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University