For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Fast Computation Algorithm for Connection Admission Control of Delay Sensitive Traffic with Multiple Quality of Service Requirements
Tsern-Huei LEE Kuen-Chu LAI
IEICE TRANSACTIONS on Communications
Publication Date: 1996/08/25
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Services
ATM, CAC, delay-sensitive traffic,
Full Text: PDF>>
This paper presets 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 fluidflow model. Numerical results show that the upper bounds are close to the actual cell loss probabilities.