ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A Proof of Convergence of the B-RED and P-RED Algorithms for Random Early Detection

Bhatnagar, Shalabh and Patro, Rajesh Kumar (2009) A Proof of Convergence of the B-RED and P-RED Algorithms for Random Early Detection. In: IEEE Communications letters, 13 (10). pp. 809-811.

[img] PDF
3.pdf - Published Version
Restricted to Registered users only

Download (149Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/search/wrapper.jsp?arnu...

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.

Item Type: Journal Article
Additional Information: Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Keywords: B-RED and P-RED algorithms for random early detection (RED); proof of convergence
Department/Centre: Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited: 09 Dec 2009 11:03
Last Modified: 19 Sep 2010 05:52
URI: http://eprints.iisc.ernet.in/id/eprint/24919

Actions (login required)

View Item View Item