KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

A Distributed Trust Model Based on Reputation Management of Peers for P2P VoD Services

  • Huang, Guimin (Research Center on Data Science and Social Computing, Guilin University of Electronic Technology) ;
  • Hu, Min (Research Center on Data Science and Social Computing, Guilin University of Electronic Technology) ;
  • Zhou, Ya (Research Center on Data Science and Social Computing, Guilin University of Electronic Technology) ;
  • Liu, Pingshan (Research Center on Data Science and Social Computing, Guilin University of Electronic Technology) ;
  • Zhang, Yanchun (Victoria University)
  • Received : 2012.05.03
  • Accepted : 2012.08.20
  • Published : 2012.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Peer-to-Peer (P2P) networks are becoming more and more popular in video content delivery services, such as Video on Demand (VoD). Scalability feature of P2P allows a higher number of simultaneous users at a given server load and bandwidth to use stream service. However, the quality of service (QoS) in these networks is difficult to be guaranteed because of the free-riding problem that nodes download the recourses while never uploading recourses, which degrades the performance of P2P VoD networks. In this paper, a distributed trust model is designed to reduce node's free-riding phenomenon in P2P VoD networks. In this model, the P2P network is abstracted to be a super node hierarchical structure to monitor the reputation of nodes. In order to calculate the reputation of nodes, the Hidden Markov Model (HMM) is introduced in this paper. Besides, a distinction algorithm is proposed to distinguish the free-riders and malicious nodes. The free-riders are the nodes which have a low frequency to free-ride. And the malicious nodes have a high frequency to free-ride. The distinction algorithm takes different measures to response to the request of these two kinds of free-riders. The simulation results demonstrate that this proposed trust model can improve QoS effectively in P2P VoD networks.

Keywords

