Name
Abstract | ||
|---|---|---|
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 querymessagesateachhopbutwouldtakelongersearchtime.Weproposethedynamicsearch(DS)algorithm,whichisageneralization 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 successrate,searchtime,queryhits,querymessages,queryefficiency,andsearchefficiency.NumericalresultsshowthatDSprovidesa 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. Index Terms—Peer-to-peer, performance analysis, search algorithm. Ç 1I NTRODUCTION |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/TPDS.2008.134 | IEEE Transactions on Parallel and Distributed Systems |
Keywords | Field | DocType |
knowledge-based search mechanism,dynamic search,unstructured peer-to-peer networks,query message,search time,longer search time,long-term search,search performance,search efficiency,efficient search algorithm,dynamic search algorithm,previous search algorithm,indexing terms,search algorithm,random walk,power law,knowledge base | World Wide Web,Search algorithm,Peer-to-peer,Computer science | Journal |
Volume | Issue | ISSN |
20 | 5 | 1045-9219 |
Citations | PageRank | References |
18 | 0.78 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Lin | 1 | 724 | 67.09 |
| Po-Chiang Lin | 2 | 139 | 10.26 |
| Hsinping Wang | 3 | 32 | 2.49 |
| Chiahung Chen | 4 | 18 | 0.78 |