• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1345-1362
• /
• 2019

Most active queue management algorithms manage network congestion based on the size of the queue but ignore the network environment which makes queue size change. It seriously affects the response speed of the algorithm. In this paper, a new AQM algorithm named CT-AQM (Change Trend-Adaptive Queue Management) is proposed. CT-AQM predicts the change trend of queue size in the soon future based on the change rate of queue size and the network environment, and optimizes its dropping function. Simulation results indicate that CT-AQM scheme has a significant improvement in loss-rate and throughput.

• Journal of Communications and Networks
• /
• v.6 no.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.

• International journal of advanced smart convergence
• /
• v.2 no.1
• /
• pp.6-11
• /
• 2013

Network Coding (NC) is a new paradigm for network communication. In network coding, intermediate nodes create new packets by algebraically combining ingress packets and send it to its neighbor node by broadcast manner. NC has rapidly emerged as a major research area in information theory due to its wide applicability to communication through real networks. Network coding is expected to improve throughput and channel efficiency in the wireless multi-hop network. Many researches have been carried out to employ network coding to wireless ad-hoc network. In this paper, we proposed a dynamic queue management to improve coding opportunistic to enhance efficiency of NC. In our design, intermediate nodes are buffering incoming packets to encode queue. We expect that the proposed algorithm shall improve encoding rate of network coded packet and also reduce end to end latency. From the simulation, the proposed algorithm achieved better performance in terms of coding gain and packet delivery rate than static queue management scheme.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.2
• /
• pp.81-94
• /
• 2012

This paper suggests PARED algorithm, a modified RED algorithm, that actively reacts to dynamic changes in network to apply packet drop probability flexibly. The main idea of PARED algorithm is that it compares the target queue length to the average queue length which is the criterion of changes in packet drop probability and feeds the gap into packet drop probability. That is, when the difference between the average queue length and the target queue length is great, it reflects as much as the difference in packet drop probability, and reflects little when the difference is little. By doing so, packet drop probability could be actively controled and effectively dealt with in the network traffic situation. To evaluate the performance of the suggested algorithm, we conducted simulations by changing network traffic into a dynamic stat. At the experiments, the suggested algorithm was compared to the existing RED one and then to ARED one that provided the basic idea for this algorithm. The results proved that the suggested PARED algorithm is superior to the existing algorithms.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.43-51
• /
• 2002

In this paper, we study the new packet dropping scheme using an active queue management algorithm. Active queue management mechanisms differ from the traditional drop tail mechanism in that in a drop tail queue packets are dropped when the buffer overflows, while in active queue management mechanisms, packets may be dropped early before congestion occurs, However, it still incurs high packet loss ratio when the buffer size is not large enough, By detecting congestion and notifying only a randomly selected fraction of connection, RED causes to the global synchronization and fairness problem. And also, it is the biggest problem that the network traffic characteristics need to be known in order to find the optimum average queue length, We propose a new efficient packet dropping method based on the active queue management for congestion control. The proposed scheme uses the per-flow rate and fair share rate estimates. To this end, we present the estimation algorithm to compute the flow arrival rate and the link fair rate, We shows the proposed method improves the network performance because the traffic generated can not cause rapid fluctuations in queue lengths which result in packet loss

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.3
• /
• pp.319-330
• /
• 2002

We consider BMAP/G/1 queueing system with N-policy and multiple vacations. We derive the vector generating functions of the queue length in a factorized form and interpret the factorization. We also derive the mean queue length.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.117-133
• /
• 1990

This paper is concerned with determining a minisum location with jockeying for a server on a probabilistic network in which each customer type enters the network system permitting with jockeying through a specified node and a nonpreemptive service policy is in effect. An algorithm to locate a single Fixed Priority Queue Median with Jockeying (FPQMJ) on acyclic networks is developed by using the Generalized Benders' Decomposition technique. The results are then extended to a general network.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.2
• /
• pp.285-291
• /
• 2008

Active Queue Management(AQM) has been widely used for congestion avoidance in Transmission Control Protocol(TCP) networks. Although numerous AQM schemes have been proposed to regulate a queue size close to a reference level, most of them are incapable of adequately adapting to TCP network dynamics due to TCP's non-linearity and time-varying stochastic properties. To alleviate these problems, we introduce an AQM technique based on a dynamic neural network using the Back-Propagation(BP) algorithm. The dynamic neural network is designed to perform as a robust adaptive feedback controller for TCP dynamics after an adequate training period. We evaluate the performances of the proposed neural network AQM approach using simulation experiments. The proposed approach yields superior performance with faster transient time, larger throughput, and higher link utilization compared to two existing schemes: Random Early Detection(RED) and Proportional-Integral(PI)-based AQM. The neural AQM outperformed PI control and RED, especially in transient state and TCP dynamics variation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.227-231
• /
• 2004

In this paper, a robust Sliding Mode Variable Structure (SMVS) controller is designed for Active Queue Management (AQM). This type of controller is insensitive to noise and variance of the parameters, thus it is suitable to time varying network systems. Simulation results conform the robust performance of SMVS controller against the disturbance. At the same time, a complete comparison between SMVS and PI controllers is made. The conclusion is that both transient and steady state performance of SMVS controller is better than that of PI one.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.177-183
• /
• 2007

Active queue management (AQM) refers to a family of packet dropping mechanisms for router queues that has been proposed to support end-to-end congestion control mechanisms in the Internet. The proposed AQM algorithm by the IETF is Random Early Detection (RED). The RED algorithm allows network operators simultaneously to achieve high throughput and low average delay. However. the resulting average queue length is quite sensitive to the level of congestion. In this paper, we propose the Refined Adaptive RED(RARED), as a solution for reducing the sensitivity to parameters that affect RED performance. Based on simulations, we observe that the RARED scheme improves overall performance of the network. In particular, the RARED scheme reduces packet drop rate and improves goodput.