Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Extended Equal Service and Differentiated Service Models for Peer-to-Peer File Sharing

  • Zhang, Jianwei (College of Computer Science and Technology, Zhejiang University) ;
  • Wang, Yongchao (Library and Information Center, Zhejiang University) ;
  • Xing, Wei (College of Computer Science and Technology, Zhejiang University) ;
  • Lu, Dongming (College of Computer Science and Technology, Zhejiang University)
  • Received : 2012.03.29
  • Accepted : 2012.11.23
  • Published : 2013.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

Peer-to-peer (P2P) systems have proved the most effective and popular file sharing applications in recent years. Previous studies mainly focused on equal service and differentiated service strategies when peers have no initial data before their downloads. For an upload-constrained P2P file sharing system, we model both the equal service process and the differentiated service process when the initial data distribution of peers satisfies some special conditions. Moreover, we show how to minimize the time required to distribute the file to any number of peers. The proposed fluid-based models can reveal the intrinsic relations among the initial data amount, the peer set size, and the minimum last finish time. The closed-form expressions derived from the extended models can closely approximate chunk-based models and systems, especially for relatively large files. As an application of the extended models, we show how to provide differentiated service efficiently to multiple peer sets. Since no limits are imposed on the upload bandwidth of peers or the size of each peer set, we believe that our analytic process and the results achieved can provide not only fundamental insights into bandwidth allocation and data scheduling but also a helpful reference for both improving system performance and building an effective incentive mechanism for P2P file sharing systems.

Keywords

