Paper Info
Title
Decentralized Search in Scale-Free P2P Networks
Abstract
Search in peer-to-peer networks is a challenging problem due to the absence of any centralized control & the limited information available at each node. When information is available about the overall structure of the network, use of this information can significantly improve the efficiency of decentralized search algorithms. Many peer-to-peer networks have been shown to exhibit power-law degree distribution. We propose two new decentralized search algorithms that can be used for efficient search in networks exhibiting scale-free design. Unlike previous work, our algorithms perform efficient search for a large range of power-law coefficients. Our algorithms are also unique in that they complete decentralized searches efficiently even when the network has disconnected components. As a corollary of this, our algorithms are also more resilient to network failure.
Year
DOI
Venue
2010
10.1109/ICPADS.2010.73
ICPADS
Keywords
Field
DocType
scale-free p2p networks,centralized control,power-law coefficient,decentralized search,peer-to-peer network,efficient search,decentralized search algorithm,power-law degree distribution,network failure,limited information,new decentralized search algorithm,degree distribution,power law distribution,power law,scale free network,measurement,scale free networks,search algorithm,routing,algorithm design and analysis,approximation algorithms,scale free
Approximation algorithm,Incremental heuristic search,Algorithm design,Search algorithm,Computer science,Computer network,Beam search,Scale-free network,Degree distribution,Corollary,Distributed computing
Conference
Citations 
PageRank 
References 
0
0.34
7
Authors
2
Name
Order
Citations
PageRank
Praphul Chandra1115.06
Dushyant Arora2673.45