Adaptive probabilistic search for peer-to-peer networks

2 March 2004

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 102-109
https://doi.org/10.1109/ptp.2003.1231509

Abstract

Peer-to-peer networks are gaining increasing attention from both the scientific and the large Internet user community. Popular applications utilizing this new technology offer many attractive features to a growing number of users. At the heart of such networks lies the search algorithm. Proposed methods either depend on the network-disastrous flooding and its variations or utilize various indices too expensive to maintain. We describe an adaptive, bandwidth-efficient algorithm for search in unstructured peer-to-peer networks, the adaptive probabilistic search method (APS). Our scheme utilizes feedback from previous searches to probabilistically guide future ones. It performs efficient object discovery while inducing zero overhead over dynamic network operations. Extensive simulation results show that APS achieves high success rates, increased number of discovered objects, very low bandwidth consumption and adaptation to changing topologies.

Keywords

This publication has 8 references indexed in Scilit:

Routing indices for peer-to-peer systems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
Improving search in peer-to-peer networks
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
A local search mechanism for peer-to-peer networks
Published by Association for Computing Machinery (ACM) ,2002
Probabilistic scalable P2P resource location services
ACM SIGMETRICS Performance Evaluation Review, 2002
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Published by Springer Nature ,2001
Search in power-law networks
Physical Review E, 2001
A scalable content-addressable network
Published by Association for Computing Machinery (ACM) ,2001
Chord
Published by Association for Computing Machinery (ACM) ,2001