Title: Analysis models for unguided search in unstructured P2P networks

Authors: Bin Wu, Ajay D. Kshemkalyani

Addresses: Computer Science Department, University of Illinois at Chicago, Chicago, IL 60607, USA. ' Computer Science Department, University of Illinois at Chicago, Chicago, IL 60607, USA

Abstract: 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.

Keywords: analysis models; unguided search; unstructured P2P; peer-to-peer networks; node coverage; simulation; query performance; random graph.

DOI: 10.1504/IJAHUC.2008.018911

International Journal of Ad Hoc and Ubiquitous Computing, 2008 Vol.3 No.4, pp.255 - 263

Published online: 22 Jun 2008 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article