Local Contribution (LC) and Trustworthiness Factors to Induce Fairness in P2P Networks
- 9 Downloads
A peer-to-peer (P2P) network is a distributed system in which the autonomous peers participate at their motivation and resources are shared in distributed manner. P2P systems can be classified in two major categories: centralized and distributed. Distributed P2P systems can be further classified in two types: structured and unstructured. With immense increase in Internet, the P2P networks have found increased interest in the research community since the different protocols for these networks can be gainfully utilized in the resource discovery process for Internet related applications. However, there are several challenges in designing an efficient protocol for the P2P networks. These networks suffer from problems such as fake content distribution, free riding, whitewashing, poor search scalability, lack of a robust trust model, etc. Moreover, the peers can join and leave the network (churn) at any time which makes trust management and searching in these networks more challenging. Free riding nature of the peers damages overall performance of the P2P systems. There are several mechanisms proposed for promoting fairness in the P2P systems like tit-for-tat policy, point-based incentive policy, PageRank, Eigen Trust, layered taxation, advertisement of incentive, etc. We have observed that in some schemes like point-based incentive scheme, peers are stricken in the process of requesting data download which leads to the starvation. We have proposed a new scheme which collects the statics of resources shared by the participating peers in P2P networks and calculated local contribution and trustworthiness factors based on the statistics. The starvation problem is minimized in the proposed scheme. We have done analytical modeling and analysis of different costs involved in downloading a file with the costs in existing scheme and found that the costs involved in proposed scheme is less than the existing scheme.
KeywordsLocal contribution (LC) Trustworthiness Fairness P2P networks
- 1.BitTorrent. http://www.bittorrent.com. Accessed June 2017.
- 2.Gnutella. https://en.wikipedia.org/wiki/Gnutella. Accessed June 2017.
- 3.British Music Rights. (2008). Music Experience and Behavior in Young People. http://www.ukmusic.org/cms/uploads/files/Uoh%20Research%202008.pdf. Accessed June 2017.
- 4.Kazaa. https://en.wikipedia.org/wiki/Kazaa. Accessed June 2017.
- 5.Grokster. https://en.wikipedia.org/wiki/Grokster. Accessed June 2017.
- 7.Sylvia, R., Paul, F., Mark, H., Richard, K., & Scott, S. (2001). A scalable content addressable network. In Proceedings of 2001 conference on applications, technologies, architectures, and protocols for computer communications, August 2001, San Diego, CA, USA, pp. 161–172.Google Scholar
- 8.Gupta, I., Berman, K., Linga, P., Demers, A., & Van Renesse, R. (2003). Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In Proceedings of 2nd international workshop on peer-to-peer systems (IPTPS 03), 2003.Google Scholar
- 11.Karakaya, M., Korpeoglu, I., & Ulusoy, Ö. (2009). Free riding in peer-to-peer networks. In Published by the IEEE computer society, March/April 2009, pp. 92–98.Google Scholar
- 12.Ren, X.-p., Wan, J., & Xu, X.-h. (2006). A mechanism to control free-riding in P2P networks. In ICWMMN2006 proceedings.Google Scholar
- 13.Junfeng, T., Lidan, Y., Juan, L., & Zhongyu, L. (2009). 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, published by IEEE Computer Society, 2009, pp. 379–384.Google Scholar
- 14.Li, Y., Liu, Y., Xu, K., & Chen, W. (2010). Analysis and balanced mechanism on free-rider in P2P network. In Proceedings of second international conference on computer modeling and simulation 2010, published by IEEE Computer Society, 2010, pp. 462–466.Google Scholar
- 15.Ge, T., & Manoharan, S. (2010). Mitigating free-riding on bittorrent networks. In Proceedings of fifth international conference on digital telecommunications 2010, published by IEEE Computer Society, 2010, pp. 52–56.Google Scholar
- 16.Wang, C., & Feng, J. (2010). A study of mutual authentication for P2P trust management. In Proceedings of sixth international conference on intelligent information hiding and multimedia signal processing 2010, published by IEEE Computer Society, 2010, pp. 474–477.Google Scholar
- 17.Liu, Q., Qin, F., & Ge, L. (2011). Modeling and analysis of free riding in peer-to-peer streaming systems. In Proceedings of 6th international ICST conference on communications and networking in China (CHINACOM) 2011, Published by IEEE Computer Society, 2011, pp. 780–784.Google Scholar
- 18.Sheshjavani, A. G., Akbari, B., & Ghaeini, H. R. (2016). A free-riding resiliency incentive mechanism for VoD streaming over hybrid CDN-P2P networks. In Proceedings of 8th international symposium on telecommunications (IST’2016), published by IEEE Computer Society, 2016, pp. 771–776.Google Scholar
- 19.Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The PageRank citation ranking: Bringing order to the web. Stanford Digital Library Technologies Project, 1998.Google Scholar
- 20.Kamvar, S. D., Schlosser, M. T., & Garcia-Molina, H. (2003). The eigentrust algorithm for reputation management in P2P networks. In Proceedings of 12th international world wide web conference, 2003.Google Scholar
- 21.Lin, C. S. & Cheng, Y.-C. (2009). A barter-based incentive mechanism for peer-to-peer media streaming. In Proceedings of IEEE 13th ISCE, May 2009, pp. 871–875.Google Scholar
- 23.Wang, B. C., Chow, A. L. H., & Golubchik, L. (2012). P2P streaming: Use of advertisements as incentives. In Proceedings of 3rd MMSys, 2012, pp. 77–82.Google Scholar
- 24.Shi, N. & Dai, Q. (2006). A novel incentive mechanism improving peer-to-peer on-demand streaming. In Proceedings of international conference on communication, circuits system (Vol. 1, pp. 91–95).Google Scholar