Skip to main content
SpringerLink
Log in
Book cover

Content Delivery Networks pp 225–250Cite as

Mathematical Models for Resource Management and Allocation in CDNs

  • Chapter

Part of the book series: Lecture Notes Electrical Engineering ((LNEE,volume 9))

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Almeida, J., Eager, D., Vernon, M., Wright, S.: Minimizing delivery cost in scalable streaming content distribution systems. IEEE Transactions on Multimedia 6, 356–365 (2004)

    Article  Google Scholar 

  2. Avella, P., Sassano, A., Vasil’ev, I.: Computational study of large-scale p-median problems. Mathematical Programming 109, 89–114 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Backx, P., Lambrecht, T., Dhoedt, B., DeTurck, F., Demeester, P.: Optimizing content distribution through adaptive distributed caching. Computer Communications 28, 640–653 (2005)

    Article  Google Scholar 

  4. Baev, I., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 661–670 (2001)

    Google Scholar 

  5. Bassali, H., Kamath, K., Hosamani, R., Gao, L.: Hierarchy-aware algorithms for CDN proxy placement in the Internet. Computer Communications 26, 251–263 (2003)

    Article  Google Scholar 

  6. Bektaş, T.: Discrete location models for content distribution. Unpublished PhD Dissertation, Bilkent University, Ankara, Turkey (2005)

    Google Scholar 

  7. Bektaş, T., Cordeau, J.F., Erkut, E., Laporte, G.: A two-level simulated annealing algorithm for efficient dissemination of electronic content. Journal of the Operational Research Society 35, 3860–3884 (2008)

    MATH  Google Scholar 

  8. Bektaş, T., Cordeau, J.F., Erkut, E., Laporte, G.: Exact algorithms for the joint object placement and request routing problem in content distribution networks. Computers & Operations Research (2008). In press

    Google Scholar 

  9. Bektaş, T., Oğuz, O., Ouveysi, I.: Designing cost-effective content distribution networks. Computers & Operations Research 34, 2436–2449 (2007)

    Google Scholar 

  10. Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  11. Berman, O., Krass, D.: An improved IP formulation for the uncapacitated facility location problem: Capitalizing on objective function structure. Annals of Operations Research 136, 21–34 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  12. Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: evidence and implications. In: Proceedings of IEEE INFOCOM’99, Vol. 1, pp. 126–134. New York (1999)

    Google Scholar 

  13. Cidon, I., Kutten, S., Soffer, R.: Optimal allocation of electronic content. Computer Networks 40, 205–218 (2002)

    Article  Google Scholar 

  14. Datta, A., Dutta, K., Thomas, H., VanderMeer, D.: World Wide Wait: a study of Internet scalability and cache-based approaches to alleviate it. Management Science 49, 1425–1444 (2003)

    Article  Google Scholar 

  15. Dubuc, G., Bektaş, T., Cordeau, J.F., Laporte, G.: Une heuristique de recherche avec tabous pour la conception de réseaux de distribution de contenu électronique INFOR 45, 175–185 (2007)

    Google Scholar 

  16. Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: On the placement of Internet instrumentation. In: Proceedings of IEEE INFOCOM’00, pp. 295–304 (2000)

    Google Scholar 

  17. Jia, X., Li, D., Hu, X., Wu, W., Du, D.: Placement of web-server proxies with consideration of read and update operations on the Internet. The Computer Journal 46(4), 378–390 (2003)

    Article  MATH  Google Scholar 

  18. Kangasharju, J., Roberts, J., Ross, K.: Object replication strategies in content distribution networks. Computer Communications 25, 376–383 (2002)

    Article  Google Scholar 

  19. Krishnan, P., Raz, D., Shavitt, Y.: The cache location problem. IEEE/ACM Transactions on Networking 8, 568–582 (2000)

    Article  Google Scholar 

  20. Laoutaris, N., Zissimopoulos, V., Stavrakakis, I.: Joint object placement and node dimensioning for Internet content distribution. Information Processing Letters 89, 273–279 (2004)

    Article  MathSciNet  Google Scholar 

  21. Laoutaris, N., Zissimopoulos, V., Stavrakakis, I.: On the optimization of storage capacity allocation for content distribution. Computer Networks 47, 409–428 (2005)

    Article  Google Scholar 

  22. Li, B., Golin, M., Italiano, G., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the Internet. In: Proceedings of IEEE INFOCOM’99, Vol. 3, pp. 1282–1290. New York (1999)

    Google Scholar 

  23. Nguyen, T., Safaei, F., Boustead, P., Chou, C.: Provisioning overlay distribution networks. Computer Networks 49, 103–118 (2005)

    Article  MATH  Google Scholar 

  24. Oliveira, C., Pardalos, P.: A survey of combinatorial optimization problems in multicast routing. Computers & Operations Research 32, 1953–1981 (2005)

    Article  MATH  Google Scholar 

  25. Ouveysi, I., Wirth, A., Yeh, A., Oguz, O.: Large scale linear programs and heuristics for the design of survivable telecommunication networks. Annals of Operations Research 124, 285–293 (2003)

    Google Scholar 

  26. Qiu, L., Padmanabhan, V., Voelker, G.: On the placement of web server replicas. In: Proceedings of IEEE INFOCOM’01, Vol. 3, pp. 1587–1596 (2001)

    Google Scholar 

  27. Radoslavov, P., Govindan, R., Estrin, D.: Topology informed Internet replica placement. Computer Communications 25, 384–392 (2002)

    Article  Google Scholar 

  28. Wauters, T., Coppens, J., De Turck, F., Dhoedt, B., Demeester, P.: Replica placement in ring based content delivery networks. Computer Communications 29, 3313–3326 (2006)

    Article  Google Scholar 

  29. Xu, J., Li, B., Lee, D.: Placement problems for transparent data replication proxy services. IEEE Journal on Selected Areas in Communications 20, 1383–1398 (2002)

    Article  Google Scholar 

  30. Xuanping, Z., Weidong, W., Xiaopeng, T., Yonghu, Z.: Data Replication at Web Proxies in Content Distribution Network, Lecture Notes in Computer Science, Vol. 2642, pp. 560–569. Springer-Verlag, Xian (2003)

    Google Scholar 

  31. Yang, M., Fei, Z.: A model for replica placement in content distribution networks for multimedia applications. In: Proceedings of IEEE International Conference on Communications (ICC ’03), Vol. 1, pp. 557 –561 (2003)

    Google Scholar 

  32. Zipf, G.: Human Behavior and the Principle of Least-Effort. Addison-Wesley, Cambridge, MA (1949)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Management, University of Southampton, Highfield, Southampton SO17 1BJ, UK

    Tolga Bektaş

  2. Honorary research fellow, Electrical and Electronic Engineering Department, The University of Melbourne, Australia

    Iradj Ouveysi

Authors
  1. Tolga Bektaş
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Iradj Ouveysi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. Computer Science&Software Engineering, University of Melbourne, 111 Barry Street, Carlton VIC 3053, Australia

    Rajkumar Buyya

  2. Dept. Computer Science & Software Engineering, University of Melbourne, 111 Barry Street, Carlton VIC 3053, Australia

    Mukaddim Pathan

  3. Dept. Informatics, Aristotle University of Thessaloniki, 541 24 Thessaloniki, Greece

    Athena Vakali

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bektaş, T., Ouveysi, I. (2008). Mathematical Models for Resource Management and Allocation in CDNs. In: Buyya, R., Pathan, M., Vakali, A. (eds) Content Delivery Networks. Lecture Notes Electrical Engineering, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77887-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-77887-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-77886-8

  • Online ISBN: 978-3-540-77887-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation