Analysis Models for Blind Search in Unstructured Overlays

Authors:
Bin Wu;Ajay D. Kshemkalyani
Affiliations:
Univ. of Illinois at Chicago, USA;Univ. of Illinois at Chicago, USA
Venue:
NCA '06 Proceedings of the Fifth IEEE International Symposium on Network Computing and Applications
Year:
2006

Citing 0
Cited 4

Analysis models for unguided search in unstructured P2P networks

International Journal of Ad Hoc and Ubiquitous Computing
Modeling message propagation in random graph networks

Computer Communications
Evaluation of models for analyzing unguided search in unstructured networks

EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
Agents and peer-to-peer computing: towards p2p-based resource allocation in competitive environments

AP2PC'08 Proceedings of the 7th international conference on Agents and Peer-to-Peer Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Flooding and random walk are two basic mechanisms for blind search in unstructured peer-to-peer overlays. Although these mechanisms have been widely studied experimentally and via simulations, they have not been analytically modeled. Time overhead, message overhead, and success rate are often used as metrics for search schemes. This paper shows that node coverage is an important metric to estimate performance metrics such as the message efficiency, success rate, and object recall of a blind search. The paper then presents two simple models to analyze node coverage in random graph overlays. These models are useful to set query parameters, evaluate search efficiency, and to estimate object replication on a statistical basis.