Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bonald, T., May, M.: Drop Behavior of RED for Bursty and Smooth Traffic. In Proceedings of IWQoS’99. March. (1999) 29
Clark, D., Fang, W.: Explicit Allocation of Best-effort Packet Delivery Service. IEEE/ACM Transactions on Networking. Vol. 4. (1998) 362–37328
Feng, W., Kandlur, D. D., Saha, D., Shin, K. G.: A Self-configuring RED Gateway. In Proceedings of IEEE INFOCOM. (1999) 1320–1328 28
Floyd, S.: RED: Discussions of Setting Parameters. available from http://www.aciri.org/floyd/REDparameters.txt. (1997) 30, 39
Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking. Vol. 1. (1993) 397–413 28, 30, 31, 38
Lin, D., Morris, R.: Dynamics of Random Early Detection. In Proceedings of ACM SIGCOMM. (1997) 28
May, M., Bolot, J., Diot, C., Jean-Marie, A.: Simple Performance Models for Differentiated Services Schemes for the Internet. In Proceedings of IEEE INFOCOM. (1999) 29
May, M., Bonald, T., Bolot, J.: Analytic Evaluation of RED Performance. In Proceedings of IEEE INFOCOM. (2000) 29
Ott, T. J., Lakshman, T,V., Wong, L. H.: SRED: Stabilized RED. In Proceedings of IEEE INFOCOM. (1999) 28
Peeters, S., Blondia, C.: A Discrete Time Analysis of Random Early Detection with Responsive Best-effort Traffic. In Proceedings of IFIP ATM & IP Workshop. (1999) 29
Sharma, V., Virtamo, J, Lassila, P.: Performance Analysis of the Random Early Detection Algorithm. submitted for publication 29, 32
Wang, W., Tipper, D. Banerjee, S.: A Simple Approximation for Modeling Nonstationary Queues. In Proceedings of IEEE INFOCOM. (1996) 255–262 33
Ziegler, T, Fdida, S., Hofmann, U.: RED+ Gateways for Identification and Discrimination of Unfriendly Best-effort Flows in the Internet. In Proceedings of IFIP ATM & IP Workshop. (1999) 28
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lassila, P.E., Virtamo, J.T. (2000). Modeling the Dynamics of the RED Algorithm. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds) Quality of Future Internet Services. QofIS 2000. Lecture Notes in Computer Science, vol 1922. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39939-9_3
Download citation
DOI: https://doi.org/10.1007/3-540-39939-9_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41076-8
Online ISBN: 978-3-540-39939-1
eBook Packages: Springer Book Archive