Subscribe

Issue No.12 - December (2011 vol.22)

pp: 2055-2062

M. Sereno , Dipt. di Inf., Univ. di Torino, Torino, Italy

R. Gaeta , Dipt. di Inf., Univ. di Torino, Torino, Italy

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.82

ABSTRACT

In this paper, we propose a generalization of the basic flooding search strategy for decentralized unstructured peer-to-peer (P2P) networks. In our algorithm a peer forwards a query to one of its neighbors using a probability that is a function of the number of connections in the overlay network of both. Moreover, this probability may also depend on the distance from the query originator. To analyze the performance of the proposed search strategy in heterogeneous decentralized unstructured P2P networks, we develop a generalized random graph (GRG)-based model that takes into account the high variability in the number of application level connections that each peer establishes, and the nonuniform distribution of resources among peers. Furthermore, the model includes an analysis of peer availability, i.e., the capability of relaying queries of other peers, as a function of the query generation rate of each peer. Validation of the proposed model is carried out comparing the model predictions with simulations conducted on real overlay topologies obtained from crawling the popular file sharing application Gnutella.

INDEX TERMS

resource allocation, graph theory, peer-to-peer computing, probability, query formulation, query processing, random processes, Gnutella file sharing application, generalized probabilistic flooding, P2P networks, flooding search strategy, decentralized unstructured peer-to-peer networks, query forwarding, overlay network, query originator, generalized random graph, GRG-based model, application level connections, nonuniform resource distribution, peer availability, query relaying, query generation rate, Peer to peer computing, Probabilistic logic, Network topology, Analytical models, Probability distribution, Predictive models, Search methods, search strategies., Peer-to-peer networks, random graphs, probabilistic flooding

CITATION

M. Sereno, R. Gaeta, "Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks",

*IEEE Transactions on Parallel & Distributed Systems*, vol.22, no. 12, pp. 2055-2062, December 2011, doi:10.1109/TPDS.2011.82REFERENCES

