Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지
DOI QR코드

DOI QR Code

Complexity Results for the Design Problem of Content Distribution Networks

  • Choi, Byung-Cheon (Department of Business Administration, Chungnam National University) ;
  • Chung, Jibok (Department of Business Administration, Daejeon University)
  • Received : 2014.07.03
  • Accepted : 2014.08.08
  • Published : 2014.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

Content Delivery Network (CDN) has evolved to overcome a network bottleneck and improve user perceived Quality of Service (QoS). A CDN replicates contents from the origin server to replica servers to reduce the overload of the origin server. CDN providers would try to achieve an acceptable performance at the least cost including the storage space or processing power. In this paper, we introduce a new optimization model for the CDN design problem considering the user perceived QoS and single path (non-bifurcated) routing constraints and analyze the computational complexity for some special cases.

Keywords

References

  1. Ahuja, R. A., K. Mehlhorn, and J. B. Orlin, "Faster algorithm for the shortest path problem," Journal of the Association for Computing Machinery 37 (1990), 213-223. https://doi.org/10.1145/77600.77615
  2. Bektas, T., O. Oguz, and I. Ouveysi, "Designing costeffective content distribution networks," Computers and Operations Research 34 (2007), 2436-2449. https://doi.org/10.1016/j.cor.2005.09.013
  3. Cisco, "Cisco Visual Networking Index: Forecast and Methodology : 2012-2017," 2012.
  4. Garey, M. R. and D. S. Johnson, "Computers and intractability:A guide to the theory of NP-completeness," W. H. Freeman, 1979.
  5. Jamin, S., C. Jin, A. R. Kurc, D. Raz, and Y. Shavitt, "Constrained mirror placement on the internet," In Proceedings of INFOCOM (2001), 31-40.
  6. Jason, D., K. Rakes, R. Terry, and A. Agarwal, "Designing content distribution networks for optimal cost and performance," Information Technology and Management 13 (2012), 1-15. https://doi.org/10.1007/s10799-011-0107-4
  7. Kangasharju, J., J. Roberts, and K. Ross, "Object replication strategies in content distribution networks," In Proceeding of Web Caching and Content Distribution Workshop 2001.
  8. Laoutaris, N., V. Zissimopoulos, and I. Stavrakakis, "Joint object placement and node dimensioning for internet content distribution," Information Processing Letters 89 (2004), 273-279. https://doi.org/10.1016/j.ipl.2003.12.002
  9. Minlan, Y., J. Wenjie, L. Haoyuan, and S. Ion, "Tradeoff in CDN designs for throughput oriented traffic," In Proceedings of CoNEXT12 (2012), 10-13.
  10. Nguyen, T., C. Chou, and P. Boustead, "Provisioning content distribution networks over shared infrastructure," In Proceedings of 11th IEEE International Conference on Networks 28 (2003), 119-124.
  11. Pallis, G. and A. Vakali, "Insight and perspectives for content delivery networks," Communications of the Association for Computing Machinery 49 (2006), 101-106.
  12. Venkataramani, A., M. Dahlin, and P. Weidmann, "Bandwidth constrained placement in a WAN," ACM Principles of Distributed Computing 2001.
  13. Xu, J., B. Li, and D. L. Lee, "Placement problems for transparent data replication proxy services," IEEE J. of Selected Areas Communication 20 (2002), 1383-1398. https://doi.org/10.1109/JSAC.2002.802068
  14. Walkowiak, K., "An exact algorithm for design of content delivery networks in MPLS environment," Journal of telecommunications and information technology 2 (2004), 13-22.