TY  - JOUR
T1  - Improved Search Efficiency in Unstructured Peer to Peer Networks Using Search Result Path Caching
AU - Anbu, S. AU - Thooyamani, K.P. 
JO  - International Journal of Soft Computing
VL  - 4
IS  - 6
SP  - 243
EP  - 249
PY  - 2009
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2009.243.249
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2009.243.249
KW  - Peer-to-Peer system
KW  -dynamic search
KW  -search efficiency
KW  -query flooding
KW  -path catching
KW  -filtering mechanism
KW  -new man’s random graph
AB  - The huge popularity of recent Peer-to-Peer (P2P) file sharing systems has been mainly driven by the scalability of their architectures and the flexibility of their search facilities. Such systems are usually designed as Unstructured P2P networks. So, designing an efficient search algorithm is a key challenge in unstructured peer-to-peer networks due to the unstructured paradigm. In this study, we proposed a Search Result Path Caching algorithm (SRPC). The proposed scheme combines the Dynamic Search (DS) algorithm and result path caching for effective search. This proposed algorithm takes the advantages from dynamic search and path caching technique works with the queried results. After the successful discovery of results the queries are returned to originator, according to our proposed algorithm the originator will stores the results for future references. In future stored references are used to search the information without querying the overall network. We analyze the performance of our algorithm based on some performance metrics including the success rate, search time and search efficiency. The numerical results shows that the proposed SRPC algorithm performs about 5 times better than DS, 125 times better than flooding and 275 times better than Random Walk (RW) in power-law graphs.
ER  -