Dynamic Content Allocation for Cloud-assisted Service of Periodic Workloads
2014 (English)In: INFOCOM 2014, IEEE , 2014, 853-861 p.Conference paper (Refereed)
Motivated by improved models for content workload prediction, in this paper we consider the problem of dynamic content allocation for a hybrid content delivery system that combines cloud-based storage with low cost dedicated servers that have limited storage and unmetered upload bandwidth. We formulate the problem of allocating contents to the dedicated storage as a ﬁnite horizon dynamic decision problem, and show that a discrete time decision problem is a good approximation for piecewise stationary workloads. We provide an exact solution to the discrete time decision problem in the form of a mixed integerlinear programming problem, propose computationally feasible approximations, and give bounds on their approximation ratios.Finally, we evaluate the algorithms using synthetic and measuredtraces from a commercial music on-demand service and give insight into their performance as a function of the workload characteristics.
Place, publisher, year, edition, pages
IEEE , 2014. 853-861 p.
, IEEE INFOCOM, ISSN 0743-166X
IdentifiersURN: urn:nbn:se:liu:diva-108506ISI: 000361544200096OAI: oai:DiVA.org:liu-108506DiVA: diva2:730596
33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014), 27 April - 2 May 2014, Toronto, Canada