This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
May 2009 (vol. 20 no. 5)
pp. 654-666
ASCII Text
x 
 
Tsungnan Lin, Pochiang Lin, Hsinping Wang, Chiahung Chen, "Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 5, pp. 654-666, May, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2008.134,
author = {Tsungnan Lin and Pochiang Lin and Hsinping Wang and Chiahung Chen},
title = {Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {20},
number = {5},
issn = {1045-9219},
year = {2009},
pages = {654-666},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.134},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
IS - 5
SN - 1045-9219
SP654
EP666
EPD - 654-666
A1 - Tsungnan Lin,
A1 - Pochiang Lin,
A1 - Hsinping Wang,
A1 - Chiahung Chen,
PY - 2009
KW - Peer-to-peer
KW - performance analysis
KW - search algorithm.
VL - 20
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Tsungnan Lin, National Taiwan University, Taipei
Pochiang Lin, National Taiwan University, Taipei
Hsinping Wang, National Taiwan University, Taipei
Chiahung Chen, National Taiwan University, Taipei
Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages at each hop but would take longer search time. We propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW. DS takes advantage of various contexts under which each previous search algorithm performs well. It resembles flooding for short-term search and RW for long-term search. Moreover, DS could be further combined with knowledge-based search mechanisms to improve the search performance. We analyze the performance of DS based on some performance metrics including the success rate, search time, query hits, query messages, query efficiency, and search efficiency. Numerical results show that DS provides a good tradeoff between search performance and cost. On average, DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs, and about 186 times better than flooding and 120 times better than RW in bimodal topologies.

