Trace–Adaptive Fragmentation for Periodic Broadcast of VBR Video

Periodic broadcast schemes have been proposed as a scalable solution for the implementation of Video–on– Demand (VoD) systems. Efficient periodic broadcast schemes fragment each video into a number of segments assuming that the videos are encoded using Constant Bit Rate (CBR) coders. We focus instead on the more efficient and commonplace class of Variable Bit Rate (VBR) encoded videos. The claim made in this paper is that the significant bit rate variability of VBR video requires a different fragmentation approach for the construction of periodic broadcast schedules. Rigid fragmentation techniques do not consider the particular video traces and may result in traffic which exceeds the available broadcast link capacity and can lead to increased data losses. Remarkably, all known periodic broadcast schemes use rigid fragmentation techniques. We introduce a new fragmentation scheme, Trace–Adaptive Fragmentation (TAF), which derives improved broadcast schedules for VBR video. Essentially, increased processing time for an off–line optimization process is traded off for improved data loss performance while also satisfying a prescribed maximum playout latency. Numerical results show the benefits, feasibility and flexibility of the proposed scheme.

[1]  Kevin C. Almeroth,et al.  The Use of Multicast Delivery to Provide a Scalable and Interactive Video-on-Demand Service , 1996, IEEE J. Sel. Areas Commun..

[2]  Kien A. Hua,et al.  Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems , 1997, SIGCOMM '97.

[3]  Darrell D. E. Long,et al.  A low bandwidth broadcasting protocol for video on demand , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[4]  Kien A. Hua,et al.  Exploiting client bandwidth for more efficient video broadcast , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

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

[6]  Philip S. Yu,et al.  On optimal batching policies for video-on-demand storage servers , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[7]  Fouad A. Tobagi,et al.  Characterization of Quality and Traffic for Various Video Encoding Schemes and Various Encoder Control Schemes , 1996 .

[8]  Oliver Rose,et al.  Statistical properties of MPEG video traffic and their impact on traffic modeling in ATM systems , 1995, Proceedings of 20th Conference on Local Computer Networks.

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

[10]  Philip S. Yu,et al.  A permutation-based pyramid broadcasting scheme for video-on-demand systems , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[11]  Darrell D. E. Long,et al.  Efficient broadcasting protocols for video on demand , 1998, Proceedings. Sixth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.98TB100247).

[12]  Keith W. Ross,et al.  Periodic broadcasting with VBR-encoded video , 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).

[13]  Mostafa H. Ammar,et al.  The Design of Teletext Broadcast Cycles , 1985, Perform. Evaluation.

[14]  Li-Ming Tseng,et al.  Harmonic broadcasting for video-on-demand service , 1997, IEEE Trans. Broadcast..

[15]  Keith W. Ross,et al.  A join-the-shortest-queue prefetching protocol for VBR video on demand , 1997, Proceedings 1997 International Conference on Network Protocols.