Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Traffic phase effects in packet-switched gateways
ACM SIGCOMM Computer Communication Review
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
Modern Digital Halftoning
The effects of active queue management on web performance
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On Designing Improved Controllers for AQM Routers Supporting TCP Flows
On Designing Improved Controllers for AQM Routers Supporting TCP Flows
An adaptive virtual queue (AVQ) algorithm for active queue management
IEEE/ACM Transactions on Networking (TON)
Can high-speed networks survive with DropTail queues management?
Computer Networks: The International Journal of Computer and Telecommunications Networking
Statistical detection of congestion in routers
IEEE Transactions on Signal Processing
RED gateway congestion control using median queue size estimates
IEEE Transactions on Signal Processing
Digital color halftoning with generalized error diffusion and multichannel green-noise masks
IEEE Transactions on Image Processing
IEEE Network: The Magazine of Global Internetworking
On the use of a full information feedback to stabilize RED
Journal of Network and Computer Applications
Hi-index | 0.00 |
Active Queue Management (AQM) aims at minimizing queuing delay while maximizing the bottleneck link throughput. This paper describes two statistical principles that can be exploited to develop improved AQM mechanisms. The first principle indicates that the statistical characteristics of packet markings provide a performance bound of AQM in relation to the queue's variance, which translates to a limitation of the traditional probabilistic marking. Based on the error diffusion algorithm, a simple marking strategy is proposed to reduce the queue's variance by one order of magnitude from that attained with probabilistic drops. The second principle focuses on the relationship between the queue occupancy and the likelihood of congestion of the link. This principle reveals that the likelihood of congestion grows exponentially with queue occupancy, suggesting that drop rates ought to increase accordingly. These fundamental principles are used jointly in the so called Diffusion Early Marking (DEM) algorithm, an AQM scheme introduced in this work leading to faster reaction, higher bottleneck link utilization, lower drop rates and lower router buffer occupancy than other AQM algorithms.