KSII Transactions on Internet and Information Systems (TIIS)

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

DOI QR Code

Fair Peer Assignment Scheme for Peer-to-Peer File Sharing

  • Hu, Chih-Lin (Department of Communication Engineering, National Central University) ;
  • Chen, Da-You (Department of Communication Engineering, National Central University) ;
  • Chang, Yi-Hsun (Department of Communication Engineering, National Central University) ;
  • Chen, Yu-Wen (Department of Electrical Engineering, Columbia University)
  • Received : 2010.07.09
  • Accepted : 2010.08.20
  • Published : 2010.10.30
Download PDF
⟨ Previous Next ⟩

Abstract

The reciprocal virtue of peer-to-peer networking has stimulated an explosion of peer population and service capacity, ensuring rapid content distribution in peer-to-peer networks. Critical issues such as peer churn, free riding, and skewed workload significantly affect performance results such as service agility, fairness, and resource utilization. To resolve these problems systematically, this study proposes a peer assignment scheme that supports fair peer-to-peer file sharing applications. The proposed scheme exploits the peer duality of both server-oriented peer capacity and client-oriented peer contribution. Accordingly, the system server can prioritize download requests and appropriately assign server peers to uploading file objects. Several functional extensions, including peer substitution and elimination, bandwidth adjustment, and distributed modification, help cope with subtle situations of service starvation and download blocking, and hence make the system design robust and amenable. Simulation results show this design is examined under both centralized and distributed peer-to-peer environments. Performance results confirm that the proposed mechanisms are simple but effective in maintaining service agility and fairness, without loss of overall service capacity in peer-to-peer files sharing systems.

Keywords

