The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2009 vol.20)
pp: 667-679
Hasan Guclu , Rochester Institute of Technology, Rochester
Murat Yuksel , University of Nevada, Reno, Reno
ABSTRACT
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.
INDEX TERMS
Unstructured peer-to-peer networks, scale-free networks, power-law networks, search efficiency, cutoff.
CITATION
Hasan Guclu, Murat Yuksel, "Limited Scale-Free Overlay Topologies for Unstructured Peer-to-Peer Networks", IEEE Transactions on Parallel & Distributed Systems, vol.20, no. 5, pp. 667-679, May 2009, doi:10.1109/TPDS.2008.150
REFERENCES
[1] J. Kleinberg, “Navigation in a Small World,” Nature, p. 845, 2000.
[2] K.Y.K. Hui, J.C.S. Lui, and D.K.Y. Yau, “Small-World Overlay P2P Networks: Constructing and Handling of Dynamic Flash Crowd,” Computer Networks, vol. 50, pp. 2727-2746, 2006.
[3] A. Iamnitchi, M. Ripeanu, and I. Foster, “Small-World File-Sharing Communities,” Proc. IEEE INFOCOM, 2004.
[4] A.-L. Barabási and R. Albert, “Emergence of Scaling in Random Networks,” Science, vol. 286, p. 509, 1999.
[5] R. Albert and A.-L. Barabási, “Topology of Evolving Networks: Local Events and Universality,” Physical Rev. Letters, vol. 85, p.5234, 2000.
[6] The Napster Home Page, http:/www.napster.com, 2008.
[7] I. Stoica, R. Morris, D. Karger, H. Kaashoek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, 2001.
[8] P. Maymounkov and D. Mazieres, “Kademlia: A Peer-to-Peer Information System Based on the XOR Metric,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[9] A. Rowstron and P. Druschel, “Past: A Large-Scale, Persistent Peer-to-Peer Storage Utility,” Proc. 18th ACM Symp. Operating Systems Principles (SOSP), 2001.
[10] R. Cox, A. Muthitacharoen, and R. Morris, “Serving DNS Using a Peer-to-Peer Lookup Service,” Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.
[11] D. Kato, “GISP: Global Information Sharing Protocol—A Distributed Index for Peer-to-Peer Systems,” Proc. Second Int'l Conf. Peer-to-Peer Computing (P2P), 2002.
[12] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. IEEE INFOCOM, 2003.
[13] E. Cohen and S. Shenker, “Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM SIGCOMM, 2002.
[14] Gnutella Home Page, http:/www.gnutella.wego.com, 2008.
[15] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2003.
[16] C. Gkantsidis, M. Mihail, and A. Saberi, “Hybrid Search Schemes for Unstructured Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2005.
[17] J. Xu, “On the Fundamental Tradeoffs between Routing Table Size and Network Diameter in Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2003.
[18] M. Srivatsa, B. Gedik, and L. Liu, “Large Scaling Unstructured Peer-to-Peer Networks with Heterogeneity-Aware Topology and Routing,” IEEE Trans. Parallel and Distributed Systems, vol. 17, no. 11, pp. 1277-1293, Nov. 2006.
[19] The Freenet Project, http:/freenetproject.org, 2008.
[20] E. Cohen, A. Fiat, and H. Kaplan, “Associative Search in Peer-to-Peer Networks: Harnessing Latent Semantics,” Proc. IEEE INFOCOM, 2003.
[21] B.F. Cooper and H. Garcia-Molina, “Ad Hoc, Self-Supervising Peer-to-Peer Search Networks,” ACM Trans. Information Systems, vol. 23, no. 2, pp. 169-200, Apr. 2005.
[22] D. Leonard, V. Rai, and D. Loguinov, “On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks,” Proc. ACM SIGMETRICS '05, pp. 26-37, 2005.
[23] D. Ilie and A. Popescu, “Statistical Models for Gnutella Signaling Traffic,” Computer Networks, vol. 51, no. 17, pp.4816-4835, Apr. 2007.
[24] S. Gribble, S. Ratnasamy, S. Shenker, K. Gummadi, R. Gummadi, and I. Stoica, “The Impact of DHT Routing Geometry on Resilience and Proximity,” Proc. ACM SIGCOMM, 2003.
[25] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On Power-Law Relationships of the Internet Topology,” Computer Comm. Rev., vol. 29, p. 251, 1999.
[26] R. Albert, H. Jeong, and A.-L. Barabási, “Diameter of the World Wide Web,” Nature, vol. 401, p. 130, 1999.
[27] A.-L. Barabási et al., “Evolution of the Social Network of Scientific Collaborations,” Physica A, vol. 311, p. 590, 2002.
[28] H. Ebel, M.-I. Mielsch, and S. Bornholdt, “Scale-Free Topology of E-mail Networks,” Physical Rev. E, vol. 66, p. 035103(R), 2002.
[29] R. Albert, H. Jeong, and A.-L. Barabási, “Error and Attack Tolerance of Complex Networks,” Nature, vol. 406, p. 378, 2000.
[30] G. Korniss, “Synchronization in Weighted Uncorrelated Complex Networks in a Noisy Environment: Optimization and Connections with Transport Efficiency,” Physical Rev. E, vol. 75, p. 051121, 2007.
[31] Z. Toroczkai and K.E. Bassler, “Jamming Is Limited in Scale-Free Systems,” Nature, vol. 428, p. 716, 2004.
[32] J.C. Doyle et al., “The “Robust yet Fragile” Nature of the Internet,” Proc. Nat'l Academy of Sciences of the USA, vol. 102, p. 14497, 2005.
[33] R. Cohen and S. Havlin, “Scale-Free Networks Are Ultrasmall,” Physical Rev. Letters, vol. 90, p. 058701, 2003.
[34] S.N. Dorogovtsev and J.F.F. Mendes, “Evolution of Networks,” Advances in Physics, vol. 51, p. 1079, 2002.
[35] M. Boguná, R. Pastor-Satorras, and A. Vespignani, “Cut-Offs and Finite Size Effects in Scale-Free Networks,” European Physical J. B, vol. 38, p. 205, 2004.
[36] P.L. Krapivsky and S. Redner, “Organization of Growing Random Networks,” Physical Rev. E, vol. 63, p. 066123, 2001.
[37] R.L. Graham, D.E. Knuth, and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, second ed. Addison-Wesley, 1994.
[38] R. Albert and A.-L. Barabási, “Bose-Einstein Condensation in Complex Networks,” Physical Rev. Letters, vol. 86, p. 5632, 2001.
[39] M. Molloy and B. Reed, “A Critical Point for Random Graphs with a Given Degree Sequence,” Random Structures & Algorithms, vol. 6, p. 161, 1995.
[40] M. Catanzaro, M. Boguná, and R. Pastor-Satorras, “Generation of Uncorrelated Random Scale-Free Networks,” Physical Rev. E, vol. 71, p. 027103, 2005.
[41] J. Dall and M. Christensen, “Random Geometric Graphs,” Physical Rev. E, vol. 66, p. 016121, 2002.
[42] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication Strategies in Unstructured Peer-to-Peer Networks,” Proc. ACM Int'l Conf. Supercomputing (ICS), 2002.
[43] L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, “Search in Power-Law Networks,” Physical Rev. E, vol. 64, p.046135, 2001.
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool