Active Queue Management Algorithm Research Articles

Performance Analysis of Fuzzy based RED for Congestion Control in MANET

In today’s world, nothing seems to be impossible, due to the astonishing advancements in science and technology. Now days, many humans are dependent on internet for their daily chores. But, congestion is one of the major issues, which affects the performance of such data networks. Thus, in order to control congestion, various schemes have been developed. In this research paper, the active queue management (AQM) scheme i.e. random early detection (RED) AQM algorithm is modified using fuzzy logic MATLAB tool, in such a manner that the efficient and reliable performance of the network can be maintained and improved as well. The results are verified with the help of QualNet 6.1 network simulator.

ENGLISH

Internet represents a shared resource wherein users contend for the finite network bandwidth. Contention among independent user demands can result in congestion, which in turn leads to long queuing delays, packet losses or both. Congestion control regulates the rate at which traffic sources inject packets into a network to ensure high bandwidth utilization while avoiding network congestion. This paper presents a new Active Queue Management algorithm in internet routers using a hybridization of multiresolution wavelet with the classical PID control (MR. Wavelet PID). The aim is to control the router queue length within a desired threshold queue level for a linearized TCP congestion model. The analytical results for a linearized TCP/AQM model are simulated using MATLAB. The performance of the proposed control scheme is evaluated for various network scenarios and the obtained results show the capability of the proposed controller to compensate for a wide range of TCP flows and link capacity variations.

Active queue management algorithm based on data-driven predictive control

Model predictive control (MPC) is a popular strategy for active queue management (AQM) that is able to incorporate physical and user defined constraints. However, the current MPC methods rely on explicit fluid model of TCP behavior with input time delay. In this paper, we propose a novel AQM algorithm based on data-driven predictive control, called Data-AQM. For Internet system with large delay, complex change and bad disturbance, data-driven predictive controller can be obtained directly based on the input---output data alone and does not require any explicit model of the system. According to the input---output data, the future queue length in data buffer, which is the basis of optimizing drop probability, is predicted. Furthermore, considering system constraints, the control requirement is converted to the optimal control objective, then the drop probability is obtained by solving the optimal problem online. Finally, the performances of Data-AQM are evaluated through a series of simulations.

Next-generation TCP for ns-3 simulator

Ns-3 simulator provides a great platform for experimental studies on different communication technologies and network topologies, and it is already used by many researchers all around the world. Unfortunately, its current TCP implementation is outdated and not ready for being used as reference platform for TCP-centered research, relegating ns-3 to play a background role in favor of its predecessor, ns-2.This paper presents the update process of ns-3 TCP module, that offers to TCP developers and researchers a consistent and RFC-compliant platform to base their works on. The method involves the addition of a new congestion-based state machine, the split of congestion control out from the socket core, and the development of a very detailed and complete testing framework, which can be easily extended.Performance tests follow the description, comparing RAM usage and execution time between ns-3 releases. Also, a case study over high-delay links on the interaction between the Transmission Control Protocol (TCP) and CoDel, an Active Queue Management algorithm born to control queuing delay, is presented.

On fairness and application performance of active queue management in broadband cable networks

We evaluate the performance of modern delay-based active queue management (AQM) algorithms in downstream DOCSIS 3.0 cable environments. Our simulation-based study involves scenarios that include tiered service levels and application workloads that include FTP, HTTP-based adaptive streaming (HAS), VoIP, and web traffic.Our results show that AQM maintains target queuing delays and consequently provides strong isolation between responsive high bandwidth and low bandwidth latency sensitive flows. We also show that lowering target queuing delays exacerbates TCP’s RTT unfairness. Nevertheless, in the scenarios that we studied, observed application performance was not significantly impacted by the specific AQM in use.With the potential large deployment of AQM imminent for DOCSIS 3.0, the analysis presented in this paper provides timely feedback to the community concerning how delay-based AQM can manage bandwidth allocation fairness and application performance in realistic downstream DOCSIS 3.0 cable network systems.

The Good, the Bad and the WiFi: Modern AQMs in a residential setting

Several new active queue management (AQM) and hybrid AQM/fairness queueing algorithms have been proposed recently. They seek to ensure low queueing delay and high network goodput without requiring parameter tuning of the algorithms themselves. However, extensive experimental evaluations of these algorithms are still lacking. This paper evaluates a selection of bottleneck queue management schemes in a test-bed representative of residential Internet connections of both symmetrical and asymmetrical bandwidths as well as WiFi. Latency under load and the performance of VoIP and web traffic patterns are evaluated under steady state conditions. Furthermore, the impact of the algorithms on fairness between TCP flows with different RTTs, and also the transient behaviour of the algorithms at flow startup is examined. The results show that while the AQM algorithms can significantly improve steady state performance, they exacerbate TCP flow unfairness. In addition, the evaluated AQMs severely struggle to quickly control queueing latency at flow startup, which can lead to large latency spikes that hurt the perceived performance. The fairness queueing algorithms almost completely alleviate the algorithm performance problems, providing the best balance of low latency and high throughput in the tested scenarios. However, on WiFi the performance of all the tested algorithms is hampered by large amounts of queueing in lower layers of the network stack inducing significant latency outside of the algorithms’ control.

Fuzzy Neuro Approach for Active Queue Management

Out internet is growing dressily day and night. One of the major problem in internet is to reduce the loss of packet during transmission. There are various nodes or devices so called router, switch, hub, and repeater are there between sender and receiver. Since the responsibility of network layer to transfer the packet to source to destination. Router is a network layer device, which route the data packets. Router give the path to the packets so that they reach the destination with minimum time and minimum loss. Each and every router has a buffer space in which packets wait for processing. This is known as queue of packets. These are also known as active queue, because they are alive they are waiting for processing they wait due to router processor speed, incoming packet rate, outgoing packet rates also due to difference of band width between incoming and outgoing packets. There are various active queue management mechanism or algorithm were developed such as RED, BLUE, SFB, CHOKE, PURPLE etc. but have their pros and cons. In this paper active queue management is done by using fuzzy logic. Basically fuzzy logic is used for decision making. Same here which packet have to drop or which not will be decided by fuzzy logic and some parameters which are used in this paper. There will be some membership graphs and rules and Mamdani mechanism use to get appropriate answer. Also a dataset is used to validate the theory.

LRURC: A Low Complexity and Approximate Fair Active Queue Management Algorithm for Choking Non-Adaptive Flows

Active Queue Management is an effective way to improve the TCP's performance. However, due to the existence of non-adaptive flows, most previous schemes cannot achieve efficiency, fairness, and easy-to-deploy simultaneously. In this paper, a novel scheme, named LRURC, is proposed to improve the fairness among different flows and reduce the flow completion time when the high-bandwidth non-adaptive flows arise. Motivated by the CHOKe algorithm, the LRURC adopts the sample-match mechanism to identify high-bandwidth flows. Furthermore, the least-recently-used mechanism is introduced to manage the high-bandwidth flows. Different from most other schemes, the LRURC calculates the packet dropping probability according to the flows' rate, which is estimated by the sample-match mechanism. This can achieve fairness effectively and reduce the influence of high-bandwidth non-adaptive flows. When the flow is not hit by the sample-match mechanism, the packet dropping probability remains constant. Simulation results show that LRURC can improve the fairness among different flows, reduce the completion time of adaptive flows, and hold the queue length around an expected value when high-bandwidth non-adaptive flows arise.

On the deterministic approach to active queue management

Virtually all known active queue management (AQM) algorithms, except for the two-category classifier (TCC), operate by calculating packet dropping probabilities. The probabilistic approach involves the necessity of using a type of random number generation upon every packet arrival at the router. Even if the generation of a single random value does not involve high computational complexity, the overhead becomes significant, considering the number of packets in a typical Internet environment. We propose a new AQM algorithm based on the deterministic approach. The algorithm offers a high throughput and a low loss ratio while maintaining a short and stable queue size. At the same time, the algorithm is of low computation complexity, which allows for energy-efficient implementations in routers. In addition to that, the proposed algorithm is universal--it provides high performance in a variety of distinct networking scenarios (diversified round-trip times, congestion levels, traffic types, etc.). Contrary to the TCC algorithm, the proposed algorithm does not make the decision whether to accept or drop the packet upon each packet arrival--the computation process is involved less frequently.

Active queue management in DOCSIS 3.1 networks

An important new feature in the DOCSIS 3.1 specification is active queue management (AQM). AQM provides a solution to the problem of providing good application layer quality of experience when multiple applications share a network connection. The need for AQM arises due to the presence of packet buffering in network elements and the mechanics of the TCP congestion avoidance algorithm. Based on simulated performance and implementation considerations, a variant of the Proportional Integral Controller Enhanced (PIE) algorithm, called DOCSIS-PIE, is now included in DOCSIS 3.1 and has recently been added to the DOCSIS 3.0 specification as well. Implementation of DOCSIS-PIE is mandatory for implementation in DOCSIS 3.1 cable modems, and recommended for implementation in DOCSIS 3.0 cable modems. In addition to the mandatory/ recommended algorithm, DOCSIS 3.1 and 3.0 cable modem vendors are free to support additional AQM algorithms of their choosing. For managing downstream traffic, the DOCSIS 3.1 specification mandates that the CMTS support an AQM technology, but does not require a specific algorithm. This article discusses the underlying problem that is addressed by AQM, the selection of DOCSIS-PIE as the algorithm of choice for DOCSIS 3.1 cable modems, and the expected performance of the algorithm in simulated network conditions.

