Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
State-dependent M/G/1 type queueing analysis for congestion control in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end congestion control schemes: utility functions, random losses and ECN marks
IEEE/ACM Transactions on Networking (TON)
Deterministic fluid models for internet congestion control
Deterministic fluid models for internet congestion control
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Resource pricing and the evolution of congestion control
Automatica (Journal of IFAC)
Part II: control theory for buffer sizing
ACM SIGCOMM Computer Communication Review
Exponential-RED: a stabilizing AQM scheme for low- and high-speed TCP protocols
IEEE/ACM Transactions on Networking (TON)
On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Time-scale decomposition and equivalent rate-based marking
IEEE/ACM Transactions on Networking (TON)
Rate-based active queue management for TCP flows over wired and wireless networks
EURASIP Journal on Wireless Communications and Networking
FluNet: A hybrid internet simulator for fast queue regimes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network optimization and control
Foundations and Trends® in Networking
Jetmax: Scalable max-min congestion control for high-speed heterogeneous networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Achieving 100% throughput in TCP/AQM under aggressive packet marking with small buffer
IEEE/ACM Transactions on Networking (TON)
Transport-independent fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Mathematical models of congestion control capture the congestion indication mechanism at the router in two different ways: rate-based models, where the queue-length at the router does not explicitly appear in the model, and queue-based models, where the queue length at the router is explicitly a part of the model. Even though most congestion indication mechanisms use the queue length to compute the packet marking or dropping probability to indicate congestion, we argue that, depending upon the choice of the parameters of the AQM scheme, one would obtain a rate-based model or a rate-and-queue-based model as the deterministic limit of a stochastic system with a large number of users. We also consider the impact of implementing AQM schemes in the real queue or a virtual queue. If an AQM scheme is implemented in a real queue, we show that, to ensure that the queuing delays are negligible compared to RTTs, one is forced to choose the parameters of a AQM scheme in a manner which yields a rate-based deterministic model. On the other hand, if the AQM scheme is implemented in a virtual queue, small-queue operation is achieved independent of the choice of the parameters, thus showing a robustness property of virtual queue-based schemes.