Sciweavers

229 search results - page 2 / 46
» Search performance analysis and robust search algorithm in u...
Sort
View
GLOBECOM
2006
IEEE
13 years 10 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
ICDE
2006
IEEE
190views Database» more  ICDE 2006»
13 years 10 months ago
Ant Algorithms for Search in Unstructured Peer-to-Peer Networks
Although the ant metaphor has been successfully applied to routing of data packets both in wireless and fixed networks, little is yet known about its applicability to the task of...
Elke Michlmayr
INFOSCALE
2006
ACM
13 years 10 months ago
Analysis and comparison of P2P search methods
The popularity and bandwidth consumption attributed to current Peer-to-Peer file-sharing applications makes the operation of these distributed systems very important for the Inte...
Dimitrios Tsoumakos, Nick Roussopoulos
MIDDLEWARE
2005
Springer
13 years 10 months ago
An Optimal Overlay Topology for Routing Peer-to-Peer Searches
Unstructured peer-to-peer networks are frequently used as the overlay in various middleware toolkits for emerging applications, from content discovery to query result caching to di...
Brian F. Cooper
IJAHUC
2008
118views more  IJAHUC 2008»
13 years 4 months ago
Analysis models for unguided search in unstructured P2P networks
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
Bin Wu, Ajay D. Kshemkalyani