Weitere Artikel dieser Ausgabe durch Wischen aufrufen
It is well known that the method of parallel downloading can be used to reduce file download times in a peer-to-peer (P2P) network. There has been little investigation on parallel download and chunk allocation for source peers with random service capacities. The main contribution of this paper is to address the problem of efficient parallel file download in P2P networks with random service capacities. A precise analysis of the expected download time is given when the service capacity of a source peer is a random variable. A general framework is developed for analyzing the expected download time of a parallel download and chunk allocation algorithm, and is applied to the analysis of several algorithms. Two chunk allocation algorithms for parallel download are proposed. It is observed that the performance of parallel download can be significantly improved by using the method of probing high-capacity peers. One such algorithm is proposed and its expected parallel download time is analyzed. The performance of these parallel file download algorithms in P2P networks with random service capacities are compared. The above parallel download algorithms are extended to multiple file download by dividing source peers into clusters. It is noticed that there is an important issue of optimal parallelism which minimizes the combined effect of intracluster and intercluster overhead of parallel download and load imbalance.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
http://blogplots.blogspot.com/2008/02/p2p-file-size-distribution.html. Accessed 18 July 2016.
http://en.wikipedia.org/wiki/File_sharing. Accessed 18 July 2016.
http://en.wikipedia.org/wiki/Peer-to-peer. Accessed 18 July 2016.
Adler, M., Kumar, R., Ross, K., Rubenstein, D., Suel, T., & Yao, D. D. (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).
Adler, M., Kumar, R., Ross, K., Rubenstein, D., Turner, D., & Yao, D. D. (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.
Bernstein, D. S., Feng, Z., Levine, B. N., & Zilberstein, S. (2003). Adaptive peer selection. In Proceedings of the 2nd International Workshop on Peer-to-Peer Systems.
Byers, J. W., 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).
Carter, R. L., & Crovella, M. E. (1999). On the network impact of dynamic server selection. Computer Networks, 31(23–24), 2529–2558. CrossRef
Chiu, Y.-M. (2009). On the performance of peer selection strategies in stochastic peer-to-peer networks. Ph.D. dissertation, North Carolina State University, Electrical Engineering.
Chiu, Y.-M., & Eun, D. Y. (2008). Minimizing file download time in stochastic peer-to-peer networks. IEEE/ACM Transactions on Networking, 16(2), 253–266. CrossRef
Dykes, S. G., Robbins, K. A., & Jeffery, C. L. (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).
Gaeta, R., Gribaudo, M., Manini, D., & Sereno, M. (2006). Analysis of resource transfers in peer-to-peer file sharing applications using fluid models. Performance Evaluation, 63, 149–174. CrossRef
Ge, Z., Figueiredo, D. R., 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).
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).
Guo, L., Chen, S., Xiao, Z., Tan, E., Ding, X., & Zhang, X. (2007). A performance study of BitTorrent-like peer-to-peer systems. IEEE Journal on Selected Areas in Communications, 25(1), 155–169.
Koo, S. G. M., Kannan, K., & Lee, C. S. G. (2006). On neighbor-selection strategy in hybrid peer-to-peer networks. Future Generation Computer Systems, 22, 732–741. CrossRef
Koo, S. G. M., 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).
Kumar, R., & Ross, K. W. (2006). Peer-assisted file distribution: The minimum distribution time. In Proceedings of the IEEE Workshop on Hot Topics in Web Systems and Technologies.
Li, K. (2012). Probing high-capacity peers to reduce download times in P2P file sharing systems with stochastic service capacities. International Journal of Foundations of Computer Science, 23(6), 1341–1369. CrossRef
Li, K. (2013). Parallel file download in peer-to-peer networks with random service capacities. In Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium Workshops (15th Workshop on Advances in Parallel and Distributed Computational Models), pp. 677–686, Boston, MA, May 20–24.
Li, K. (2014). On the expected file download time of the random time-based switching algorithm in P2P networks. Peer-to-Peer Networking and Applications, 7(2), 147–158. CrossRef
Li, K. (2015). Analysis of file download time in peer-to-peer networks with stochastic and time-varying service capacities. Future Generation Computer Systems, 42, 36–43. CrossRef
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).
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).
Liu, Y., Gong, W., & Shenoy, P. (2001). On the impact of concurrent downloads. In Proceedings of the 33nd Winter Simulation Conference (pp. 1300–1305).
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).
Rodriguez, P., & Biersack, E. W. (2002). Dynamic parallel access to replicated content in the internet. IEEE/ACM Transactions on Networking, 10(4), 455–465. CrossRef
Stutzbach, D., & Rejaie, R. (2006). Understanding churn in peer-to-peer networks. In Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement.
Teo, M., Carbunaru, C., Leong, B., Nataraj, Y., Vu, H. M. L., Tan, R., & Teo, Y. M. (2008). Achieving high-bandwidth peer-to-peer file distribution. In Proceedings of the 4th ACM International Conference on Emerging Networking Experiments and Technologies.
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 3462) (pp. 709–717).
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).
Zwillinger, D. (Ed.). (1996). Standard mathematical tables and formulae (30th ed.). Boca Raton, FL: CRC Press.
- Design and analysis of parallel file downloading algorithms in peer-to-peer networks
- Springer US
Neuer Inhalt/© Filograph | Getty Images | iStock