### Abstract

Original language | English |
---|---|

Pages (from-to) | 298 - 303 |

Number of pages | 6 |

Journal | IEEE Transactions on Communications |

Volume | 39 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1991 |

MoE publication type | A1 Journal article-refereed |

### Fingerprint

### Cite this

*IEEE Transactions on Communications*,

*39*(2), 298 - 303. https://doi.org/10.1109/26.76467

}

*IEEE Transactions on Communications*, vol. 39, no. 2, pp. 298 - 303. https://doi.org/10.1109/26.76467

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

Research output: Contribution to journal › Article › Scientific › peer-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 -