Abstract

Unstructured systems are more supportive for present mass market where demands are changing day by day. It is always a challenge to design a more efficient search algorithm for unstructured file sharing systems. Flooding and random walk are commonly used techniques but have many limitations. Flooding has poor granularity and very high search cost due to its dependency on ttl. On the other hand random walk is more efficient with its random neighbor selection but it requires high search time. In this paper, we propose an approach to reduce random walks search time by reducing redundancy in algorithm. We have evaluated our changes in random walk on grid topology and our simulation results prove that by working on same network with same parameters, search performance of our approach is 3 times better than simple random walk.

References

• Xiuqi Li and Jie Wu, “Searching Techniques in Peer-to-Peer Networks” Department of Computer Science and Engineering, Florida Atlantic University.
• Dimitrios Tsoumakos and Nick Roussopoulos, “Adaptive Probabilistic Search for Peer-to-Peer Networks”, Proceedings of the Third International Conference on Peer-to-Peer Computing (P2P03), IEEE 2003.
• Christos Gkantsidis, Milena Mihail and Amin Saberi, “Hybrid Search Schemes for Unstructured Peer-to-Peer Networks,” Proc .IEEE INFOCOM’05, pp.1526-1537, 2005.
• VicentCholvi, AntonioFern´ andez,LuisL´ opez,LuisRodero-Merino,“ Using Random Walks to Find Resources in Unstructured Self-Organized P2P Networks”, Dasson 2007.
• William Acosta Surendar Chandra, “Unstructured Peer­to­Peer Networks ­ Next Generation of Performance and Reliability”, IEEE Infocom 2005.
• Chinmay R Totekar,Vani M, Palavalli Sharath R, “Search Improvement In Unstructured P2P Network Considering Type of Content”, IEEE 2008.
• ManalElDick, EstherPacitti, “Locaware:Index Caching in Unstructured P2P-file Sharing Systems”, 2nd International Workshop on Data Management in Peer-to-peer systems (DAMAP) (2009).
• Phouvieng Hieungmany and Shigeo Shioda,“Characteristics of Random Walk Search on Embedded Tree Structure for Unstructured P2Ps”, 16th International Conference on Parallel and Distributed Systems. IEEE 2010.
• P.Lin , T.Lin, and H.Wang, “Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks,” Proc.Global Telecomm. Conf. (GLOBECOM’06), Nov.2006.
• Lars Backstrom and Jure Leskovec,” Supervised Random Walks:Predicting and Recommending Links in Social Networks”,WSDM’11, HongKong, China, , February9–12,2011.
• Nabhendra Bisnik and Alhussein Abouzeid, “Modeling and Analysis of Random Walk Search Algorithms in P2P Networks”,ICC’09, IEEE, 2009.
• Lada A. Adamic and Bernardo A. Huberman, “Zipf’s law and the Internet”, Glottometrics, Vol. 3 (2002), pp. 143-150, 2002.
• Alberto Montresor and M´ark Jelasity,“PeerSim:A Scalable P2P Simulator”, In Proc. of the 9th Int. Conference on Peer-to-Peer (P2P’09), pages 99–100. Seattle, WA, September 2009.
• Gian Paolo Jes, “PeerSim HOW TO: Build a new protocol for the PeerSim 1.0 simulator”, December 24, 2005.
• Moreno Marzolla, “Simulating overlay network with Peersim”,http//www.moreno.marzolla.name.
• Bruno DEFUDE, “P2P simulation with PeerSim” ,Feburary2007.
• Tsungnan Lin, Hsinping Wang, “Search Performance Analysis In Peer-to-Peer Networks”,Proceedings of the Third International Conference on Peer-to-Peer Computing, IEEE 2003.