Constructing a proximity-aware power law overlay network

Peer-to-peer (P2P) networks offer a message exchanging overlay for distributed applications such as file sharing, application layer multicast, and publisher/subscriber system. The communication efficiency of the underlying overlay network is thus one of the primary factors that determine the performance of those applications. In this paper, we propose a P2P overlay network aiming at offering the low maintenance overhead of unstructured P2P networks and the scalability and communication efficiency of structured P2P networks. We design a distributed algorithm to construct low-diameter overlay networks with power law topologies. Peers consider both network proximity information and capacity of existing peers when choosing their P2P network neighbors. Using an application layer multicast system as our example, we demonstrate that our system can provide generic, scalable, and low diameter overlay networks for distributed applications that demand efficient P2P communication supports

[1]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

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

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

[4]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[5]  Magnus Karlsson,et al.  Turning heterogeneity into an advantage in overlay routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[6]  Robert Tappan Morris,et al.  Resilient overlay networks , 2001, SOSP.

[7]  Scott Shenker,et al.  Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.

[8]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

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

[10]  Rita H. Wouhaybi,et al.  Phenix: supporting resilient low-diameter peer-to-peer topologies , 2004, IEEE INFOCOM 2004.

[11]  Ben Y. Zhao,et al.  Brocade: Landmark Routing on Overlay Networks , 2002, IPTPS.

[12]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[13]  Fan Chung Graham,et al.  A random graph model for massive graphs , 2000, STOC '00.

[14]  Eli Upfal,et al.  Building low-diameter P2P networks , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

[16]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.