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

Authors:
Shalabh Bhatnagar;Rajesh Kumar Patro
Affiliations:
Department of Computer Science and Automation, Indian Institue of Science, Bangalore, India;Cisco Systems, Bangalore, India
Venue:
IEEE Communications Letters
Year:
2009

Citing 6
Cited 1

Convergent activation dynamics in continuous time networks

Neural Networks
Random early detection gateways for congestion avoidance

IEEE/ACM Transactions on Networking (TON)
Two-timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences

ACM Transactions on Modeling and Computer Simulation (TOMACS)
PERFORMANCE ANALYSIS OF THE RANDOM EARLY DETECTION ALGORITHM

Probability in the Engineering and Informational Sciences
Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization

ACM Transactions on Modeling and Computer Simulation (TOMACS)
A probabilistic constrained nonlinear optimization framework to optimize RED parameters

Performance Evaluation

Optimal multi-layered congestion based pricing schemes for enhanced QoS

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [8], 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.