Performance Evaluation of Search Algorithms Over Peer-to-Peer Networks
Peer-To-Peer (P2P) computing has attracted considerable attention in the last few years because of its ability to aggregate unused resources. One of the fundamental operations in P2P systems is resource discovery, which is responsible for finding the resources that the users request. Resource discovery is challenging because the large number of resources to be discovered can be in the order of millions, and because resources can join and leave in an arbitrary way. This paper compares the performance of various search algorithms over a Peer-To-Peer network. These algorithms are: Gnutella, Modified BFS, and Random Walk. The authors evaluate these algorithms with regards to: successful queries, and number of hits per query. These algorithms are also evaluated when various percentages of network peers become unavailable.