A Fully Adaptive Active Queue Management Method for Congestion Prevention at the Router Buffer

Active queue management(AQM)methods manage the queued packets at the router buffer,prevent buffer congestion,and stabilize the network performance.The bursty nature of the traffic passing by the network routers and the slake behavior of the existing AQM methods leads to unnecessary packet dropping.This paper proposes a fully adaptive active queue management(AAQM)method to maintain stable network performance,avoid congestion and packet loss,and eliminate unnecessary packet dropping.The proposed AAQM method is based on load and queue length indicators and uses an adaptive mechanism to adjust the dropping probability based on the buffer status.The proposed AAQM method adapts to single and multiclass traffic models.Extensive simulation results over two types of traffic showed that the proposed method achieved the best results compared to the existing methods,including Random Early Detection(RED),BLUE,Effective RED(ERED),Fuzzy RED(FRED),Fuzzy Gentle RED(FGRED),and Fuzzy BLUE(FBLUE).The proposed and compared methods achieved similar results with low or moderate traffic load.However,under high traffic load,the proposed AAQM method achieved the best rate of zero loss,similar to BLUE,compared to 0.01 for RED,0.27 for ERED,0.04 for FRED,0.12 for FGRED,and 0.44 for FBLUE.For throughput,the proposed AAQM method achieved the highest rate of 0.54,surpassing the BLUE method’s throughput of 0.43.For delay,the proposed AAQM method achieved the second-best delay of 28.51,while the BLUE method achieved the best delay of 13.18;however,the BLUE results are insufficient because of the low throughput.Consequently,the proposed AAQM method outperformed the compared methods with its superior throughput and acceptable delay.

A FUZZY-LOGIC CONTROL ALGORITHM FOR ACTIVE QUEUE MANAGEMENT IN IP NETWORKS

Active Queue Management (AQM) is an active research area in the Internet community. Random Early Detection (RED) is a typical AQM algorithm, but it is known that it is difficult to configure its parameters and its average queue length is closely related to the load level. This paper proposes an effective fuzzy congestion control algorithm based on fuzzy logic which uses the pre- dominance of fuzzy logic to deal with uncertain events. The main advantage of this new congestion control algorithm is that it discards the packet dropping mechanism of RED, and calculates packet loss according to a preconfigured fuzzy logic by using the queue length and the buffer usage ratio. Theo- retical analysis and Network Simulator (NS) simulation results show that the proposed algorithm achieves more throughput and more stable queue length than traditional schemes. It really improves a router's ability in network congestion control in IP network.

Active Queue Management Exploiting the Rate Information in TCP-IP Networks

In this paper, we propose a new mechanism called explicit rate notification(ERN) to be used in end-to-end communications. The ERN scheme encodes in the header of transmission control protocol(TCP) packets information about the sending rate and the round trip time(RTT) of the flows. This new available information to the intermediate nodes(routers) is used to improve fairness, increase utilization, decrease the number of drops, and minimize queueing delays. Thus, it induces a better management of the queue. A comparison of our scheme with preexistent schemes, like the explicit congestion notification scheme, shows the effectiveness of the proposed mechanism.

An Active Queue Management Algorithm: CRED

By applying the method of average and variance, a new queue management algorithm named the Classified-Random Early Detection （CRED） algorithm is presented which can identify the media streaming, TCP traffic and other UDP traffic at the edge routers. The algorithm discriminates the slow start and the congestion control phase of the TCP traffic and combines the TCP congestion control with the IP congestion control to alleviate the congestion effectively. Simulation shows that CRED can not only make the media streaming obtain the resources needed but also protect the TCP traffic transmitted effectively and reliably.

Hop distance fairness for wireless mesh network based on queue management

