Optimal Content Distribution in Video-on-Demand Tree Networks

Video-on-demand (VOD) services are expected to grow significantly over time, providing diverse programs for home entertainment, distance instruction, news on demand, and other applications. These services require large bandwidth resources. We present a model for a tree network where each node may have demands for multiple different VOD program families, where each program family is an aggregation of similar programs. The decision variables include location of VOD servers and assignment of program families to servers. The model considers cost of servers, cost of assigning program families to servers, and cost of link bandwidths used to broadcast programs. The objective is to minimize the sum of all these costs. The model is formulated as an integer program. We develop a dynamic programming formulation with multiple state variables and an algorithm that solves this model. Starting from the end nodes of the tree network, the algorithm determines optimal solutions to subtrees, eventually reaching the root node with the central server, thus providing an optimal solution to the entire network.

[1]  U. Mocci,et al.  Optimal server location in VOD networks , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[2]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[3]  Ren-Hung Hwang,et al.  Fast optimal video placement algorithms for hierarchical video-on-demand systems , 2001, IEEE transactions on broadcasting.

[4]  Hanan Luss,et al.  An Equitable Bandwidth Allocation Model for Video-on-Demand Networks , 2008 .

[5]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[6]  Shivendra S. Panwar,et al.  File distribution in networks with multimedia storage servers , 2001, Networks.

[7]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .

[8]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[9]  Hanan Luss,et al.  Telecommunications Access Network Design , 2006, Handbook of Optimization in Telecommunications.

[10]  Kien A. Hua,et al.  Video delivery technologies for large-scale deployment of multimedia applications , 2004, Proceedings of the IEEE.

[11]  Iradj Ouveysi,et al.  A novel optimization algorithm for video placement and routing , 2006, IEEE Communications Letters.

[12]  Arie M. C. A. Koster,et al.  A dynamic programming algorithm for the local access telecommunication network expansion problem , 2000, Eur. J. Oper. Res..

[13]  David Shallcross,et al.  Node Placement and Sizing for Copper Broadband Access Networks , 2001, Ann. Oper. Res..

[14]  Shay Kutten,et al.  Optimal allocation of electronic content , 2002, Comput. Networks.

[15]  Iradj Ouveysi,et al.  Designing cost-effective content distribution networks , 2007, Comput. Oper. Res..

[16]  Jiangchuan Liu,et al.  Multirate video multicast over the Internet: an overview , 2003 .

[17]  Chae Y. Lee,et al.  A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics , 2004, Comput. Oper. Res..

[18]  I. Rhee,et al.  Multicast with cache (Mcache): an adaptive zero-delay video-on-demand service , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[19]  Luís Gouveia,et al.  Network flow models for the local access network expansion problem , 2007, Comput. Oper. Res..

[20]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).