Simulation comparison of RED and REM
- Creators
- Athuraliya, Sanjeewa
-
Low, Steven H.
- Others:
- Tham, Chen-Khong
- Zhang, Liren
Abstract
We propose earlier an optimization based low control for the Internet called Random Exponential Marking (REM). REM consists of a link algorithm, that probabilistically marks packets inside the network, and a source algorithm, that adapts source rate to observed marking. The marking probability is exponential in a link congestion measure, so that the end-to-end marking probability is exponential in a path congestion measure. Because of the finer measure of congestion provided by REM, sources do not constantly probe the network for spare capacity, but settle around a globally optimal equilibrium, thus avoiding the perpetual cycle of sinking into and recovering from congestion. In this paper we compare the performance of REM with Reno over RED through simulation.
Additional Information
© Copyright 2001 IEEE. Reprinted with permission. Publication Date: 5-8 September 2000. This work is supported by the Australian Research Council under grants S499705, A49930405 and S4005343.Attached Files
Published - ATHicon01a.pdf
Files
Name | Size | Download all |
---|---|---|
md5:546dd8ba304e40d81325f47b584f9474
|
415.4 kB | Preview Download |
Additional details
- Eprint ID
- 11481
- Resolver ID
- CaltechAUTHORS:ATHicon01a
- Australian Research Council
- S499705
- Australian Research Council
- A49930405
- Australian Research Council
- S4005343
- Created
-
2008-08-28Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field