By Topic

A fast, simple and near-optimal content placement scheme for a large-scale VoD system

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
$33 $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

3 Author(s)
Jun He ; Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China ; Xiaoming Zhao ; Baohua Zhao

Video-on-Demand(VoD) service providers operate their own networks with large-scale serving nodes, each of which serves users in a certain geographic area. Efficient content placement can dramatically reduce the network latency and improve the user utilization. Content placement is a difficult problem though, due to the explosively increasing video library, the limited disk capacity and high diversity of request patterns. In this paper, we formulate the problem as an integer program, with the simple and practical objective of maximizing the aggregate amount of hitting data. We prove that this problem is NPhard. Jointly considering the size and popularity distributions of the video clips, we propose a fast greedy algorithm to solve it. Numerical results show that our algorithm is near-optimal (within 1-3% of optimal) and more efficient than existing solutions. We also evaluate our assumed distributions of video clips through a case study of the Youtube video data.

Published in:

Communication Systems (ICCS), 2012 IEEE International Conference on

Date of Conference:

21-23 Nov. 2012