Maximizing the profit of VOD service on broadband cable networks

Bandwidth contention is still a challenging problem in providing efficient IP-based video-on-demand (VOD) service on broadband cable networks (BCNs), due to the lack of effective approaches to exploit the unique characteristics of BCNs. To address this issue, we have designed an optimal full-sharing (Dong Y et al., 2003) for VOD service over a single channel, which maximizes the number of simultaneous video sessions on the single channel. In this paper, we further extend our optimal scheduling for VOD service over multiple channels. We first analyze the expected session bandwidth of a video and then develop an efficient video assignment mechanism for maximizing the profit of a VOD system.

[1]  Mary K. Vernon,et al.  Dynamic Skyscraper Broadcasts for Video-on-Demand , 1998, Multimedia Information Systems.

[2]  Jehan-François Pâris.  A simple low-bandwidth broadcasting protocol for video-on-demand , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[3]  Asit Dan,et al.  Scheduling policies for an on-demand video server with batching , 1994, MULTIMEDIA '94.

[4]  Tomasz Imielinski,et al.  Metropolitan area video-on-demand service using pyramid broadcasting , 1996, Multimedia Systems.

[5]  Mary K. Vernon,et al.  Minimizing Bandwidth Requirements for On-Demand Data Delivery , 2001, IEEE Trans. Knowl. Data Eng..

[6]  Donald F. Towsley,et al.  Supplying instantaneous video-on-demand services using controlled multicast , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[7]  Yingfei Dong.  TR 02-028 Full-Sharing Optimal Scheduling for VOD Service on Broadband Cable Networks , 2002 .

[8]  Keith W. Ross,et al.  Periodic broadcasting with VBR-encoded video , 2003, Multimedia Systems.

[9]  Lixin Gao,et al.  Optimal Patching Schemes for Efficient Multimedia Streaming , 1999 .

[10]  Ralf Steinmetz,et al.  Tune to Lambda patching , 2000, PERV.