DOI QR코드

DOI QR Code

Distributing Network Loads in Tree-based Content Distribution System

  • Han, Seung Chul (Department of Computer Engineering, Myongji University) ;
  • Chung, Sungwook (Department of Computer Engineering, Changwon National University) ;
  • Lee, Kwang-Sik (Department of Computer Engineering, Myongji University) ;
  • Park, Hyunmin (Department of Computer Engineering, Myongji University) ;
  • Shin, Minho (Department of Computer Engineering, Myongji University)
  • Received : 2012.09.02
  • Accepted : 2012.01.03
  • Published : 2013.01.31

Abstract

Content distribution to a large number of concurrent clients stresses both server and network. While the server limitation can be circumvented by deploying server clusters, the network limitation is far less easy to cope with, due to the difficulty in measuring and balancing network load. In this paper, we use two useful network load metrics, the worst link stress (WLS) and the degree of interference (DOI), and formulate the problem as partitioning the clients into disjoint subsets subject to the server capacity constraint so that the WLS and the DOI are reduced for each session and also well balanced across the sessions. We present a network load-aware partition algorithm, which is practicable and effective in achieving the design goals. Through experiments on PlanetLab, we show that the proposed scheme has the remarkable advantages over existing schemes in reducing and balancing the network load. We expect the algorithm and performance metrics can be easily applied to various Internet applications, such as media streaming, multicast group member selection.

Keywords

References

  1. S. C. Han and Y. Xia, "Optimal node selection algorithm for parallel download in overlay content," Computer Networks, vol. 53, pp. 1480-1496, 2009. https://doi.org/10.1016/j.comnet.2009.01.011
  2. S. C. Han and Y. Xia, "Constructing an optimal server set in structured peer-to-peer network," IEEE JSAC, vol. 25, pp. 170-178, 2007.
  3. "PlanetLab," [Online]. Available: http://www.planet-lab.org.
  4. "Akamai," [Online]. Available: http://www.akamai.com.
  5. E. Nygren, R. K. Sitaraman and J. Sun, "The Akamai Network: A platform for high-performance Internet applications," ACM SIGOPS Operating Systems Review, vol. 44, 2010.
  6. C. X. Zheng and Y. Xia, "Optimal swarming for massive content distribution," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 6, 2010.
  7. Y. Xia, S. Chen, C. Cho and V. Korgaonkar, "Algorithms and performance of load balancing with multiple hash functions in massive content distribution," Computer Networks, vol. 53, 2009.
  8. "BitTorrent," [Online]. Available: http://www.bittorrent.com.
  9. J. Pouwelse, P. Garbacki, D. Epema and H. Sips, "The BitTorrent P2P file-sharing system: Measurements and analysis," Peer-to-Peer Systems IV, vol. 3640, 2005.
  10. "PPStream," [Online]. Available: http://www.ppstream.com.
  11. J. Jia, C. Li and C. Chens, "Characterizing PPStream across Internet," in NPC Workhops, 2007.
  12. L. Cherkasova and J. Lee, "FastReplica: Efficient large file distribution within content delivery networks," in USITS, 2003.
  13. J. Lee and G. Veciana, "On application-level load balancing in FastReplica," Computer Communications, vol. 30, 2007.
  14. K. Park and V. S. Pai, "Scale and performance in the CoBlitz largefile distribution service," in USENIX/ACM NSDI, 2006.
  15. B. Chun, P. Wu, H. Weatherspoon and J. Kubiatowicz, "ChunkCast: An anycast service for large content distribution," in USENIX IPTPS, 2006.
  16. D. Kosti, A. Rodriguez, J. Albrecht and A. Vahdat, "Bullet: high bandwidth data dissemination using an overlay mesh," in SOSP, 2003.
  17. D. Kostic, A. Rodriguez, J. Albrecht and A. Vahdat, "Bullet: high bandwidth data dissemination using an overlay mesh," ACM SIGOPS Operating Systems Review, vol. 37, 2003.
  18. M. Castro, M. Jones, H. Wang and A. Wolman, "An evaluation of scalable application-level multicast built using peer-to-peer overlays," in INFOCOM, 2003.
  19. S. Ratnasamy, M. Handley, R. M. Karp and S. Shenker, "Application-level multicast using content-addressable networks," Networked Group Communications, vol. 2233, 2001.
  20. Y. Chu, "A case for end system multicast," IEEE JSAC, vol. 20, 2002.
  21. S. C. Han and Y. Xia, "Network load-aware content distribution in overlay networks," Computer Communications, vol. 32, 2009.
  22. N. Knight, H. X. Nguyen and M. Roughan, "The Internet Topology Zoo," IEEE JSAC, vol. 29, Oct 2011.
  23. N. Duffield and F. Presti, "Network tomography from measured end-to-end delay covariance," IEEE Transactions on Networking, vol. 12, 2004.
  24. I. Bazzi, D. Katabi and X. Yang, "A passive approach for detecting shared bottlenecks," in ICCCN, 2002.
  25. F. Chang, B. Yao, R. Viswanathan and D. Waddington, "Topology inference in the presence of anonymous routers," in INFOCOM, 2003.
  26. R. Castro, M. Coates and R. Nowak, "Maximum likelihood network topology identification from edge-based unicast measurements," in SIGMETRICS, 2002.
  27. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, 1995.

Cited by

  1. Design and Implementation of Streaming Media Server Cluster Based on FFMpeg vol.2015, pp.None, 2013, https://doi.org/10.1155/2015/963083