A fast computation algorithm for connection admission control of delay sensitive traffic with multiple quality of service requirements

Tsern-Huei Lee*, Kuen Chu Lai

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

This paper presents a fast computation algorithm for connection admission control for heterogeneous delay sensitive traffic in ATM networks. Cell loss probability is adopted as the measure of quality of service. In our study, cells of each connection are allowed to have two different loss priorities and the aggregate traffic can have more than two. To cope with multiple quality of service requirements, the link capacity is divided into several bands. For simplicity, each traffic source is assumed to alternate between active and idle periods. However, the results can be extended to traffic sources having more than two states. Upper bounds of actual cell loss probabilities are derived based on the bufferless fluid flow model. Numerical results show that the upper bounds are close to the actual cell loss probabilities.

Original languageEnglish
Pages (from-to)1094-1100
Number of pages7
JournalIEICE Transactions on Communications
VolumeE79-B
Issue number8
StatePublished - 1 Jan 1996

Keywords

  • ATM
  • CAC
  • Delay-sensitive traffic

Fingerprint Dive into the research topics of 'A fast computation algorithm for connection admission control of delay sensitive traffic with multiple quality of service requirements'. Together they form a unique fingerprint.

Cite this