References

  1. D'Acunto L., Vinko T., Sips H., "Bandwidth Allocation in BitTorrent-like VoD Systems under Flash Crowds", in Proc. of the IEEE International Conference on Peer-to-Peer Computing, pp. 192-201, 2010.
  2. YU Yi-Jiao and JIN Hai, "A suvery on overcoming free riding in peer-to-peer network", Chinese Journal of Computers, vol.1, no.31, pp.135-150, 2008.
  3. Y.Yang, A.L.H.Chow and L.Golubchik, "Improving QoS in BitTorrent-like VoD Systems", in proc. of ieee infocom, pp.1-9, 2010.
  4. Hughes, Daniel, Geoff Coulson and James Walkerdine, "Free Riding on Gnutella Revisited: The Bell Tolls?," Journal of IEEE Distributed Systems Online, vol.6, no.6, pp.1-13, 2005. https://doi.org/10.1109/MDSO.2005.31
  5. Hughes D, Coulson G and Walkerdine J, "Free Riding on Gnutella Revisited: The Bell Tolls", IEEE Distributed Systems On-line, vol.6, no.6, pp.1-18, 2005. https://doi.org/10.1109/MDSO.2005.31
  6. Anceaume E., Gradinariu M. and Ravoajia A., "Incentive for P2P Fair Resource Sharing", in Proc. of the IEEE International Conference on Peer-to-Peer Computing, pp.253-260, 2005.
  7. M. Feldman, K. Lai, I. Stoica and J. Chuang, "Robust incentive techniques for peer-to-peer networks", in Proc. of the 5th ACM Conference on Electronic Commerce, pp.102-111, 2004.
  8. Gupta R. and Somani A. K., "Game theory as a tool to strategize as well as predict nodes' behavior in peer-to-peer networks", in Proc. of the 11th International Conference on Parallel and Distributed Systems, pp.244-249, 2005.
  9. M. Meulpolder, J.A. Pouwelse, D.H.J. Epema and H.J. Sips, "Bartercast: a practical approach to prevent lazy free-riding in p2p networks", in Proc. of the 6th International Workshop on Hot Topics in Peer-to-Peer Systems in Conjunction with IPDPS, pp.1-8, 2009.
  10. Zhang Jie, Zhao Zheng and Wang Song, "A role-based trust model for peer-to-peer systems", in Proc. of Next-Generation Communication and Sensor Networks, pp.377-386, 2006.
  11. D.Wu, C. Liang, Y.Li and K. Ross, "View-Upload Decoupling: A redesign of multi-channel p2p video systems", IEEE INFOCOM, pp.2726-2730, 2009.
  12. M. Gupta, P. Judge and M. Ammar, "A reputations system for peer-to-peer Networks", in Proc. of the 13th International Workshop on Network and Operating Systems Support for Digital Audio and Video, pp.144-152, 2003.
  13. S.D. Kamvar, M.T. Schlosser and H. Garcia-Molina, "The eigen trust algorithm for reputations management in p2p networks", in Proc. of the 12th international conference on World Wide Web, pp.640-651, 2003.
  14. V. Vishnumurthy, S. Chandrakumar and E.G Sirer, "Karma: A secure economic framework for peer-to-peer resource sharing", In Workshop on the Economics of Peer-to-Peer Systems, pp.1-6, 2003.
  15. Fenglin QIN, Liansheng GE, Qi LIU and Ju LIU, "free riding analysis of peer-to-peer streaming systems", Journal of Computational Information Systems, vol.7, no.3, pp.721-728, 2007.
  16. J.J.D. Mol, J.A. Pouwelse, M. Meulpolder, D.H.J. Epema and H.J. Sips, "Give-to-Get: Free-riding-resilient Video-on-Demand in P2P Systems", Multimedia Computing and Networking, vol. 6818, pp.681804-681804-8, 2008.
  17. M. Piatek, T. Isdal, A. Krishnamurthy and T. Anderson, "One hop reputations for peer to peer file sharing workloads", in Proc. of the 5th USENIX Symposium on Networked Systems Design and Implementation, pp.1-14, 2008.
  18. Feldman M. and Chuang J., "Overcoming free-riding behavior in peer-to-peer systems", ACM SIGCOM Exchanges, vol. 5, no. 4, pp.41-50, 2006.
  19. Guimin Huang, Yuhong Liang and Ya Zhou, "A Distributed Top-k Query Algorithm Integrated k-Cone Structure for DHT Overlay Networks", International Conference on Multimedia Technology, pp.24-27, 2011.
  20. Silverston T., Fourmaux O. and Crowcroft J., "Towards an Incentive mechanism for Peer-to-Peer Multimedia Live Streaming Systems", In IEEE Eighth International Conference on Peer-to-Peer Computing, pp. 125-128, 2008.
  21. Mol J.D. , Epema D.H.P. and Sips H.J. , "The orchard algorithm: building multicast trees for p2p video multicasting without free-riding", IEEE Transactions on Multimedia, vol. 9, no. 8, pp.1593-1604, 2007.
  22. Jongbae Moon and Yongyun Cho, "A point-based inventive system to prevent free-riding on p2p network environments", Lecture Notes in Computer Science, vol.6785, pp.462-471, 2011.
  23. Lucia D'Acunto, Nazareno Andrade, Johan A. Pouwelse and Henk J. Sips, "Peer Selection Strategies for Improved QoS in Heterogeneous BitTorrent-Like VoD Systems", in Proc. of the IEEE International Symposium on Multimedia, pp.89-96, 2010.
  24. Lawrence R. Rabiner, "A tutorial on hidden markov models and selected applications in speech recognition", in Proc. of the IEEE, vol.77, no.2, pp.257-286, 1989. https://doi.org/10.1109/5.18626
  25. Daniel Ramage, "Hidden Markov Models Fundamentals", CS229 Section Notes, 2007.
  26. Mark Stamp, "A Revealing Introduction to Hidden Markov Models", San Jose State University, 2012.
  27. Montresor. A. and Jelasity and M., "PeerSim: A Scalable P2P Simulator", IEEE Ninth International Conference on Peer-to-Peer Computing, pp.99-100, 2009.

Cited by

  1. 온라인상에서 부정적 편향에 따른 평판 확산 차이에 관한 연구 : 선거 사례를 중심으로 vol.14, pp.1, 2015, https://doi.org/10.9716/kits.2015.14.1.263
  2. A Novel Multi-link Integrated Factor Algorithm Considering Node Trust Degree for Blockchain-based Communication vol.11, pp.8, 2017, https://doi.org/10.3837/tiis.2017.08.001