Characterization of queue fluctuations in probabilistic AQM mechanisms

Authors:
Peerapol Tinnakornsrisuphap;Richard J. La
Affiliations:
QUALCOMM, Inc., San Diego, CA;University of Maryland, College Park, MD
Venue:
Proceedings of the joint international conference on Measurement and modeling of computer systems
Year:
2004

Citing 6
Cited 7

Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
TCP and explicit congestion notification

ACM SIGCOMM Computer Communication Review
A mean-field model for multiple TCP connections through a buffer implementing RED

Performance Evaluation
Dynamics of random early detection gateway under a large number of tcp flows

Dynamics of random early detection gateway under a large number of tcp flows
TCP Vegas: end to end congestion avoidance on a global Internet

IEEE Journal on Selected Areas in Communications

On the behavior of ECN/RED gateways under a large number of TCP flows: Limit theorems

Queueing Systems: Theory and Applications
Asymptotic behavior of heterogeneous TCP flows and RED gateway

IEEE/ACM Transactions on Networking (TON)
Local and global stability of TCP-newReno/RED with many flows

Computer Communications
Performance analysis of TCP/AQM with generalized AIMD under intermediate buffer sizes

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)
Technical Communique: Stability of a rate control system with averaged feedback and network delay

Automatica (Journal of IFAC)
An extended GIX/M/1/N queueing model for evaluating the performance of AQM algorithms with aggregate traffic

ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a framework for studying the interaction of a probabilistic active queue management (AQM) algorithm with a generic end-user congestion-control mechanism. We show that as the number of flows in the network increases, the queue dynamics can be accurately approximated by a simple deterministic process. In addition, we investigate the sources of queue fluctuations in this setup. We characterize two distinct sources of queue fluctuations; one is the deterministic oscillations which can be captured through the aforementioned deterministic process. The other source is the random fluctuations introduced by the probabilistic nature of the marking schemes. We discuss the relationship between these two types of fluctuations and provide insights into how to control them. Concrete examples in this framework are given for several popular algorithms such as Random Early Detection, Random Early Marking and Transmission Control Protocol.