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
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
RED+ gateways for identification and discrimination of unfriendly best-effort flows in the Internet
Broadband communications
A simple approximation for modeling nonstationary queues
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
| Hi-index | 0.00 |
The RED algorithm is one of the active queue management methods promoted by the IETFfor congestion control in backbone routers. We analyze the dynamic behavior of a single RED controlled queue receiving a Poisson stream with time varying arrival rate, describing the aggregate traffic from a population of TCP sources. The queue is described in terms of the time dependent expected values of the instantaneous queue length and of the exponentially averaged queue length, for which we derive a pair of ordinary differential equations (ODEs). The accuracy of the model is verified for different arrival rate functions by comparing simulated results against the numerical solutions of the ODEs. For instance, the model captures well the oscillatory behavior observed in simulations. Also, it is possible to use the linearized version of the ODEs to explore bounds for the parameters of the system such that e.g. upon a load change the system reaches the new equilibrium gracefully without oscillations. These results, in turn, can be used as basis for some guidelines for choosing the parameters of the RED algorithm.