Published March 2000
| Published
Book Section - Chapter
Open
An enhanced random early marking algorithm for Internet flow control
Abstract
We propose earlier an optimization based flow control for the Internet called Random Early Marking (REM). In this paper we propose and evaluate an enhancement that attempts to speed up the convergence of REM in the face of large feedback delays. REM can be regarded as an implementation of an optimization algorithm in a distributed network. The basic idea is to treat the optimization algorithm as a discrete time system and apply linear control techniques to stabilize its transient. We show that the modified algorithm is stable globally and converges exponentially locally. This algorithm translates into an enhanced REM scheme and we illustrate the performance improvement through simulation.
Additional Information
© Copyright 2000 IEEE. Reprinted with permission. Publication Date: 26-30 March 2000. The first two authors acknowledge the Australian Commonwealth Government for their Australian Postgraduate Awards, and the last author acknowledges the support of the Australian Research Council under grants S499705 and A49930405.Attached Files
Published - ATHinfocomm00.pdf
Files
ATHinfocomm00.pdf
Files
(782.5 kB)
Name | Size | Download all |
---|---|---|
md5:b53065b2030160ea4d554bddb7b80969
|
782.5 kB | Preview Download |
Additional details
- Eprint ID
- 11493
- Resolver ID
- CaltechAUTHORS:ATHinfocomm00
- Australian Research Council
- S499705
- Australian Research Council
- A49930405
- Austrialian Commonwealth Government
- Created
-
2008-08-21Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field