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

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.103-111
• /
• 1999

ATM 망의 혼잡상태를 회피하기 위하여 다양한 방법들이 제안되고 있으며, 이들 중에는 전송시스템에 존재하는 스위치의 버퍼 값에 지능형 마킹을 표시함으로서 각 전송회선에 공평한 대역폭을 할당하며 혼잡상태를 회피하는 방법이 있다 ATM Forum은 ATM 망에서 ABR 서비스의 혼잡제어를 위한 표준으로서 셀률 기반 혼잡제어기법을 적용하고 있다. EPRCA(Enhanced Proprotional Rate Control Algorithm)은 망의 상태를 항상 검사하는 것이 아니라 망의 혼잡이 발생하였을 때만 작동하기 때문에 부정확한 셀률 정보를 가질 수 있다. DMRCA(Dynamic Max Rate Control Algorithm)은 혼잡의 정도에 따라서 적절한 셀률을 부여하기 위하여 스위치에 임계값을 지정하며, 셀률은 스위치에서 제공되는 증가계수와 감소계수에 비례하여 변하게 된다. 본 논문은 DMRCA에서 혼잡제어를 위해서 적용하는 증가/감소변수의 크기 변화에 따른 공평대역할당의 수렴속도를 평가하여 최적의 변수값을 찾고자 한다.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.91-94
• /
• 1998

ATM technology is reaching a certain level of maturity that allow for its deployment in local as well as in wide area networks. Concurrently, audiovisual applications are foreseen as one of the major users of such broadband networks. We present in this paper requriement of real-time multimedia service on B-ISDN networks and simulating the transport of MPEG-2 encoded multimedia data over ATM networks using CBR, VBR, ABR of ATM Traffic Service. We compare each delay time considering network performance and propose need for real-time multimedia service.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.11
• /
• pp.962-966
• /
• 2001

The major problem at a branch point for point-to-multipoint available bit rate(ABR) services in asynchronous transfer mode (ATM) networks is how to consolidate backward resource management(BRM) cells from each branch for a multicast connection. In this paper, we propose an efficient feedback consolidation algorithm based on an adaptive dynamic threshold(ADT) to eliminate the consolidation noise and the reduce the consolidation delay. The main idea of the ADT algorithm lies in that each branch point estimates the ABR traffic condition of the network through the virtual queue estimation and the transmission threshold of the queue level in branch points is adaptively controlled according to the estimation. Simulation results show that the proposed ADT algorithm can achieve a faster response in congestion status and a higher link utilization compared with the previous works.

• Proceedings of the IEEK Conference
• /
• 2000.06c
• /
• pp.109-112
• /
• 2000

The EPRCA(Enhanced Proportional Rate Control Algorithm) is one of the explicit rate control algorithm recommended by the ATM forum. EPRCA algorithm is using only two threshold to buffer change is not considered for calculating ER value. In this paper to cover the shortage, two more variables are added for considering increase of buffer quantity. So calculating proper ER would avoid before getting into the congestion situation. To analysis the affect, EPRCA and proposed algorithm are compared through simulation by analysis of change of buffer length and ACR change

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3199-3208
• /
• 1999

Recently the number of Internet users have been drastically increased with the introduction of WWW browsers, which requires accommodation study of TCP/IP on ATM networks. There are a number of problems in operating IP-over-ATM efficiently because of limited functions and overhead of IP. According to recent research, the alternatives to TCP/IP efficiently because of limited functions and overhead of IP. According to recent research, the alternatives to TCP/IP over ABR or UBR have been suggested, and the required capacity of switch buffer and problems in TCP/IP over ABR have been researched. In this paper, we address problems caused by the features of HTTP traffic and suggest a solution for TCP over ABR. The performance of the methods suggested in this paper is verified through simulation under limited conditions.

• Electronics and Telecommunications Trends
• /
• v.14 no.1 s.55
• /
• pp.24-35
• /
• 1999

90년도 들어 WWW의 등장과 함께 TCP/IP를 이용하는 인터넷의 폭발적인 사용증가로 인해 TCP/IP를 ATM 네트워크에서 사용하기 위한 연구가 필요하게 되었다. 현재 IP의 제한적인 기능 및 여러 가지 오버헤드로 인해 ATM 네트워크에서 IP를 효율적으로 운용하는데 많은 문제가 따르고 있다. 현재까지의 연구로는 ABR 또는 UBR 위에서 TCP/IP를 서비스하는 방안이 제시되고 있고, ABR을 TCP/IP의 전송수단으로 사용하는 경우 발생될 수 있는 문제점 및 스위치에서의 버퍼 요구량 등에 대한 연구가 진행되어 왔다. 본 연구에서는 HTTP 트래픽이 갖는 특성으로 인해 TCP/ABR이 가질 수 있는 문제점을 도출하고 해결책을 제시했다. 향후에 제시된 방법들의 성능은 시뮬레이션 및 큐잉 이론 등을 이용한 해석이 필요하다.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.81-84
• /
• 2002

The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, Scheduling algorithm allocates network resources fairly to each VC. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.850-858
• /
• 2000

Increased network reliability is required as the size of communication network becomes larger and the bandwidth requirement is increasing. And preparing of backup path is required to protect the network from serious network failures in high speed network. In this paper, we construct multiple logical networks on a physical ATM network according to the ATM bearer service category(CBR, rt-VBR, nrt-VBR, ABR, UBR) defined by ATM Forum to support the required QoS(Quality of Service) and to manage the network more efficiently. We use backup path restoration algorithm rather than dynamic restoration to achieve rapid restoration when active path fails and we use fault management function in TINA. We propose a restoration scheme that is suitable for high-speed network.