作者: Marvin Theimer , Alec Wolman , Michael B. Jones , Stefan Saroiu , Nicholas J. A. Harvey
DOI:
关键词: Chord (peer-to-peer) 、 Distributed computing 、 Scalability 、 Locality 、 Pastry 、 Administrative domain 、 Overlay network 、 Skip graph 、 Computer network 、 Computer science 、 Partition (database)
摘要: Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have recently emerged flexible infrastructure for building large peer-to-peer systems. In practice, systems two disadvantages: They provide no control over where data is stored guarantee that routing paths remain within an administrative domain whenever possible. SkipNet a scalable network provides controlled placement guaranteed locality by organizing primarily string names. allows both fine-grained coarse-grained placement: Content can be placed either on pre-determined node or distributed uniformly across the nodes of hierarchical naming sub-tree. An additional useful consequence SkipNet's properties partition failures, in which entire organization disconnects from rest system, result disjoint, but well-connected networks.