Park Dong Jun, Kim Hyoung Ji, Lee Sang Hun

The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 4, pp. 697-708, Jul. 1996
10.3745/KIPSTE.1996.3.4.697,   PDF Download:

Abstract

In this paper, we study reactive congession control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explict formulae are derived for the number of cells in the system and the loss probabilities for the reaffic Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this paper, we study reactive congestion control, in which each source changes its cell emitting rate adaptively to the traffic load at the switching node. Our intention is that, by incorporation such a congestion control method in ATM network, more efficient congestion control is established. We develope an analytical model, and carry out an approximate analysis of reactive congestion control with priority. Numerical results show that several orsers of magnityde improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance. And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

Statistics
Cite this article