References

  1. B. Cohen, "Incentives build robustness in BitTorrent," in Proc. Workshop Economics Peer-to-Peer Systems, Berkeley, CA, USA, June 2003.
  2. W. C. Liao, F. Papadopoulos, and K. Psounis, "Performance analysis of BitTorrent-like systems with heterogeneous users," Performance Evaluation, vol. 64, no. 9-12, pp. 876-891, Oct. 2007. https://doi.org/10.1016/j.peva.2007.06.008
  3. L. Mekouar, Y. Iraqi, and R. Boutaba, "A contribution-based service differentiation scheme for peer-to-peer systems," Peer-to-Peer Networking Appli., vol. 2, no. 2, pp. 146-163, June 2009. https://doi.org/10.1007/s12083-008-0026-2
  4. J. L. Chiang, Y. Y. Tseng, and W. T. Chen, "Interest-intended piece selection in BitTorrent-like peer-to-peer file sharing systems," J. Parallel Distributed Computing, vol. 71, no. 6, pp. 879-888, June 2011. https://doi.org/10.1016/j.jpdc.2010.12.011
  5. X. Y. Yang and G. de Veciana, "Performance of peer-to-peer networks: Service capacity and role of resource sharing policies," Performance Evaluation, vol. 63, no. 3, pp. 175-194, Mar. 2006. https://doi.org/10.1016/j.peva.2005.01.005
  6. X. Y. Yang and G. de Veciana, "Service capacity of peer to peer networks," in Proc. IEEE INFOCOM, Hong Kong, China, Mar. 2004, pp. 2242-2252.
  7. D. Y. Qiu and R. Srikant, "Modeling and performance analysis of BitTorrent-like peer-to-peer networks," Comput. Commun. Rev., vol. 34, no. 4, pp. 367-377, Oct. 2004. https://doi.org/10.1145/1030194.1015508
  8. F. Clevenot-Perronnin, P. Nain, and K.W. Ross, "Multiclass P2P networks: Static resource allocation for service differentiation and bandwidth diversity," Performance Evaluation, vol. 62, no. 1-4, pp. 32-49, Oct. 2005. https://doi.org/10.1016/j.peva.2005.07.017
  9. E.W. Biersack, P. Rodriguez, and P. Felber, "Performance analysis of peerto- peer networks for file distribution," in Proc. QOFIS, Barcelona, Spain, Sept. 2004, pp. 1-10.
  10. F. Esposito, I. Matta, D. Bera, and P. Michiardi, "On the impact of seed scheduling in peer-to-peer networks," Comput. Netw., vol. 55, no. 15, pp. 3303-3317, Oct. 2011. https://doi.org/10.1016/j.comnet.2011.06.020
  11. G. Wu and T. C. Chiueh, "How efficient is BitTorrent?," in Proc. SPIE Multimedia Comput. Netw. Conf., San Jose, CA, US, Jan. 2006, pp. 710- 710.
  12. J. Mundinger, R. Weber, and G. Weiss, "Optimal scheduling of peer-topeer file dissemination," J. Scheduling, vol. 11, no. 2, pp. 1094-6136, Apr. 2008.
  13. J. Mundinger, R. Weber, and G. Weiss, "Analysis of peer-to-peer file dissemination," Performance Evaluation Rev., vol. 34, no. 3, pp. 12-14, Dec. 2006. https://doi.org/10.1145/1215956.1215963
  14. R. Kumar and K. W. Ross, "Optimal peer-assisted file distribution: single and multi-class problems," in Proc. HOTWEB, Boston, MA, US, Nov. 2006, pp. 20-30.
  15. M. Mehyar, W. Gu, S. H. Low, M. Effros, and T. Ho, "Optimal strategies for efficient peer-to-peer file sharing," in Proc. ICASSP, Honolulu, HI, USA, Apr. 2007, pp. 1337-1340.
  16. B. Fan, J. C. Lui, and D. Chiu, "The design trade-offs of BitTorrent-like file sharing protocols," IEEE/ACM Trans. Netw., vol. 17, no. 2, pp. 365- 376, Apr. 2009. https://doi.org/10.1109/TNET.2008.2002553
  17. S. K. Jonathan, O. K. Victor, and L. King-Shan, "Performance comparison of scheduling algorithms for peer-to-peer collaborative file distribution," IEEE J. Sel. Areas Commun., vol. 25, no. 1, pp. 146-154, Jan. 2007. https://doi.org/10.1109/JSAC.2007.070115
  18. G. M. Ezovski, A. Tang, and L. L. Andrew, "Minimizing average finish time in P2P networks," in Proc. IEEE INFOCOM, Rio de Janeiro, Brazil, Apr. 2009, pp. 594-602.
  19. C. H.Wen and R. C. Lin, "Towards minimizing average finish time of P2P file delivery under peer leaving," in Proc. 3PGCIC, Fukuoka, Japan, Nov. 2010, pp. 55-62.
  20. Y. Liu, "Delay bounds of chunk-based peer-to-peer video streaming," IEEE/ACM Trans. Netw., vol. 18, no. 4, pp. 1195-1206, Aug. 2010. https://doi.org/10.1109/TNET.2009.2038155
  21. S. Liu, R. Zhang-Shen, W. Jiang, J. Rexford, and M. Chiang, "Performance bounds for peer-assisted live streaming," Performance Evaluation Rev., vol. 36, no. 1, pp. 313-324, June 2008. https://doi.org/10.1145/1384529.1375493
  22. S. Sengupta, S. Liu, M. Chen, M. Chiang, J. Li, and P. A. Chou, "Peer-topeer streaming capacity," IEEE Trans. Inf. Theory, vol. 57, no. 8, pp. 5072- 5087, Aug. 2011. https://doi.org/10.1109/TIT.2011.2145630
  23. BitSim. (2007). [Online]. Available: http://planete.inria.fr/software/BitSim/
  24. R. Kumar, L. Yong, and K. Ross, "Stochastic fluid theory for P2P streaming systems," in Proc. IEEE INFOCOM, Anchorage, AK, USA, May 2007, pp. 919-927.
  25. D. Stutzbach and R. Rejaie, "Understanding churn in peer-to-peer networks," in Proc. ACM IMC, Rio de Janeiro, Brazil, Oct. 2006, pp. 189- 202.
  26. D. Leonard, Z. Yao, V. Rai, and D. Loguinov, "On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks," in IEEE/ACM Trans. Netw., vol. 15, no. 3, pp. 644-656, Oct. 2007. https://doi.org/10.1109/TNET.2007.893199
  27. Z. Yao, D. Leonard, X.Wang, and D. Loguinov, "Modeling heterogeneous user churn and local resilience of unstructured P2P networks," in Proc. IEEE ICNP, Santa Barbara, CA, USA, Nov. 2006, pp. 32-41.