By Topic

Generalized Probabilistic Flooding in Unstructured Peer-to-Peer Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rossano Gaeta ; Università di Torino, Torino ; Matteo Sereno

In this paper, we propose a generalization of the basic flooding search strategy for decentralized unstructured peer-to-peer (P2P) networks. In our algorithm a peer forwards a query to one of its neighbors using a probability that is a function of the number of connections in the overlay network of both. Moreover, this probability may also depend on the distance from the query originator. To analyze the performance of the proposed search strategy in heterogeneous decentralized unstructured P2P networks, we develop a generalized random graph (GRG)-based model that takes into account the high variability in the number of application level connections that each peer establishes, and the nonuniform distribution of resources among peers. Furthermore, the model includes an analysis of peer availability, i.e., the capability of relaying queries of other peers, as a function of the query generation rate of each peer. Validation of the proposed model is carried out comparing the model predictions with simulations conducted on real overlay topologies obtained from crawling the popular file sharing application Gnutella.

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:22 ,  Issue: 12 )