Robustness of real and virtual queue-based active queue management schemes

Authors:
Ashvin Lakshmikantha;Carolyn L. Beck;R. Srikant
Affiliations:
Department of Electrical and Computer Engineering and Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL;Department of General Engineering, University of Illinois at Urbana-Champaign, Urbana, IL;Department of Electrical and Computer Engineering and Coordinated Sciences Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2005

Citing 9
Cited 5

Real and complex analysis, 3rd ed.

Real and complex analysis, 3rd ed.
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Modeling TCP throughput: a simple model and its empirical validation

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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
Bandwidth sharing: objectives and algorithms

IEEE/ACM Transactions on Networking (TON)
Congestion control for high bandwidth-delay product networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end congestion control schemes: utility functions, random losses and ECN marks

IEEE/ACM Transactions on Networking (TON)
Resource pricing and the evolution of congestion control

Automatica (Journal of IFAC)
REM: active queue management

IEEE Network: The Magazine of Global Internetworking

Stability and sensitivity for congestion control in wireless mesh networks with time varying link capacities

Ad Hoc Networks
Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control

IEEE/ACM Transactions on Networking (TON)
On the deployment of AQM algorithms in the internet

MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
On the stability of AQM algorithms

MMACTEE'09 Proceedings of the 11th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
Analysis of AQM Queues with Queue Size Based Packet Dropping

International Journal of Applied Mathematics and Computer Science - Issues in Advanced Control and Diagnosis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we evaluate the performance of both real and virtual queue-based marking schemes designed for use at routers in the Internet. Using fluid flow models, we show via analysis and simulations that Virtual Queue (VQ)-based marking schemes outperform Real Queue (RQ)-based marking schemes in terms of robustness to disturbances and the ability to maintain low queueing delays. In fact, we prove that a linearized model of RQ-based marking schemes exhibit a lack of robustness to constant but otherwise unknown levels of disturbances. The analytical results we present are applicable to combinations of proportionally fair and TCP-type congestion controllers at the source, and Random Exponential Marking (REM) and Proportional Control (PC) schemes at the router. The behavior of Random Early Discard (RED) and Proportional-Integral (PI) control schemes at the router are also studied via simulations.