Evolutionary Optimization of File Assignment for a Large-Scale Video-on-Demand System

We present a genetic algorithm for tackling a file assignment problem for a large-scale video-on-demand system. The file assignment problem is to find the optimal replication and allocation of movie files to disks so that the request blocking probability is minimized subject to capacity constraints. We adopt a divide-and-conquer strategy, where the entire solution space of file assignments is divided into subspaces. Each subspace is an exclusive set of solutions sharing a common file replication instance. This allows us to utilize a greedy file allocation method for finding a good-quality heuristic solution within each subspace. We further design two performance indices to measure the quality of the heuristic solution on 1) its assignment of multicopy movies and 2) its assignment of single-copy movies. We demonstrate that these techniques, together with ad hoc population handling methods, enable genetic algorithms to operate in a significantly reduced search space and achieve good-qual...

• Type: Journal
• Year: 2008
• Where: TKDE
• Authors: Jun Guo, Yi Wang, Kit-Sang Tang, Sammy Chan, Eric W. M. Wong, Peter Taylor, Moshe Zukerman
• Keywords: File Assignment Problem, File Assignments, Genetic Algorithms, TKDE 2008