- [1] "Entropia," technical report, http:/www.entropia.com, 2011.
- [2] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-Area Cooperative Storage with CFS,"
Proc. ACM Symp. Operating Systems Principles (SOSP), 2001.- [3] S. Iyer, P. Rowstron, and P. Druschel, "Squirrel: A Decentralized Peer-to-Peer Web Cache,"
Proc. ACM Symp. Principles of Distributed Computing (PODC), 2002.- [4] "Global Index (GI)," technical report, http://www.skype.comskype_p2pexplained.htm , 2011.
- [5] S. Iyer, P. Rowstron, and P. Druschel, "SplitStream: High-Bandwidth Multicast in Cooperative Environments,"
Proc. ACM Symp. Operating Systems Principles (SOSP), 2003.- [6] X. Zhang, J. Liu, B. Li, and T.P. Yum, "DONet/CoolStreaming: A Data-Driven Overlay Network for Live Media Streaming,"
Proc. IEEE INFOCOM, 2005.- [7] Y.-H. Chu, S. Rao, and H. Zhang, "A Case for End System Multicast,"
IEEE J. Selected Areas in Comm., vol. 20, no. 8,Special Issue on Networking Support for Multicast, pp. 1456-1471, Oct. 2002.- [8] J. Li, P.A. Chou, and C. Zhang, "MutualCast: An Efficient Mechanism for One-to-Many Content Distribution,"
Proc. ACM SIGCOMM ASIA Workshop, 2005.- [9] B. Cohen, "BitTorrent Protocol Specification,"
Proc. First Workshop Economics of Peer-to-Peer Systems (P2P), 2003.- [10] Z. Ge, D.R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, "Modeling Peer-Peer File Sharing System,"
Proc. IEEE INFOCOM, 2003.- [11] D. Stutzbach, R. Rejaie, and S. Sen, "Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems,"
Proc. ACM SIGCOMM Internet Measurement Conf., 2005.- [12] S. Sen and J. Wang, "Analyzing Peer-to-Peer Traffic Across Large Networks,"
IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 219-232, Apr. 2004.- [13] P.K. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan, "Measurement, Modeling, and Analysis of a Peer-to-Peer File-Sharing Workload,"
Proc. ACM Symp. Operating Systems Principles (SOSP), 2003.- [14] S. Saroiu, P.K. Gummadi, and S.D. Gribble, "Measuring and Analyzing the Characteristics of Napster and Gnutella Hosts,"
Multimedia Systems J., vol. 8, no. 5, Nov. 2002.- [15] R. Bolla, R. Gaeta, A. Magnetto, M. Sciuto, and M. Sereno, "A Measurement Study Supporting P2P File-Sharing Community Models,"
Computer Networks, vol. 53, no. 4, pp. 485-500, 2009.- [16] M. Ripeanu, "Peer-to-Peer Architecture Case Study: Gnutella Network,"
Proc. IEEE First Int'l Conf. Peer-to-peer Computing (P2P), 2001.- [17] S. Zhao, D. Stutzbach, and R. Rejaie, "Characterizing Files in the Modern Gnutella Network: A Measurement Study,"
Proc. SPIE/ACM Multimedia Computing and Networking, 2006.- [18] T. Klingberg and R. Manfredi, "Gnutella 0.6," technical report, http://rfc-gnutella.sourceforge.net/srcrfc-0_6-draft.html , 2011.
- [19] M.E.J. Newman, "The Spread of Epidemic Disease on Networks,"
Physical Rev. E, vol. 66, 2002.- [20] M.E.J. Newman, "The Structure and Function of Networks,"
Computer Physics Comm., vol. 147, pp. 40-45, 2002.- [21] M.E.J. Newman, S.H. Strogatz, and D.J. Watts, "Random Graphs with Arbitrary Degree Distributions and Their Applications,"
Physical Rev. E, vol. 64, 2001.- [22] C. Gkantsidis, M. Mihail, and A. Saberi, "Random Walks in Peer-to-Peer Networks,"
Proc. IEEE INFOCOM, 2004.- [23] Q. Lv, E. Cohen, K. Li, and S. Shenker, "Search and Replication in Unstructured Peer-to-Peer Network,"
Proc. Int'l Conf. Supercomputing (ICS '02), 2002.- [24] S. Tewari and L. Kleinrock, "Analysis of Search and Replication in Unstructured Peer-to-Peer Networks,"
Proc. ACM SIGMETRICS Conf., 2005.- [25] M.A. Serrano and M. Boguna, "Tuning Clustering in Random Networks with Arbitrary Degree Distributions,"
Physical Rev. E, vol. E 72, no. 3, 2005.- [26] R. Gaeta, G. Balbo, S. Bruell, M. Gribaudo, and M. Sereno, "A Simple Analytical Framework to Analyze Search Strategies in Large-Scale Peer-to-Peer Networks,"
Performance Evaluation, vol. 62, nos. 1-4, pp. 1-16, 2005.- [27] R. Gaeta and M. Sereno, "On the Evaluation of Flooding-Based Search Strategies in Peer-to-Peer Networks,"
Concurrency and Computation: Practice and Experience, vol. 20, no. 6, pp. 713-734, 2008.- [28] F. Lo Piccolo, G. Neglia, and G. Bianchi, "The Effect of Heterogeneous Link Capacities in BitTorrent-Like File Sharing Systems,"
Proc. Int'l Workshop Hot Topics in Peer-to-Peer Systems (Hot-P2P), 2004.- [29] F. Clévenot-Perronnin, P. Nain, and K.W. Ross, "Multiclass P2P Networks: Static Resource Allocation for Service Differentiation and Bandwidth Diversity,"
Performance Evaluation, vol. 62, nos. 1-4, pp. 32-49, 2005.- [30] K. Oikonomou and I. Stavrakakis, "Performance Analysis of Probabilistic Flooding Using Random Graphs,"
Proc. First Int'l IEEE WoWMoM Workshop Autonomic and Opportunistic Comm. (AOC), 2007.- [31] S. Crisostomo, U. Schilcher, C. Bettstetter, and J. Barros, "Analysis of Probabilistic Flooding: How Do We Choose the Right Coin?"
Proc. IEEE Int'l Conf. Comm., 2009.- [32] A.O. Stauffer and V.C. Barbosa, "Probabilistic Heuristics for Disseminating Information in Networks,"
IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 425-435, Apr. 2007.- [33] C. Gkantsidis, M. Mihail, and A. Saberi, "Hybrid Search Schemes for Unstructuired Peer-to-Peer Networks,"
Proc. IEEE INFOCOM, 2005.- [34] S. Tewari and L. Kleinrock, "Optimal Search Performance in Unstructured Peer-to-Peer Networks with Clustered Demands,"
IEEE J. Selected Areas in Comm., vol. 25, no. 1, pp. 84-95, Jan. 2007.- [35] S. Tewari and L. Kleinrock, "Proportional Replication in Peer-to-Peer Networks,"
Proc. IEEE INFOCOM, 2006.- [36] Y. Chawathe, S. Ratnasamy, B.L., N. Lanhaui, and S. Shenker, "Making Gnutella-Like P2P Systems Scalable,"
Proc. ACM SIGCOMM, 2003.- [37] Q. Lv, S. Ratnasamy, and S. Shenker, "Can Heterogeneity Make Gnutella Scalable?"
Proc. First Int'l Workshop Peer-to-Peer Systems (IPTPS), 2002.- [38] L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, "Search in Power-Law Networks,"
Physical Rev. E, vol. 64, 2001.- [39] N. Sarshar, P. Boykin, and V. Roychowdury, "Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable,"
Proc. Fourth IEEE P2P, 2004.- [40] D. Tsoumakos and N. Roussopoulos, "Adaptive Probabilistic Search for Peer-to-Peer Networks,"
Proc. Third Int'l Conf. Peer-to-Peer Computing (P2P), 2003.- [41] A. Kumar, J. Xu, and E.W. Zegura, "Efficient and Scalable Query Routing for Unstructured Peer-to-Peer Networks,"
Proc. IEEE INFOCOM, 2005.- [42] E. Cohen and S. Shenker, "Replication Strategies in Unstructured Peer-to-Peer Networks,"
Proc. ACM SIGCOMM, 2002.- [43] M. Mihail, A. Saberi, and P. Tetali, "Random Walks with Lookahead in Power Law Random Graphs,"
Internet Math., vol. 3, p. 2007, 2004. |