SkipNet: a scalable overlay network with practical locality properties

  • Authors:
  • Nicholas J. A. Harvey;Michael B. Jones;Stefan Saroiu;Marvin Theimer;Alec Wolman

  • Affiliations:
  • Microsoft Research, Microsoft Corporation, Redmond, WA and Department of Computer Science and Engineering, University of Washington, Seattle, WA;Microsoft Research, Microsoft Corporation, Redmond, WA;Department of Computer Science and Engineering, University of Washington, Seattle, WA;Microsoft Research, Microsoft Corporation, Redmond, WA;Microsoft Research, Microsoft Corporation, Redmond, WA

  • Venue:
  • USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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 sub-tree. 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.