SkipNet: a scalable overlay network with practical locality properties

作者: Marvin Theimer , Alec Wolman , Michael B. Jones , Stefan Saroiu , Nicholas J. A. Harvey

DOI:

关键词: Chord (peer-to-peer)Distributed computingScalabilityLocalityPastryAdministrative domainOverlay networkSkip graphComputer networkComputer sciencePartition (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.

参考文章(44)
C. Labovitz, A. Ahuja, F. Jahanian, Experimental study of Internet stability and backbone failures ieee international symposium on fault tolerant computing. pp. 278- 285 ,(1999) , 10.1109/FTCS.1999.781062
Pete Keleher, Bobby Bhattacharjee, Bujor Silaghi, Are Virtualized Overlay Networks Too Much of a Good Thing international workshop on peer to peer systems. pp. 225- 231 ,(2002) , 10.1007/3-540-45748-8_21
Yang-Hua Chu, Sanjay G Rao, Srinivasan Seshan, Hui Zhang, A case for end system multicast measurement and modeling of computer systems. pp. 1- 12 ,(2000)
Amin Vahdat, Jeff Chase, Rebecca Braynard, Dejan Kostić, Patrick Reynolds, Adolfo Rodriguez, Self-Organizing Subsets: From Each According to His Abilities, to Each According to His Needs international workshop on peer to peer systems. pp. 76- 84 ,(2002) , 10.1007/3-540-45748-8_7
John R. Douceur, The Sybil Attack international workshop on peer to peer systems. pp. 251- 260 ,(2002) , 10.1007/3-540-45748-8_24
Miguel Castro, Peter Druschel, Y. Charlie Hu, Antony Rowstron, Topology-aware routing in structured peer-to-peer overlay networks Lecture Notes in Computer Science. pp. 103- 107 ,(2003) , 10.1007/3-540-37795-6_19
John D. Kubiatowicz, Anthony D. Joseph, Ben Y. Zhao, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and University of California at Berkeley. ,(2001)
William Pugh, Skip Lists: A Probabilistic Alternative to Balanced Trees workshop on algorithms and data structures. pp. 437- 449 ,(1989) , 10.1007/3-540-51542-9_36
Ben Yanbin Zhao, John Kubiatowicz, Anthony D Joseph, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing ,(2001)
Marvin Theimer, Dejan Kostić, John Dunagan, Alec Wolman, Michael B. Jones, Nicholas J. A. Harvey, FUSE: lightweight guaranteed distributed failure notification operating systems design and implementation. pp. 11- 11 ,(2004)