Providing cost-effective video-on-demand (VOD) services necessitates reducing the required bandwidth for transporting video over high-speed networks. In this paper, we investigate efficient schemes for transporting archived MPEG-coded video over a VOD distribution network. A video stream is characterized by a time-varying traffic envelope, which provides an upper bound on the bit rate. 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 a previous work , we investigated stream scheduling and bandwidth allocation using global traffic envelopes and homogeneous streams. In this paper, we generalize the scheduling scheme in  to include the heterogeneous case. We then investigate the allocation problem under window-based traffic envelopes, which provide tight bounds on the bit rate. Using such envelopes, we introduce three stream-scheduling schemes for multiplexing video connections at a server. The performance of these schemes is evaluated under static and dynamic scenarios. Our results indicate a significant reduction in the per-stream allocated bandwidth when stream scheduling is used. While this reduction is obtained through statistical multiplexing, the transported streams are guaranteed stringent, deterministic quality of service (i.e., zero loss rate and small, bounded delay). In contrast to video smoothing, our approach requires virtually no buffer at the set-top box since frames are delivered at their playback rate.
ASJC Scopus subject areas
- Electrical and Electronic Engineering