The superposition of periodic cell arrival streams in an ATM multiplexer

James Roberts, Jorma Virtamo

Research output: Contribution to journalArticleScientificpeer-review

85 Citations (Scopus)

Abstract

The authors consider the queue arising in a multiservice network using ATM (asynchronous transfer mode) when a superposition of periodic streams of constant-length cells is multiplexed on a high-speed link. An exact closed formula is derived for the queue length distribution in the case where all streams have the same period, and tight upper and lower bounds are obtained on this distribution when the periods are different. Numerical results confirm that the use of a Poisson approximation (i.e. the M/D/1 queue) can lead to a significant overestimation of buffer requirements, particularly in the case of heavy loads. Buffer requirements for a mixture of different period streams can be accurately estimated from the upper bound on the queue length distribution. For given load, requirements increase with the number of long-period (i.e. low-bit rate) sources. The results are deduced from a novel characterization of the single-server constant service time queue, which should be useful in other applications.
Original languageEnglish
Pages (from-to)298 - 303
Number of pages6
JournalIEEE Transactions on Communications
Volume39
Issue number2
DOIs
Publication statusPublished - 1991
MoE publication typeA1 Journal article-refereed

Fingerprint

Asynchronous transfer mode
Servers

Cite this

Roberts, James ; Virtamo, Jorma. / The superposition of periodic cell arrival streams in an ATM multiplexer. In: IEEE Transactions on Communications. 1991 ; Vol. 39, No. 2. pp. 298 - 303.
@article{9e5847ac35744d8881efcf67f7947c6e,
title = "The superposition of periodic cell arrival streams in an ATM multiplexer",
abstract = "The authors consider the queue arising in a multiservice network using ATM (asynchronous transfer mode) when a superposition of periodic streams of constant-length cells is multiplexed on a high-speed link. An exact closed formula is derived for the queue length distribution in the case where all streams have the same period, and tight upper and lower bounds are obtained on this distribution when the periods are different. Numerical results confirm that the use of a Poisson approximation (i.e. the M/D/1 queue) can lead to a significant overestimation of buffer requirements, particularly in the case of heavy loads. Buffer requirements for a mixture of different period streams can be accurately estimated from the upper bound on the queue length distribution. For given load, requirements increase with the number of long-period (i.e. low-bit rate) sources. The results are deduced from a novel characterization of the single-server constant service time queue, which should be useful in other applications.",
author = "James Roberts and Jorma Virtamo",
note = "Project code: TEL9035",
year = "1991",
doi = "10.1109/26.76467",
language = "English",
volume = "39",
pages = "298 -- 303",
journal = "IEEE Transactions on Communications",
issn = "0090-6778",
publisher = "Institute of Electrical and Electronic Engineers IEEE",
number = "2",

}

The superposition of periodic cell arrival streams in an ATM multiplexer. / Roberts, James; Virtamo, Jorma.

In: IEEE Transactions on Communications, Vol. 39, No. 2, 1991, p. 298 - 303.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - The superposition of periodic cell arrival streams in an ATM multiplexer

AU - Roberts, James

AU - Virtamo, Jorma

N1 - Project code: TEL9035

PY - 1991

Y1 - 1991

N2 - The authors consider the queue arising in a multiservice network using ATM (asynchronous transfer mode) when a superposition of periodic streams of constant-length cells is multiplexed on a high-speed link. An exact closed formula is derived for the queue length distribution in the case where all streams have the same period, and tight upper and lower bounds are obtained on this distribution when the periods are different. Numerical results confirm that the use of a Poisson approximation (i.e. the M/D/1 queue) can lead to a significant overestimation of buffer requirements, particularly in the case of heavy loads. Buffer requirements for a mixture of different period streams can be accurately estimated from the upper bound on the queue length distribution. For given load, requirements increase with the number of long-period (i.e. low-bit rate) sources. The results are deduced from a novel characterization of the single-server constant service time queue, which should be useful in other applications.

AB - The authors consider the queue arising in a multiservice network using ATM (asynchronous transfer mode) when a superposition of periodic streams of constant-length cells is multiplexed on a high-speed link. An exact closed formula is derived for the queue length distribution in the case where all streams have the same period, and tight upper and lower bounds are obtained on this distribution when the periods are different. Numerical results confirm that the use of a Poisson approximation (i.e. the M/D/1 queue) can lead to a significant overestimation of buffer requirements, particularly in the case of heavy loads. Buffer requirements for a mixture of different period streams can be accurately estimated from the upper bound on the queue length distribution. For given load, requirements increase with the number of long-period (i.e. low-bit rate) sources. The results are deduced from a novel characterization of the single-server constant service time queue, which should be useful in other applications.

U2 - 10.1109/26.76467

DO - 10.1109/26.76467

M3 - Article

VL - 39

SP - 298

EP - 303

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 2

ER -