EFRED: Enhancement of Fair Random Early Detection Algorithm

Quality of Service (QoS) generally refers to measurable like latency and throughput, things that directly affect the user experience. Queuing (the most popular QoS tool) involves choosing the packets to be sent based on something other than arrival time. The Active queue management is important subject to manage this queue to increase the effectiveness of Transmission Control Protocol networks. Active queue management (AQM) is an effective means to enhance congestion control, and to achieve trade-off between link utilization and delay. The de facto standard, Random Early Detection (RED), and many of its variants employ queue length as a congestion indicator to trigger packet dropping. One of these enhancements of RED is FRED or Fair Random Early Detection attempts to deal with a fundamental aspect of RED in that it imposes the same loss rate on all flows, regardless of their bandwidths. FRED also uses per-flow active accounting, and tracks the state of active flows. FRED protects fragile flows by deterministically accepting flows from low bandwidth connections and fixes several shortcomings of RED by computing queue length during both arrival and departure of the packet. Unlike FRED, we propose a new scheme that used hazard rate estimated packet dropping function in FRED. We call this new scheme Enhancement Fair Random Early Detection. The key idea is that, with EFRED Scheme change packet dropping function, to get packet dropping less than RED and other AQM algorithms like ARED, REM, RED, etc. Simulations demonstrate that EFRED achieves a more stable throughput and performs better than current active queue management algorithms due to decrease the packets loss percentage and lowest in queuing delay, end to end delay and delay variation (JITTER).

A New DiffServ Edge Router with Controlled‐UDP

The existing edge routers can not assign the link capacities between User datagram protocol (UDP) subscribers and Transmission control protocol (TCP) subscribers to ensure the multiple priorities traffics with Differentiate-Serve (DiffServ). To solve the problem, a new DiffServ edge router with Controlled-UDP (C-UDP) is proposed. The proposed DiffServ edge router can control the data rates of UDP and TCP subscribers according to their priorities. In the proposed edge router, there are multi-queues buffers controlled by TCP Active queue management (AQM) and UDP AQM algorithms to implement fair and stable link capacities. The proposed TCP AQM and UDP AQM algorithms achieve the network congestion control and DiffServ by operating AQM parameters on the stable conditions proposed by us. The dynamic simulation results demonstrate the proposed edge router for DiffServ network to be valid.

Active queue management with discrete sliding modes in TCP networks

Abstract In this paper, a new active queue management (AQM) algorithm for data traffic control in TCP/IP networks is developed. The algorithm design is based on the principles of discrete sliding-mode control. Unlike majority of earlier studies, the design procedure considers the effects of both non-negligible delay in transferring data and feedback information and unpredictable capacity variations. The switching function is selected to incorporate a delay compensation mechanism, which ensures efficient network operation even for large bandwidthdelay product connections. The proposed algorithm, implemented as a packet marking scheme, is tested in discrete event ns-2 simulator. The results show that the algorithm provides fast convergence to steady state after sudden, unanticipated capacity changes. By generating smaller overshoots, the proposed algorithm also allows for reducing buffer space requirements to avoid packet loss as compared to the benchmark AQM solutions.

On the Use of Economical Theories and Metrics to Design an Intelligent Active Queue Management in the Internet

Active Queue Management (AQM) plays an important role in the Internet congestion control. Random Early Detection (RED) is the most popular active queue management algorithm that is used in the in Internet routers. The effectiveness of RED algorithm highly depends on appropriate setting of its parameters. Moreover, RED uses only the average queue length as a congestion meter to trigger packet dropping as a congestion feedback. Since the average queue length considers only long-term behavior of any queue, this approach fails to see instantaneous changes of the queue and hence its reaction is not fast enough. This paper inspires from the economic principles to design a new congestion control algorithm. This algorithm, called ECORED, enhances the network performance by dynamically tuning of RED's parameters. ECORED introduces two meters i.e. queue length growth velocity and drop rate velocity to measure the congestion level and produce appropriate congestion feedbacks. Based on extensive simulations conducted using Network Simulator-2 (ns-2), we show that ECORED algorithm reduces the packet loss rate and achieves high utilization in compare with RED, ARED and NLRED.

Simulation and Implementation of Adaptive Fuzzy PID

