Scale-Free Overlay Topologies with Hard Cutoffs 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 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 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 large number of entries for construction of the overlay topology. So, 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. Thus, it is expected that efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate construction of scale-free topologies with hard cutoffs and effect of these hard cutoffs on the search efficiency.

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

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

[3]  Abhishek Kumar,et al.  Efficient and scalable query routing for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[5]  Virgílio A. F. Almeida,et al.  Using locality of reference to improve performance of peer-to-peer applications , 2004, WOSP '04.

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

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

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

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

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

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

[12]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

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

[14]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[15]  Jacky C. Chu,et al.  Availability and locality measurements of peer-to-peer file systems , 2002, SPIE ITCom.

[16]  Kirsten Hildrum,et al.  Optimizations for Locality-Aware Structured Peer-to-Peer Overlays , 2003 .

[17]  27th International Conference on Distributed Computing Systems Workshops (ICDCS 2007 Workshops), June 25-29, 2007, Toronto, Ontario, Canada , 2007, ICDCS Workshops.

[18]  Zoltan Toroczkai,et al.  Gradient Networks , 2004, cond-mat/0408262.

[19]  Hector Garcia-Molina,et al.  Partial lookup services , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

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

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

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

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

[24]  G. B. A. Barab'asi.  Competition and multiscaling in evolving networks , 2000, cond-mat/0011029.

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

[26]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

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

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

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

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

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

[32]  Jun Xu,et al.  On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[33]  David R. Karger,et al.  Building peer-to-peer systems with chord, a distributed lookup service , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

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

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

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

[37]  M. Serrano,et al.  Weighted Configuration Model , 2005, cond-mat/0501750.

[38]  Ramesh Govindan,et al.  Using the small-world model to improve Freenet performance , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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

[41]  Ellen W. Zegura,et al.  Adding structure to unstructured peer-to-peer networks: the use of small-world graphs , 2005, J. Parallel Distributed Comput..

[42]  Fan Chung Graham,et al.  A Random Graph Model for Power Law Graphs , 2001, Exp. Math..

[43]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

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

[45]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

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

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

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

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

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

[51]  Y. Charlie Hu,et al.  Assisted Peer-to-Peer Search with Partial Indexing , 2007, IEEE Transactions on Parallel and Distributed Systems.

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

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

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

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

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

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

[58]  Ginestra Bianconi,et al.  Competition and multiscaling in evolving networks , 2001 .

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

[60]  G Korniss,et al.  Synchronization landscapes in small-world-connected computer networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[61]  Hasan Guclu.  Synchronization in Small-World-Connected Computer Networks , 2006 .