Skip to main content
Log in

Robust optimization of Random Early Detection

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Random Early Detection (RED) is the most widely used Adaptive Queue Management (AQM) mechanism in the internet. Although RED shows better performance than its predecessor, DropTail, its performance is highly sensitive to parameter settings. Under non-optimum parameter settings, the performance degrades and quickly approaches that of DropTail gateways. As the network conditions change dynamically and since the optimum parameter settings depend on these, the RED parameters also need to be optimized and updated dynamically. Since the interaction between RED and TCP is not well understood as analytical solutions cannot be obtained, stochastic approximation based parameter optimization is proposed as an alternative. However, simulation based approaches may yield a sub-optimal solution since for these to work, the network needs to be accurately simulated which is, however, infeasible with today’s internet. In this paper, we present an optimization technique for optimizing RED parameters that makes use of direct measurements in the network. We develop a robust two-timescale simultaneous perturbation stochastic approximation algorithm with deterministic perturbation sequences for optimization of RED parameters. A proof of convergence of this algorithm is provided. Network simulations, using direct implementation of the algorithm over RED routers, are carried out to validate the proposed approach. The algorithm presented here is found to show better performance as compared to a recently proposed algorithm that adaptively tunes a RED parameter.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. J. Aweya, M. Oullette and D.Y. Montuno, An optimization-oriented view of random early detection, Computer Communications 24 (2001) 1170–1187.

    Article  Google Scholar 

  2. B. Bharath and V.S. Borkar, Robust parameter optimization of hidden Markov models, Journal of Indian Institute of Science 78 (1998) 119–130.

    Google Scholar 

  3. S. Bhatnagar, Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization, ACM Transactions on Modeling and Computer Simulation 15(1) (2005) 74–107.

    Google Scholar 

  4. S. Bhatnagar, M.C. Fu, S.I. Marcus and S. Bhatnagar, Two timescale algorithms for simulation optimzation of hidden Markov models, IIE Transactions 33(3) (2001) 245–258.

    Google Scholar 

  5. S. Bhatnagar, M.C. Fu, S.I. Marcus and P.J. Fard, Optimal structured feedback policies for ABR flow control using two-timescale SPSA, IEEE/ACM Transactions on Networking 9(4) (2001) 479–491.

    Article  Google Scholar 

  6. S. Bhatnagar, M.C. Fu, S.I. Marcus and I.J. Wang, Two timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences, ACM Transactions on Modelling and Computer Simulation 13(4) (2003) 180–209.

    Google Scholar 

  7. S. Bhatnagar and I.B.B. Reddy, Optimal threshold policies for admission control in communication networks via discrete parameter stochastic approximation. Telecommunication Systems 29(1) (2005) 9–31.

    Google Scholar 

  8. T. Bonald, M. May and J. Bolot, Analytic evaluation of RED performance, in: Proc. of INFOCOM, Vol. 3, (2000), pp. 1415–1424.

  9. M. Christiansen, K. Jaffay, D. Ott and F.D. Smith, Tuning RED for web traffic, in: Proc. of SIGCOMM (2000), pp 139–150.

  10. B. Braden et al. Recommendations on queue management and congestion avoidance in the internet, in: RFC 2309 (1998), p. 16.

  11. W. Feng, D. Kandlur, D. Saha and K.G. Shin, A self-configuring RED gateway, in: Proc. of INFOCOM, Vol. 3, (1999), pp. 1320–1328.

  12. V. Firoiu and M. Borden, A study of active queue management for congestion control, in: Proc. of INFOCOM, Vol. 3, (2000) pp. 1435–1444.

  13. S. Floyd, R. Gummadi and S. Shenker, Adaptive RED: An algorithm for increasing the robustness of RED, Technical report, The ICSI Center for Internet Research Berkeley, California, 2001.

  14. S. Floyd and V. Jacobson, Random early detection gateways for congestion avoidance, IEEE/ACM Transactions on Networking 1(4) (1993) 397–413.

    Google Scholar 

  15. A. Haider, H. Sirisena and K. Pawlikowski, Hybrid random early detection algorithm for improving end-to-end congestion control in TCP/IP networks, Technical report TR-COSC 02/05, University of Canterbury (Christchurch, New Zealand, 2005).

  16. Y.C. Ho and X.R. Cao, Perturbation Analysis of Discrete Event Dynamical Systems (Kluwer, Boston, 1991).

  17. Y. Hong, Y. Cao, H. Sun and K.S. Trivedi, RED parameters and performance of TCP connections, Electronics Letters, 2001.

  18. H.J. Kushner and G.G. Yin, Stochastic Approximation Algorithms and Applications, Springer, 1997.

  19. S.H. Low, F. Paganini and S.S. Adalkha, Dynamics of TCP/RED and a scalable control, in: Proc. of INFOCOM (June 2002).

  20. M. May, J. Bolot, C. Diot and B. Lyles. Reasons not to deploy RED. in: Proc. of 7th. International Workshop on Quality of Service (IWQoS’99),London (1999), pp. 260–262.

  21. V. Misra, W. Gong and D. F. Towsley, Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED, in: Proc. of SIGCOMM (2000), pp. 151–160.

  22. J. Neveu, Discrete Event Parameter Martingales. (North Holland, Amsterdam, 1975).

  23. NS. Network Simulator. http://www-mash.cs.berkley.edu/ns.

  24. T.J. Ott, T.V. Lakshman and L.H. Wong. SRED: Stabilized RED, in: Proceedings of INFOCOM (1999), Vol. 3, pp. 1346–1355.

  25. R. Pemantle, Nonconvergence to unstable points in urn models and stochastic approximations, Annals of Prob. 18 (1990) 698–712.

    Google Scholar 

  26. R.Y. Rubinstein, Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks (Wiley, 1987).

  27. V. Sharma, J. Virtamo and P. Lassila, Performance analysis of the random early detection algorithm, Probability in the Engineering and Informational Sciences 16 (2002) 367–388.

  28. J.C. Spall, Multivariate stochastic approximation using a simultaneous perturbation gradient approximation, IEEE Transactions on Automatic Control 37 (1992) 332–341.

    Article  Google Scholar 

  29. T.A. Trinh and S. Molnar, A comprehensive performance analysis of random early detection mechanism, Telecommunication Systems 25(1, 2) (2004) 9–31.

    Google Scholar 

  30. R. Vaidya and S. Bhatnagar, Optimized RIO for diffserve networks, in: Proc. of International Conference on Information and Computer Science, Dhahran, Saudi Arabia (2004), pp. 227–240.

  31. T. Ye and S. Kalyanaraman, Adaptive tuning of RED using on-line simulation, in: Proc. of GLOBECOM (2002), vol. 3, pp. 2210–2214.

  32. B. Zheng and M. Atiquzzaman, Low pass filter/over drop avoidance (LPF/ODA): An algorithm to improve the response time of RED gateways, Wiley International Journal of Communication Systems 15(10) (2002) 899–906.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shalabh Bhatnagar.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vaidya, R., Bhatnagar, S. Robust optimization of Random Early Detection. Telecommun Syst 33, 291–316 (2006). https://doi.org/10.1007/s11235-006-9020-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-006-9020-2

Keywords

Navigation