Active queue management (AQM) is a group of FIFO based queue management mechanisms in a router to support end-to-end congestion control in the Internet. Until random early detection (RED) was proposed by the internet engineering task force (IETF) for deploying[1], FIFO based tail drop (TD) was the only AQM mechanism used in the network. Two main functions are used in AQM: one is the congestion ...

In recent years, AQM (Active Queue Management) mechanisms, which support the end-to-end congestion control mechanism of TCP (Transmission Control Protocol), have been widely studied. The AQM mechanism is a congestion control mechanism at a router to control its queue length by actively discarding arriving packets. Many AQM mechanisms such as RED (Random Early Detection) have been proposed. Howe...

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

The Active Queue Management algorithms stabilize the instantaneous queue length through mapping the congestion measurement into packet drop probability to achieve high throughput and low average delay. Random Early Detection [RED] is widely used AQM mechanism detecting and avoiding the incipient congestion. The detection of congestion is based on priori estimation of congestion and calculation ...

Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size d...

This paper describes and evaluates the use of steady-state TCP behavior knowledge for proactive queue management (PQM). We show how routers can use flow parameters and the knowledge of TCP end-host behavior to intelligently mark packets to prevent queue build-up, and thus prevent congestion from ever occurring, while at the same time provide high link utilization and low packet loss. This is in...

in order to make the best utilization of a link in computer networks, active queue management (aqm) algorithms are generally used in a variety of methods. in this paper, a systematic control strategy based on self-scheduled h ∞, considering the dynamics of the window-based tcp flow, is proposed. then, the robustness of the designed controller to disturbance and parameter fluctuations of the pla...

Abstract: This paper presents a delay-dependent robust stochastic active queue management (AQM) scheme that can be implemented in the routers for stabilizing queues in transmission control protocol (TCP) communication networks. The linearized TCP/AQM system is modelled as a uncertain time-delay system with stochastic perturbations and time-varying network parameters. In this paper, a new flow m...

In this report we discuss the dynamics of heterogeneous TCP systems with propagation delays. Instead of studying the local linearized TCP dynamics, we study the global stability conditions and obtain the stability regions. Also we provide proof of periodic behavior of a single TCP connection when stability conditions are not met.