Random Early Marking

Authors:
Sanjeewa Athuraliya;Steven H. Low;David E. Lapsley
Affiliations:
-;-;-
Venue:
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Year:
2000

Citing 3
Cited 1

Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic

ACM SIGCOMM Computer Communication Review
Optimization flow control—I: basic algorithm and convergence

IEEE/ACM Transactions on Networking (TON)
Resource pricing and the evolution of congestion control

Automatica (Journal of IFAC)

A survey of optimal network congestion control for unicast and multicast transmission

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random Early Marking (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. Marking allows a source to estimate its path congestion measure and adjusts its rate in a way that aligns individual optimality with social optimality. We describe the REM algorithm, summarize its key properties, and present some simulation results that demonstrate its stability, fairness and robustness.