TY - GEN
T1 - Optimal dynamic replica placement in content delivery networks
AU - Bartolini, Novella
AU - Lo Presti, Francesco
AU - Petrioli, Chiara
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2003
Y1 - 2003
N2 - Content Delivery Networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a Semi Markov Decision Process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.
AB - Content Delivery Networks (CDN) design entails the placement of server replicas to bring the content close to the users, together with an efficient and content aware request routing. In this paper we address the problem of dynamic replica placement to account for users demand variability while optimizing the costs paid by a CDN provider and the overall performance of the distributed replica servers architecture. We formulate the dynamic replica placement problem as a Semi Markov Decision Process accounting for the traffic conditions, the users level of satisfaction, as well as the costs paid to install, maintain or remove a replica from a site. The proposed model applies to general network topologies and considers realistic constraints on network and servers capacity. The optimal strategy derived by means of the decision model provides the ground for designing a centralized heuristic and is used as a benchmark for the heuristic evaluation. Simulation results show that the proposed heuristic has a behavior close to that of the optimal strategy and achieves very good performance in terms of low average distance from a user to the serving replica, low average number of replicas and high probability of being able to serve a request.
UR - http://www.scopus.com/inward/record.url?scp=84890884334&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84890884334&partnerID=8YFLogxK
U2 - 10.1109/icon.2003.1266178
DO - 10.1109/icon.2003.1266178
M3 - Conference contribution
AN - SCOPUS:84890884334
SN - 0780377885
SN - 9780780377882
T3 - IEEE International Conference on Networks, ICON
SP - 125
EP - 130
BT - ICON 2003 - 11th IEEE International Conference on Networks
PB - IEEE Computer Society
T2 - 11th IEEE International Conference on Networks, ICON 2003
Y2 - 28 September 2003 through 1 October 2003
ER -