Skip to main content
SpringerLink
Log in

On the expected file download time of the random time-based switching algorithm in P2P networks

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

Abstract

The expected file download time of the random time-based switching algorithm for peer selection and file downloading in a peer-to-peer (P2P) network is still unknown. The main contribution of this paper is to analyze the expected file download time of the time-based switching algorithm for file sharing in P2P networks when the service capacity of a source peer is totally correlated over time, namely, the service capacities of a source peer in different time slots are a fixed value. A recurrence relation is developed to characterize the expected file download time of the time-based switching algorithm. It is proved that for two or more heterogeneous source peers and sufficiently large file size, the expected file download time of the time-based switching algorithm is less than and can be arbitrarily less than the expected download time of the chunk-based switching algorithm and the expected download time of the permanent connection algorithm. It is shown that the expected file download time of the time-based switching algorithm is in the range of the file size divided by the harmonic mean of service capacities and the file size divided by the arithmetic mean of service capacities. Numerical examples and data are presented to demonstrate our analytical results.

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

Similar content being viewed by others

References

  1. http://blogplots.blogspot.com/2008/02/p2p-file-size-distribution.html. Accessed 17 Dec 2012

  2. http://en.wikipedia.org/wiki/File_sharing. Accessed 17 Dec 2012

  3. http://en.wikipedia.org/wiki/Peer-to-peer. Accessed 17 Dec 2012

  4. Adler M, Kumar R, Ross K, Rubenstein D, Suel T, Yao DD (2005) Optimal peer selection for P2P downloading and streaming. In: Proceedings of the 24th annual joint conference of the IEEE computer and communications societies, vol 3, pp 1538–1549

  5. Adler M, Kumar R, Ross K, Rubenstein D, Turner D, Yao DD (2004) Optimal peer selection in a free-market peer-resource economy. In: Proceedings of the 2nd workshop on the economics of peer-to-peer systems

  6. Bernstein DS, Feng Z, Levine BN, Zilberstein S (2003) Adaptive peer selection. In: Proceedings of the 2nd international workshop on peer-to-peer systems

  7. Byers JW, Luby M, Mitzenmacher M (1999) Accessing multiple mirror sites in parallel: using Tornado codes to speed up downloads. In: Proceedings of the 18th annual joint conference of the IEEE computer and communications societies, vol 1, pp 275–283

  8. Carter RL, Crovella ME (1999) On the network impact of dynamic server selection. Comput Networks 31(23–24):2529–2558

    Article  Google Scholar 

  9. Chiu Y-M, Eun DY (2008) Minimizing file download time in stochastic peer-to-peer networks. IEEE/ACM Trans Netw 16(2):253–266

    Article  Google Scholar 

  10. Dykes SG, Robbins KA, Jeffery CL (2000) An empirical evaluation of client-side server selection algorithms. In: Proceedings of the 19th annual joint conference of the IEEE computer and communications societies, vol 3, pp 1361–1370

  11. 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:149–174

    Article  Google Scholar 

  12. Ge Z, Figueiredo DR, Jaiswal S, Kurose J, Towsley D (2003) Modeling peer-peer file sharing systems. In: Proceedings of the 22nd annual joint conference of the IEEE computer and communications societies, vol 3, pp 2188–2198

  13. Gkantsidis C, Ammar M, Zegura E (2003) On the effect of large-scale deployment of parallel downloading. In: Proceedings of the 3rd IEEE workshop on internet applications, pp 79–89

  14. Koo SGM, Kannan K, Lee CSG (2006) On neighbor-selection strategy in hybrid peer-to-peer networks. Future Gener Comput Syst 22:732–741

    Article  Google Scholar 

  15. Koo SGM, Rosenberg C, Xu D (2003) Analysis of parallel downloading for large file distribution. In: Proceedings of the 9th IEEE workshop on future trends of distributed computing systems, pp 128–135

  16. Kumar R, Ross KW (2006) Peer-assisted file distribution: the minimum distribution time. In: Proceedings of the IEEE workshop on hot topics in web systems and technologies

  17. Li K (2010) Analysis of random time-based switching for file sharing in peer-to-peer networks. In: Proceedings of the 24th IEEE international parallel and distributed processing symposium workshops (7th international workshop on hot topics in peer-to-peer systems)

  18. Li K (2011) Reducing download times in peer-to-peer file sharing systems with stochastic service capacities. In: Proceedings of the 25th IEEE international parallel and distributed processing symposium workshops (13th workshop on advances in parallel and distributed computational models), pp 603–612

  19. Liu Y, Gong W, Shenoy P (2001) On the impact of concurrent downloads. In: Proceedings of the 33nd winter simulation conference, pp 1300–1305

  20. Lingjun M, Lui K-S (2008) Scheduling in P2P file distribution—on reducing the average distribution time. In: Proceedings of the 5th IEEE consumer communications and networking conference, pp 521–522

  21. Lingjun M, Xiaolei W, Lui K-S (2008) A novel peer grouping scheme for P2P file distribution networks. In: Proceedings of the IEEE international conference on communications, pp 5598– 5602

  22. Manini D, Gribaudo M (2006) Modelling search, availability, and parallel download in P2P file sharing applications with fluid model. In: Proceedings of 14th international conference on advanced computing and communications, pp 449–454

  23. Rodriguez P, Biersack EW (2002) Dynamic parallel access to replicated content in the internet. IEEE/ACM Trans Netw 10(4):455–465

    Article  Google Scholar 

  24. Stutzbach D, Rejaie R (2006) Understanding churn in peer-to-peer networks. In: Proceedings of the 6th ACM SIGCOMM conference on internet measurement

  25. Teo M, Carbunaru C, Leong B, Nataraj Y, Vu HML, Tan R, Teo YM (2008) Achieving high-bandwidth peer-to-peer file distribution. In: Proceedings of the 4th ACM international conference on emerging networking experiments and technologies

  26. Tewari S, Kleinrock L (2005) On fairness, optimal download performance and proportional replication in peer-to-peer networks. In: Proceedings of the 4th international IFIP-TC6 networking conference (LNCS), vol 3462, pp 709–717

  27. Zheng X, Cho C, Xia Y (2008) Optimal peer-to-peer technique for massive content distribution. in: Proceedings of the 27th IEEE conference on computer communications, pp 151–155

Download references

Acknowledgments

The criticism and comments from three reviewers are greatly appreciated.

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York, New Paltz, NY, 12561, USA

    Keqin Li

Authors
  1. Keqin Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Keqin Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, K. On the expected file download time of the random time-based switching algorithm in P2P networks. Peer-to-Peer Netw. Appl. 7, 147–158 (2014). https://doi.org/10.1007/s12083-012-0188-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-012-0188-9

Keywords

Search

Navigation