Scale-free Overlay Structures for Unstructured Peer-to-Peer Networks

In unstructured peer-to-peer networks, the overlay topology among peers is a crucial factor in addition to the peer/data organization and search. The scale-free networks generated by the preferential attachment (PA) model have been widely described in previous researches. However, the PA model is incomplete to account for the robustness of real network. In this paper, the HLD and HHD models of scale-free overlay structures for unstructured peer-to-peer networks are proposed. With the identical degree distribution and network size in the models, we discuss the structural robustness and fragility as well as the dynamic changes of load intensity when nodes are successively removed under various attack strategies. Experimental results show that these two models are better than PA model in robustness and load-intensity.

[1]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[2]  Daishi Kato.  GISP: global information sharing protocol-a distributed index for peer-to-peer systems , 2002, Proceedings. Second International Conference on Peer-to-Peer Computing,.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

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

[5]  Yi Pan,et al.  Analysis of hybrid P2P overlay network topology , 2008, Comput. Commun..

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

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

[8]  Edith Cohen,et al.  Replication strategies in unstructured peer-to-peer networks , 2002, SIGCOMM.

[9]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[10]  Naoki Wakamiya,et al.  LLR: A Construction Scheme of a Low-Diameter, Location-Aware, and Resilient P2P Network , 2006, 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing.

[11]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[13]  Miguel Castro,et al.  Scalable Application-Level Anycast for Highly Dynamic Groups , 2003, Networked Group Communication.

[14]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

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

[16]  Murat Yuksel,et al.  Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks , 2006, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[17]  Hao Lv,et al.  Analyzing unstructured peer-to-peer search networks with QIL , 2004, IEEE International Conference onServices Computing, 2004. (SCC 2004). Proceedings. 2004.

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

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

[20]  Ren-Hung Hwang,et al.  A location-aware peer-to-peer overlay network , 2007, Int. J. Commun. Syst..

[21]  S. Bornholdt,et al.  Scale-free topology of e-mail networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.