Skip to main content
SpringerLink
Log in

Analysis of minimum distribution time of tit-for-tat-based P2P file distribution: Linear programming based approach

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

Abstract

In recent years, software update has become one of the essential functions in the current Internet to maintain devices safe from a various types of attacks. If the number of software users is enormous, distribution servers tend to be bottlenecks, due to the access concentration. To alleviate this problem, several systems (e.g., Windows update) have started applying peer-to-peer (P2P) file distribution where clients (peers) assist the distribution by uploading retrieved fragments of the file (i.e., pieces) to others. However, it has been pointed out that many peers tend to be free riders, which are not willing to upload pieces to others, so as to save their upload capacities. Tit-for-tat (TFT) strategy in game theory is one of the practical mechanisms to build reciprocity between each pair of peers. In this paper, we first develop a linear program (LP) as a tool to analyze the minimum distribution time of the TFT-based P2P file distribution under arbitrary upload capacity distribution. Focusing on the fact that access links can be categorized into multiple classes in the current Internet, we further extend the general formulation to multi-class formulation, which does not depend on the system scale. Through numerical results, we reveal the fundamental characteristics of the TFT-based P2P file distribution.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

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

Similar content being viewed by others

References

  1. Carbunaru C, Teo YM, Leong B, Ho T (2014) Modeling flash crowd performance in peer-to-peer file distribution. IEEE Transactions on Parallel and Distributed Systems 25(10):2617–2626. https://doi.org/10.1109/TPDS.2013.220

    Article  Google Scholar 

  2. Deploy and update Windows 10. Available at https://docs.microsoft.com/en-us/windows/deployment/

  3. Hughes D, Coulson G, Walkerdine J (2005) Free riding on Gnutella revisited: The bell tolls? IEEE Distributed Systems Online 6(6):1–13. https://doi.org/10.1109/MDSO.2005.31

    Article  Google Scholar 

  4. BitTorrent. Available at https://www.bittorrent.com

  5. Azzedin F, Yahaya M (2016) Modeling bittorrent choking algorithm using game theory. Futur Gener Comput Syst 55:255–265. https://doi.org/10.1016/j.future.2015.02.007

    Article  Google Scholar 

  6. 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. https://doi.org/10.1587/transcom.E97.B.2650

    Article  Google Scholar 

  7. Sasabe M (2018) Analysis of optimal piece flow in tit-for-tat-based P2P streaming. Comput Netw 139(7):60–69. https://doi.org/10.1016/j.comnet.2018.04.004

    Article  Google Scholar 

  8. Sasabe M (2020) Topological influence on optimality of tit-for-tat based P2P content distribution. Peer-to-Peer Networking and Applications 13(1):243–254. https://doi.org/10.1007/s12083-019-00763-x

    Article  Google Scholar 

  9. Nishi Y, Sasabe M, Kasahara S (2020) Optimality analysis of locality-aware tit-for-tat-based P2P file distribution. Peer-to-Peer Networking and Applications: 1–16. https://doi.org/10.1007/s12083-020-00925-2

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

  11. Kumar R, Ross KW (2006) Peer-assisted file distribution: The minimum distribution time. In: Proceedings of 1st IEEE workshop on hot topics in web systems and technologies, pp 1–11. https://doi.org/10.1109/HOTWEB.2006.355259

  12. Chen D, Batson RG, Dang Y (2010) Applied integer programming. Wiley

  13. Aguilar-Gonzalez A, Nolazco-Flores JA, Vargas-Rosales C, Bustos R (2017) Characterisation, design and simulation of an efficient peer-to-peer content distribution system for enterprise networks. Peer-to-Peer Networking and Applications 10(1):122–137. https://doi.org/10.1007/s12083-015-0412-5

    Article  Google Scholar 

  14. D’Alessandro Costa MA, Gonçalves Rubinstein M (2019) Performance analysis of a locality-aware bittorrent protocol in enterprise networks. Peer-to-Peer Networking and Applications 12(4):751–762. https://doi.org/10.1007/s12083-018-0674-9

    Article  Google Scholar 

  15. Pouwelse J, Garbacki P, Epema D, Sips H (2005) The Bittorrent P2P file-sharing system: Measurements and analysis. In: Proceedings of the 4th international conference on peer-to-peer systems, pp 205–216. https://doi.org/10.1007/11558989_19

  16. Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proc. of the 6th ACM SIGCOMM conference on internet measurement, pp 189–202. https://doi.org/10.1145/1177080.1177105

  17. Ge Z, Figueiredo D, Jaiswal S, Kurose J, Towsley D (2003) Modeling peer-peer file sharing systems. In: Proceedings of IEEE INFOCOM, vol 3, pp 2188–2198. https://doi.org/10.1109/INFCOM.2003.1209239

  18. Tewari S, Kleinrock L (2005) On fairness, optimal download performance and proportional replication in peer-to-peer networks. In: Proceedings of the 4th IFIP-TC6 international conference on networking technologies, services, and protocols; performance of computer and communication networks; Mobile and Wireless Communication Systems, pp 709–717. https://doi.org/10.1007/11422778_57

  19. Ferragut A, Paganini F (2015) Queueing analysis of peer-to-peer swarms: Stationary distributions and their scaling limits. Perform Eval 93:47–62. https://doi.org/10.1016/j.peva.2015.08.003

    Article  Google Scholar 

  20. Qiu D, Srikant R (2004) Modeling and performance analysis of BitTorrent-like peer-to-peer networks. ACM SIGCOMM Comput Commun Rev 34(4):367–378. https://doi.org/10.1145/1030194.1015508

    Article  Google Scholar 

  21. Gaeta R, Gribaudo M, Manini D, Sereno M (2006) Analysis of resource transfers in peer-to-peer file sharing applications using fluid models. Perform Eval 63(3):149–174. https://doi.org/10.1016/j.peva.2005.01.001

    Article  Google Scholar 

  22. Meulpolder M, Pouwelse JA, Epema DHJ, Sips HJ (2009) Modeling and analysis of bandwidth-inhomogeneous swarms in BitTorrent. In: Proceedings of IEEE P2P, pp 232–241. https://doi.org/10.1109/P2P.2009.5284523

  23. Murai F, de A Rocha AA, Figueiredo D, de Souza e Silva EA (2012) Heterogeneous download times in a homogeneous bittorrent swarm. Comput Netw 56(7):1983–2000. https://doi.org/10.1016/j.comnet.2012.02.009

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  25. de Souza e Silva E, Leão RMM, Menasché DS, Towsley D (2019) On the scalability of P2P swarming systems. Comput Netw 151:93–113. https://doi.org/10.1016/j.comnet.2019.01.006

    Article  Google Scholar 

  26. DeFigueiredo D, Venkatachalam B, Wu SF (2007) Bounds on the performance of P2P networks using tit-for-tat strategies. In: Proceedings of IEEE P2P, pp 11–18. https://doi.org/10.1109/P2P.2007.32

  27. Carbunaru C, Teo YM, Leong B (2011) A performance study of peer-assisted file distribution with heterogeneous swarms. In: Proceedings of IEEE 36th conference on local computer networks, pp 341–349. https://doi.org/10.1109/LCN.2011.6115314

  28. Carbunaru C, Teo YM, Leong B, Ho T (2014) Modeling flash crowd performance in peer-to-peer file distribution. IEEE Trans Parallel Distrib Sys 25(10):2617–2626. https://doi.org/10.1109/TPDS.2013.220

    Article  Google Scholar 

  29. BitTorrent protocol specification. available at http://www.bittorrent.org

  30. Mendes DX, de Souza e Silva E, Menasché D, Leão R, Towsley D (2017) An experimental reality check on the scaling laws of swarming systems. In: Proc. of IEEE INFOCOM, pp. 1–9. https://doi.org/10.1109/INFOCOM.2017.8057126

  31. Legout A, Liogkas N, Kohler E, Zhang L (2007) Clustering and sharing incentives in BitTorrent systems. ACM SIGMETRICS Performance Evaluation Review 35(1):301–312. https://doi.org/10.1145/1269899.1254919

    Article  Google Scholar 

  32. Ministry of Internal Affairs and Communications, Japan : Information and Communications in Japan. https://www.soumu.go.jp/johotsusintokei/whitepaper/eng/WP2018/2018-index.html(2018)

Download references

Acknowledgements

The author thanks Mr. Yohei Nishi for his valuable comments.

Author information

Authors and Affiliations

  1. Graduate School of Science and Technology, Nara Institute of Science and Technology, 8916-5 Takayama-cho, Ikoma, Nara, 630-0192, Japan

    Masahiro Sasabe

Authors
  1. Masahiro Sasabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masahiro Sasabe.

Ethics declarations

Conflict of Interests

The author declares that he has no conflict of interest.

Additional information

Publisher’s note

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

This research was partly supported by JSPS KAKENHI (19H01103 and 19KT0045), Japan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sasabe, M. Analysis of minimum distribution time of tit-for-tat-based P2P file distribution: Linear programming based approach. Peer-to-Peer Netw. Appl. 14, 2127–2138 (2021). https://doi.org/10.1007/s12083-021-01182-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-021-01182-7

Keywords

Search

Navigation