Abstract

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. 1

Keywords

PastryComputer scienceScalabilityLocalityOverlay networkDistributed computingComputer networkChord (peer-to-peer)OverlayPartition (number theory)Disjoint setsNetwork partitionRouting (electronic design automation)Database

Affiliated Institutions

Related Publications

Chord

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed loo...

2001 9645 citations

Publication Info

Year
2003
Type
article
Pages
9-9
Citations
614
Access
Closed

External Links

Citation Metrics

614
OpenAlex

Cite This

Nicholas J. A. Harvey, Michael B. Jones, Stefan Saroiu et al. (2003). SkipNet: a scalable overlay network with practical locality properties. , 9-9.