Wireless mesh network （WMN） is a new multi-hop network for broadband accessing to intemet. However, there exists a server unfairness problem based on different hop distances in WMN. To solve this problem, the unfairness issue was analyzed in test-bed experiment and NS2 simulation. A dynamic queue management scheme E-QMMN was proposed, which allocates the queue buffer according to the hop distance of every flow. The experimental results show that the proposed scheme can not only increase the hop distance fairness of the legacy scheme at most 50%, but also reduce the average round trip time at least 29% in congested WMN environments.

RED-DTB: A Dual Token Bucket Based Queue Management Algorithm

Improving the Quality of Service (QoS) of Internet traffic is widely recognized as a critical issue for the next-generation networks. In this paper, we present a new algorithm for the active queue management, namely RED-DTB. This buffer control technique is used to enforce approximate fairness among a large number of concurrent Internet flows. Like RED (Random Early Detection) algorithm, the RED-DTB mechanism can be deployed to actively respond to the gateway congestion, keep the gateway in a healthy state, and protect the fragile flows from being stolen bandwidth by greedy ones. The algorithm is based on the so-called Dual Token Bucket (DTB) pattern. That is, on the one hand, every flow is rate-limited by its own token bucket, to ensure that it can not consume more than its fair share of bandwidth; On the other hand, to make some compensations to less aggressive flows, such as connections with larger round trip time or smaller sending window, and to gain a relatively higher system utilization coefficient, all flows, depending on their individual behavior, may have a chance to fetch tokens from the public token bucket when they run out of their own share of tokens. The algorithm is analyzed and evaluated by simulations, and is proved to be effective in protecting the gateway buffer and controlling the fair allocation of bandwidth among flows.

A Robust Algorithm in Active Queue Management

A variable structure based control scheme was proposed for Active Queue Management(AQM) by using sliding model algorithm and reach law method. This approach aims to address the tradeoff between good performance and robustness with respect to the uncertainties of the round-trip time and the number of active connections. Ns simulations results show that the proposed design significantly outperforms the peer AQM schemes in terms of fluctuation in the queue length, packet throughput, and loss ratio. The conclusion is that proposed scheme is in favor of the achievement to AQM objectives due to its good transient and steady performance.

A DYNAMIC CROSS-LAYER DATA QUEUE MANAGEMENT APPROACH BASED ON PRIORITY FOR DELAY-TOLERANT MOBILE SENSOR NETWORKS

This paper presents a Dynamic Cross-layer Data Queue Management approach (DC-DQM) based on priority to address the priority deviation problem in Delay-Tolerant Mobile Sensor Networks (DT-MSNs). Receiver-driven data delivery scheme is used for fast response to data transfers, and a priority based interaction model is adopted to identify the data priority. Three interactive parameters are introduced to prioritize and dynamically manage data queue. The experimental results show that it can ameliorate data delivery ratio and achieve good performance in terms of average delay.

Fuzzy variable structure algorithms for active queue management with delay compensation

Based on the linearized model of the TCP connections through the congested routers, this paper puts forward an active queue management algorithm (FVS-T). The algorithm utilizes the fuzzy variable structure control algorithm with delay factor to compensate time varying round-trip times (RTT) and uncertainties with respect to the number of active TCP sessions. By analyzing the robustness and performance of the control scheme for the nonlinear TCP/AQM model, we show that the proposed design has good performance and robustness, which are central to the notion of AQM. Implementation issues were discussed and ns simulations were provided to validate the design and compare its performance to other peer schemes in different scenarios. The results show that the proposed design significantly outperforms the other congestion schemes in terms of packet loss ratio, throughput and buffer fluctuation.

Multi-indicator Active Queue Management Method

