Peer-to-Peer Networking and Applications

, Volume 8, Issue 1, pp 120–136 | Cite as

An efficient and distributed file search in unstructured peer-to-peer networks

  • Mohammad Shojafar
  • Jemal H. Abawajy
  • Zia Delkhah
  • Ali Ahmadi
  • Zahra Pooranian
  • Ajith Abraham


Peer-to-peer (P2P) networks are gaining increased attention from both the scientific community and the larger Internet user community. Data retrieval algorithms lie at the center of P2P networks, and this paper addresses the problem of efficiently searching for files in unstructured P2P systems. We propose an Improved Adaptive Probabilistic Search (IAPS) algorithm that is fully distributed and bandwidth efficient. IAPS uses ant-colony optimization and takes file types into consideration in order to search for file container nodes with a high probability of success. We have performed extensive simulations to study the performance of IAPS, and we compare it with the Random Walk and Adaptive Probabilistic Search algorithms. Our experimental results show that IAPS achieves high success rates, high response rates, and significant message reduction.


Unstructured peer-to-peer Adaptive probabilistic search Ant colony Success rate Information retrieval 


  1. 1.
    Iskandar I, Naomie S (2009) Selective flooding based on relevant nearest-neighbor using query feedback and similarity across unstructured peer-to-peer networks. Journal of Computer Science 3(5):184–190, ISSN 1549–3636Google Scholar
  2. 2.
    Balakrishnan H, Kaashoek MF, Karger D, Morris R, Stoica I (2003) Looking up data in P2P systems. Communications of ACM 46(2):43–48CrossRefGoogle Scholar
  3. 3.
    Barkai D (2002) Technologies for sharing and collaborating on the net. Proceeding of the 1st International Workshop on Peer-to-Peer Computing (IPTPS02), ISBN: 0-7695-1503-7, 13–28. doi:  10.1109/P2P.2001.990419
  4. 4.
    Daswani N, Garcia-molina H, Yang B (2003) Open problems in data-sharing peer-to-peer systems. Proc. of the 9th International Conference on Database Theory (ICDT03) 1–15Google Scholar
  5. 5.
    Milojicic DS, Kalogeraki V, Lukose R, Nagaraja K, Pruyne J, RichardB, Rollins M, Xu Z (2002) Peer-to-peer computing, HP Lab technical report, HPL-2002-57
  6. 6.
    Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer to-peer network’s. Proceeding of the 16th ACM International Conference on Supercomputing (ACM ICS02) 258–259. doi:  10.1145/514191.514206
  7. 7.
    Stoica I, Morris R, Karger D, Frans M, Kaashoek, Balakrishnan H (2001) Chord: A scalable peer-to-peer lookup service for internet applications. Proceeding of the 2001 ACM Annual Conference of the Special Interest Group on Data Communication (ACM SIGCOMM01) 149–160.
  8. 8.
    Clarke I, Sandberg O, Theodore BW, Hong W (2001) Free net: A distributed anonymous information storage and retrieval system. Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability 46–66.
  9. 9.
    Manku GS, Bawa M, Raghavan P (2003) Verity Inc, Symphony: Distributed hashing in a small world. Proceeding of 4th USENIX Symposium on Internet Technology and Systems (USITS03) 127–140.
  10. 10.
    Dorigo M, Gambardella LM (1997) Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation 1(1):53–66CrossRefGoogle Scholar
  11. 11.
    Caro GD, Dorigo M (1998) AntNet: Distributed stigmergy control for communications networks. Journal of Artificial Intelligence Research 9:317–365zbMATHGoogle Scholar
  12. 12.
    Babaoglu O, Meling H, Montresor A (2002) Anthill: A framework for the development of agent-based peer-to-peer systems. In Proceedings of the 22nd International Conference on Distributed Computing Systems Google Scholar
  13. 13.
    Wu C, Yang K, Ho J (2006) AntSearch: An ant search algorithm in unstructured peer-to-peer networks. In Proceedings of the 11th IEEE Symposium on Computers and Communications Google Scholar
  14. 14.
    Michlmayr E (2006) Ant algorithms for search in unstructured peer-to-peer networks, Proceedings of the 22nd International Conference on Data Engineering Workshops (ICDEW ‘06). IEEE Computer Society, Washington, pp 142–146CrossRefGoogle Scholar
  15. 15.
    Tang D, Lu X, Yang L (2011) ACO-based search algorithm in unstructured P2P Network. In Proceedings of the 2011 International Conference of Information Technology, Computer Engineering and Management Sciences, 1 (ICM ‘11), IEEE Computer Society, Washington, 143–146Google Scholar
  16. 16.
    Tsoumakos D, Roussopoulos N (2003) Adaptive probabilistic search in peer-to-peer networks. Technical Report, CS-TR-4451Google Scholar
  17. 17.
    Tsoumakos D, Roussopoulos N (2003) Adaptive probabilistic search for peer-to-peer networks. Proceedings of the 3rd International Conference on Peer-to-Peer Computing (P2P 2003) 102–109Google Scholar
  18. 18.
    Huo Q, Chen J, Xu X, Zhou Y, Liu X (2011) A location-aware efficient content-based searching over unstructured P2P network. International Conference on Network Computing and Information Security (NCIS) 2:183–187. doi: 10.1109/NCIS.2011.135 Google Scholar
  19. 19.
    Rhea SC, Kubiatowicz J (2002) Probabilistic location and routing. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM’02) 3:1248–1257. doi: 10.1109/INFCOM.2002.1019375 Google Scholar
  20. 20.
    Yang B, Garcia-Molina H (2002) Improving search in peer-to-peer network’s. Proceeding of the 22nd IEEE International Conference on Distributed Computing (IEEE ICDCS02) 5–14, doi:  10.1109/ICDCS.2002.1022237
  21. 21.
    Jawhar I, Wu J (2004) A two-level random walk search protocol for peer-to-peer networks. Proceeding of the 8th World Multi-Conference on Systemic, Cybernetics and Informatics 1–5. doi:
  22. 22.
    Tigelaar AS, Hiemstra D, Trieschnigg D (2012) Peer-to-peer information retrieval: An overview. ACM Transactions on Information Systems (TOIS) 30(2):1–34. doi: 10.1145/2180868.2180871 CrossRefGoogle Scholar
  23. 23.
    Crespo A, Garcia-Molina H (2002) Routing indices for peer-to-peer systems. Proceeding of the 22nd International Conference on Distributed Computing Systems (IEEE ICDCS02) 23–32. doi:  10.1109/ICDCS.2002.1022239
  24. 24.
    Himali DMR, Prasad SK (2011) SPUN: A P2P Probabilistic search algorithm based on successful paths in unstructured networks. IEEE International Symposium on Parallel and Distributed Processing Workshops 1610–1617. doi:  10.1109/IPDPS.2011.316
  25. 25.
    Kalogeraki V, Gunopulos D, Zeinalipour-Yazti D (2002) A local search mechanism for peer-to-peer networks. Proceedings of the 11th ACM Conference on Information and Knowledge Management (ACM CIKM02) 300–307. doi:  10.1145/584792.584842
  26. 26.
    Yang C, Li X (2005) Dominating-set-based searching in peer-to-peer networks. International Journal of High Performance Computing and Networking 3(4):205–210. doi: 10.1504/IJHPCN.2005.008562 CrossRefGoogle Scholar
  27. 27.
    Wu Y, Izumi T, Ooshita F, Kakugawa H, Masuzawa T (2007) An adaptive randomized search protocol in peer-to-peer systems, Proceedings of the 2007 ACM symposium on Applied computing 533–537. doi:  10.1145/1244002.1244126
  28. 28.
    Delbru R, Campinas S, Tummarello G (2012) Searching web data: An entity retrieval and high-performance indexing model. Elsevier Web Semantics: Science, Services and Agents on the World Wide Web archive 10:33–58. doi: 10.1016/j.websem.2011.04.004 CrossRefGoogle Scholar
  29. 29.
    Liu M, Koslela T, Ou Z, Zhou J, Riekki J, Ylianttila M (2011) Super-peer-based coordinated service provision. Journal of Network and Computer Applications archive 34(4):1210–1224. doi: 10.1016/j.jnca.2011.01.007 CrossRefGoogle Scholar
  30. 30.
    Lee P, Jayasumana AP, DilumBandara HMN, Lim S, Chandrasekar V (2012) A peer-to-peer collaboration framework for multi-sensor data fusion. Journal of Network and Computer Applications archive 35(3):1052–1066. doi: 10.1016/j.jnca.2011.12.005 CrossRefGoogle Scholar
  31. 31.
    Association for Computing Machinery (1998) ACM computing classification system (ACM CCS)Google Scholar
  32. 32.
    Ripeanu M, Foster I, Iamnitchi A (2002) Mapping the Gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6Google Scholar
  33. 33.
    Ramzan N, Park H, Izquierdo B (2012) Video streaming over P2P networks: Challenges and opportunities. Image Communication Journal 27(5):401–411. doi: 10.1016/j.image.2012.02.004 Google Scholar
  34. 34.
    Androutsellis-Theotokis S, Spinellis D (2004) A survey of peer-to-peer content distribution technologies. ACM Computing Surveys (CSUR) Journal 26(4):335–371CrossRefGoogle Scholar
  35. 35.
    Cormen TH, Leiserson ChE, Rivest RL, Stein C (2009) Introduction to algorithms, Second edition, MIT Press, ISBN 0-262-03384-4 168–171Google Scholar
  36. 36.
    Michlmayr E (2006) Ant algorithms for search in unstructured peer-to-peer networks, Proceedings of ICDE Google Scholar
  37. 37.
    Marti S, Ganesan P, Molina HG (2004) DHT routing using social links. Proceeding of the 3rdInternational Workshop on Peer-to-Peer Systems (IPTPS04)Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Mohammad Shojafar
    • 1
  • Jemal H. Abawajy
    • 2
  • Zia Delkhah
    • 3
  • Ali Ahmadi
    • 3
  • Zahra Pooranian
    • 4
  • Ajith Abraham
    • 5
    • 6
  1. 1.Department of Information Engineering, Electronics and Telecommunication (DIET)“Sapienza” University of RomeRomeItaly
  2. 2.Senior IEEE Members, School of Information TechnologyDeakin UniversityWaurn PondsAustralia
  3. 3.Department of Electrical and Computer EngineeringQazvin Islamic Azad UniversityQazvinIran
  4. 4.Department of Computer EngineeringIslamic Azad UniversityAndimeshkIran
  5. 5.Machine Intelligence Research Labs (MIR Labs)AuburnUSA
  6. 6.IT4Innovations - Center of excellence, VSB – Technical University of OstravaOstrava – PorubaCzech Republic

Personalised recommendations