File replication in video on demand services

Authors:
Kairui Chen;Hui-Chuan Chen;Richard Borie;Jonathan C. L. Liu
Affiliations:
University of Alabama, Tuscaloosa, AL;University of Alabama, Tuscaloosa, AL;University of Alabama, Tuscaloosa, AL;University of Florida, Gainesville, FL
Venue:
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Year:
2005

Citing 7
Cited 1

Operations research: an introduction, 4th ed.

Operations research: an introduction, 4th ed.
RAID: high-performance, reliable secondary storage

ACM Computing Surveys (CSUR)
EVENODD: an optimal scheme for tolerating double disk failures in RAID architectures

ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering

Proceedings of the 24th annual international symposium on Computer architecture
Efficient video file allocation schemes for video-on-demand services

Multimedia Systems
Introduction to Linear Optimization

Introduction to Linear Optimization
On Providing Highly Available Fault-Tolerant Video-on-Demand Services

ICMCS '98 Proceedings of the IEEE International Conference on Multimedia Computing and Systems

Solving a Video-Server Load Re-Balancing Problem by Mixed Integer Programming and Hybrid Variable Neighborhood Search

HM '09 Proceedings of the 6th International Workshop on Hybrid Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A large-scale video-on-demand (VOD) system demands storage of hundreds of movies and support of thousands of concurrent accesses. The number of concurrent accesses to each movie may vary, depending on the popularity of each movie. File replication problem is concerned with how to replicate, and place the movie files over a number of magnetic disk arrays such that a given access profile can be supported at a minimum cost. This is an NP-hard combinatorial problem. However with its similarity to a transportation model, we develop a transportation-type algorithm to generate a good solution in an effective and convenient form. The computational results show that the proposed algorithm outperforms the existing greedy placement algorithm.