By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wei Zhao ; Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA ; Ktunz, M. ; Tripathi, S.K.

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

Published in:

Communications, 1997. ICC '97 Montreal, Towards the Knowledge Millennium. 1997 IEEE International Conference on  (Volume:2 )

Date of Conference:

8-12 Jun 1997