• 전자공학회논문지S
• /
• 제35S권3호
• /
• pp.29-38
• /
• 1998

This ppaer suggests a congestion control scheme for CL(ConnectionLess) overlay network using the feedback loops getween CL werver, between CL servers, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadband Data Service) defined by ITU0T(International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In this CL overlay network, two kinds of congestions, link congestion and CL server congestion, may occur. We suggest a scheme that can solve the congestion using ABR(Available Bit Rate) feedback control loop, the traffic control mechanism. This scheme is the link-by-link method suing the ABR feedback control loops between CL user and CL server or between CL servers, and the header translation table of CL server. As CL servers are always endpoints of ABR connections, the congestion staturs of the CL server can be informed to the traffic sources using RM(Resource Management) cell of the ABR feedback loops. Also CL server knows the trafffic sources making congestion by inspecting the source address field of CLNAP-PDUs(ConnectionLess Network Access Protocol - Protocol Data Units). Therefore this scheme can be implemeted easily using only both ABR feedback control loop of ATM layer and the congestion state table using the header translation table of CL server because it does not require separate feedback links for congestion control of CL servers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4342-4366
• /
• 2016

Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

• Journal of Communications and Networks
• /
• 제6권2호
• /
• pp.133-146
• /
• 2004

Recently, many active queue management (AQM) algorithms have been proposed to address the performance degradation. of end-to-end congestion control under tail-drop (TD) queue management at Internet routers. However, these AQM algorithms show performance improvement only for limited network environments, and are insensitive to dynamically changing network situations. In this paper, we propose an adaptive queue management algorithm, called PID-controller, that uses proportional-integral-derivative (PID) feedback control to remedy these weak-Dalles of existing AQM proposals. The PID-controller is able to detect and control congestion adaptively and proactively to dynamically changing network environments using incipient as well as current congestion indications. A simulation study over a wide range of IP traffic conditions shows that PID-controller outperforms other AQM algorithms such as Random Early Detection (RED) [3] and Proportional-Integral (PI) controller [9] in terms of queue length dynamics, packet loss rates, and link utilization.

• 한국산학기술학회:학술대회논문집
• /
• 한국산학기술학회 2003년도 Proceeding
• /
• pp.236-242
• /
• 2003

ATM ABR service controls network traffic using feedback information on the network congestion situation in order to guarantee the demanded service qualities and the available cell rates. In this paper we apply the control method using queue length prediction to the formation of feedback information for more efficient ABR traffic control. If backward node receive the longer delayed feedback information on the impending congestion, the switch can be already congested from the uncontrolled arriving traffic and the fluctuation of queue length can be inefficiently high in the continuing time intervals. The feedback control method proposed in this paper predicts the queue length in the switch using the slope of queue length prediction function and queue length changes in time-series. The predicted congestion information is backward to the node. NLMS and neural network are used as the predictive control functions, and they are compared from performance on the queue length prediction. Simulation results show the efficiency of the proposed method compared to the feedback control method without the prediction. Therefore, we conclude that the efficient congestion and stability of the queue length controls are possible using the prediction scheme that can resolve the problems caused from the longer delays of the feedback information.

• International Journal of Control, Automation, and Systems
• /
• 제4권1호
• /
• pp.53-62
• /
• 2006

In this paper, ATM network congestion control with explicit rate feedback is considered. In ATM networks, delays commonly appear in data transmission and have to be considered in congestion control design. In this paper, a bounded single round delay on the return path is considered. Our objective is to design an explicit rate feedback control that achieves a robust optimal $H_2$ performance regardless of the bounded time-varying delays. An optimization approach in terms of linear matrix inequalities (LMIs) is given. Saturation in source rate and queue buffer is also taken into consideration in the proposed design. Simulations for the cases of single source and multiple sources are presented to demonstrate the effectiveness of the design.

• 한국통신학회논문지
• /
• 제30권7B호
• /
• pp.481-488
• /
• 2005

멀티미디어 응용 서비스에 대한 요구가 증대됨에 따라 멀티미디어 혼잡제어 알고리즘에 대한 연구가 더욱 중요시되고 있다. 그러나 기존에 제안된 혼잡제어 알고리즘들은 혼잡 상황 판단을 위하여 RTT를 사용하기 때문에 데이터 전송 경로의 혼잡 상황과 회신 정보 회신 경로의 혼잡 상황을 정확히 구분하지 못하는 단점이 있다. 본 논문에서는 OTT를 사용하여 네트워크 혼잡 상황을 판단하도록 제안된 RRC-OTT(Receiver-based Rate Control with One-way Trip Time) 알고리즘의 장점을 활용하여 데이터 전송 경로와 회신 정보 회신 경로의 혼잡 상황 판단을 분리하도록 하였고, 특히 회신 경로의 혼잡 상황이 데이터 전송 경로에 미치는 영향을 최소화하는 알고리즘을 제안하였다. 제안된 알고리즘의 성능 평가를 통하여 기존 혼잡제어 알고리즘과 달리 RRC-OTT 알고리즘은 회신 경로의 혼잡 상황에 영향을 받지 않고 일정한 성능을 보임을 입증하였다.

• 한국정보과학회논문지:정보통신
• /
• 제27권1호
• /
• pp.58-67
• /
• 2000

본 논문에서는 실시간 멀티미디어 데이타의 멀티캐스트 혼잡 제어를 위한 대표자 기반의 피드백 수렴 방법과 전송율 조정 방법을 제안한다. 멀티캐스트 혼잡 제어에서는 다수의 수신자들이 하나의 송신자에게 피드백을 전송하므로 피드백 폭주 문제가 발생하는데 이러한 문제를 해결하기 위해 본 논문에서는 대표자를 사용한다. 본 논문에서 제안하는 방법에서 수신자는 패킷 손실률을 담은 주기적인 피드백을 생성하고 송신자는 대표자의 계층구조를 이용해 이러한 피드백을 수렴하여 전송률을 조정한다. 대표자는 지역 단위로 선정되고 필터의 역할을 하여 피드백을 억제한다. 시뮬레이션 결과, 제안한 방법이 피드백 폭주 문제를 해결하면서 혼잡 상황에 대처하여 전송률을 조정할 수 있음을 볼 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2405-2407
• /
• 2003

We propose a feedback-based congestion control algorithm for the wireless TCP network. In this paper, we present a new TCP protocol to control the congestion window size. In particular, the asymptotic analysis of the wireless TCP is presented. Through simulations, our algorithm shows an improvement of TCP’s performance in wireless networks.

• 제어로봇시스템학회논문지
• /
• 제6권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.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.368-371
• /
• 1996

In this paper, a feedforward-plus-feedback control scheme is presented to prevent congestion in store-and-forward packet switching networks. The control scheme consists of two algorithms. Specifically, the input traffic adjustment algorithm employs a fairness policy such that the transmission rate of the input traffic is proportional to its offered rate. The control signal computation algorithms to ensure stability of the overall system in the robust sense and to ensure the desired transient behavior in the adaptive, with respect to variations of input traffic, are designed.