SKY: efficient peer-to-peer networks based on distributed Kautz graphs

Many proposed P2P networks are based on traditional interconnection topologies. Given a static topology, the maintenance mechanism for node join/departure is critical to designing an efficient P2P network. Kautz graphs have many good properties such as constant degree, low congestion and optimal diameter. Due to the complexity in topology maintenance, however, to date there have been no effective P2P networks that are proposed based on Kautz graphs with base > 2. To address this problem, this paper presents the “distributed Kautz (D-Kautz) graphs”, which adapt Kautz graphs to the characteristics of P2P networks. Using the D-Kautz graphs we further propose SKY, the first effective P2P network based on Kautz graphs with arbitrary base. The effectiveness of SKY is demonstrated through analysis and simulations.

[1]  David R. Karger,et al.  Koorde: A Simple Degree-Optimal Distributed Hash Table , 2003, IPTPS.

[2]  Huaimin Wang,et al.  Internet-based virtual computing environment (iVCE): Concepts and architecture , 2006, Science in China Series F: Information Sciences.

[3]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[4]  A. Rowstron,et al.  Scalable, decentralized object location and routing for large-scale peer-to-peer systems , 2001 .

[5]  Siddhartha Annapureddy,et al.  Shark: scaling file servers via cooperative caching , 2005, NSDI.

[6]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[7]  Jie Wu,et al.  Moore: An Extendable Peer-to-Peer Network Based on Incomplete Kautz Digraph with Constant Degree , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Guihai Chen,et al.  Cycloid: a constant-degree and lookup-efficient P2P overlay network , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[9]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[10]  A novel constant degree and constant congestion DHT scheme for peer-to-peer networks , 2005 .

[11]  WangXiaoming,et al.  Graph-theoretic analysis of structured peer-to-peer systems , 2005 .

[12]  Zhang Yi.  Scalable Distributed Resource Information Service for Internet-Based Virtual Computing Environment , 2007 .

[13]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[14]  Pierre Fraigniaud,et al.  D2B: A de Bruijn based content-addressable network , 2006, Theor. Comput. Sci..

[15]  Jiannong Cao,et al.  Delay-Bounded Range Queries in DHT-based Peer-to-Peer Systems , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[16]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[17]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[18]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

[19]  Nong Xiao,et al.  PIBUS: A Network Memory-Based Peer-to-Peer IO Buffering Service , 2007, Networking.

[20]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[21]  Robert Tappan Morris,et al.  Serving DNS Using a Peer-to-Peer Lookup Service , 2002, IPTPS.

[22]  Laurent Viennot,et al.  Broose: a practical distributed hashtable based on the de-Bruijn topology , 2004 .

[23]  Zhang Yiming,et al.  Scalable Distributed Resource Information Service for Internet-Based Virtual Computing Environment , 2007 .

[24]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[25]  Dongsheng Li,et al.  A novel constant degree and constant congestion DHT scheme for peer-to-peer networks , 2007, Science in China Series F: Information Sciences.

[26]  Moni Naor,et al.  Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.

[27]  Miguel Angel Fiol,et al.  The Partial Line Digraph Technique in the Design of Large Interconnection Networks , 1992, IEEE Trans. Computers.

[28]  Abhishek Kumar,et al.  Ulysses: a robust, low-diameter, low-latency peer-to-peer network , 2004, Eur. Trans. Telecommun..