论文信息 - A proof of convergence of the B-RED and P-RED algorithms for random early detection

A proof of convergence of the B-RED and P-RED algorithms for random early detection

In, we recently presented two computationally efficient algorithms named B-RED and P-RED for random early detection. In this letter, we present the mathematical proof of convergence of these algorithms under general conditions to local minima.

Shalabh Bhatnagar | Rajesh Kumar Patro | R. K. Patro | S. Bhatnagar

[1] Morris W. Hirsch,et al. Convergent activation dynamics in continuous time networks , 1989, Neural Networks.

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

[3] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .

[4] Kevin Barraclough,et al. I and i , 2001, BMJ : British Medical Journal.

[5] Vinod Sharma,et al. PERFORMANCE ANALYSIS OF THE RANDOM EARLY DETECTION ALGORITHM , 2002, Probability in the Engineering and Informational Sciences.

[6] Fernando Paganini,et al. Dynamics of TCP/RED and a scalable control , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7] J. Spall,et al. A modified second‐order SPSA optimization algorithm for finite samples , 2002 .

[8] Michael C. Fu,et al. Two-timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences , 2003, TOMC.

[9] Shalabh Bhatnagar,et al. Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization , 2005, TOMC.

[10] Shalabh Bhatnagar,et al. A probabilistic constrained nonlinear optimization framework to optimize RED parameters , 2009, Perform. Evaluation.