A Novel Method for Supporting Locality in Peer-to-Peer Overlays Using Hypercube Topology

Today, peer-to-peer networks are become more popular among internet users and more than millions peers share high volume of data from anywhere. Sending and receiving these data increase the network traffics terribly. By improving the performance of these networks not only the efficiency of these networks increase but also the overall performance of the internet augments. To achieve high performance and resilience to failures, a peer can make connections with those other peers that are geographically closer to it. In this paper, we present a novel mechanism for placing peers on the overlay network, which supports locality without increasing network traffic seriously.

[1]  Baruch Awerbuch,et al.  Concurrent Online Tracking of Mobile Users , 1991, SIGCOMM.

[2]  Richard M. Karp,et al.  A stochastic process on the hypercube with applications to peer-to-peer networks , 2003, STOC '03.

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

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

[5]  J. J. Garcia-Luna-Aceves,et al.  Hop-reservation multiple access (HRMA) for ad-hoc networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

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

[8]  Donald F. Towsley,et al.  The effect of network topology on the spread of epidemics , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.

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

[12]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[13]  Rajmohan Rajaraman,et al.  Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.

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

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

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

[17]  Bryce Wilcox-O ' Hearn.  Experiences Deploying a Large-Scale Emergent Network , 2002 .

[18]  Rajmohan Rajaraman,et al.  A data tracking scheme for general networks , 2001, SPAA '01.