DocumentCode :
1301167
Title :
A CAC scheme based on real-time cell loss estimation for ATM multiplexers
Author :
Kang, Sang H. ; Sung, Dan K.
Author_Institution :
Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea
Volume :
48
Issue :
2
fYear :
2000
fDate :
2/1/2000 12:00:00 AM
Firstpage :
252
Lastpage :
258
Abstract :
For the superposition of on/off sources, we propose a real-time computable two-state Markov modulated Poisson process [MMPP(2)] modeling method characterizing the aggregate cell arrival rate and the variance-time curve for cell counts. Numerical examples show that the proposed method yields a good estimation of the cell loss ratio (CLR) in asynchronous transfer mode (ATM) multiplexers. Then, we propose an approximation method for calculating the workload for the MMPP(2)/D/1 system. By considering the workload as an upper bound of CLR of ATM multiplexers, we propose a connection admission control (CAC) algorithm utilizing peak cell rate, sustainable cell rate, and maximum burst size as user traffic descriptors. Using the proposed CAC algorithm, an acceptance decision is made with computational complexities of less than 3000 floating point operations. It is also observed from numerical evaluations that the proposed CAC algorithm yields a high multiplexing gain, compared with other methods in the literature
Keywords :
Markov processes; Poisson distribution; asynchronous transfer mode; computational complexity; multiplexing equipment; packet switching; quality of service; queueing theory; telecommunication congestion control; telecommunication traffic; ATM multiplexers; CAC algorithm; CLR; MMPP(2) modeling method; MMPP(2)/D/1 system; QoS; aggregate cell arrival rate; approximation method; asynchronous transfer mode; cell counts; cell loss ratio; computational complexities; connection admission control; floating point operations; high multiplexing gain; maximum burst size; on/off sources; peak cell rate; real-time cell loss estimation; sustainable cell rate; two-state Markov modulated Poisson process; upper bound; user traffic descriptors; variance-time curve; virtual waiting time; Admission control; Aggregates; Approximation methods; Asynchronous transfer mode; Computational complexity; Multiplexing; Quantum computing; Tail; Traffic control; Yield estimation;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/26.823558
Filename :
823558
Link To Document :
بازگشت