Papers
Topics
Authors
Recent
Search
2000 character limit reached

An Enhanced Search Technique for Managing Partial Coverage and Free Riding in P2P Networks

Published 5 Jun 2010 in cs.NI | (1006.1017v1)

Abstract: This paper presents a Q-learning based scheme for managing the partial coverage problem and the ill-effects of free riding in unstructured P2P networks. Based on various parameter values collected during query routing, reward for the actions are computed and these rewards are used for updating the corresponding Q-values of peers. Thus, the routing is done through only nodes which have shown high performance in the past. Simulation experiments are conducted in several times and the results are plotted. Results show that the proposed scheme effectively manages free riders, generates high hit ratio, reduces network traffic and manages partial coverage problem.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.