Abstract
A Content Distribution Network includes dedicated servers creating an architecture that moves the content to servers that are closer to the user, reducing delays and traffic. In this structure several problems are studied, including the Problem of Allocation of Storage Capacity (SCAP) and the Replica Placement and Request Distribution Problem (RPRDP). This work analyzes these problems in an integrated way and proposes the creation of a new problem named Capacities, Replicas and Requests Distribution Problem (CRRDP), which enables the dynamic allocation of disk space on the servers and distribution of replicas and requests. The main contributions of this work are the creation of a new problem and a new formulation which associates variables and restrictions presents in mathematical formulations for this problems. The Mathematical formulation was analyzed and computational results shows that operational costs can be reduced and that it is possible to disable unused servers over the network.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Neves, T., Ochi, L., Albuquerque, C.: A new hibrid heuristic dor replica placement and request distribution in content distribution networks. Optim. Lett. 9(4) (2015)
Uderman, F., Neves, T., Albuquerque, C.: Optimizing server storage capacity on content distribution networks. In: Anais do Simpósio Brasileiro de Redes de Computadores - SBRC2011 (2011)
Tang, X., Xu, J.: On replica placement for QOS-aware content distribution. In: Proceedings of Infocon 2004, pp. 806–815 (2004)
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)
Li, W.E.A.: Analysis and Performance Study for Coordinated Hierarchical Cache Placement Strategies, 1st edn. Elsevier (2010)
Hu, H., Wen, Y.: Joint content replication and request routing for social video distribution over cloud CDN: a community clustering method. IEEE Trans. Circuits Syst. Video Technol. 26(7), 1320–1333 (2016)
Gerhardt, R., Neves, T., Albuquerque, C.: Análise de redundância em uma formulação matemática para o problema de posicionamento de réplicas e distribuição de requisições em redes de distribuição de conteúdos. SBPO - Simpósio Brasileiro de Pesquisa Operacional 8 (Agosto 2015)
IBM ILOG CPLEX Optimization Studio (COS): ILOG S.A., CPLEX 10 user’s manual (2006)
Neves, T.: Synthetic instances for a management problem in content distribution networks. Technical report, UFF. http://labic.ic.uff.br/ (url world wide web (2011) 02/2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Gerhardt, R., Neves, T., Rangel, L. (2018). Jointly Optimizing Replica Placement, Requests Distribution and Server Storage Capacity on Content Distribution Networks. In: Lee, J., Rinaldi, G., Mahjoub, A. (eds) Combinatorial Optimization. ISCO 2018. Lecture Notes in Computer Science(), vol 10856. Springer, Cham. https://doi.org/10.1007/978-3-319-96151-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-96151-4_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96150-7
Online ISBN: 978-3-319-96151-4
eBook Packages: Computer ScienceComputer Science (R0)