A considerable number of applications are running over IP networks.This increased the contention on the network resource,which ultimately results in congestion.Active queue management(AQM)aims to reduce the serious consequences of network congestion in the router buffer and its negative effects on network performance.AQM methods implement different techniques in accordance with congestion indicators,such as queue length and average queue length.The performance of the network is evaluated using delay,loss,and throughput.The gap between congestion indicators and network performance measurements leads to the decline in network performance.In this study,delay and loss predictions are used as congestion indicators in a novel stochastic approach for AQM.The proposed method estimates the congestion in the router buffer and then uses the indicators to calculate the dropping probability,which is responsible for managing the router buffer.The experimental results,based on two sets of experiments,have shown that the proposed method outperformed the existing benchmark algorithms including RED,ERED and BLUE algorithms.For instance,in the first experiment,the proposed method resides in the third-place in terms of delay when compared to the benchmark algorithms.In addition,the proposed method outperformed the benchmark algorithms in terms of packet loss,packet dropping,and packet retransmission.Overall,the proposed method outperformed the benchmark algorithms because it preserves packet loss while maintaining reasonable queuing delay.

A rate-based robust queue management system through multi-loop internal model controller with initial value compensation

An efficient congestion control approach should gain weighted fairness and also robustness against external disturbances.Moreover,variations in the number of active sources cause a network to operate as a switched system in which the initial values affect the transient response.The main contribution of this article is to design a rate-based adaptive robust queue management contemplating the initial value compensation(IVC).The congestion is avoided via Two-Degree-of-Freedom Internal Model Control protocol as a robust procedure.The utilisation factors are designated according to the delay of each source(weighted fairness)in which the sources will use the maximum value of the bottleneck capacity(maximum utilisation).On the other hand,the number of the users is determined adaptively and effects of non-zero initial values are eliminated through a protocol called IVC.Simulation results through Network Simulator 2 and Simulink software confirm the analytical results and the efficacy of the proposed method.

Design and Analysis of a Multiscale Active Queue Management Scheme

Since Internet is dominated by TCP-based applications, active queue management （AQM） is considered as an effective way for congestion control. However, most AQM schemes suffer obvious performance degradation with dynamic traffic. Extensive measurements found that Internet traffic is extremely bursty and possibly self-similar. We propose in this paper a new AQM scheme called multiscale controller （MSC） based on the understanding of traffic burstiness in multiple time scale. Different from most of other AQM schemes, MSC combines rate-based and queue-based control in two time scales. While the rate-based dropping on burst level （large time scales） determines the packet drop aggressiveness and is responsible for low and stable queuing delay, good robustness and responsiveness, the queue-based modulation of the packet drop probability on packet level （small time scales） will bring low loss and high throughput. Stability analysis is performed based on a fluid-flow model of the TCP/MSC congestion control system and simulation results show that MSC outperforms many of the current AQM schemes.

Analytical Modeling of a Multi-queue Nodes Network Router

This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.

Traffic Queuing Management in the Internet of Things: An Optimized RED Algorithm Based Approach

Congestion control is one of the main obstacles in cyberspace traffic.Overcrowding in internet traffic may cause several problems;such as high packet hold-up,high packet dropping,and low packet output.In the course of data transmission for various applications in the Internet of things,such problems are usually generated relative to the input.To tackle such problems,this paper presents an analytical model using an optimized Random Early Detection(RED)algorithm-based approach for internet traffic management.The validity of the proposed model is checked through extensive simulation-based experiments.An analysis is observed for different functions on internet traffic.Four performance metrics are taken into consideration,namely,the possibility of packet loss,throughput,mean queue length and mean queue delay.Three sets of experiments are observed with varying simulation results.The experiments are thoroughly analyzed and the best packet dropping operation with minimum packet loss is identified using the proposed model.

Fuzzy variable structure delay control algorithms and their applications to AQM

This paper analyzes the fuzzy variable structure control algorithms for delay systems and describes the compensation mechanism of the integral factor to the effect of the delay. Based on the linearized model of the congestion-avoidance flow-control mode of transmission control protocol (TCP), we present delay control algorithms for active queue management (AQM) and discuss the parameter tuning of the algorithms. The NS (network simulator) simulation results show that the proposed control scheme for the nonlinear TCP/AQM model has good performance and robustness with respect to the uncertainties of the round-trip time (RTT) and the number of active TCP sessions. Compared to other similar schemes, our algorithms perform better in terms of packet loss ratio, throughput and butter fluctuation.

