CaltechAUTHORS
  A Caltech Library Service

Simulation comparison of RED and REM

Athuraliya, Sanjeewa and Low, Steven H. (2000) Simulation comparison of RED and REM. In: IEEE International Conference on Networks (ICON 2000), Singapore, 5-8 September 2000. IEEE , Piscataway, NJ, pp. 68-72. ISBN 0-7695-0777-8. http://resolver.caltech.edu/CaltechAUTHORS:ATHicon01a

[img]
Preview
PDF - Published Version
See Usage Policy.

405Kb

Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:ATHicon01a

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.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1109/ICON.2000.875770DOIUNSPECIFIED
http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=875770PublisherUNSPECIFIED
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.
Funders:
Funding AgencyGrant Number
Australian Research CouncilS499705
Australian Research CouncilA49930405
Australian Research CouncilS4005343
Subject Keywords:Internet; optimization; random processes; telecommunication congestion control; 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
Record Number:CaltechAUTHORS:ATHicon01a
Persistent URL:http://resolver.caltech.edu/CaltechAUTHORS:ATHicon01a
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:11481
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:28 Aug 2008 02:25
Last Modified:26 Dec 2012 10:15

Repository Staff Only: item control page