• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.4
• /
• pp.583-592
• /
• 1998

In this paper, the cell loss rate is analyzed in terms of the input traffic stream of different speed in ATM network. The cell loss rate is calculated by birth-death process of Leaky-Bucket mechanism as the representative algorithm of usage parameter control. The cell loss rate assumed 2-state MMPP input process to be birth-death process by considering the character of token pool about finite capacity queue. The results from numerical analysis show that the cell loss rate decreases abruptly according to the buffer size increase. The computer simulation by SIMSCRIPT II.5 has been done and compared with on/off input source case to verify the analysis results.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.3
• /
• pp.512-522
• /
• 1996

To provide broadband ISDN service for the users in scattered locations, the application of satellite communications network is seriously considered. To trans mit ATM cells efficiently in satellite communications, it is effective to use TDM A method. However, it is necessary to have a method to compensate the cell delayvari-ation caused by the difference between TDMA and ATM. This paper optimized the cell control time(Tc) when traffic inputs have poisson or markov modulated poisson process by applying cell delay variation characteristics of time stamp method, which has the most advantages among compensation methods or cell delay variation. This paper also intorduces a method of reducing the cell clumping phenomena by adapting discrete time stamp method, including the analysis and evalutation of the range of required quality of CDV distribution by ATM transmission.The result of the experiment shows that CDV distribution-range can be controlled to 1.2$\times$Tc which reduces overall cell delay variation by discrrete time stamp method.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.128-135
• /
• 2002

We propose a new space priority mechanism, and analyze its performance in a single Constant Bit Rate (CBR) server. The arrival process is derived from the superposition of two types of traffics, each in turn results from the superposition of homogeneous ON-OFF sources that can be approximated by means of a two-state Markov Modulated Poisson Process (MMPP). The buffer mechanism enables the Asynchronous Transfer Mode (ATM) layer to adapt the quality of the cell transfer to the Quality of Service (QoS) requirements and to improve the utilization of network resources. This is achieved by "Selective-Delaying and Pushing-ln"(SDPI) cells according to the class they belong to. The scheme is applicable to schedule delay-tolerant non-real time traffic and delay-sensitive real time traffic. Analytical expressions for various performance parameters and numerical results are obtained. Simulation results in term of cell loss probability conform with our numerical analysis.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion 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 the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. 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 a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude 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.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.11
• /
• pp.1395-1406
• /
• 2001

In order to cover a widespread service range, terrestrial/satellite-mixed network is being combined with terrestrial ATM network. This dissertation analyzes and investigates several previously existent CDV compensation methods in order to compensate CDV arising from interfacing satellite TDMA and ATM. Specifically to supplement the problems of timestamp and cell number counting methods, new Variable Timestamp method for CDV compensation is proposed. To evaluate the proposed method, MMPP(Markov Modulated Poisson Process), which can express VBR service very well, is selected as a cell input traffic model of terrestrial transmitting earth station. After several simulation, it is also confirmed that CDV compensation capability for VBR services is very superior to the cell number counting method. In this case, as the timestamp number Nts increases, CDV compensation capability increases, and the CDV distribution length is reduced.