Skip to main content
Log in

Optimality analysis of locality-aware tit-for-tat-based P2P file distribution

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

Abstract

In the current Internet, periodic software update is essential to maintain systems secure from malicious attacks. In case of proliferated software, e.g., Operating System (OS), the distribution server for update tends to be a bottleneck, due to the concentration of users’ requests. To tackle this problem, several systems, e.g., Windows Update, have been applying the Peer-to-Peer (P2P) file distribution technique where clients called peers upload retrieved fragments of the original file, i.e., pieces, to others. However, peers may not be willing to upload pieces to others, due to their own communication overhead. BitTorrent has adopted the Tit-for-Tat (TFT) strategy in game theory, which encourages peers to exchange an equivalent number of pieces among each pair of peers. In recent years, the optimality of TFT-based P2P content distribution, i.e., file distribution and streaming, has been analyzed with the help of Integer Linear Programming (ILP). In this paper, considering the fact that the communication overhead inside a group, e.g., LAN or Autonomous System (AS), is much less than that of between groups, we model locality-aware TFT-based P2P file distribution where the TFT constraint is relaxed for intra-group communications. We further formulate the optimal piece flow determination problem as ILP in the similar way to the existing work. Through numerical results, we show that the locality-aware TFT-based P2P file distribution can achieve quasi-optimal average file download time when the upload capacity of the server is a bottleneck and the number of groups is moderate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. BitTorrent. available at https://www.bittorrent.com

  2. Deploy and Update Windows10. available at https://docs.microsoft.com/en-us/windows/deployment/

  3. IBM ILOG CPLEX Optimizer. available at https://www.ibm.com/analytics/cplex-optimizer

  4. Azzedin F, Yahaya M (2016) Modeling BitTorrent Choking Algorithm Using Game Theory. Fut Gener Comput Syst 55(2):255–265

    Article  Google Scholar 

  5. Blond SL, Legout A, Dabbous W (2011) Pushing BitTorrent Locality to the Limit. Comput Netw 55 (3):541–557

    Article  Google Scholar 

  6. Carbunaru C, Teo YM, Leong B, Ho T (2014) Modeling Flash Crowd Performance in Peer-to-Peer File Distribution 25(10):2617–2626

  7. Chen D, Batson RG, Dang Y (2010) Applied integer programming.0 Wiley, New York

  8. Cuevas R, Laoutaris N, Yang X, Siganos G, Rodriguez P (2014) Bittorrent Locality and Transit TrafficReduction: When, Why, and at What Cost?. IEEE Trans Parallel Distrib Syst 25(5):1177–1189. https://doi.org/10.1109/TPDS.2013.109

    Article  Google Scholar 

  9. D’Alessandro Costa MA, Gonċalves Rubinstein M (2018) Performance Analysis of a Locality-Aware BitTorrent Protocol in Enterprise Networks. Peer-to-Peer Networking and Applications:1– 12

  10. Ferragut A, Paganini F (2016) Fluid models of population and download progress in P2P networks. IEEE Trans Control Netw Syst 3(1):34–45. https://doi.org/10.1109/TCNS.2015.2434092

    Article  MathSciNet  MATH  Google Scholar 

  11. Ghaderzadeh A, Kargahi M, Reshadi M (2017) Infred: Intelligent Free Rider Detection in Collaborative Distributed Systems. J Netw Comput Appl 78:134–145. https://doi.org/10.1016/j.jnca.2016.11.007

    Article  Google Scholar 

  12. Goldenberg DK, Qiuy L, Xie H, Yang YR, Zhang Y (2004) Optimizing cost and performance for multihoming. In: Proceedings of the ACM SIGCOMM computer communication review, pp 79–92

  13. Hasegawa M, Sasabe M, Takine T (2014) Analysis of Optimal Scheduling in Tit-for-Tat-Based P2P File Distribution. IEICE Trans Commun 97(12):2650–2657

    Article  Google Scholar 

  14. Huang W, Wu C, Li Z, Lau FC (2014) The Performance and Locality Tradeoff in Bittorrent-like File Sharing Systems. Peer-to-Peer Netw Appl 7(4):469–484. https://doi.org/10.1007/s12083-012-0190-2

    Article  Google Scholar 

  15. Jin X, Kwok YK (2015) Coercion builds cooperation in dynamic and heterogeneous P2P live streaming networks. Comput Netw 81:1–18. https://doi.org/10.1016/j.comnet.2015.02.006

    Article  Google Scholar 

  16. Jun S, Ahamad M (2005) Incentives in BitTorrent Induce Free Riding. In: Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-peer Systems, P2PECON ’05. ACM, New York, pp 116–121. https://doi.org/10.1145/1080192.1080199

  17. Kang X, Wu Y (2015) Incentive Mechanism Design for Heterogeneous Peer-to-Peer Networks: A Stackelberg Game Approach. IEEE Trans Mob Comput 14(5):1018–1030. https://doi.org/10.1109/TMC.2014.2343628

    Article  Google Scholar 

  18. Lu K, Wang S, Xie L, Wang Z, Li M (2016) A Dynamic Reward-Based Incentive Mechanism: Reducing the Cost of P2P systems. Knowl-Based Syst 112:105–113. https://doi.org/10.1016/j.knosys.2016.09.002

    Article  Google Scholar 

  19. Magharei N, Rejaie R, Rimac I, Hilt V, Hofmann M (2014) ISP-Friendly Live P2P Streaming 22(3):244–256

  20. Nishi Y, Sasabe M, Kasahara S (2020) Impact of Locality-awareness on Tit-for-Tat-based P2P File Distribution. In: To be presented at IEEE consumer communications & networking conference, pp 1–6

  21. Pouwelse Johanand Garbacki P, Epema D, Sips H (2005) The bittorrent P2P File-Sharing system: Measurements and analysis. In: Castro M., van Renesse R. (eds) Peer-to-peer systems IV. Springer, Berlin, pp 205–216

  22. Sasabe M (2018) Analysis of Optimal Piece Flow in Tit-for-Tat-Based P2P Streaming. Comput Netw 139 (7):60–69

    Article  Google Scholar 

  23. Sasabe M (2019) Topological Influence on Optimality of Tit-for-Tat based P2P Content Distribution. Peer-to-Peer Networking and Applications:1–12

  24. Seibert J, Torres R, Mellia M, Munafo MM, Nita-Rotaru C, Rao S (2012) The Internet-Wide impact of P2P traffic localization on ISP profitability. IEEE/ACM Trans Netw 20(6):1910–1923. https://doi.org/10.1109/TNET.2012.2190093

    Article  Google Scholar 

  25. de Souza e Silva E, Leão RM, Menasché DxS, Towsley D (2019) On the scalability of P2P swarming systems. Comput Netw 151(3):93–113

    Article  Google Scholar 

  26. Wang H, Liu J (2012) Exploring Peer-to-Peer Locality in Multiple Torrent Environment. IEEE Trans Parallel Distrib Syst 23(7):1216–1226. https://doi.org/10.1109/TPDS.2011.253

    Article  Google Scholar 

  27. Wu TY, Lee WT, Guizani N, Wang TM (2014) Incentive mechanism for P2P file sharing based on social network and game theory. J Netw Comput Appl 41:47–55. https://doi.org/10.1016/j.jnca.2013.10.006

    Article  Google Scholar 

  28. Xia RL, Muppala JK (2010) A Survey of BitTorrent Performance 12(2):140–158

  29. Zhang X, Wang N, Cao Y, Peng L, Meng H (2018) A Stochastic Analytical Modeling Framework on ISP–P2P Collaborations in Multidomain Environments 12(3):2320–2331

  30. Zhao J, Wu C, Lin X (2015) Locality-aware Streaming in Hybrid P2P-Cloud CDN Systems. Peer-to-Peer Netw Appl 8(2):320–335. https://doi.org/10.1007/s12083-013-0233-3

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yohei Nishi.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This paper is an expanded version of the paper, which was presented at IEEE Consumer Communications & Networking Conference (CCNC 2020) [20] . This work was supported in part by JSPS KAKENHI (A) under Grant 19H01103 and JSPS KAKENHI (C) under Grant 19K11942, Japan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nishi, Y., Sasabe, M. & Kasahara, S. Optimality analysis of locality-aware tit-for-tat-based P2P file distribution. Peer-to-Peer Netw. Appl. 13, 1688–1703 (2020). https://doi.org/10.1007/s12083-020-00925-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-020-00925-2

Keywords

Navigation