Guaranteeing statistical QoS to regulated traffic: The single node case

Martin Reisslein, Keith W. Ross, Srini Rajagopal

Research output: Chapter in Book/Report/Conference proceedingChapter

25 Citations (Scopus)

Abstract

Multimedia traffic can typically tolerate some loss but has rigid delay constraints. A natural QoS requirement for a multimedia connection is a prescribed bound on the fraction of traffic that exceeds an end-to-end delay limit. We propose and analyze a traffic management scheme which guarantees QoS to multimedia traffic while simultaneously allowing for a large connection-carrying capacity. We study our traffic management scheme in the context of a single node. In order for the node to guarantee QoS, each connection's traffic is regulated. In order to support many connections, the link statistically multiplexes the connections' traffic. The scheme consists of (i) cascaded leaky-buckets for traffic regulation, (ii) smoothers at the ingresses, and (iii) bufferless statistical multiplexing within the node. For this scheme we show that loss probabilities are minimized with simple one-buffer smoothers which operate at specific minimum rates. We also show that the worst-case input traffic is extremal on-off traffic for all connections. These two results lead to a straightforward scheme for guaranteeing QoS to regulated traffic. Using MPEG video traces, we present numerical results which demonstrate the methodology. Finally, we compare the bufferless scheme with buffered statistical multiplexing.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages1061-1072
Number of pages12
Volume3
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 18th Annual Joint Conference of the IEEE Computer and Communications Societie, INFOCOM-99 - New York, NY, USA
Duration: Mar 21 1999Mar 25 1999

Other

OtherProceedings of the 1999 18th Annual Joint Conference of the IEEE Computer and Communications Societie, INFOCOM-99
CityNew York, NY, USA
Period3/21/993/25/99

Fingerprint

Telecommunication traffic
Quality of service
Multiplexing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Computer Science(all)

Cite this

Reisslein, M., Ross, K. W., & Rajagopal, S. (1999). Guaranteeing statistical QoS to regulated traffic: The single node case. In Proceedings - IEEE INFOCOM (Vol. 3, pp. 1061-1072). IEEE.

Guaranteeing statistical QoS to regulated traffic : The single node case. / Reisslein, Martin; Ross, Keith W.; Rajagopal, Srini.

Proceedings - IEEE INFOCOM. Vol. 3 IEEE, 1999. p. 1061-1072.

Research output: Chapter in Book/Report/Conference proceedingChapter

Reisslein, M, Ross, KW & Rajagopal, S 1999, Guaranteeing statistical QoS to regulated traffic: The single node case. in Proceedings - IEEE INFOCOM. vol. 3, IEEE, pp. 1061-1072, Proceedings of the 1999 18th Annual Joint Conference of the IEEE Computer and Communications Societie, INFOCOM-99, New York, NY, USA, 3/21/99.
Reisslein M, Ross KW, Rajagopal S. Guaranteeing statistical QoS to regulated traffic: The single node case. In Proceedings - IEEE INFOCOM. Vol. 3. IEEE. 1999. p. 1061-1072
Reisslein, Martin ; Ross, Keith W. ; Rajagopal, Srini. / Guaranteeing statistical QoS to regulated traffic : The single node case. Proceedings - IEEE INFOCOM. Vol. 3 IEEE, 1999. pp. 1061-1072
@inbook{62994176508e4639a00cad478085fc25,
title = "Guaranteeing statistical QoS to regulated traffic: The single node case",
abstract = "Multimedia traffic can typically tolerate some loss but has rigid delay constraints. A natural QoS requirement for a multimedia connection is a prescribed bound on the fraction of traffic that exceeds an end-to-end delay limit. We propose and analyze a traffic management scheme which guarantees QoS to multimedia traffic while simultaneously allowing for a large connection-carrying capacity. We study our traffic management scheme in the context of a single node. In order for the node to guarantee QoS, each connection's traffic is regulated. In order to support many connections, the link statistically multiplexes the connections' traffic. The scheme consists of (i) cascaded leaky-buckets for traffic regulation, (ii) smoothers at the ingresses, and (iii) bufferless statistical multiplexing within the node. For this scheme we show that loss probabilities are minimized with simple one-buffer smoothers which operate at specific minimum rates. We also show that the worst-case input traffic is extremal on-off traffic for all connections. These two results lead to a straightforward scheme for guaranteeing QoS to regulated traffic. Using MPEG video traces, we present numerical results which demonstrate the methodology. Finally, we compare the bufferless scheme with buffered statistical multiplexing.",
author = "Martin Reisslein and Ross, {Keith W.} and Srini Rajagopal",
year = "1999",
language = "English (US)",
volume = "3",
pages = "1061--1072",
booktitle = "Proceedings - IEEE INFOCOM",
publisher = "IEEE",

}

TY - CHAP

T1 - Guaranteeing statistical QoS to regulated traffic

T2 - The single node case

AU - Reisslein, Martin

AU - Ross, Keith W.

AU - Rajagopal, Srini

PY - 1999

Y1 - 1999

N2 - Multimedia traffic can typically tolerate some loss but has rigid delay constraints. A natural QoS requirement for a multimedia connection is a prescribed bound on the fraction of traffic that exceeds an end-to-end delay limit. We propose and analyze a traffic management scheme which guarantees QoS to multimedia traffic while simultaneously allowing for a large connection-carrying capacity. We study our traffic management scheme in the context of a single node. In order for the node to guarantee QoS, each connection's traffic is regulated. In order to support many connections, the link statistically multiplexes the connections' traffic. The scheme consists of (i) cascaded leaky-buckets for traffic regulation, (ii) smoothers at the ingresses, and (iii) bufferless statistical multiplexing within the node. For this scheme we show that loss probabilities are minimized with simple one-buffer smoothers which operate at specific minimum rates. We also show that the worst-case input traffic is extremal on-off traffic for all connections. These two results lead to a straightforward scheme for guaranteeing QoS to regulated traffic. Using MPEG video traces, we present numerical results which demonstrate the methodology. Finally, we compare the bufferless scheme with buffered statistical multiplexing.

AB - Multimedia traffic can typically tolerate some loss but has rigid delay constraints. A natural QoS requirement for a multimedia connection is a prescribed bound on the fraction of traffic that exceeds an end-to-end delay limit. We propose and analyze a traffic management scheme which guarantees QoS to multimedia traffic while simultaneously allowing for a large connection-carrying capacity. We study our traffic management scheme in the context of a single node. In order for the node to guarantee QoS, each connection's traffic is regulated. In order to support many connections, the link statistically multiplexes the connections' traffic. The scheme consists of (i) cascaded leaky-buckets for traffic regulation, (ii) smoothers at the ingresses, and (iii) bufferless statistical multiplexing within the node. For this scheme we show that loss probabilities are minimized with simple one-buffer smoothers which operate at specific minimum rates. We also show that the worst-case input traffic is extremal on-off traffic for all connections. These two results lead to a straightforward scheme for guaranteeing QoS to regulated traffic. Using MPEG video traces, we present numerical results which demonstrate the methodology. Finally, we compare the bufferless scheme with buffered statistical multiplexing.

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

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

M3 - Chapter

AN - SCOPUS:0032661524

VL - 3

SP - 1061

EP - 1072

BT - Proceedings - IEEE INFOCOM

PB - IEEE

ER -