Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Passive estimation of TCP round-trip times
ACM SIGCOMM Computer Communication Review
The BLUE active queue management algorithms
IEEE/ACM Transactions on Networking (TON)
The Buffer-Bandwidth Trade-off Curve is Convex
Queueing Systems: Theory and Applications
New directions in traffic measurement and accounting
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Bitmap algorithms for counting active flows on high speed links
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Scalable TCP: improving performance in highspeed wide area networks
ACM SIGCOMM Computer Communication Review
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
An adaptive virtual queue (AVQ) algorithm for active queue management
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Part I: buffer sizes for core routers
ACM SIGCOMM Computer Communication Review
Part III: routers with very small buffers
ACM SIGCOMM Computer Communication Review
An SLA perspective on the router buffer sizing problem
ACM SIGMETRICS Performance Evaluation Review
Router buffer sizing revisited: the role of the output/input capacity ratio
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Convergence of trajectories and optimal buffer sizing for MIMD congestion control
Computer Communications
New methods for passive estimation of TCP round-trip times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Convexity properties of loss and overflow functions
Operations Research Letters
AIST: insights into queuing and loss on highly multiplexed links
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Proceedings of the 7th Latin American Networking Conference
| Hi-index | 0.24 |
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in understanding this relationship stem from the fact that it depends on the complex nature of arriving traffic and the problems associated with modelling such traffic. Existing AQM schemes achieve a ''low delay'' and ''high utilization'' by responding early to congestion without considering the exact relationship between delay and utilization. However, in the context of exploiting the delay/utilization tradeoff, the optimal choice of a queueing scheme's control parameter depends on the cost associated with the relative importance of queueing delay and utilization. The optimal choice of control parameter is the one that maximizes a benefit that can be defined as the difference between utilization and cost associated with queuing delay. We present two practical algorithms, Optimal Drop-Tail (ODT) and Optimal BLUE (OB), that are designed with a common performance goal: namely, maximizing this benefit. Their novelty lies in fact that they maximize the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor do they require complex parameter estimation. Packet level ns2 simulations are given to demonstrate the efficacy of the proposed algorithms and the framework in which they are designed.