Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
TCP Smart Framing: A Segmentation Algorithm to Improve TCP Performance
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Connector: active queue management
Crossroads
TCP smart framing: a segmentation algorithm to reduce TCP latency
IEEE/ACM Transactions on Networking (TON)
Subsidized RED: an active queue management mechanism for short-lived flows
Computer Communications
On the validity of flow-level tcp network models for grid and cloud simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS)
| Hi-index | 0.00 |
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are used. We studied the two RED variants described in [4] and point out a weakness in both. The first variant where the drop probability is independent from the packet size discriminates connections with smaller MTUs. The second variant results in a very high packet loss ratio (PLR), and therefore low goodput, for connections with higher MTUs. We show that fairness in terms of loss and goodput can be supplied through an appropriate setting of the RED algorithm.