Analysis models for unguided search in unstructured P2P networks. (16th July 2008)

• Record Type: Journal Article
• Authors: Wu, Bin; Kshemkalyani, Ajay D.
• Is Part Of: International journal of ad hoc and ubiquitous computing. Volume 3:Number 4(2008)
• Page Start: 255
• Page End: 263
• Publication Date: 2008-07-16
• Subjects: analysis models -- unguided search -- unstructured P2P -- peer-to-peer networks -- node coverage -- simulation -- query performance -- random graph; Ubiquitous computing -- Periodicals; Embedded computer systems -- Periodicals; Electronic data processing -- Distributed processing -- Periodicals; Wireless communication systems -- Periodicals; Computer architecture -- Periodicals; 004.2
• Languages: English
• ISSNs: 1743-8225

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.