• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.36-48
• /
• 1991

In this study, an efficient algorithm is developed to compute steady state probabilities for the following M$_{x}$G/1 server vacation system under control-operating poligy: At the end of a busy period, the server takes a sequence of vacations, each for a random amount of time. At the end of each vacation, he inspects the length of the queue. If the queue length at this time is equal to or greater than a prespecified threshold value r, he begins to serve the queue until it is empty.y.

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

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). While active queue management in routers and gateways can potentially reduce total packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use queue lengths as the indicator of the severity of congestion. In this paper, in order to solve this problem, a new active queue management algorithm called MRED(Modified Random Early Detection) is proposed. MRED computes the packet drop probability based on our heuristic method rather than the simple method used in RED. Using simulation, MRED is shown to perform better than existing queue management schemes. To analyze the performance, we also measure throughput of traffics under the FIFO control, and compared the performance with that of this MRED system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.121-124
• /
• 2002

In Diffserv Network, RIO is the most effective active queue management algorithm. RIO, the enhanced queue management algorithm from RED, divides IN and OUT packets and manages them differently. one of the main problems for the implementation of RIO is the Bandwidth Skew problem for providing the Assured Service. In this paper, we will show the bandwidth skew problem in RIO and provide an enhanced RIO mechanism that will alleviate the bandwidth skew problem.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.39-44
• /
• 2003

The network performance gets down during congestion periods to solve the problem effectively. A RED(Random Earl Detection) algorithm of the queue management algorithm is proposed and IETF recommends it as a queue management. A RED algorithm controls a congestion aspect dynamically. In analyzing parameters when static value of parameter is set in the gateway cannot be handled the status of current network traffic properly We propose the Effective RED algorithm to solve with the weakness of RED In this algorithm the maximum drop probability decides to accept or drop the interning packets, is adjusted dynamically on the current queue state for controlling the congestion phase effectively in the gateway. This algorithm is confirmed by computer simulation using the NS(Network Simulator)-2.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.3
• /
• pp.53-58
• /
• 2019

This paper proposes a class-based FQ-CoDel(Flow Queue-Control Delay) algorithm. A variety of application system services create bottlenecks in tactical communication network and the bottlenecks cause some problems such as traffic loss and delay. Therefore, more research on effective traffic processing is needed. The proposed class-based FQ-CoDel algorithm, suggests dynamic buffer management and scheduling, classifies specific packets in each queue according to service attribute and criticality and checks periodically latency of the packets in each queue. Also, it abandons the packets if some packets stay in queue above schedule time and manages the total amount of traffic stored in queue with certain level.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.121.1-121
• /
• 2001

Congestion control is a critical issue in TCP networks, Recently, active queue management (AQM) was proposed for congestion control at routers. The random early detection RED algorithm is widely known in the AQM algorithms, We present an adaptive nonlinear RED (NRED) algorithm, which has nonlinear drop probability profile. The proposed algorithm enhanced the performance of the RED algorithm by the self-parameterization based on the traffic load Furthermore, the proposed algorithm can effectively adapt itself between he RED and the drop-tail queue management by adopting proper nonlinearity in the drop probability profile. Through simulation, we show the effectiveness of the proposed algorithm comparing with the drop-tail and the original RED algorithm.

• International Journal of Computer Science & Network Security
• /
• v.23 no.4
• /
• pp.123-133
• /
• 2023

Active queue management (AQM) is a leading congestion control system, which can keep smaller queuing delay, less packet loss with better network utilization and throughput by intentionally dropping the packets at the intermediate hubs in TCP/IP (transmission control protocol/Internet protocol) networks. To accelerate the responsiveness of AQM framework, proportional-integral-differential (PID) controllers are utilized. In spite of its simplicity, it can effectively take care of a range of complex problems; however it is a lot complicated to track down optimal PID parameters with conventional procedures. A few new strategies have been grown as of late to adjust the PID controller parameters. Therefore, in this paper, we have developed a Squirrel search based PID controller to dynamically find its controller gain parameters for AQM. The controller gain parameters are decided based on minimizing the integrated-absolute error (IAE) in order to ensure less packet loss, high link utilization and a stable queue length in favor of TCP networks.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.6
• /
• pp.140-148
• /
• 2011

Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic. To deal with these problems, a study on algorithm that can provide high quality multimedia service by considering both network congestion and characteristics of multimedia data is required. In this paper, we propose APQM algorithm which probabilistically removes packet by the congestion level of the queue in wireless station. The comparison with other existing scheduling algorithms shows tht congestion in the network is reduced and multimedia service quality of the proposed algorithm is improved.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.93-105
• /
• 2006

The domination of the Internet by TCP-based services has spawned many efforts to provide high network utilization with low loss and delay in a simple and scalable manner. Active queue management (AQM) algorithms attempt to achieve these goals by regulating queues at bottleneck links to provide useful feedback to TCP sources. While many AQM algorithms have been proposed, most suffer from instability, require careful configuration of nonintuitive control parameters, or are not practical because of slow response to dynamic traffic changes. In this paper, we propose a new AQM algorithm, hybrid random early detection (HRED), that combines the more effective elements of recent algorithms with a random early detection (RED) core. HRED maps instantaneous queue length to a drop probability, automatically adjusting the slope and intercept of the mapping function to account for changes in traffic load and to keep queue length within the desired operating range. We demonstrate that straightforward selection of HRED parameters results in stable operation under steady load and rapid adaptation to changes in load. Simulation and implementation tests confirm this stability, and indicate that overall performances of HRED are substantially better than those of earlier AQM algorithms. Finally, HRED control parameters provide several intuitive approaches to trading between required memory, queue stability, and response time.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.181-183
• /
• 2002

현재의 인터넷 라우터는 Drop tail 방식으로 큐 안의 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인해 발생하는 혼잡 상황을 명시적으로 해결 한 수 없다. 이 문제를 해결하기 위해 IETF (Internet Engineering Task Force)에서는 RED(Random Early Detection)알고리즘과 같은 능동적인 큐 관리 알고리즘(AQM: Active Queue Algorithm)을 제시하였다. 하지만 RED 알고리즘은 네트워크 환경에 따른 매개 변수의 설정의 어려움을 가지고 있어 잘못된 매개변수 설정으로 인하여 네트워크 성능을 저하시키는 문제를 발생시키며 전체 망에 불안정한 혼잡제어를 야기 시킨다. 본 논문에서는 기존의 AQM를 개선한 SOQuM(Stabilized Operation of Queue Management) 알고리즘을 제안하였다. 제안한 알고리즘의 성능을 검증하기 위해 기존의 방법과 시뮬레이션을 이용하여 비교하였다.