Skipnet: A scalable overlay network with practical locality properties

DMCA

Skipnet: A scalable overlay network with practical locality properties (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Nicholas J. A. Harvey , Michael B. Jones , Stefan Saroiu , Marvin Theimer , Alec Wolman

Citations:

359 - 5 self

BibTeX

@INPROCEEDINGS{Harvey03skipnet:a,
    author = {Nicholas J. A. Harvey and Michael B. Jones and Stefan Saroiu and Marvin Theimer and Alec Wolman},
    title = {Skipnet: A scalable overlay network with practical locality properties},
    booktitle = {},
    year = {2003}
}

OpenURL

Abstract

Abstract: Scalable overlay networks such as Chord, Pastry, and Tapestry have recently emerged as a flexible infrastructure for building large peer-to-peer systems. In practice, two disadvantages of such systems are that it is difficult to control where data is stored and difficult to guarantee that routing paths remain within an administrative domain. SkipNet is a scalable overlay network that provides controlled data placement and routing locality guarantees by organizing data primarily by lexicographic key ordering. SkipNet also allows for both fine-grained and coarsegrained control over data placement, where 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, result in two disjoint, but well-connected overlay networks. 1

Keyphrases

scalable overlay network practical locality property data placement well-connected overlay network additional useful consequence locality guarantee pre-determined node entire organization disconnect partition failure locality property administrative domain flexible infrastructure hierarchical naming subtree large peer-to-peer system

DMCA