Simulation Comparison of RED and REM

  • Authors:
  • Affiliations:
  • Venue:
  • ICON '00 Proceedings of the 8th IEEE International Conference on Networks
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose earlier 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 through simulation.