[1] D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger, “Sampling Techniques for Large, Dynamic Graphs,” Proc. Ninth IEEE Global Internet Symp. (Global Internet '06), Apr. 2006.
[2] A.H. Rasti, D. Stutzbach, and R. Rejaie, “On the Long-Term Evolution of the Two-Tier Gnutella Overlay,” Proc. Ninth IEEE Global Internet Symp. (Global Internet '06), Apr. 2006.
[3] D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, and Z. Xu, “Peer-to-Peer Computing,” Technical Report HPL-2002-57, HP, 2002.
[4] K. Sripanidkulchai, The Popularity of Gnutella Queries and Its Implications on Scalability, white paper, Carnegie Mellon Univ., Feb. 2001.
[5] M. Jovanovic, F. Annexstein, and K. Berman, “Scalability Issues in Large Peer-to-Peer Networks: A Case Study of Gnutella,” technical report, Laboratory for Networks and Applied Graph Theory, Univ. of Cincinnati, 2001.
[6] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '02), pp. 5-14, July 2002.
[7] G. Kan, “Gnutella,” Peer-to-Peer Harnessing the Power of Disruptive Technologies, O'Reilly, pp. 94-122, 2001.
[8] RFC-Gnutella 0.6, http://rfc-gnutella.sourceforge.net /developer/ testingindex.html, 2008.
[9] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in Peer-to-Peer Networks,” Proc. IEEE INFOCOM '04, pp. 120-130, 2004.
[10] L.A. Adamic, R.M. Lukose, A.R. Puniyani, and B.A. Huberman, “Search in Power-Law Networks,” Physical Rev., E, vol. 64, 046135, 2001.
[11] L.A. Adamic, R.M. Lukose, and B.A. Huberman, “Local Search in Unstructured Networks,” Handbook of Graphs and Networks. pp.295-317, Wiley-VCH, 2003.
[12] C. Gkantsidis, M. Mihail, and A. Saberi, “Hybrid Search Schemes for Unstructured Peer-to-Peer Networks,” Proc. IEEE INFOCOM '05, pp. 1526-1537, 2005.
[13] N. Bisnik and A. Abouzeid, “Modeling and Analysis of RandomWalk Search Algorithm in P2P Networks,” Proc. Second Int'l Workshop Hot Topics in Peer-to-Peer Systems (HOT-P2P '05), pp.95-103, 2005.
[14] M.E.J. Newman, S.H. Strogatz, and D.J. Watts, “Random Graphs with Arbitrary Degree Distribution and Their Applications,” Physical Rev., E, vol. 64, 026118, 2001.
[15] H. Wang and T. Lin, “On Efficiency in Searching Networks,” Proc. IEEE INFOCOM '05, pp. 1490-1501, 2005.
[16] P. Lin, T. Lin, and H. Wang, “Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks,” Proc. Global Telecomm. Conf. (GLOBECOM '06), Nov. 2006.
[17] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured Peer-to-Peer Networks,” Proc. 16th Ann. Int'l Conf. Supercomputing (ICS '02), pp. 84-95, June 2002.
[18] Z. Ge, D.R. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, “Modeling Peer-Peer File Sharing Systems,” Proc. IEEE INFOCOM'03, pp. 2188-2198, 2003.
[19] K. Sripanidkulchai, The Popularity of Gnutella Queries and Its Implications on Scalability, O'Reilly, www.openp2p.com, Feb. 2001.
[20] M. Ripeanu, A. Iamnitchi, and I. Foster, “Mapping the Gnutella Network,” IEEE Internet Computing, vol. 6, no. 1, pp. 50-56, Jan./Feb. 2002.
[21] S. Saroiu, P.K. Gummadi, and S.D. Gribble, A Measurement Study of Peer-to-Peer File Sharing Systems. MMCN, Jan. 2002.
[22] J. Chu, K. Labonte, and B. Levine, “Availability and Locality Measurements of Peer-to-Peer File Systems,” ITCom: Scalability and Traffic Control in IP Networks, July 2002.
[23] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, “A Local Search Mechanism for Peer-to-Peer Networks,” Proc. ACMCIKM Int'l Conf. Information and Knowledge Management (CIKM '02), pp. 300-307, Nov. 2002.
[24] Z. Zhuang, Y. Liu, L. Xiao, and L.M. Ni, “Hybrid Periodical Flooding in Unstructured Peer-to-Peer Networks,” Proc. 32nd Int'l Conf. Parallel Processing (ICPP '03), pp. 171-178, Oct. 2003.
[25] S. Jiang, L. Guo, and X. Zhang, “LightFlood: An Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer Systems,” Proc. 32nd Int'l Conf. Parallel Processing (ICPP '03), pp.627-635, Oct. 2003.
[26] S. Jiang, L. Guo, X. Zhang, and H. Wang, “LightFlood: Minimizing Redundant Messages and Maximizing Scope of Peer-to-Peer Search,” IEEE Trans. Parallel and Distributed Systems, vol. 19, no. 5, pp. 601-614, May 2008.
[27] D. Tsoumakos and N. Roussopoulos, “Adaptive Probabilistic Search for Peer-to-Peer Networks,” Proc. Third Int'l Conf. Peer-to-Peer Computing (P2P '03), pp. 102-109, Sept. 2003.
[28] D. Tsoumakos and N. Roussopoulos, “Analysis and Comparison of P2P Search Methods,” Technical Report CS-TR-4539, UMIACS-TR-2003-107, Dept. of Computer Science, Univ. of Maryland, 2003.
[29] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making Gnutella-Like P2P Systems Scalable,” Proc. ACM SIGCOMM '03, pp. 407-418, Aug. 2003.
[30] A. Crespo and H. Garcia-Molina, “Routing Indices for Peer-to-Peer Systems,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '02), pp. 23-32, July 2002.
[31] B. Yang and H. Garcia-Molina, “Improving Search in Peer-to-Peer Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems (ICDCS '02), pp. 5-14, July 2002.
[32] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-Yazti, “A Local Search Mechanism for Peer-to-Peer Networks,” Proc. 11th Int'lConf. Information and Knowledge Management (CIKM '02), pp. 300-307, Nov. 2002.
[33] R.A. Ferreira, M.K. Ramanathan, A. Awan, A. Grama, and S. Jagannathan, “Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks,” Proc. Fifth IEEE Int'l Conf. Peer-to-Peer Computing (P2P '05), pp. 165-172, Aug. 2005.
[34] N. Sarshar, P.O. Boykin, and V.P. Roychowdhury, “Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable,” Proc. Fourth IEEE Int'l Conf. Peer-to-Peer Computing (P2P '04), pp. 2-9, Aug. 2004.
[35] M. Mihail, A. Saberi, and P. Tetali, “Random Walks with Lookahead in Power Law Random Graphs,” Internet Mathematics, 2006.
[36] L.A. Adamic, “The Small World Web,” Proc. Third European Conf. Digital Libraries (ECDL '99), pp. 443-452, 1999.
[37] S. Behnel and A. Buchmann, “Models and Languages for Overlay Networks,” Proc. VLDB Workshop Databases, Information Systems and Peer-to -Peer Computing (DBISP2P '05), Aug. 2005.
[38] S. Behnel and A. Buchmann, “Overlay Networks—Implementation by Specification,” Proc. ACM/IFIP/USENIX Sixth Int'l Middleware Conf. (Middleware), 2005.
[39] W. Aiello, F. Chung, and L. Lu, “A Random Graph Model for Massive Graphs,” Proc. 32nd Ann. ACM Symp. Theory of Computing (STOC '00), pp. 171-180, 2000.

Index Terms:
Peer-to-peer, performance analysis, search algorithm.
Citation:
Tsungnan Lin, Pochiang Lin, Hsinping Wang, Chiahung Chen, "Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 5, pp. 654-666, May 2009, doi:10.1109/TPDS.2008.134
Usage of this product signifies your acceptance of the Terms of Use.