Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP
ACM SIGCOMM Computer Communication Review
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Improving TCP smoothness by synchronized and measurement-based congestion avoidance
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
The War between Mice and Elephants
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
TCP-Friendly SIMD Congestion Control and Its Convergence Behavior
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
General AIMD Congestion Control
General AIMD Congestion Control
Early Regulation of Unresponsive Flows
Early Regulation of Unresponsive Flows
Flow rate fairness: dismantling a religion
ACM SIGCOMM Computer Communication Review
On the Miscollaboration of Congestion Control Mechanisms at the Transport and the Network Layers
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01
On the Properties of System-Wide Responsive Behavior
ITNG '08 Proceedings of the Fifth International Conference on Information Technology: New Generations
Differentiating Services with Noncongestive Queuing (NCQ)
IEEE Transactions on Computers
| Hi-index | 0.00 |
Most AQM algorithms, such as RED, assure fairness through randomness in congestion notification. However, randomness results in fair allocation of network resources only when time limitations are not considered. This is not compatible with the current Internet, where traffic oscillations are frequent and the demand for fair treatment is rather urgent, due to short duration of most applications. Given the short duration of most modern Internet applications, fast convergence to fairness is necessitated. In this paper, we use fairness as the major criterion to adjust traffic and present a corresponding algorithm of active queue management, which is called Explicit Global Congestion Notifier (EGCN). EGCN notifies flows almost simultaneously about incipient congestion by marking packets arriving at the router's queue, when the load in the network increases and buffer overflow is expected. This is a new approach compared with the random notification policy of RED or ECN. EGCN distributes the burden to adjust backward to more flows and consequently allows for smoother window adjustments. We elaborate on the properties of system-wide response in terms of fairness, smoothness and efficiency. Simulation results demonstrate a clear-cut advantage of the proposed scheme.