A Connection Admission Control with Recursive Formula in ATM Networks


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 7, pp. 1788-1796, Jul. 1997
10.3745/KIPSTE.1997.4.7.1788,   PDF Download:

Abstract

In this paper, we propose a new connection admission control(CAC) algorithm for traffic control in ATM network in which traffic estimation is performed based on user-specified parameters at every moment of connection request or connection release by recursive formula which makes real-time calculation possible. And traffic estimation using cell flow measurement is carried out when the number of connectioned calls does not change during a measurement reflection period. Performance analysis of the proposed method is carried out using several aspects for homogeneous and heterogeneous bursty traffic. The results showed that the proposed CAC method revealed better performance, than conventional CAC method for burst moedl in both utilization and QoS point of view.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
N. J. Hyun, P. C. Jung, L. K. Hyun, "A Connection Admission Control with Recursive Formula in ATM Networks," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 7, pp. 1788-1796, 1997. DOI: 10.3745/KIPSTE.1997.4.7.1788.

[ACM Style]
Nam Jae Hyun, Park Chan Jung, and Lee Kee Hyun. 1997. A Connection Admission Control with Recursive Formula in ATM Networks. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 7, (1997), 1788-1796. DOI: 10.3745/KIPSTE.1997.4.7.1788.