Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks

Authors:
Tsungnan Lin;Pochiang Lin;Hsinping Wang;Chiahung Chen
Affiliations:
National Taiwan University, Taipei;National Taiwan University, Taipei;National Taiwan University, Taipei;National Taiwan University, Taipei
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
2009

Citing 0
Cited 5

An efficient hybridflood searching algorithm for unstructured peer-to-peer networks

ICICA'10 Proceedings of the First international conference on Information computing and applications
Resource searching in an unstructured P2P network based on Cloning Random Walker assisted by Dominating Set

Computer Networks: The International Journal of Computer and Telecommunications Networking
Biologically inspired future service environment

Computer Networks: The International Journal of Computer and Telecommunications Networking
Heuristic resource search in a self-organised distributed multi agent system

IWSOS'12 Proceedings of the 6th IFIP TC 6 international conference on Self-Organizing Systems
SMBSRP: a search mechanism based on interest similarity, query relevance and distance prediction

IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Designing efficient search algorithms is a key challenge in unstructured peer-to-peer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressively and covers the most nodes. However, it generates a large amount of query messages and, thus, does not scale. On the contrary, RW searches conservatively. It only generates a fixed amount of query messages at each hop but would take longer search time. We propose the dynamic search (DS) algorithm, which is a generalization of flooding and RW. DS takes advantage of various contexts under which each previous search algorithm performs well. It resembles flooding for short-term search and RW for long-term search. Moreover, DS could be further combined with knowledge-based search mechanisms to improve the search performance. We analyze the performance of DS based on some performance metrics including the success rate, search time, query hits, query messages, query efficiency, and search efficiency. Numerical results show that DS provides a good tradeoff between search performance and cost. On average, DS performs about 25 times better than flooding and 58 times better than RW in power-law graphs, and about 186 times better than flooding and 120 times better than RW in bimodal topologies.