By Topic

Dynamic content allocation for cloud-assisted service of periodic workloads

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dan, G. ; Sch. of Electr. Eng., KTH R. Inst. of Technol., Stockholm, Sweden ; Carlsson, N.

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 finite 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 integer linear programming problem, propose computationally feasible approximations, and give bounds on their approximation ratios. Finally, we evaluate the algorithms using synthetic and measured traces from a commercial music on-demand service and give insight into their performance as a function of the workload characteristics.

Published in:

INFOCOM, 2014 Proceedings IEEE

Date of Conference:

April 27 2014-May 2 2014