1. Technion –Israel Institute of Technology Software Systems Laboratory A Comparison of Peer-to-Peer systems by Gomon Dmitri and Kritsmer Ilya under Roi Melamed supervising Winter Semester 2003

2. Network is should not be overloaded by flood messages. Network is should not be overloaded by flood messages. Random Walker – each search message received is forwarded to 1 random neighbor. Random Walker – each search message received is forwarded to 1 random neighbor. Replication scheme enhances overall success rate. Replication scheme enhances overall success rate. The suggested solution : Gnutella like network: Gnutella like network: Large number of similar nodes - no centralization Large number of similar nodes - no centralization Dynamic network. Dynamic network. The search problem -nodes search for resources in the network. The search problem -nodes search for resources in the network. The problem is not addressed well by most popular systems currently in use. The problem is not addressed well by most popular systems currently in use. Peer-to-Peer (P2P) Networks

3. Various replication strategies : “Owner replication” – when a search is successful, the object is stored at the requester node only. One can call this strategy as “No Replication”. “Owner replication” – when a search is successful, the object is stored at the requester node only. One can call this strategy as “No Replication”. “Path replication” – when a search is successful, the “pointer” to the object is stored at all nodes along the path from the requester to the provider, and the object is stored at the requester node. “Path replication” – when a search is successful, the “pointer” to the object is stored at all nodes along the path from the requester to the provider, and the object is stored at the requester node. “Random replication” – when a search is successful, we count the number of nodes on the path between the requester and the provider and then randomly pick the same number of nodes and replicate the object. The most effective strategy. “Random replication” – when a search is successful, we count the number of nodes on the path between the requester and the provider and then randomly pick the same number of nodes and replicate the object. The most effective strategy.

4. The Goal of the Project Implementation of the query algorithm based on multiple random walks with distinct replication modes, applied in Gnutella-like P2P networks Implementation of the query algorithm based on multiple random walks with distinct replication modes, applied in Gnutella-like P2P networks Execution of simulations with various parameters. Execution of simulations with various parameters. Analysis of the results. Analysis of the results.