• Journal of KIISE:Information Networking
• /
• v.27 no.2
• /
• pp.206-218
• /
• 2000

Retransmissions on the DLC layer are essential to ABR service providing the low CLR (cell loss ratio) over the unreliable wireless channel with high bit error rate. In the wireless ATM, the DLC layer below ATM layer performs the retransmission and reordering of the cells to recover the cell loss over the wireless channel and by doing so, the effect of the wireless channel characteristics with high bit error rate can be minimized on the ATM layer which is designed under the assumption of the low bit error rate. We propose, in this paper, the schemes to reflect the changes of the transmission rate over the wireless channel on the ABR rate control. Proposed scheme can control the source rate to the changes of the transmission rate over the wireless channel and reduce the required buffer size in the AP (access point). In the simulation, we assume that the DLC layer can inform the ATM layer of the wireless channel quality as good or bad. Our simulation results show that the proposed schemes require the smaller buffer size compared with the existing scheme, enhanced dynamic max rate control algorithm (EDMRCA). It is also shown that the scheme with the intelligent DLC which adjusts the rate to the wireless channel quality not only provides the low CLR with smaller buffer requirement but also improves the throughput by utilizing the wireless bandwidth more efficiently.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.374-376
• /
• 1998

ABR서비스는 ATM 망의 이용률을 증대시키고, 매우 버스트한 트래픽 응용을 지원하기위해 설계되었다. ATM 포럼에서는 망에서 소스의 셀 전송률을 조절하고 셀 손실을 최소화하기 위한 ABR 서비스 표준으로 폐쇄루프와 전송률기반의 폭주 제어 알고리즘을 채택하였다. 이러한 폭주 제어 알고리즘 중에서 대표적인 것이 ERIVCA(Explicit Rare Indication for Congestion Avoidance) 이다. 본 논문에서는 ERIVCA 의 견고성, 공평성 LAN/WAN 환경에 대해서 성능을 시험하고. 그 결과로 성능을 향상시키기 위해 개선된 최대-최소 구조를 제공한다. 또한 제안된 구조에 대한 시뮬레이션을 하여 기존 ERIVCA 알고리즘의 성능과 비교 분석한다.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.8
• /
• pp.629-637
• /
• 2000

Unbalance between user requirements and insufficient network resources makes a congestion. In the future since the communication networks will have very heavy traffic congestion will be more serious. The ATM networks was recommended to support the B-ISDN service for the future multimedia communication. In thie sense of congestion avoidance and recovery the ABR service category in ATM networks allows the feedback flow control mechanism to dynamically allocate the idle bandwidth of the network to users fairly and to control the network congestion rapidly In this paper we introduce a congestion control scheme using systematical approach to confirm robust stability with respect to unknown round trip delay for the network which has both unicast and multicast connections.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.698-703
• /
• 2000

초고속 인터넷의 멀티미디어 서비스 통합에 대한 해결책으로 ATM 네트워크 기술이 널리 사용되고 있다. UBR 상의 TCP에서는 혼잡 시 패킷의 손실을 줄이기 위한 UBR+EPD 방식과 ABR 상의 TCP에서 ABR 율 기반 제어는 셀 손실을 억제하는 높은 성능의 ER 방식이 제안되었다. 그러나 인터넷 서비스의 영역이 지역적으로 점차 확장되어짐에 따라 보다 다양한 QoS가 요구되어진다. 이러한 환경요인을 만족시키기 위해, 본 논문에서는 UBR 서비스상의 TCP의 성능개선을 위해서 거리에 따른 빠른 재전송과 회복의 설정 여부에 대한 성능평가와 ABR 서비스에서는 TCP의 파라미터인 MTU(Maximum Transport Unit)의 크기를 변화시켜 좋은 성능 개선을 가져오는 MTU 크기를 시뮬레이션 결과 통해 나타내었다.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.7
• /
• pp.82-90
• /
• 1998

본 논문에서는 신호 채널에 의한 ABR 트래픽 제어 메카니즘을 제시하고, ABR 트 래픽을 제어하기 위한 Bandwidth Request 메시지와 Bandwidth Allocated 메시지를 고안하 였다. 또한 새로운 트래픽 파라메터 협상 메시지 흐름을 고안 하였으며, 성능 분석을 통하여 기존 방식에 비하여 호 처리시간과 가용 대역폭 이용 측면에서 본 논문에서 제안한 방안이 월등히 우수함을 알 수 있었다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.63-66
• /
• 2000

