The week's pick
Random Articles
Reseach Article
Efficient Search Techniques in Peer to Peer Networks
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 36 - Number 1 |
| Year of Publication: 2011 |
| Authors: Tarunpreet Bhatia, Dr. Deepak Garg |
10.5120/4457-6242
|
Tarunpreet Bhatia, Dr. Deepak Garg . Efficient Search Techniques in Peer to Peer Networks. International Journal of Computer Applications. 36, 1 ( December 2011), 31-38. DOI=10.5120/4457-6242
Abstract
In order to use Internet resources efficiently we need to search and locate information efficiently. System performance diminishes by either duplicating a large quantity of data on each and every node or flooding query to all the nodes in the network. Firstly, this paper reviews various searching algorithms. Search techniques can be classified as blind search in which information about neighbors is not kept by the peer and informed search where peers store information for routing queries to other nodes. It discusses how range queries can be processed efficiently by rotating scheme over structured P2P systems and secure searching algorithm based on topology adaptation which penalizes the malicious peers. Genetic algorithm providing parallel search are also covered in the paper. Lastly, it focuses on merits, demerits and applicability of these algorithms in different situations.
References
- Chang N, Liu M Revisiting the ttl-based controlled flooding search: optimality and randomization. In: Mobile computing and networking (2004).
- Pu IM, Shen Y Enhanced blocking expanding ring search in mobile ad hoc networks. In: 3rd international conference on new technologies, mobility and security (NTMS) (2009).
- D. Tsoumakos and N. Roussopoulos, “Analysis and Comparison of P2P Search Methods,” Proc.1st Int. Conf. Scalable Information Systems (2006).
- Reza Dorrigiv, Alejandro L´opez-Ortiz, and Pawel Pralat, “Search Algorithms for Unstructured Peer-to-Peer Networks,” proc. of 32nd IEEE Conference on Local Computer Networks (2007).
- Christos Gkantsidis, Milena Mihail, Amin Saberi, "Random Walks in Peer-to-Peer Networks", in proceedings of IEEE Infocom (2004)
- Scalable percolation search on complex networks by Nima Sarshara, Oscar Boykinb, Vwani Roychowdhurya Theoretical Computer Science (2006).
- Range queries in trie-structured overlays Anwitaman Datta, Manfred Hauswirth, Renault John, Roman Schmidt, Karl Aberer Ecole Polytechnique F´ed´erale de Lausanne (EPFL) CH-1015 Lausanne, Switzerland.
- Dynamic storage and access load balancing for answering range queries in peer-to-peer networks Zaher Al Aghbari & Ibrahim Kamel & Ahmed Mustafa, Springer Media, LLC (2010).
- Secure and Privacy- Aware Searching in Peer-to-Peer Networks Jaydip Sen TCS Innovation Labs, Tata Consultancy Services Ltd.
- Tain, H., Zou, S., Wang, W., Cheng, S.: Constructing Efficient Peer-to-Peer Overlay Topologies by Adaptive Connection Establishment. Computer Communication (2006)
- Ahn CW, Ramakrishna RS A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE transactions on evolutionary computation (2002).
- Wong WY, Lau TP, King PI Information retrieval in P2P networks using genetic algorithm. In: Special interest tracks and posters of the 14th international conference on World Wide Web, Chiba (2005).
Index Terms
Keywords