Evaluating the efficiency of unguided search based on random walk in unstructured peer-to-peer networks is important because it provides guidelines in correctly setting the parameters of the search. Most existing work is based on simulations. We evaluate two analytical models - the algebraic model and the combinatorial model - for various search efficiency metrics against simulation results. We use the random graph topology and assume unguided searches. The results show that the two analytical models are accurate and match each other closely. We study the impact of the average node degree, hop count, number of walkers, and replication ratios on node coverage, object recall, and message efficiency, and on the accuracy of the models. © IFIP International Federation for Information Processing 2006.
CITATION STYLE
Wu, B., & Kshemkalyani, A. D. (2006). Evaluation of models for analyzing unguided search in unstructured networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4097 LNCS, pp. 163–172). Springer Verlag. https://doi.org/10.1007/11807964_17
Mendeley helps you to discover research relevant for your work.