On the Performance of Flooding-Based Resource Discovery

We consider flooding-based resource discovery in distributed systems. With flooding, a node searching for a resource contacts its neighbors in the network, which in turn contact their own neighbors and so on until a node possessing the requested resource is located. Flooding assumes no knowledge about the network topology or the resource distribution thus offering an attractive means for resource discovery in dynamically evolving networks such as peer-to-peer systems. We provide analytical results for the performance of a number of flooding-based approaches that differ in the set of neighbors contacted at each step. The performance metrics we are interested in are the probability of locating a resource and the average number of steps and messages for doing so. We study both uniformly random resource requests and requests in the presence of popular (hot) resources. Our analysis is also extended to take into account the fact that nodes may become unavailable either due to failures or voluntary departures from the system. Our analytical results are validated through simulation

[1]  Onn Shehory.  A Scalable Agent Location Mechanism , 1999, ATAL.

[2]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[3]  LuJianguo,et al.  Dynamic service matchmaking among agents in open information environments , 1999 .

[4]  Matthias Klusch,et al.  Dynamic service matchmaking among agents in open information environments , 1999, SGMD.

[5]  Mor Harchol-Balter,et al.  Resource discovery in distributed networks , 1999, PODC '99.

[6]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[7]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[8]  Shay Kutten,et al.  Asynchronous resource discovery in peer to peer networks , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..

[9]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[10]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[11]  Evangelos P. Markatos,et al.  Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[12]  DruschelPeter,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001 .

[13]  Farnoush Banaei Kashani,et al.  Criticality-based analysis and design of unstructured peer-to-peer networks as "Complex systems" , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[14]  Vassilios V. Dimakopoulos,et al.  Cache updates in a peer-to-peer network of mobile agents , 2004 .

[15]  Antony I. T. Rowstron,et al.  Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.

[16]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[17]  Vassilios V. Dimakopoulos,et al.  Performance analysis of distributed search in open agent systems , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[18]  Tong Wang,et al.  Strategies for distributed search , 1992, CSC '92.

[19]  Vassilios V. Dimakopoulos,et al.  A Peer-to-Peer Approach to Resource Discovery in Multi-agent Systems , 2003, CIA.

[20]  Uzi Vishkin,et al.  Deterministic Resource Discovery in Distributed Networks , 2003, Theory of Computing Systems.

[21]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[22]  Danny Dolev,et al.  Asynchronous resource discovery , 2003, PODC '03.

[23]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.