CFP last date
20 March 2024
Call for Paper
April Edition
IJCA solicits high quality original research papers for the upcoming April edition of the journal. The last date of research paper submission is 20 March 2024

Submit your paper
Know more
Reseach Article

Survey of Various Search Mechanisms in Unstructured Peer-to-Peer Networks

by Harshit Kapoor, Kushagra Mehta, Diwakar Puri, Sandeep Saxena
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 68 - Number 6
Year of Publication: 2013
Authors: Harshit Kapoor, Kushagra Mehta, Diwakar Puri, Sandeep Saxena

Harshit Kapoor, Kushagra Mehta, Diwakar Puri, Sandeep Saxena . Survey of Various Search Mechanisms in Unstructured Peer-to-Peer Networks. International Journal of Computer Applications. 68, 6 ( April 2013), 21-25. DOI=10.5120/11584-6917

@article{ 10.5120/11584-6917,
author = { Harshit Kapoor, Kushagra Mehta, Diwakar Puri, Sandeep Saxena },
title = { Survey of Various Search Mechanisms in Unstructured Peer-to-Peer Networks },
journal = { International Journal of Computer Applications },
issue_date = { April 2013 },
volume = { 68 },
number = { 6 },
month = { April },
year = { 2013 },
issn = { 0975-8887 },
pages = { 21-25 },
numpages = {9},
url = { },
doi = { 10.5120/11584-6917 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T21:27:06.704476+05:30
%A Harshit Kapoor
%A Kushagra Mehta
%A Diwakar Puri
%A Sandeep Saxena
%T Survey of Various Search Mechanisms in Unstructured Peer-to-Peer Networks
%J International Journal of Computer Applications
%@ 0975-8887
%V 68
%N 6
%P 21-25
%D 2013
%I Foundation of Computer Science (FCS), NY, USA

Peer-to-Peer (P2P) [1] are widely used for file sharing purposes. This type of usage provides decentralized solutions over centralized complex architecture. Peer-to-Peer networks are gaining attention from both the scientific perspective as well as the large Internet community. Popular applications utilizing this new technology offer many attractive features to a growing number of users. P2P is an architecture which is all-together a different class of applications that use the concept of distributed resources to perform an important crucial function in a decentralized manner. The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Internet community. Efficiently discovering the queried resource is the initial and most important step in establishing an efficient peer-to-peer communication. Here, we will be describing and analyzing the performances of some existing search mechanisms deployed for the peer discovery and the content look up.

  1. D. Raghu, CH. Raja Jacob, Gowthu, Jagadeesh Kumar, G. Monika Devi, Ramya Addanki. Dynamic search algorithm in unstructured peer-to-peer networks. International journal for computer science and technology. 2011.
  2. B. Srikanth and K. Venkateswara Rao. Dynamic search algorithm used in unstructured peer-to-peer networks. Internationa journal of engineering trend and technology. 2011
  3. Dimitrios Tsoumakos & Nick Roussopoulos Analysis and Comparison of P2P search methods. Infoscale '06 proceedings of the 1st International Conference on Scalable Information Systems. ACM@2006.
  4. Hsinping Wang, Tsungnan Lin, Chia Hung Chen and Yennan Shen. Dynamic Search in peer-to-peer networks. ACM 2004.
  5. Qin Lv, Pei Cao, Edith Cohen, Kai Li and Scott Shenker. Search and Replication in unstructured peer-to-peer networks. ACM 2002.
  6. Dimitrios Tsoumakos and Nick Roussopoulos. Adaptive Probabilistic Search (APS) for Peer-to-Peer Networks. 3rd IEEE intl conference on P2P computing, 2003.
  7. Xiuqi Li and Jie Wu. Searching Techniques in Peer-to-Peer Networks.
  8. Beverly Yang, Hector Garcia-Molina. Efficient search in peer-to-peer networks. Proceedings of the ICDCS'02 conference, 2002.
  9. Christos Gkantsidis, Milena Mihail, and Amin Saberi. Random Walks in Peer-to-Peer Networks. Performance Evaluation - P2P computing systems. ACM 2006.
  10. N. Ranjeeth Kumar, N. Deepika. An Efficient Search Algorithm in Decentralized Peer-to-Peer Networks. Int. J. Computer Techology & Applications. 2012.
  11. Arturo Crespo, Hector Garcia- Molina. Routing indices for peer-to-peer networks.
  12. WU Xiao-kui. Research on Routing Method on Peer-to-Peer Network. 978-1-4244-6349-7/10 © 2010 IEEE.
  13. Tsungnan Lin, Hsinping Wang. Search Performance Analysis in Peer-to-Peer Networks. Proceedings of the Third International Conference on Peer-to-Peer Computing (P2P'03). IEEE 2003.
  14. IEEE Transactions on Parallel and Distributed Systems 2009 Dynamic search algorithm in unstructured peer to peer networks By Tsungnan lin,Pochiang lin ,chiahung chin (national Taiwan university)
  15. Journal of computer science -Improving the Performance of the Peer to Peer Network by Introducing an Assortment of Methods M. Sadish Sendil and N. Nagarajan.
  16. Reza Dorrigiv, Alejandro Lopez- Ortiz, Pawel Pralat. Search Algorithms for Unstructured Peer-to-Peer Networks. LCN '07 Proceedings of the 32nd IEEE Conference on Local Computer Networks. IEEE computer society, 2007.
  17. Chao Xie and Yi Pan. Analysis of Large-Scale Hybrid Peer-to-Peer Network Topology.
  18. Sabu M. Thampi and Chandra Sekaran. K. Survey of search and replication schemes in unstructured p2p network. Network Protocols and Algorithms, ISSN 1943-3581, Vol. 2, No. 1, 2010. Cornell University Library.
  19. Christos Gkantsidis, Milena Mihail and Amin Saberi. Hybrid Search Schemes for Unstructured Peer-to-Peer Networks. 0-7803-8968-9/05 © 2005 IEEE.
  20. Stefan KraxbergerScalable Secure Routing for Heterogeneous Unstructured P2P Networks. 2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing IEEE.
  21. Hongbo Jiang and Shudong Jin. Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks. Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP'05).
  22. Abhishek Kumar, Jun (Jim) Xu and Ellen W. Zegura. Efficient and Scalable Query Routing for Unstructured Peer-to- Peer Networks. 0-7803-8968-9/05 © 2005 IEEE.
  23. Virag Shah, Gustavo de Veciana and George Kesidis. Learning to Route Queries in Unstructured P2P Networks: Achieving Throughput Optimality Subject to Query Resolution Constraints. 2012 Proceedings IEEE INFOCOM.
  24. Ming Xu, Shuigeng Zhou and Jihong Guan. Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents. J Netw Syst Manage (2012) 20:309-352 Springer.
  25. Katja Hose, Christian Lemke and Kai-Uwe Sattler. Maintenance strategies for routing indexes. Distrib Parallel Databases (2009) 26: 231–259 Springer.
  26. John Risson, Tim Moors. Survey of research towards robust peer-to-peer networks: Search methods. Computer Networks 50 (2006) 3485–3521 ScienceDirect Elsevier.
  27. Nabhendra Bisnik and Alhussein Abouzeid. Modeling and Analysis of Random Walk Search Algorithms in P2P Networks. Proceedings of the 2005 Second International Workshop on Hot Topics in Peer-to-Peer Systems (HOT-P2P'05) © 2005 IEEE.
Index Terms

Computer Science
Information Sciences


Peer to peer networks survey unstructured blind search informed