Branch and price algorithm for content allocation problem in VOD network

Authors:
Jungman Hong;Seungkil Lim
Affiliations:
Consulting Division, LG CNS, Seoul, Korea;Division of e-businessIT, Sungkyul University, Anyang, Korea
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 5
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
An integer programming approach to the bandwidth packing problem

Management Science
An iterative algorithm for delay-constrained minimum-cost multicasting

IEEE/ACM Transactions on Networking (TON)
Optimal allocation of electronic content

Computer Networks: The International Journal of Computer and Telecommunications Networking
A cost comparison of distributed and centralized approaches to video-on-demand

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper considers an optimal video file allocation problem in a video-on-demand (VOD) network. The objective of the problem is to find an optimal video file allocation strategy, giving both types of videos and the number of copies of each video file type to be carried at each distributed server and each local server in the VOD network, that minimizes the associated storage and transmission cost subject to each server capacity. The problem is formulated as a mixed integer programming problem and solved by a column generation approach. Computational results show that the associated column generation algorithm with three exploited valid inequalities applied and a branch-and-bound procedure can together solve practical size problems in reasonable time.