Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimizing Random Walk Search Algorithms in P2P Networks Nabhendra Bisnik
 

Summary: Optimizing Random Walk Search Algorithms in P2P Networks
Nabhendra Bisnik
Rensselaer Polytechnic Institute
Troy, New York
bisnin@rpi.edu
Alhussein A. Abouzeid
Rensselaer Polytechnic Institute
Troy, New York
abouzeid@ecse.rpi.edu
Abstract
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P
networks. This model is used to obtain analytical expressions for the performance metrics of random
walk search in terms of the popularity of the resource being searched for and the random walk parameters.
We propose an equation-based adaptive search mechanism that uses an estimate of the 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 the equation-based adaptive search is significantly better than the non-adaptive random
walk and other straight-forward adaptive mechanisms.
1 Introduction

  

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

 

Collections: Engineering; Computer Technologies and Information Sciences