Random Early Detection Gateways for Congestion Avoidance

Random Early Detection Gateways for Congestion Avoidance (1993)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sally Floyd , Van Jacobson

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

BibTeX

@ARTICLE{Floyd93randomearly,
    author = {Sally Floyd and Van Jacobson},
    title = {Random Early Detection Gateways for Congestion Avoidance},
    journal = {IEEE/ACM TRANSACTIONS ON NETWORKING},
    year = {1993},
    volume = {1},
    pages = {397--413}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

This paper presents Random Early Detection (RED) gateways for congestion avoidance in packetswitched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving 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 function 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 through the 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 ...

Citations

2033	Congestion avoidance and control - Jacobson - 1988
1128	Probability inequalities for sums of bounded random variables - Hoeffding - 1963
379	Forecasting, structural time series models and the Kalman filter - Harvey - 1989
345	A control theoretic approach to flow control - Keshav - 1991
313	Observations on the dynamics of a congestion control algorithm: The effects of two-way traffic - ZHANG, SHENKER, et al. - 1991
291	binary feedback scheme for congestion avoidance in computer networks - Ramakrishnan, Jain - 1990
246	Connections with multiple congested gateways in packet-switched networks part1: One-way traffic - Floyd - 1991
241	The synchronization of periodic routing messages - Floyd, Jacobson - 1994
214	Internet control message protocol - Postel - 1981
205	Traffic phase effects in packet-switched gateways - Floyd, Jacobson - 1991
142	Congestion Avoidance in Computer Networks with a Connectionless Network Layer - Jain, Ramakrishnan - 1988
120	A New Architecture for Packet Switched Network Protocols - Zhang - 1989
111	A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks - Jain - 1989
106	Supporting Real-Time Applications - D, Clark, et al. - 1992
80	Congestion Control in Computer Networks: Issues and Trends - Jain - 1990
75	A network simulator - KESHAV
69	Analysis of random drop for gateway congestion control. MIT-LCSTR-465 - Hashem - 1989
57	Oscillating Behavior of Network Traffic: A Case Study Simulation”, Internetworking: Research and Experience - Zhang, Clark - 1990
55	Recursive Estimation and Time-Series Analysis - Young - 1984
54	Analysis of Algorithms - Hofri - 1995
50	A New Congestion Control Scheme: Slow Start and - Wang, Crowcroft - 1991
48	A Table of Series and Products - Hansen - 1975
41	Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays - Mitra, Seery - 1991
39	A hop by hop rate-based congestion control scheme - Mishara, Kanakia - 1992
35	Myths about congestion management in high-speed networks - Jain - 1992
30	Congestion control for high speed packet switched networks - Bala, Cidon, et al. - 1990
30	On Traffic Phase Effects - Floyd, Jacobson - 1992
26	Something a host could do with source quench: The source quench introduced delay (SQuID). Request for Comments 1016, Internet Engineering Task Force - Prue, Postel - 1987
14	Internet control message protocol," Network Working Group Request for - Postel - 1981
12	NEST: a Network Simulation and Prototyping Tool - Bacon, Dupuy, et al. - 1988
12	Two fast implementations of the “minimal standard” random number generator - Carta - 1990
12	Issues in Flexible Resource Manage-ment for Datagram Networks - Floyd - 1992
9	Eliminating Periodic Packet Losses - Wang, Crowcroft - 1992
8	Myths About Congestion Management - Jain - 1992
6	A Delay-Based Approach for Congestion Avoidance - Jain - 1989
5	NEST: A Network Simulation and Prototyping - Dupuy, Schwartz, et al. - 1990
4	The Performance of Adaptive Window Flow Controls, in a Dynamic Load Environment - Pingali, Tipper, et al. - 1990
4	DTP: An Efficient Transport Protocol - Sanghi, Agrawala - 1991
4	A Control-theoretic Approach toFlow Control - Keshav - 1991
3	editors for the IETF Performance and Congestion Control Working Group, "Gateway congestion control survey", RFC 1254 - Mankin, Ramakrishnan - 1991
3	Some Performance Results for TCP over ATM with Congestion”, to appear - Romanow
2	Comments on the IETF performance and congestion control working group draft on gateway congestion control policies”, unpublished - Shenker - 1989
2	Probability Inequalities for Sums ofBounded Random Variables - Hoeffding - 1963
1	Nest: A network simulation and prototyping tool - Schwartz, Yemimi - 1988
1	Two fast implementations of the 'minimal standard' random number generator - Catta - 1990
1	Supporting real-time applications in an integrated \ervices packet network: Architecture and mechanism - Shenker, Zhang - 1992
1	Strumrul Time Srr-ies Models and the Kalman Filter - ec, q - 1989
1	Prohahilrstic Analvsis - of . AlqoI-rthmA - Hofn - 1987
1	REAL: A network simulator - Keshab
1	A hop by hop rate-based congestion control wheme - Mishra, Kanakia - 1992