International Journal of Computer Network and Information Security (IJCNIS)
IJCNIS Vol. 4, No. 3, 8 Apr. 2012
Cover page and Table of Contents: PDF (size: 264KB)
Distributed Algorithms for Improving Search Efficiency in P2P Overlays
Full Text (PDF, 264KB), PP.1-7
Views: 0 Downloads: 0
Author(s)
Index Terms
Algorithm, File Sharing, Replication, Mounting, Bootstrap Peer
Abstract
Peer-to-peer (P2P) overlay is a distributed application architecture in which peers share their resources. Peers are equally privileged, equipotent participants in the application. Several algorithms for enhancing P2P file searching have been proposed in the literature. In this paper, we have proposed a unique approach of reducing the P2P search complexity and improving search efficiency by using distributed algorithms. In our approach a peer mounts other popular peer's files and also replicates other popular files or critical files identified using a threshold value. Once a file is mounted, file access requests can be serviced by transparently retrieving the file and sending it to the requesting peer. Replication used in this work improves the file retrieval time by allowing parallel transfer. We have shown the performance analysis of our proposed approach which shows improvement in the search efficiency.
Cite This Paper
Chittaranjan Hota, Vikram Nunia, Antti Ylä-Jääski, "Distributed Algorithms for Improving Search Efficiency in P2P Overlays", International Journal of Computer Network and Information Security(IJCNIS), vol.4, no.3, pp.1-7, 2012. DOI:10.5815/ijcnis.2012.03.01
Reference
[1]"The Gnutella Protocol Specification 0.6," http://rfc-gnutella.sourceforge.net.
[2]"KaZaA," http://www.kazaa.com.
[3]Neil Daswani, Hector Garcia-Molina and Beverly Yang, "Open Problems in Data-Sharing Peer-to-Peer Systems," In Proceedings of the 9th International Conference on Database Theory (ICDT '03), pp. 1–15, London, UK, 2002, Springer-Verlag.
[4] "Napster," http://en.wikipedia.org/wiki/Napster.
[5]B. Yang and H. Garcia-Molina, "Improving search in peer-to-peer networks. In Distributed Computing Systems," In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS '02), pp. 5–14, July 2002, IEEE Computer Society.
[6]Qin Lv, Pei Cao, Edith Cohen, Kai Li and Scott Shenker. "Search and replication in unstructured peer-to-peer networks," In Proceedings of the 16th International Conference on Supercomputing (ICS '02), pp. 84–95, New York, NY, USA, 2002, ACM Press.
[7]Elias Leontiadis, Vassilios V. Dimakopoulos and Evaggelia Pitoura. E., "Creating and Maintaining Replicas in Unstructured Peer-to-Peer Systems," In 12th International Euro-Par Conference on Parallel Processing, pp. 1015-1025 Berlin, Heidelberg, 2006, Springer-Verlag.
[8]Arturo Crespo and Hector Garcia-Molina, "Routing Indices For Peer-to-Peer Systems," In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS'02), pp. 23–34, Washington DC, USA, July 2002, IEEE Computer Society.
[9]John Kubiatowicz, David Bindel, Yan Chen, Steven Czerwinski,Patrick Eaton, Dennis Geels, RamakrishanGummadi, SeanRhea, Hakim Weatherspoon, Westley Weimer, Chris Wells and Ben Zhao, "An Architecture for Global-scale Persistent Storage," ACM Special Interest Group on Programming Languages (ACM SIGPLAN), Vol. 35, Issue 8, pp. 190–201, New York, NY, USA, Nov 2000, ACM Press.
[10]Rongmei Zhang and Y.C. Hu. "Assisted Peer-to-Peer Search with Partial Indexing," IEEE Transactions on Parallel and Distributed Systems, Vol. 18, Issue 8, pp. 1146–1158, Aug 2007, IEEE Computer Society.
[11]Chunqiang Tang and Sandhya Dwarkadas, "Hybrid Global-local Indexing for Effcient Peer-to-Peer Information Retrieval," In Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation, Vol. 1, pp. 16–16, Berkeley, CA, USA, 2004, USENIX Association Berkeley, CA, USA.