본 논문에서는 신호 채널을 이용하여 실제적인 호 연결 처리 전에 착신 단말의 가용 전송률 및 서비스 호환성 여부를 조사하는 Look Ahead Enquiry/Response 기법에 의한 새로운 ABR 트래픽 파라메터 협상 베시지 흐름 메카니즘을 제안하였으며, 신호채널을 이용한 ABR 트래픽 전송률 제어가 가능하도록 Bandwidth Request 메시지와 Bandwidth Allocated 메시지를 고안하였다. 또한 성능 분석을 통하여 기존 방식과 비교하여 호 처리시간과 링크 이용 효율측면에서 본 논문에서 제안한 방안이 월등히 우수함을 알 수 있었다.

• Journal of the Korea Society for Simulation
• /
• v.8 no.1
• /
• pp.51-61
• /
• 1999

A cell scheduling method of Queue for the ATM switch is proposed and simulated. In this paper, we present the cell scheduling method proper to the proposed queue and the improved queue with Queue Sharing(QS) structure for CBR, VBR, ABR traffic. The proposed QS structure minimizes the CLS(Cell Loss Ratio) of ABR traffic and decreases the CLR of bursty VBR traffic. Also we propose a cell scheduling method using VRR(Variable Round Robin) scheme proper to the high-speed(ATM) switch. The VRR scheme provides a fairness in terms of service chance for the queues in the ATM switch as well as QOS of their cell delay characteristic of CBR and VBR traffic, QOS of ABR CLR. The simulation results show the proposed method achieves excellent CLR and average cell delay performance for the various ATM traffic services in the Queue Sharing structure.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.6
• /
• pp.359-365
• /
• 2005

This paper presents an reduced-order near-optimal controller for the congestion control of Available Bit Rate (ABR) service in Asynchronous Transfer Mode (ATM) networks. We introduce the model, of a class of ABR traffic, that can be controlled using a Explicit Rate feedback for congestion control in ATM networks. Since there are great computational complexities in the class of optimal control problem for the ABR model, the near-optimal controller via reduced-order technique is applied to this model. It is implemented by the help of weakly coupling and singular perturbation theory, and we use bilinear transformation because of its computational convenience. Since the bilinear transformation can convert discrete Riccati equation into continuous Riccati equation, the design problems of optimal congestion control can be reduced. Using weakly coupling and singular perturbation theory, the computation time of Riccati equations can be saved, moreover the real-time congestion control for ATM networks can be possible.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1880-1893
• /
• 1996

In this paper, we propose the fuzzy traffic control method in ABR service for the effective use of ATM link. This method, a modified version of EPRCA which is one of rate control methods in ABR service, controls the values of the transmission rates of source by using the fuzzy traffic inference based on switch buffer size and buffer variate rate. For this method, we developed a model and algorithm of the fuzzy traffic control method and a fuzzy traffic controller, after studying fuzzy and neural networks which applied to ATM traffic control and EPRCA. For the fuzzy traffic controller, we also designed a membership function, fuzzy control rules and a max-min inferencing method. We conducted a simulation and compared the link utilization of the fuzzy traffic control method with that of the EPRCA method. The results of the simulation indicated that, compared to EPRCA, the fuzzy traffic control method improves the link utilization by 2.3% in a normal distribution model and by 2.7% in the MMPP model of the source.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.9
• /
• pp.3011-3018
• /
• 2000

On ATM networks, ABR services are provided using the remained bandwidth after allocating CBR and VBR traffic. Realtime services such as transmitting audio or video data may be provided using CBR and VBR which have a constrained transmission delay, but in these cases, the communications bandwidth may be wasted. This paper proposes an efficient bandwidth allocation algorithm to transfer real-time data using ABR service. The proposed algorithm guarantees MCR and allocates bandwidth to each connection proportional to its MCR. The proposed algorithm divides the connections in two groups - a satisfied state group and a bottlenecked state group - and enhances bandwidth utilization by allowing the remained bandwidth after allocating the connections in the satisfied state to be allocated to the connections in the bottlenecked state. Our algorithm uses a Queue control function proposed by Ghani[5] to keep the Queue length within some boundary, which makes the transmission delay constant. We simulate and compare the performance of the proposed algorithm with that of the algorithms proposed by ATM Forum[1] and Kalampoukas[2].