Enhancement of BARTERCAST Using Reinforcement Learning to Effectively Manage Freeriders

  • G. Sreenu
  • P. M. Dhanya
  • Sabu M. Thampi
Part of the Communications in Computer and Information Science book series (CCIS, volume 193)

Abstract

Efficient searching and quality services are offered by prevailing infrastructure of Peer-to-Peer(P2P)networks. P2P applications are more and more wide spreading with good scope. Though the advantages are still existing the P2P system is vulnerable to some security issues. One of the important issues that threatens the subsistence of P2P system is freeriding. Freeriders are peers(nodes) which only utilize the system but not contribute anything to the system. Freeriders affect the system in a drastic manner. Freeriders mainly download the contents without uploading anything. So the contents will be concentrated in few peers and that will increase the congestion and reduce the quality of the system. This reduces the popularity of the system. This paper compares different approaches for managing freeriders and finally a solution is suggested which is an extension to existing protocol known as BARTERCAST and the enhancement is done through Q-learning. Application of reinforcement learning approach in BARTERCAST results in more accurate results.

Keywords

Maxflow Q-learning Q-table Reward 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Meulpolder, M., Pouwelse, J.A., Epema, D.H.J., Sips, H.J.: BARTERCAST: A practical approach to prevent lazy free riding in p2p networks. In: Proceedings of IPDPS 2009, pp. 1–8 (2009)Google Scholar
  2. 2.
    Watkins, C.J.C.H., Dayan, P.: Technical Note:Q-Learning. Journal Machine Learning 8(3-4) (May 1992), doi:10.1007/BF00992698Google Scholar
  3. 3.
    Elrufaie, E., Turner, D.A.: Bidding in P2P Content Distribution Networks using the Lightweight Currency Paradigm. In: International Conference on Information Technology: Coding and Computing (ITCC 2004), vol. 2, p.129 (2004)Google Scholar
  4. 4.
    Catalano, D., Ruffo, G.: A Fair Micro-Payment Scheme for Profit Sharing in P2P Networks. In: Proceedings of the 2004 International Workshop on Hot Topics in Peer-to-Peer Systems (HOT-P2P 2004). IEEE, Los Alamitos (2004)Google Scholar
  5. 5.
    Mekouar, L., Iraqi, Y., Boutaba, R.: Free riders under control through service differentiation in peer-to-peer systems. In: International Conference on Collaborative Computing: Networking, Applications and Worksharing (2005)Google Scholar
  6. 6.
    Zhang, K., Antonopoulos, N.: Towards a Cluster Based Incentive Mechanism for P2P Networks. In: CCGRID 2009 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid (2009)Google Scholar
  7. 7.
    Chen, C., Su, S., Shuang, K., Yang, F.: TARC: A Novel Topology Adaptation Algorithm based on Reciprocal Contribution in Unstructured P2P Networks. In: ICPP Workshops 2009, pp. 437–442 (2009)Google Scholar
  8. 8.
    Tian, J., Yang, L., Li, J., Liu, Z.: A Distributed and Monitoring-based Mechanism for Discouraging Free Riding in P2P Network. In: 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, pp. 379–384 (2009)Google Scholar
  9. 9.
    Damiani, E., Vimercati, S., Paraboschi, S., Samarati, P., Violante, F.: A Reputation-based Approach for Choosing Reliable Resources in Peer-to-Peer Networks. In: ACM Symposium on Computer Communication Security, pp. 207–216 (2002)Google Scholar
  10. 10.
    Singh, A., Liu, L.: TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems. In: Third IEEE International Conference on Peer-to-Peer Computing, pp. 142–149 (September 2003)Google Scholar
  11. 11.
    Lee, S., Sherwood, R., Bhattacharjee, B.: Cooperative peer groups in NICE (2003)Google Scholar
  12. 12.
    Kamvar, S., Schlosser, M., Garcia-Molina, H.: The Eigen- Trust algorithm for reputation management in P2P networks. In: Proceedings of the Twelwth International World-Wide Web Conference (WWW 2003), 446–458 (2003)Google Scholar
  13. 13.
    Xiong, L., Liu, L.: PeerTrust: Supporting reputationbased trust for peer-to-peer electronic communities. IEEE Transactions on Knowledge and Data Engineering 16(7), 843–857 (2004)CrossRefGoogle Scholar
  14. 14.
    Zhou, R., Hwang, K.: PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing. IEEE Trans. Parallel and Distributed Systems 18(4), 460–473 (2006)Google Scholar
  15. 15.
    Zhou, R., Hwang, K., Cai, M.: Gossiptrust for fast reputation aggregation in peer-to-peer networks. IEEE Trans. on Knowledgement and Data Engineering, 1282–1295 (February 11, 2008)Google Scholar
  16. 16.
    Yasutomi, M., Mashimo, Y., Shigeno, H.: GRAT:Group Reputation Aggregation Trust for Unstructured Peer-to-Peer Network. In: ICDCSW 2010: Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems Workshops (2010)Google Scholar
  17. 17.
    Thampi, S.M., Chandra Sekaran, K.: Q-Feed - An Effective Solution for the Free-riding Problem in Unstructured P2P Networks. International Journal of Digital Multimedia Broadcasting 2010, Article ID 793591, doi:10.1155/2010/793591, ISSN: 1687-7578, e-ISSN: 1687-7586 Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • G. Sreenu
    • 1
  • P. M. Dhanya
    • 1
  • Sabu M. Thampi
    • 1
  1. 1.Rajagiri School of Engineering and TechnologyCochinIndia

Personalised recommendations