|
USITS '03 Abstract
SkipNet: A Scalable Overlay Network with Practical Locality Properties
Nicholas J. A. Harvey, Microsoft Research and University of Washington; Michael B. Jones, Microsoft Research; Stefan Saroiu, University of Washington; Marvin Theimer and Alec Wolman, Microsoft Research
Abstract
Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have
recently emerged as flexible infrastructure for building large
peer-to-peer systems.
In practice, such systems have two disadvantages:
They provide no control over where data is stored and no guarantee
that routing paths remain within an administrative
domain whenever possible.
SkipNet is a scalable overlay network that provides
controlled data placement and guaranteed routing locality by
organizing data primarily by string names. SkipNet
allows for both fine-grained and coarse-grained control over data
placement: Content can be placed either on a pre-determined node
or distributed uniformly across the nodes of a hierarchical naming
subtree. An additional useful consequence of SkipNet's locality
properties is that partition failures, in which an entire organization
disconnects from the rest of the system, can result in two disjoint, but
well-connected overlay networks.
- View the full text of this paper in HTML and PDF.
The Proceedings are published as a collective work, © 2003 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
|
Need help? Use our Contacts page.
