An Enhanced Random Early Marking Algorithm for Internet Flow Control (1999)
| Venue: | In Proceedings of IEEE INFOCOM 2000 |
| Citations: | 36 - 5 self |
BibTeX
@INPROCEEDINGS{Athuraliya99anenhanced,
author = {Sanjeewa Athuraliya and David Lapsley and Steven Low},
title = {An Enhanced Random Early Marking Algorithm for Internet Flow Control},
booktitle = {In Proceedings of IEEE INFOCOM 2000},
year = {1999},
pages = {1425--1434}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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. Keywords---Internet flow control, pricing, optimization flow control, marking, REM, feedback delay I. INTRODUCTION We proposed earlier a flow control scheme for the Internet called Random Early Marking (REM) [1]. It is derived from an optimization model where each source is characterized by a utili...