With the exponential growth of the Internet traffic, congestion problems become severe. To solve these severe problems, the Internet Engineering Task Force (IETF) recommends implementing the Active Queue Management (AQM) mechanism on the Internet routers. This paper introduces a robust AQM algorithm, called Adaptive Fuzzy Proportional Integral Derivative (AF-PID), which adaptively tunes the parameters to overcome the sensitivity of parameters settings for dynamic Internet environments. It's more important that we have operated comparison experiments between Droptail, RED, PID and AF-PID algorithm under seven different scenario s by NS2 simulation software. The experimental results definitely proved the performance of the AF-PID algorithm is of great superiority. Furthermore, we have built up a network test bed with IPCOP as the router successfully, and embedded with the AF-PID algorithm, which once again proved that AF-PID algorithm is not only easy to implement on real network, but also c onsistent with the simulation result s under the same scenario

AN EVENT DRIVEN SIMULATION FOR ADAPTIVE GENTLE RANDOM EARLY DETECTION (AGRED) ALGORITHM

Simulations are used to find optimum answers for pr oblems in wide areas. Active queue management algorithms such as RED, GRED, typically use simulators like ns2 which is an open source simulator or OPNET, OMNET which are commercial simulators. However, beside the benefits of using simulators like having defined modules, parameters. There are probl ems such as complexity, large integrated components and licensing cost. To have an ideal balance in men tioned benefits and problems and to further complement the repository of simulators, this study presents t he description of a general-purpose programming language based discrete event simulation for active queue ma nagement. This research has focused at developing a discrete event simulator to implement one of active queue management algorithms which is called AGRED. The results showed that the developed simulator has successfully produced the same results with an ave rage deviation of 1.5% as previous simulator in AGRED.

An effective queuing architecture for elastic and inelastic traffic with different dropping precedence in MANET

Mobile ad hoc network (MANET) is a group of self-organized mobile nodes that are associated with comparatively low bandwidth wireless links. This paper proposes an effective queuing architecture, which supports both elastic and inelastic traffic. The packets of inelastic flows are always stored ahead of those of the elastic flows. If a link is critically loaded by the inelastic traffic, it results in large delays and elastic traffic may have some delay constraints that are nonnegligible. The virtual queue algorithm reduces the experienced delay by comprising virtual queues that are served at a fraction of the actual service rate and by using the virtual queue-length values in utility function. Then, optimization framework is used in which scheduling algorithm allocates resource fairly in the network to meet the fairness objectives of both elastic and inelastic flows. Finally, priority dropping active queue management algorithm is designed based on proportional-integral design (PID) mechanism which provides the differentiated services for the different layers or frames according to their priority.

RED: A HIGH LINK UTILIZATION AND FAIR ALGORITHM

Internet and its applications are an integral part of our daily life .These days they are widely used for various purposes such as communication, public services, entertainments, distant educations, etc., each possessing different quality of service (QoS) requirements. How to provide finer congestion control for network emerges as a major problem. To prevent the problem of congestion control and synchronization various active queue management (AQM) techniques are used. AQM algorithms execute on network routers and detect initial congestion by monitoring some functions. When congestion occurs on the link the AQM algorithms detects and provides signals to the end systems. Various algorithms have been proposed in recent years but RED is one of the most influential techniques among all the existing ones. This review paper provides the functioning mechanism of the RED technique with the help of its algorithm & its variants. KeywordsAQM ,RED ,RED parameters, RED algorithm, RED variants

Fluid flow approximation of time-limited TCP/UDP/XCP streams

Abstract This article presents the use of fluid flow approximation to model interactions between a set of TCP, UDP and XCP flows in the environment of IP routers using AQM (Active Queue Management) algorithms to control traffic congestion. In contrast to other works, independent UDP and TCP streams are considered and the model allows to start and end data transmissions in TCP, UDP and XCP streams at any time moment. It incorporates several Active Queue Management mechanisms: RED, NLRED, CHOKe.

Enhanced Random Early Detection (ENRED)

ABSTRACT As the internet is expected to better support many applications such as multimedia with limit bandwidth, new mechanisms are needed to control the congestion in the network. Active Queue Management (AQM) algorithms play an important role to ensure the stability of the Internet. Random Early Detection (RED) is the first active queue management algorithm proposed for deployment in TCP/IP networks. RED has some parameters tuning issues that need to be carefully addressed for it to give good performance under different network scenarios.We propose a new algorithm called Enhanced Random Early Detection (ENRED). ENRED works to improve these parameters to provide better congestion control over the network while remaining the advantage of RED.This paper will introduce ENRED and some features about RED and its variants . 8We simulate the proposed algorithm (ENRED) using the well-known network simulator ns-2, by comparing it to the original RED. Simulation results show that the proposed algorithm achieves better queue size than RED and decreases the delay and losses.