quotImproving Query Search Performance in Unstructured P2P Networks Using Proclamation Based Search Algorithmquot

Abstract

quotSearching in unstructured P2P networks is considerably more challenging because of the newlinelack of global routing and dynamic topology. Various search algorithms have been newlineevolved in the past In unstructured P2P systems, the majority of active query-based newlinesearch algorithms shares a known approach: when there is a search message, a peer newlinedelivers a query to different peers in the overlay network As the query has to travel many newlinehops, generally it will take longer time for the query to be answered. As a result, there is newlinehuge number of query messages which is generated in the network. So, more bandwidth newlineand power is consumed in all the nodes which are associated in the routing path. Too newlinemuch usage of queries generally leads to lengthy search latency and heavy load in the newlinesystem. The challenge in unstructured p2p networks is designing an efficient search newlineAlgorithm. Some typical search algorithms are random walk and flooding. Flooding in newlinegeneral covers many nodes but the drawback is that it generates huge amount of query newlinemessages. Random walk generates only fewer amounts of query messages but takes long newlinetime to search. In this research, we propose a Proclamation Based Search algorithm for newlineavoiding multiple hops in forwarding the query in unstructured Peer to Peer networks. newlineProclamation is nothing but producing the overview of the details a peer tends to share newlineand properly delivered and precisely cached by other peers. In this system, the nodes newlineactively publish the outline of the contents, and precisely store helpful outline of the newlinecontents received from other peers. When there is a search request, a node can discover newlinethe destination node by searching its localized outline repository, and therefore acquire newlineone-hop search with moderate search cost. Experimental results showcase that the newlineperformance of Proclamation Based Search algorithm performs better when compared to newlineother search algorithms in levels of search success rate, search response time bandwidth newlineconsumption.. newlinequot newline newline