Random Early Detection for Congestion Avoidance in Wired Networks: A Discretized Pursuit Learning-Automata-Like Solution

In this paper, we present a learning-automata-like (LAL) mechanism for congestion avoidance in wired networks. Our algorithm, named as LAL random early detection (LALRED), is founded on the principles of the operations of existing RED congestion-avoidance mechanisms, augmented with a LAL philosophy. The primary objective of LALRED is to optimize the value of the average size of the queue used for congestion avoidance and to consequently reduce the total loss of packets at the queue. We attempt to achieve this by stationing a LAL algorithm at the gateways and by discretizing the probabilities of the corresponding actions of the congestion-avoidance algorithm. At every time instant, the LAL scheme, in turn, chooses the action that possesses the maximal ratio between the number of times the chosen action is rewarded and the number of times that it has been chosen. In LALRED, we simultaneously increase the likelihood of the scheme converging to the action, which minimizes the number of packet drops at the gateway. Our approach helps to improve the performance of congestion avoidance by adaptively minimizing the queue-loss rate and the average queue size. Simulation results obtained using NS2 establish the improved performance of LALRED over the traditional RED methods which were chosen as the benchmarks for performance comparison purposes.

[1]  Mohammad S. Obaidat,et al.  Guest editorial learning automata: theory, paradigms, and applications , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[2]  B. John Oommen,et al.  An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks , 2006, IEEE Transactions on Computers.

[3]  Johanna Antila.  TCP Performance Simulations Using Ns2 , 2002 .

[4]  B. John Oommen,et al.  GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks , 2004, Int. J. Commun. Syst..

[5]  Kaddour Najim,et al.  Learning Automata: Theory and Applications , 1994 .

[6]  Mariana Agache,et al.  CONTINUOUS AND DISCRETIZED GENERALIZED PURSUIT LEARNING SCHEMES , 2000 .

[7]  B. John Oommen,et al.  Fault-tolerant routing in adversarial mobile ad hoc networks: an efficient route estimation scheme for non-stationary environments , 2010, Telecommun. Syst..

[8]  B.J. Oommen,et al.  Ε-optimal Discretized Linear Reward-penalty Learning Automata , 1988, IEEE Trans. Syst. Man Cybern..

[9]  B. John Oommen,et al.  Generalized pursuit learning schemes: new families of continuous and discretized learning automata , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[10]  B. John Oommen,et al.  Absorbing and Ergodic Discretized Two-Action Learning Automata , 1986, IEEE Trans. Syst. Man Cybern..

[11]  M. A. L. THATHACHAR,et al.  A new approach to the design of reinforcement schemes for learning automata , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  S. Lakshmivarahan,et al.  Learning Algorithms Theory and Applications , 1981 .

[13]  Mohammed Atiquzzaman,et al.  Low pass filter/over drop avoidance (LPF/ODA): an algorithm to improve the response time of RED gateways , 2002, Int. J. Commun. Syst..

[14]  B. John Oommen,et al.  Discretized estimator learning automata , 1992, IEEE Trans. Syst. Man Cybern..

[15]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[16]  B. John Oommen,et al.  The asymptotic optimality of discretized linear reward-inaction learning automata , 1984, IEEE Transactions on Systems, Man, and Cybernetics.

[17]  Fengyuan Ren,et al.  Enhancement to RED algorithm , 2001, Proceedings. Ninth IEEE International Conference on Networks, ICON 2001..

[18]  Abhay Karandikar,et al.  Active queue management using adaptive RED , 2003, Journal of Communications and Networks.

[19]  Sudip Misra,et al.  Routing Bandwidth-Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach , 2007, IEEE Transactions on Computers.

[20]  P. S. Sastry,et al.  A Class of Rapidly Converging Algorithms for Learning Automata , 1984 .

[21]  B. John Oommen,et al.  Continuous and discretized pursuit learning schemes: various algorithms and their comparison , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[22]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .