Simulation comparison of RED and REM

Author

Athuraliya, Sanjeewa ; Low, Steven

Author_Institution

Dept. of Electr. & Electron. Eng., Melbourne Univ., Parkville, Vic., Australia

fYear

2000

fDate

2000

Firstpage

68

Lastpage

72

Abstract

We proposed earlier (Athuraliya et al. 2000) an optimization based flow 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 (random early detection) through simulation

Keywords

Internet; optimisation; random processes; telecommunication congestion control; Internet; RED; REM; end-to-end marking probability; globally optimal equilibrium; link algorithm; link congestion measure; marking probability; optimization based flow control; packets; path congestion measure; random early detection; random exponential marking; source algorithm; source rate; Aggregates; Communication system control; Constraint optimization; Control systems; Cost accounting; Design optimization; Distributed computing; Feedback; Internet; Probes;

fLanguage

English

Publisher

ieee

Conference_Titel

Networks, 2000. (ICON 2000). Proceedings. IEEE International Conference on

Print_ISBN

0-7695-0777-8

Type

conf

DOI

10.1109/ICON.2000.875770

Filename

875770