Limited Scale-Free Overlay Topologies for Unstructured Peer-to-Peer Networks

In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. Topological characteristics have profound impact on the efficiency of a search on such unstructured P2P networks, as well as other networks. A key limitation of scale-free (power-law) topologies is the high load (i.e., high degree) on a very few number of hub nodes. In a typical unstructured P2P network, peers are not willing to maintain high degrees/loads as they may not want to store a large number of entries for construction of the overlay topology. Therefore, to achieve fairness and practicality among all peers, hard cutoffs on the number of entries are imposed by the individual peers, which limits scale-freeness of the overall topology, hence limited scale-free networks. Thus, it is expected that the efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate the construction of scale-free topologies with hard cutoffs (i.e., there are not any major hubs) and the effect of these hard cutoffs on the search efficiency. Interestingly, we observe that the efficiency of normalized flooding and random walk search algorithms increases as the hard cutoff decreases.

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

[2]  A. Barabasi,et al.  Bose-Einstein condensation in complex networks. , 2000, Physical review letters.

[3]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

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

[5]  Adrian Popescu,et al.  Statistical models for Gnutella signaling traffic , 2007, Comput. Networks.

[6]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[7]  Antony I. T. Rowstron,et al.  PAST: a large-scale, persistent peer-to-peer storage utility , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[8]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[11]  Hector Garcia-Molina,et al.  Ad Hoc, self-supervising peer-to-peer search networks , 2005, TOIS.

[12]  Alessandro Vespignani,et al.  Cut-offs and finite size effects in scale-free networks , 2003, cond-mat/0311650.

[13]  Kevin E. Bassler,et al.  Network dynamics: Jamming is limited in scale-free systems , 2004, Nature.

[14]  IEEE Transactions on Parallel and Distributed Systems, Vol. 13 , 2002 .

[15]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[16]  Edith Cohen,et al.  Associative search in peer to peer networks: harnessing latent semantics , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[17]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[18]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[21]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[22]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

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

[24]  R. Pastor-Satorras,et al.  Generation of uncorrelated random scale-free networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[26]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[27]  Mudhakar Srivatsa,et al.  Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing , 2006, IEEE Transactions on Parallel and Distributed Systems.

[28]  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).

[29]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[30]  David K. Y. Yau,et al.  Small-world overlay P2P networks: Construction, management and handling of dynamic flash crowds , 2006, Comput. Networks.

[31]  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.

[32]  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,.

[33]  S. Low,et al.  The "robust yet fragile" nature of the Internet. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

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

[35]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

[36]  Ian T. Foster,et al.  Small-world file-sharing communities , 2003, IEEE INFOCOM 2004.

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

[38]  G. Korniss,et al.  Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[40]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.