Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Modeling and Analysis of Random Walk Search Algorithms in P2P Networks
 

Summary: Modeling and Analysis of Random Walk Search
Algorithms in P2P Networks
Nabhendra Bisnik and Alhussein Abouzeid
Electrical, Computer and Systems Engineering Department
Rensselaer Polytechnic Institute
Troy, New York
Email: bisnin@rpi.edu, abouzeid@ecse.rpi.edu
Abstract-- In this paper we develop a model for random
walk search mechanism in unstructured P2P networks. Using
the model we obtain analytical expressions for the performance
metrics of random walk search in terms of the popularity of the
resource being searched for and the parameters of random walk.
We propose an equation based adaptive search mechanism that
uses estimate of popularity of a resource in order to choose the
parameters of random walk such that a targeted performance
level is achieved by the search. We also propose a low-overhead
method for maintaining an estimate of popularity that utilizes
feedback (or lack there-off) obtained from previous searches.
Simulation results show that the performance of equation based
adaptive search is significantly better than the non-adaptive

  

Source: Abouzeid, Alhussein A. - Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute

 

Collections: Engineering; Computer Technologies and Information Sciences