资 源 简 介
Use PeerSim or some other tool to generate graphs of size up to n >= 5000 nodes. Arrange to randomly place copies of 20 files – each file should be placed at 0.1% to 1% of the peers. And run various search algorithms:
using Gnutella-type flooding;
using the random walker model;
using 1-hop replication.
In each case, compute the search time from multiple trials, as well as the total number of nodes visited to locate the object. Then compare the performances of the two search algorithms.
