Skip to main content
SpringerLink
Log in

A new hybrid heuristic for replica placement and request distribution in content distribution networks

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

In Content Distribution Networks (CDN), in order to better serve clients, it is necessary to replicate contents at surrogate servers and distribute requests using such servers. The decisions of where to place replicated contents and how to distribute clients can be modeled as an optimization problem known as Replica Placement and Request Distribution Problem (RPRDP). In this paper we use a model that regards several realistic details that are not treated simultaneously in the literature, such as: constraints in server disk space and bandwidth, QoS requirements of requests and changes in the network conditions. Also, a new hybrid method, that uses exact and heuristic concepts simultaneously, is presented to solve the RPRDP. We compared the results obtained by the proposed algorithm with: a bound obtained by an exact offline approach, a solution of a real CDN provider and other hybrid heuristics. Results show that the proposed method outperforms the solution used in real CDNs and also in all other studied methods.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Kurose, J., Ross, K.: Computer Networking: a Top-Down Approach Featuring the Internet. Addison-Wesley, Boston (2003)

  2. Aioffi, W., Mateus, G., Almeida, J., Loureiro, A.: Dynamic content distribution for mobile enterprise networks. IEEE J. Sel. Areas Commun. 23(10), 2022–2031 (2005)

    Article  Google Scholar 

  3. Almeida, J.M., Eager, D.L., Vernon, M.K., Wright, S.J.: Minimizing delivery cost in scalable streamingcontent distribution systems. IEEE Trans. Multimed. 6, 356–365 (2004)

    Article  Google Scholar 

  4. Bartolini, N., Presti, F., Petrioli, C.: Optimal dynamic replica placement in content delivery networks. In: The 11th IEEE International Conference on Networks 2003, ICON 2003, pp. 125–130 (2003)

  5. Sharma, A., Venkataramani, A., Sitaraman, R.K.: Distributing content simplifies ISP traffic engineering. In: Proceedings of the ACM SIGMETRICS/International Conference on Measurement and Modeling of Computer Systems, pp. 229–242 (2013)

  6. Tenzakhti, F., Day, K., Ould-Khaoua, M.: Replication algorithms for the world-wide web. J. Syst. Archit. 50, 591–605 (2004)

    Article  Google Scholar 

  7. Wauters, T., Coppens, J., Dhoedt, B., Demeester, P.: Load balancing through efficient distributed content placement. In: Next Generation Internet Networks, pp. 99–105 (2005)

  8. Bektas, T., Oguz, O., Ouveysi, I.: Designing cost-effective content distribution networks. Comput. Oper. Res. 34, 2436–2449 (2007)

    Article  MATH  Google Scholar 

  9. Huang, C., Abdelzaher, T.: Towards content distribution networks with latency guarantees. In: 12th IEEE International Workshop on Quality of Service, 2004. IWQOS 2004, pp. 181–192 (2004)

  10. Zhou, X., Xu, C.Z.: Efficient algorithms of video replication and placement on a cluster of streaming servers. J Netw. Comput. Appl. 30, 515–540 (2007)

    Article  Google Scholar 

  11. Neves, T., Drummond, L., Ochi, L., Albuquerque, C., Uchoa, E.: Solving replica placement and request distribution in content distribution networks. Electron. Notes Discrete Math. 36, 89–96 (2010). doi:10.1016/j.endm.2010.05.012

    Article  Google Scholar 

  12. Wu, L.Y., Zhang, X.S., Zhang, J.L.: Capacitated facility location problem with general setup cost. Comput. Oper. Res. 33, 1226–1241 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Martello, S., Toth, P.: Knapsack Problems. Wiley, New York (1990)

  14. Tang, X., Xu, J.: On replica placement for QoS-aware content distribution. IEEE INFOCOM 2004, 806–815 (2004)

    Google Scholar 

  15. Morettin, P.A., de Castro Toloi, C.M.: Modelos para Previsão de Séries Temporais, vol. 1. Instituto de Matemática Pura e Aplicada (1981)

  16. Ahuja, R.K., Magnanti, T.L., Orlin, J.: Network Flows: Theory, Algorithms, and Applications, 1 edn. Prentice Hall, Englewood Cliffs, NJ (1993)

  17. ILOG S.A.: CPLEX 11 User’s Manual (2008)

  18. LABIC: World Wide Web. http://labic.ic.uff.br/ (2005). Accessed 15 Feb 2012

  19. Neves, T.: Synthetic instances for a management problem in content distribution networks. In: Technical report, UFF (2011) http://labic.ic.uff.br/ (url world wide web) (2011). Accessed 15 Feb 2012

Download references

Acknowledgments

The authors thank the support of CNPq, CAPES and FAPERJ.

Author information

Authors and Affiliations

  1. Escola de Engenharia Industrial e Metalúrgica de Volta Redonda, Universidade Federal Fluminense, Av. dos Trabalhadores 420, Volta Redonda, RJ, Brazil

    Tiago Neves

  2. Instituto de Computação, Universidade Federal Fluminense, Rua Passo da Pátria 156, Niterói, RJ, Brazil

    Luiz Satoru Ochi & Célio Albuquerque

Authors
  1. Tiago Neves
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luiz Satoru Ochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Célio Albuquerque
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tiago Neves.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Neves, T., Ochi, L.S. & Albuquerque, C. A new hybrid heuristic for replica placement and request distribution in content distribution networks. Optim Lett 9, 677–692 (2015). https://doi.org/10.1007/s11590-014-0770-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-014-0770-6

Keywords

Search

Navigation