A Buffer Management Scheme for Packet Queues in MANET

We introduce a new scheme of buffer management to handle packet queues in Mobile Ad hoc Networks （MANETs） for fixed and mobile nodes. In this scheme, we try to achieve efficient queuing in the buffer of a centrally communicating MANET node through an active queue management strategy by assigning dynamic buffer space to all neighboring nodes in proportion to the number of packets received from neighbors and hence controlling packet drop probabilities. Our simulation study reveals that the proposed scheme is a way to improve the buffer management for packet queues in MANET nodes in terms of packet loss ratio, transmission efficiency, and some other important system parameters.

Diffserv AQM algorithm for edge and core routers

The existing active queue management （AQM） algorithm acts on subscribers and edge routers only, it does not support differentiate-serve （Diffserv） quality of service （QoS）, while the existing diffserv QoS has not considered the link capacities between edge routers and connected core routers. When a core router in a two layers’ network experiences congestion, the connected edge routers have no ability to adjust their access data rates. Thus, it is difficult to achieve the congestion control for the large scale network with many edge routers and core routers. To solve these problems, two difffserve AQM algorithms are proposed for the congestion control of multilayer network. One diffserv AQM algorithm implements fair link capacities of edge routers, and the other one implements unequal link capacities of edge routers, but it requires the core routers to have multi-queues buffers and Diffserv AQM to support. The proposed algorithms achieve the network congestion control by operating AQM parameters on the conditions of proposed three theorems for core and edge routers. The dynamic simulation results demonstrate the proposed control algorithms for core and edge routers to be valid.

Using Lyapunov function to design optimal controller for AQM routers

It was shown that active queue management schemes implemented in the routers of communication networks sup-porting transmission control protocol (TCP) flows can be modelled as a feedback control system. In this paper based on Lyapunov function we developed an optimal controller to improve active queue management (AQM) router’s stability and response time, which are often in conflict with each other in system performance. Ns-2 simulations showed that optimal controller outperforms PI controller significantly.

Congestion control algorithm in large-delay uncertain networks

Based on Smith-fuzzy controller, a new active queue management （AQM） algorithm adaptable to the large-delay uncertain networks is presented. It can compensate the negative impact on the queue stability caused by the large delay, and it also maintains strong robustness under the condition of dynamic network fluid. Its stability is proven through Lyapunov method. Simulation results demonstrated that this method enables the queue length to converge at a preset value quickly and keeps the queue oscillation small, the simulation results also show that the scheme is very robust to disturbance under various network conditions and large delay and, in particular, the algorithm proposed outperforms the conventional PI control and fuzzy control when the network parameters and network delay change.

AN EFFECTIVE NETWORK CONGESTION CONTROL METHOD FOR MULTILAYER NETWORK

The congestion control problem in a single node network has been solved by the nonlinearfeedback control method,which has been proven to be effective and robust for different router’s queuesize.However,these control models are based on the single layer network architecture,and the sendersand receivers are directly connected by one pair of routers.With the network architecture being moreand more complex,it is a serious problem how to cooperate many routers working in the multilayernetwork simultaneously.In this paper,an effective Active Queue Management(AQM)scheme toguarantee the stability by the nonlinear control of imposing some restrictions on AQM parameter inmultilayer network is proposed.The nonlinear control can rely on some heuristics and network trafficcontrollers that appear to be highly correlated with the multilayer network status.The proposedmethod is based on the improved classical Random Early Detection(RED)differential equation and atheorem for network congestion control.The theorem proposed in the paper proved that the stability ofthe fluid model can effectively ensure the convergence of the average rate to its equilibrium pointthrough many routers in multilayer network.Moreover,when the network capacity is larger,theproposed scheme can still approach to the fullest extensibility of utilization and ensure the stability ofthe fluid model.The paper reveals the reasons of congestion control in multilayer network,provides atheorem for avoiding network congestion,and gives simulations to verify the results.