Efficient transport of stored video using stream scheduling and window-based traffic envelopes

Wei Zhao, Marwan M Krunz, Satish K. Tripathi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

We present efficient scheduling schemes for transporting archived MPEG-coded video over a constant-bit-rate (CBR) channel. A video source is characterized by a time-varying traffic envelope, which constitutes an upper bound on the actual bit rate. To provide a relatively tight bound, window-based envelopes are used in which the bound is based on fixed-length segments of the movie. Using such envelopes, we show that video streams can be scheduled for transmission over the network such that the per-stream allocated bandwidth is significantly less than the source peak rate. In certain cases, a reduction of up to 85% of the source peak rate was achieved. Bandwidth gain is obtained via statistical multiplexing, while providing stringent, deterministic quality of service. Online procedures for bandwidth computation and admission control under the examined scheduling schemes are presented.

Original languageEnglish (US)
Title of host publicationIEEE International Conference on Communications
PublisherIEEE
Pages793-797
Number of pages5
Volume2
Publication statusPublished - 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can
Duration: Jun 8 1997Jun 12 1997

Other

OtherProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3)
CityMontreal, Can
Period6/8/976/12/97

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Zhao, W., Krunz, M. M., & Tripathi, S. K. (1997). Efficient transport of stored video using stream scheduling and window-based traffic envelopes. In IEEE International Conference on Communications (Vol. 2, pp. 793-797). IEEE.