Novel Method to Anti-free-rider on Unstructured P2P Networks
In P2P network,free riding is so prevalent that it is harmful or even seriously threatened to the normal P2P applications.A novel distributed algorithm to alleviate the impacts of free-riding is proposed,in which free-riders' location is mainly concerned.In the algorithm,each peer monitors its neighbors and reaches its own judgment that if the neighbor is a free-rider or not.Most of the existing methods fighting with free-riding require a permanent peer's ID or a mechanism to maintain a global reputation of each peers,but in our algorithm each node just store the message coming from its neighbours and a set of counters.Simulation experiments show that the algorithm is effective and efficient to combat free-riding in the unstructured P2P networks and its performance on throughput has significantly improved in compare with the existing solutions.