Random Early Detection Gateways for Congestion Avoidance

Random Early Detection Gateways for Congestion Avoidance (1993)

Cached

Download Links

by Sally Floyd , Van Jacobson

Venue:	IEEE/ACM TRANSACTIONS ON NETWORKING
Citations:	1933 - 26 self

Versions

Version History

Metadata Version 1

User correction supplied by mph

Datum	Value	Source
TITLE	Random Early Detection Gateways for Congestion Avoidance	user correction
AUTHOR NAME	Sally Floyd	user correction
AUTHOR AFFIL	Lawrence Berkeley LaboratoryUniversity of California	user correction
AUTHOR NAME	Van Jacobson	user correction
AUTHOR AFFIL	Lawrence Berkeley LaboratoryUniversity of California	user correction
ABSTRACT	This paper presents Random Early Detection (RED) gate-ways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by com-puting the average queue size. The gateway could notify connections of congestion either by dropping packets ar-riving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a preset threshold,the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a func-tion of the average queue size. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth throughthe gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP.The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connectionsdecreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways.	user correction
YEAR	1993	user correction
VENUE	IEEE/ACM TRANSACTIONS ON NETWORKING	user correction
CITATIONS	26 found	ParsCit 1.0