Sciweavers

Share
IJAHUC
2008

Analysis models for unguided search in unstructured P2P networks

9 years 10 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 graph based P2P networks. We then present two analytical models: the algebraic model and the combinatorial model. These models are useful in setting query parameters and evaluating search efficiency. We evaluate these two models in terms of various performance metrics against simulation results. We also study the impact of the setup parameters, such as node degree, hop count, and number of walkers, on the query performance, and on the precision of the models.
Bin Wu, Ajay D. Kshemkalyani
Added 12 Dec 2010
Updated 12 Dec 2010
Type Journal
Year 2008
Where IJAHUC
Authors Bin Wu, Ajay D. Kshemkalyani
Comments (0)
books