抄録
For a video-on-demand (VOD) system we propose a fast algorithm to solving the video assignment problem. The goal is to minimize the total cost, which consists of transmission cost and storage cost, while servers are limited capacity of storage and supply. In contrast to this attempt, our approach considers both the server storage cost and the network transmission cost. Our method incoeporates a simple and efficient modification to the basic subgradient search step. Preliminary analysis shows that for smaller-scale problems, the average percentage deviation from the best solution is 0.01% for our approach with only 100 iteration. Even though we cast our algorithm in a VOD setting problem, our method is appropriate to the other combinational optimization problems as well.
