Dynamic Content Allocation for Cloud-assisted Service of Periodic Workloads
2014 (English)In: INFOCOM, 2014 Proceedings IEEE, IEEE conference proceedings, 2014, 853-861 p.Conference paper (Refereed)
Motivated by improved models for content workloadprediction, in this paper we consider the problem of dynamiccontent allocation for a hybrid content delivery system thatcombines cloud-based storage with low cost dedicated serversthat have limited storage and unmetered upload bandwidth. Weformulate the problem of allocating contents to the dedicatedstorage as a finite horizon dynamic decision problem, and showthat a discrete time decision problem is a good approximation forpiecewise stationary workloads. We provide an exact solution tothe discrete time decision problem in the form of a mixed integerlinear programming problem, propose computationally feasibleapproximations, and give bounds on their approximation ratios.Finally, we evaluate the algorithms using synthetic and measuredtraces from a commercial music on-demand service and giveinsight into their performance as a function of the workload characteristics.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2014. 853-861 p.
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-134814DOI: 10.1109/INFOCOM.2014.6848013ISI: 000361544200096ScopusID: 2-s2.0-84904430656OAI: oai:DiVA.org:kth-134814DiVA: diva2:668180
The 33rd Annual IEEE International Conference on Computer Communications (INFOCOM'14); Toronto, Canada, 27 April - May 2, 2014
QC 201505212013-11-292013-11-292015-10-29Bibliographically approved