Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
High performance TCP in ANSNET
ACM SIGCOMM Computer Communication Review
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
Bitmap algorithms for counting active flows on high speed links
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
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 III: routers with very small buffers
ACM SIGCOMM Computer Communication Review
Open issues in router buffer sizing
ACM SIGCOMM Computer Communication Review
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
Server selection for carbon emission control
Proceedings of the 2nd ACM SIGCOMM workshop on Green networking
| Hi-index | 0.00 |
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 a generic algorithm Optimal Delay-Utilization control of t (ODU-t) that is designed with a performance goal of maximizing this benefit. Its novelty lies in fact that it maximizes the benefit in an online manner, without requiring knowledge of the traffic conditions, specific delay-utilization models, nor does it require complex parameter estimation. Moreover, other performance metrics like loss rate or jitter can be directly incorporated into the optimization framework as well. Packet level ns2 simulations are given to demonstrate the behavior of the proposed algorithm.