• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.12
• /
• pp.9-24
• /
• 1995

In this paper, we proposed and analysed two kinds of priority control mechanism to archive the cell loss rate requirement and the delay requirement of each class. The service classes of our concern are the high time priority class(class 1) and the high loss priority class(class 2). Two kinds of priority control mechanism is divided by the method of storing the arriving class 2 cell in buffer on case of buffer full. The first one is the method which discarding the arriving class 2 cell, the second one is the mothod which storing the arriving class 2 cell on behalf of pushing out the class 1 cell in buffer. In the proposed priority schemes, one cell of the class 1 is transmitted whenever the maximum K cells of the class 2 is transmitted on case of transmitting the class 1 cell and the class 2 cell sequentially. In this paper, we analysed the cell loss rate and the mean cell delay for each class of the proposed priority scheme by using the Markov chain. The analytical results show that the characteristic of the mean cell delay becomes better for the class 1 cell and that of the cell loss rate becomes better for the class 2 cell by selecting properly the cell transfer ratio according to the condition of input traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.855-869
• /
• 1997

In this paper, we proposed two kids of dynamic priority control mechanisms controlling the cell service ratio in order to improve the QOS(Quality of Service). We also analyse theoretically the characteristics of cell loss probability and mean cell delay time by applying the proposed priority control mechanisms to ATM switch with output buffer. The proposed priority control mechanisms have the same principles of storing cells into buffer but the different principles of serving cells from buffer. The one is the control mechanism controlling the cell service ratio according to the relative cell occupancy ratio of buffer, the other is the control mechanism controlling the cell service ratio according to both the relative cell occupancy ratio of buffer and the average arrival rate. The two service classes of our concern are the delay sensitive class and the loss sensitive class. The analytical results show that the proposed control mechanisms are able to improve the QOS, the characteristics of cell loss probability and mean cell delay time, by selecting properly the relative cell occupancy ratio of buffer and the average arrival rate. conventional DLB algorithm does not support synchronous cells, but the proposed algorithm gives higher priority to synchronous cells. To reduce synchronous cell loss rate, the synchronous cell detector is used in the proposed algorithm. Synchronous cell detector detects synchronous cells, and passes them cells to the 2nd Leaky-Bucket. So it is similar to give higher priority to synchronous cells. In this paper, the proposed algorithm used audio/video traffic modeled by On/Off and Two-state MMPP, and simulated by SLAM II package. As simulation results, the proposed algorithm gets lower synchronous cell loss rate than the conventional DLB algorithms. The improved DLB algorithm for multimedia synchronization can be extended to any other cells which require higher priority.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.779-792
• /
• 1993

In a switching node or an ATM multiplexer of the ATM network, a good bandwidth utilization can be achieved by the priority control using the 1-bit(Cell Loss priority) in ATM cell header. In this paper, the mixed mechanism is proposed to make up for shortcomings of existing space priority control mechanisms and to decrease the loss probability of high priority cell and its performance is analyzed about the cell loss probability. To estimate the performance of proposed mixed mechanism, its cell loss probability is compared with those of non-priority mechanism, push-out mechanism and partial buffer sharing mechanism. The cell loss probability is analyzed using a M/D/1/N modeling and a 2-state MMPP/D/1/N modeling and also comparison between two modelings is made. To verify this result of numerical analysis, the computer simulation is performed for each mechanism using the simulation language, SIMSRIPT II.5.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.479-491
• /
• 1994

In this paper, we proposed cell priority control with 2-level thresholds, which was considered cell loss and cell delay requirement, in ATM switch with output buffer. Priority control mechanism presented in this paper improved cell loss rate for cell loss censitive cell and cell delay for delay censitive cell. In this mechanism cell loss rate and mean cell delay of cell priority control mechanism were obtained theoretically. The results show that cell loss rate and mean cell delay improvement become better by adjusting two thresholds according to QOS characteristics.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.70-73
• /
• 1998

This paper present a new priority control mechanism which is to balance the cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements. And, to reduce the delay rates we modified existing cell scheduling scheme. Throughout the computer simulation, the existing methods and proposed scheme is compared with respect to cell loss rate and average delay time. In the result of simulation, the proposed scheme have more improved performance than the other schemes with respect to cell loss rate and average delay time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1296-1304
• /
• 1999

In this paper, we propose an enhanced usage parameter control algorithm, which is one of the preventive traffic control method in ATM networks. Proposed algorithm is based on the cell loss priority bit in the ATM cell header. This algorithm can eliminate the measurement phasing problem in cell conformance testing in ATM networks. Proposed algorithm can minimize the cell loss ratio of high priority cell(CLP = 0) and resolve the burstiness of cells which may be introduced in traffic multiplexing and demultiplexing procedure. For the performance evaluation, we simulate the proposed algorithm with discrete time input traffic model, the results show that the performance of proposed algorithm is better than that of ITU-T usage parameter control algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.82-89
• /
• 2000

This study analyzes the cell loss probability of an ATM multiplexer with real time and non-real time bursty traffics. It is assumed that an ATM multiplexer with loss priority control for the analysis. The loss priority control uses the CLP Reld of cell header. For easy analysis and less computation. the multiplexed traffic of the ATM multiplexer was modeled by the MMDP. The ATM multiplexer is simulated by the MMDP/MMDP/l/K queueing system. From the above results, The connection admission of an ATM multiplexer with loss priority control is determined by the cell loss probability with low priority as well as the size of threshold buffer. Therefore, to increase the statistical multiplexing gain it will be good to utilize the loss priority control in order.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1884-1892
• /
• 1993

In push out scheme, high priority cell which arrives when the buffer is full pushs low priority cell. The PBS scheme provides priority by variable threshold in buffer.In this paper, for Controlling congestion in ATM network we propose buffer processing method in which the PBS scheme has variable threshold. And we analysis The performance of this scheme. As a result of simulation, the proposed push out scheme with variable threshold reduces the loss of low priority cell compared with existing push out scheme. This proposed method not only reduces the loss of high priority cell like existing push out scheme but also reduces the loss of low priority cell by variable threshold.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.6
• /
• pp.23-32
• /
• 1996

This paper proposes a new buffer management scheme to service delay-sensitive traffic and loss-sensitive traffic fairly in ATM networks. The proposed scheme uses tow buffers for delay-sensitive traffic and loss-sensitive traffic. To satisfy the average delay time of delay-sensitive traffic, cells in real-time buffer are served first. When congestion occurs in nonreal-time buffer, low loss priority cell in real-time buffer can be pushed out by high loss priority cell in nonreal-time buffer can be transferred to real-time buffer considering threshold value in real-time buffer. Using computer simulation, the existing methods and proposed scheme are compared and analyzed with respect to cell loss rate and average delay time. Simulation results show that the proposed scheme have superior performance to conventional schemes.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.339-342
• /
• 1998

The various services that a broadband integrated services digital network (B-ISDN) carries, have a wide range of delay, delay jitter and cell loss probability requirements. Design of appropriate control schemes for B-ISDN is an extremely important and challenging problem. In this paper, we proposes a priority control scheme with a delay counter and a cell counter per each class type. The priority control for required service quality is performed with delay/loss factor obstained by comparing window counter with cell counter. The performance of proposed control scheme is estimated by computer simulation.