Scheduling and bandwidth allocation for the distribution of archived video in VOD systems

Marwan M Krunz, Wei Zhao, Ibrahim Matta

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

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 [13], we investigated stream scheduling and bandwidth allocation using global traffic envelopes and homogeneous streams. In this paper, we generalize the scheduling scheme in [13] 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.

Original languageEnglish (US)
Pages (from-to)335-355
Number of pages21
JournalTelecommunication Systems
Volume9
Issue number3-4
StatePublished - 1998

Fingerprint

Video on demand
Frequency allocation
Scheduling
Bandwidth
Multiplexing
Set-top boxes
HIgh speed networks
Electric power distribution
Quality of service
Servers
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Scheduling and bandwidth allocation for the distribution of archived video in VOD systems. / Krunz, Marwan M; Zhao, Wei; Matta, Ibrahim.

In: Telecommunication Systems, Vol. 9, No. 3-4, 1998, p. 335-355.

Research output: Contribution to journalArticle

@article{9288d03e0cce4b8d90c8957abf517def,
title = "Scheduling and bandwidth allocation for the distribution of archived video in VOD systems",
abstract = "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 [13], we investigated stream scheduling and bandwidth allocation using global traffic envelopes and homogeneous streams. In this paper, we generalize the scheduling scheme in [13] 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.",
author = "Krunz, {Marwan M} and Wei Zhao and Ibrahim Matta",
year = "1998",
language = "English (US)",
volume = "9",
pages = "335--355",
journal = "Telecommunication Systems",
issn = "1018-4864",
publisher = "Springer Netherlands",
number = "3-4",

}

TY - JOUR

T1 - Scheduling and bandwidth allocation for the distribution of archived video in VOD systems

AU - Krunz, Marwan M

AU - Zhao, Wei

AU - Matta, Ibrahim

PY - 1998

Y1 - 1998

N2 - 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 [13], we investigated stream scheduling and bandwidth allocation using global traffic envelopes and homogeneous streams. In this paper, we generalize the scheduling scheme in [13] 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.

AB - 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 [13], we investigated stream scheduling and bandwidth allocation using global traffic envelopes and homogeneous streams. In this paper, we generalize the scheduling scheme in [13] 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.

UR - http://www.scopus.com/inward/record.url?scp=22444455894&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=22444455894&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:22444455894

VL - 9

SP - 335

EP - 355

JO - Telecommunication Systems

JF - Telecommunication Systems

SN - 1018-4864

IS - 3-4

ER -