References

  1. The cooperative association for Internet data analysis (CAIDA), "Internet traffic classification," online available: http://www.caida.org/research/traffic-analysis/classification-overview/, 2009.
  2. Z. Ge, D. Figueiredo, S. Jaiswal, J. Kurose, and D. Towsley, "Modeling peer-peer file sharing systems," in Proc. of IEEE INFOCOM'03, vol. 3, pp. 2188-2198, 2003.
  3. S. Androutsellis-Theotokis and D. Spinellis, "A survey of peer-to-peer content distribution technologies," ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, 2004. https://doi.org/10.1145/1041680.1041681
  4. X. Yang and G. de Veciana, "Service capacity of peer to peer networks," in Proc. of IEEE INFOCOM'04, vol. 4, pp. 2242-2252, 2004.
  5. J. S. Kong, J. S. A. Bridgewater, and V. P. Roychowdhury, "Resilience of structured p2p systems under churn: the reachable component method," Computer Communications, vol. 31, no. 10, pp. 2109-2123, 2008. https://doi.org/10.1016/j.comcom.2008.01.051
  6. D. Stutzbach, and R. Rejaie, "Understanding churn in peer-to-peer networks," in Proc. of the 6th ACM SIGCOMM Conf. on Internet measurement, pp. 189-202, 2006.
  7. E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, "A survey and comparison of peer-to-peer overlay network schemes," IEEE Communications Tutorials and Surveys, vol. 7, no. 2, pp. 72-93, 2005. https://doi.org/10.1109/COMST.2005.1610546
  8. C.-L. Hu and T.-H. Kuo, "Hierarchical peer-to-peer overlay with cluster-reputation-based adaptation," in Proc. of the 2009 IEEE Pacific Rim Conf. on Communications, Computers and Signal Processing, 2009.
  9. F. E. Bustamante and Y. Qiao, "Designing less-structured p2p systems for the expected high churn," IEEE/ACM Trans. on Networking, vol. 16, no. 3, pp. 617-627, 2008. https://doi.org/10.1109/TNET.2007.903986
  10. E. Adar and B. A. Huberman, "Free riding on gnutella," First Monday, vol. 5, no. 10, 2000.
  11. S. Saroiu, P. K. Gummadi, and S. D. Gribble, "A measurement study of peer-to-peer file sharing systems," in Proc. of the SPIE Vol.4673: Multimedia Computing and Networking, 2002.
  12. A. Creus-Mir, R. Casadesus-Masanell, and A. Hervas-Drane, "Bandwidth allocation in peer-to-peer file sharing networks," Computer Communications, vol. 31, no. 2, pp. 257-265, 2008. https://doi.org/10.1016/j.comcom.2007.08.001
  13. M. Feldman and J. Chuang, "Overcoming free-riding behavior in peer-to-peer systems," ACM SIGecom Exchanges, vol. 5, no. 4, pp. 41-50, 2005. https://doi.org/10.1145/1120717.1120723
  14. P. Antoniadis, C. Courcoubetis, and R. Mason, "Comparing economic incentives in peer-to-peer networks," Computer Networks, vol. 46, no. 1, pp. 133-146, 2004. https://doi.org/10.1016/j.comnet.2004.03.021
  15. P. Resnick, K. Kuwabara, R. Zeckhauser, and E. Friedman, "Reputation systems," Communications of the ACM, vol. 43, no. 12, pp. 45-48, 2000. https://doi.org/10.1145/355112.355122
  16. S. Jun and M. Ahamad, "Incentives in BitTorrent induce free riding," in Proc. of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-Peer Systems, pp. 116-121, 2005.
  17. D. Hughes, G. Coulson, and J. Walkerdine, "Free riding on gnutella revisited: the bell tolls?" IEEE Distributed Systems Online, vol. 6, no. 3, 2005.
  18. B. Yang and H. Garcia-Molina, "PPay: Micropayments for peer-to-peer systems," in Proc. of the 10th ACM Conf. on Computer and Communications Security, pp. 300-310, 2003.
  19. M. J. Osborne, An introduction to game theory, Oxford University Press, 2004.
  20. K. Eger and U. Killat, "Bandwidth trading in BitTorrent-like p2p networks for content distribution," Computer Communications, vol. 31, no. 2, pp. 201-211, 2008. https://doi.org/10.1016/j.comcom.2007.08.005
  21. I. Osipkov, P. Wang, and Y. Kim, "Robust accounting in decentralized p2p storage systems," in Proc. of the 26th IEEE International Conf. on Distributed Computing Systems, pp. 300-310, 2006.
  22. I. Simplot-Ryl, I. Traore, and P. Everaere, "Distributed architectures for electronic cash schemes: a survey," International Journal of Parallel, Emergent and Distributed Systems, vol. 24, no. 3, pp. 243-271, 2009. https://doi.org/10.1080/17445760802441671
  23. E. Fourquet, K. Larson, and W. Cowan, "A reputation mechanism for layered communities," ACM SIGecom Exchanges, vol. 6, no. 1, pp. 11-22, 2006. https://doi.org/10.1145/1150735.1150738
  24. B. Cohen, "Incentives build robustness in BitTorrent," in Proc. of the 1st Workshop on Economics of Peer-to-Peer Systems, 2003.
  25. A. Legout, G. Urvoy-Keller, and P. Michiardi, "Rarest first and choke algorithms are enough," in Proc. of the 6th ACM SIGCOMM Conf. on Internet measurement, pp. 203-216, 2006.
  26. D. Qiu and R. Srikant, "Modeling and performance analysis of BitTorrent-like peer-to-peer networks," in Proc. of ACM SIGCOMM'04, pp. 367-378, 2004.
  27. M. Li, J. Yu, and J. Wu, "Free-riding on BitTorrent-like peer-to-peer file sharing systems: modeling analysis and improvement," IEEE Trans. on Parallel and Distributed Systems, vol. 19, no. 7, pp. 954-966, 2008. https://doi.org/10.1109/TPDS.2007.70783
  28. M. Yang, Z. Zhang, X. Li, and Y. Dai, "An empirical study of free-riding behavior in the maze p2p file-sharing system," in Proc. of the 4th Annual International Workshop on Peer-To-Peer Systems, vol. 3640 of Lecture Notes in Computer Science, Springer, pp. 182-192, 2005.
  29. A. R. Bharambe, C. Herley, and V. Padmanabhan, "Analyzing and improving a BitTorrent network's performance mechanisms," in Proc. of IEEE INFOCOM'06, 2006.
  30. H. Liu and C. Hsu, "Anne: a fair service capacity management for p2p overlay networks," in Proc. of the 2nd International Conf. on Communications and Networking in China, pp. 265-269, 2007.
  31. R. Jurca and B. Faltings, "Reputation-based pricing of p2p services," in Proc. of the 2005 ACM SIGCOMM Workshop on Economics of peer-to-peer systems, pp. 144-149, 2005.
  32. R. Prasad, V. Srinivas, V. Kumari, and K. Raju, "An effective calculation of reputation in p2p networks," Journal of Networks, vol. 4, no. 5, pp. 332-342, 2009.
  33. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in Proc. of the 16th ACM International Conf. on Supercomputing, pp.84.95, 2002.
  34. B. Yang and H. Garcia-Molina, "Improving search in peer-to-peer networks," in Proc. of the 22nd International Conf. on Distributed Computing Systems, pp. 5-14, 2002.
  35. M. Yanga and Z. Fei, "A novel approach to improving search efficiency in unstructured peer-to-peer networks," Journal of Parallel and Distributed Computing, vol. 69, no. 11, pp. 877-884, 2009. https://doi.org/10.1016/j.jpdc.2009.07.004
  36. C. Gkantsidis, M. Mihail, and A. Sabei, "Hybrid search schemes for unstructured peer-to-peer networks," in Proc. of IEEE INFOCOM'05, vol. 3, pp. 1526-1537, 2005.
  37. X. Shi, J. Han, Y. Liu, and L. M. Ni, "Popularity adaptive search in hybrid p2p systems," Journal of Parallel and Distributed Computing, vol. 69, no. 2, pp. 125-124, 2009. https://doi.org/10.1016/j.jpdc.2008.09.004
  38. T. Lin, P. Lin, H. Wang, and C. Chen, "Dynamic search algorithm in unstructured peer-to-peer networks," IEEE Trans. on Parallel and Distributed Systems, vol. 20, no. 5, pp. 654-666, 2009. https://doi.org/10.1109/TPDS.2008.134

Cited by

  1. A mechanism of bandwidth allocation for peer-to-peer file-sharing networks via particle swarm optimization vol.35, pp.2, 2018, https://doi.org/10.3233/jifs-172276