Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

IJAHUC
2008

favoriteEmaildiscussreport

118views more IJAHUC 2008»

Analysis models for unguided search in unstructured P2P networks

13 years 4 months ago

Analysis models for unguided search in unstructured P2P networks

Download www.cs.uic.edu

: 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

Real-time Traffic

IJAHUC 2008 | Query Performance | Random Walk | Various Performance Metrics |

claim paper

Related Content

» Absence of Evidence as Evidence of Absence A Simple Mechanism for Scalable P2P Search

» SemSearch A Scalable Semantic Searching Algorithm for Unstructured P2P Network

» Modeling Random Walk Search Algorithms in Unstructured P2P Networks with Social Informatio...

» BudgetBased SelfOptimized Incentive Search in Unstructured P2P Networks

» A ClassBased Search System in Unstructured P2P Networks

» Analysis and comparison of P2P search methods

» Aggregation of Document Frequencies in Unstructured P2P Networks

» Optimizing random walk search algorithms in P2P networks

» The SOWES approach to P2P web search using semantic overlays

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IJAHUC
Authors	Bin Wu, Ajay D. Kshemkalyani

Comments (0)