Random Early Detection for congestion avoidance in wired networks: A discretized pursuit learning-automata-like solution

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 40, Issue 1, 2010, Pages 66-76

  Misra, Sudip ^a   Oommen, B John ^b,c   Yanamandra, Sreekeerthy ^a,d   Obaidat, Mohammad S ^e  

^a INDIAN INSTITUTE OF TECHNOLOGY   (India)

^b CARLETON UNIVERSITY   (Canada)

^c UNIVERSITY OF AGDER   (Norway)

^d KIIT UNIVERSITY   (India)

^e MONMOUTH UNIVERSITY   (United States)

Author keywords

Average queue size; Discretized pursuit learning; Queue loss; Random early detection (RED); Stochastic learning automata (LA)

Indexed keywords

AVERAGE QUEUE SIZE; AVERAGE SIZE; CONGESTION AVOIDANCE; LOSS RATES; MAXIMAL-RATIO; PACKET DROPS; PERFORMANCE COMPARISON; PRIMARY OBJECTIVE; QUEUE SIZE; RANDOM EARLY DETECTIONS; SIMULATION RESULT; STOCHASTIC LEARNING AUTOMATA; TOTAL LOSS; WIRED NETWORKS;

ALGORITHMS; AUTOMATA THEORY; OPTIMIZATION; PHILOSOPHICAL ASPECTS; PROBABILITY; QUEUEING THEORY; ROBOTS; STOCHASTIC SYSTEMS; TRANSLATION (LANGUAGES);

GATEWAYS (COMPUTER NETWORKS);

EID: 77955076853     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2009.2032363     Document Type: Article

References (28)

1. M. Agache, "Families of estimator-based stochastic learning algorithms", M. S. thesis, School Comput. Sci., Carleton Univ., Ottawa, ON, Canada, 2000.
2. M. Agache and B. J. Oommen, "Continuous and discretized generalized pursuit learning schemes", in Proc. 4th SCI, S. Andraddttir, K. J. Healy, D. H. Withers, and B. L. Nelson, Eds., Orlando, FL, Jul. 2000, pp. VII: 270-VII:275.
3. M. Agache and B. J. Oommen, "Generalized pursuit learning schemes: New families of continuous and discretized learning automata", IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 32, no. 6, pp. 738-749, Dec. 2002.
4. J. Antila, TCP Performance Simulations Using NS2, Last accessed on Feb. 3, 2009. [Online]. Available: http://www.netlab.tkk.fi/j~mantti3/pubs/special studypdf
5. R. Fengyuan, R. Yong, and S. Xiuming, "Enhancement to RED algorithm", in Proc. 9th IEEE Int. Conf. Netw., Oct. 2001, pp. 14-19.
6. S. Floyd and V. Jacobson, "Random Early Detection gateways for congestion avoidance", IEEE/ACM Trans. Netw., vol. 1, no. 4, pp. 397-413, Aug. 1993.
7. D. Katabi and M. Handley, "Enhancing Internet congestion control using explicit and precise feedback", in Proc. Oxygen Workshop, Jul. 2001, pp. 1-2.
8. S. Lakshmivarahan, Learning Algorithms Theory and Applications. New York: Springer-Verlag, 1981.
9. J. K. Lanctôt, "Discrete estimator algorithms: A mathematical model of computer learning", M. S. thesis, Dept. Math. Stat., Carleton Univ., Ottawa, ON, Canada, 1989.
10. J. K. Lanctôt and B. J. Oommen, "Discretized estimator learning automata", IEEE Trans. Syst., Man, Cybern., vol. 22, no. 6, pp. 1473-1483, Nov./Dec. 1992.
11. Active Queue Management, Last accessed on Feb. 3, 2009. [Online]. Available: http://en. wikipedia.org/wiki/active queue management
12. S. Misra and B. J. Oommen, "GPSPA: A new adaptive algorithm for maintaining shortest path routing trees in stochastic networks", Int. J. Commun. Syst., vol. 17, no. 10, pp. 963-984, Dec. 2004.
13. S. Misra and B. J. Oommen, "An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks", IEEE Trans. Comput., vol. 55, no. 6, pp. 686-702, Jun. 2006.
14. S. Misra and B. J. Oommen, "Fault-tolerant routing in adversarial mobile Ad Hoc networks: An efficient route estimation scheme for non-stationary environments", Telecommun. Syst. J., 2009, to be published.
15. K. Najim and A. S. Poznyak, Learning Automata: Theory and Applications. Oxford, U. K.: Pergamon, 1994.
16. K. S. Narendra and M. A. L. Thathachar, Learning Automata: An Introduction. Englewood Cliffs, NJ: Prentice-Hall, 1989.
17. M. S. Obaidat, G. I. Papadimitriou, and A. S. Pomportsis, "Learning automata: Theory, paradigms, and applications", IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 32, no. 6, pp. 706-709, Dec. 2002.
18. B. J. Oommen, "Absorbing and ergodic discretized two-action learning automata", IEEE Trans. Syst., Man, Cybern., vol. SMC-16, no. 2, pp. 282-293, Mar./Apr. 1986.
19. B. J. Oommen and M. Agache, "Continuous and discretized pursuit learning schemes: Various algorithms and their comparison", IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. 31, no. 3, pp. 277-287, Jun. 2001.
20. B. J. Oommen and J. P. R. Christensen, "∈-optimal discretized reward-penalty learning automata", IEEE Trans. Syst., Man, Cybern., vol. 18, no. 3, pp. 451-457, May/Jun. 1988.
21. B. J. Oommen and E. R. Hansen, "The asymptotic optimality of discretized linear reward-inaction learning automata", IEEE Trans. Syst., Man, Cybern., vol. SMC-14, no. 3, pp. 542-545, May/Jun. 1984.
22. B. J. Oommen, S. Misra, and O.-C. Granmo, "Routing bandwidth guaranteed paths in MPLS traffic engineering: A multiple race track learning approach", IEEE Trans. Comput., vol. 56, no. 7, pp. 959-976, Jul. 2007.
23. P. S. Sastry, "Systems of learning automata: Estimator algorithms applications", Ph. D. dissertation, Dept. Elect. Eng., Indian Inst. Sci., Bangalore, India, Jun. 1985.
24. NS2 Network Simulator, Last accessed on Feb. 3, 2009. [Online]. Available: http://www.isi.edu/nsnam/ns
25. M. A. L. Thathachar and B. J. Oommen, "Discretized reward-inaction learning automata", J. Cybern. Inf. Sci., vol. 2, no. 1, pp. 24-29, Spring 1979.
26. M. A. L. Thathachar and P. S. Sastry, "A class of rapidly converging algorithms for learning automata", IEEE Trans. Syst., Man, Cybern., vol. SMC-15, no. 1, pp. 168-175, Jan./Feb. 1985.
27. R. Verma, A. Iyer, and A. Karandikar, "Active queue management using adaptive RED", J. Commun. Netw., vol. 5, no. 3, pp. 275-281, Sep. 2003.
28. B. Zheng and M. Atiquzzaman, "Low pass filter/over drop avoidance (LPF/ODA): An algorithm to improve the response time of RED gateways", Int. J. Commun. Syst., vol. 15, no. 10, pp. 899-906, Dec. 2002.