CHypercube: A Novel P2P Overlay Network

Most of recent researches on P2P system focus on how to build a highly usable P2P overlay network. Researchers include small routing table, short query path and good robustness into their design objectives of overlay topology. In this paper, we present a general group theory method and define a new Cayley graph. Based on this graph, we propose a novel P2P overlay network called CHypercube, which has simple routing(searching) scheme and many other excellent properties such as short query path, high clustering and good robustness because of its symmetry. The performance is evaluated by simulation to show that CHypercube posses shorter query path length and higher clustering and better robustness than several popular P2P overlay networks such as Chord and Ulysses.

[1]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[2]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

[4]  Karl Aberer,et al.  The essence of P2P: a reference architecture for overlay networks , 2005, Fifth IEEE International Conference on Peer-to-Peer Computing (P2P'05).

[5]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[6]  Behrooz Parhami.  Introduction to Parallel Processing , 2002, Series in Computer Science.

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

[8]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

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

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

[11]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

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

[13]  Wenjun Xiao,et al.  Cayley graphs as models of deterministic small-world networks , 2006, Inf. Process. Lett..

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

[15]  Jun Xu.  On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2004, IEEE Journal on Selected Areas in Communications.

[16]  Norman Biggs.  Algebraic Graph Theory: Index , 1974 .

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

[18]  Wolfgang Nejdl,et al.  Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs , 2004, ISPA.