An Efficient p2p Content Retrieval in Guided Distributed Environment using Dynamic Search Algorithm

Background/Objectives: The Peer-to-Peer (P2P) network connection can build loosely coupled application that covers effective resource sharing. The main aim of this propounded approach is to develop the search and recoveryoperation in the unstructured p2p networks. Methods/Statistical Analysis: The network can be classified either as structured or unstructured. Since, the p2p networks which are mainly unstructured can be built efficaciously and with more precision, even in severe conditions over the network topology;so as a result, these networks are far more suitable to the network environment. The random search techniques adopted by these types of networks commonly perform less effective in large size network. The search and retrieve performance can be improved in unstructured p2p networks by utilizing users common Preference pattern, which will be captured inside a probability-theoretic structure is called User Preference Model (UPM). It is developed with the support of Dynamic Query Retrieval Protocol. Findings: In our propounded approach, whenever the same file is searched for over three times, the details, present in the routing table will be automatically moving to the User Preference Model Table, hence rendering our propounded searching methodology much faster and efficacious in nature. Improvements/Applications: The application of the research is to be used in the small world unstructured peer to peer networks. The search performance and retrieval performance can be improved in this research. Novelty: In this specific paper, we have propounded a search protocol as well as a routing table updating protocol so as to develop or improve the searching process through self-managing the p2p network structure into a small business world application.