• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.5
• /
• pp.973-980
• /
• 2005

In this paper, we analyze previous flow control algorithm for serving ABR traffic, and then propose the algorithm which calculate fair transmission rate and control efficiently ABR traffic using VS/VD switch which has an effect on PNNI environment with long delay. For getting the transmission rate, the proposed algorithm use FMMRA as ER scheme which calculate exactly the fair share. And, in large delay state, we can obtain fair cell sharing by calculating transmission rates which obtained by transmitted queue length information of VD to VS for serve and drain cell in queue Through the computer simulation, we evaluate the performance of proposed algorithm. According to the results, the proposed algorithm shows good performance.

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

ABR 은 ATM의 서비스 중에서 가장 최근에 추가된 것으로서 트래픽 소스의 전송률을 제어하기 위해서 피드백 메커니즘을 사용한다. ABR 서비스의 성능은 스위치를 통해서 피드백되는 RM 셀에 의해서 결정적인 영향을 받는다. ATM 표준에는 EPRCA, CAPC, ERICA 등의 알고리즘을 다루고 있다. 하지만 이러한 스위치 알고리즘에 대한 성능평가 및 분석 은 자세히 이루어지지 않고 있다. 본 논문에서는 현재 사용중인 ABR 스위치 알고리즘 중 단순히 큐의 길이에 위해 폭주를 판단하는 EPRCA 방법에 대해서 자세히 분석하고 EPRCA 의 단점을 극복하기 위해서 큐의 길이뿐만 아니라 새로운 변수 즉 평균 분산 및 표준편차을 이용해서 각 송신원의 공정성을 높이고 시스템의 효율성을 증대시키는 방안을 제시한다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.30-35
• /
• 2000

초고속통신의 실현과 다양한 멀티미디어정보의 QoS를 향상시키기 위한 ATM 방식은 TCP/IP 통신의 기본적인 전송 매카니즘으로 사용되고 있다. TCP가 ATM 망에서의 ABR서비스를 사용할 때 ABR의 율 기반 제어와 TCP 흐름제어사이에 상호작용이 없는 한, 이런 환경하에서 ATM망의 ABR 트래픽을 좀더 효율적으로 제어하기위해서는 EFCI-ER 스위치 방식의 상호혼용 운영이 불가피하다. 본 논문에서는 이러한 상호혼용을 위하여 EFCI-ER 스위치의 혼용망을 모델로 하여 여러 가지 ER 스위치 알고리즘을 이용하여 대역할당의 공정성 셀손실을 그리고 처리율을 구하였다. 시뮬레이션 결과로써 여러 가지 ER 스위치 알고리즘중에서 망의 형태에 영향을 덜 받으면서 VC(Virtual Channel) 에 공정하게 대역폭을 할당할 수 있는 하나의 알고리즘을 나타내었다.

• 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 알고리즘의 성능과 비교 분석한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1089-1098
• /
• 2001

WRR 스케줄링 알고리즘은 계산의 단순성과 저 비용 구현의 장점을 가지고 있어 고속 패킷 스위칭 네트워크에서 널리 쓰이고 있지만 버스티한 트래픽에 대해서는 입력 트래픽을 일정 비율로 스케줄링하기 때문에 효율성이 낮다는 문제점이 있다. 또한, WRR 알고리즘은 ABR 서비스 클래스의 공평성 기준의 하나인 Maximum of MCR or Max-Min share 공평성을 만족시키지 못한다. 따라서 ABR 서비스를 위한 공평성 기준을 만족시키는 스케줄링 알고리즘이 필요하다. 따라서, 본 논문에서는 ABR 서비스를 위한 5가지 공평성 기준들 중 Maximum of MCR or Max-Min share를 만족시키는 스케줄링 알고리즘을 제안한다. 제안된 알고리즘이 공평성 기준을 만족시키고, 네트워크 자원을 각 ABR VC들에게 공평하게 할당해 주는지를 컴퓨터 시뮬레이션을 통하여 WRR 알고리즘과 비교, 분석한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.2
• /
• pp.307-312
• /
• 2000

Asynchronous transfer mode(ATM) is flexible to support the various multimedia communication services such as data, voice, and image by applying asynchronous time-sharing and statistical multiplexing techniques to the existing data communication. ATM service is categorized to CBR, VBR, UBR, and ABR according to characteristics of the traffic and a required service qualities. Among them, ABR service guarantees a minimal bandwidth and can transmit cells at a maximum transmission rate within the available bandwidth. To minimize the cell losses in transmission and switching, a feedback information in ATM network is used to control the traffic. In this paper, predictive control algorithms are proposed for the feedback information. When the feedback information takes a long propagation delay to the backward nodes, ATM switch can experience a congestion situation from the queue length increases, and a high queue length fluctuations in time. The control algorithms proposed in this paper provides predictive control model using slop changes of the queue length function and previous data of the queue lengths. Simulation shows the effectiveness result of the proposed control algorithms.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.9
• /
• pp.28-34
• /
• 1998

In ATM networks CBR data traffic is sent in constant bit rate, and VBR data traffic in variable bit rate. Therefore unused bandwidth at network capacity may exist. To avoid waste of network resourcesm, ABR traffic utilizes the unused bandwidth to the utmost after CBR and VBR data traffic being first served. In this paper, a transfer rate-based congestion control algorithm is proposed for efficient ABR service in ATM networks. In the proposed algorithm the ATM switch first calculates bandwidth according to variable cell transfer rate in an ABR source. records this value in ER field in a RM cell, and then transmits a RM Cell to an ABR source. In this way the proposed algorithm dynamically allocates bandwidth to each ABR source, and the switch also can rapidly adapt to a change of a transfer rate of an source. The performance simulation of the proposed algorithm has batter performance in terms of source condition and link utilization.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.1-10
• /
• 2000

ATM network technology is generally used for the solution of integrating multimedia service in high-speed Internet. In Internet protocol based on ATM services, If single cell is lost in ATM layer, the entire TCP packet will be lost. Therefore, TCP performance will be degraded. In order to reduce cell loss, when congestion occur, UBR+EPD mechanism is proposed to improve the throughput in TCP over UBR, and ER scheme is suggested in TCP over ABR. In this paper, we analyzed the performance improvement effect of UBR+EPD with FRR (Fast Retransmission and Recovery), the adjusting EPD threshold parameter (R), and variation of MTU (Maximum Transport Unit) size. As a result, through the analysis of performance, we know that the improved throughput and fairness are shown by the proposed scheme.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.527-539
• /
• 2001

The wireless asynchronous transfer mode (ATM) system has the advantage of providing the broadband services with various quality-of-service requirements to the mobile terminal efficiently by utilizing the ATM technology developed for the wired ATM system. The available bit rate (ABR) service among various ATM services utilizes the available bandwidth remaining in the ATM link, which allows the efficient bandwidth usage. During the handoff of the mobile terminal, however, the queue length in the access point (AP) which resides in the boundary of the wired ATM network and the wireless ATM network may increase abruptly. In this paper, we propose a scheme which prevents the buffer-overflow and buffer-underflow in the AP during the handoff of the wireless ABR connection in the wireless ATM system using binary feedback rate-based ABR traffic control. This scheme controls the source's cell generation rate during both handoff period and some time interval after the completion of the handoff procedure. The simulation results show that the proposed scheme prevents the buffer-overflow and buffer-underflow. The proposed scheme can contribute to increasing the throughput of the wireless ABR service during handoff by preventing the buffer overflow and underflow during handoff period.

• 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].