Download:
by Sally Floyd, Van Jacobson
IEEE/ACM Transactions on Networking
http://www.aciri.org/floyd/papers/early.twocolumn.pdf
Add To MetaCart
Abstract:
of a delay-bandwidth product) that were full much of the time; this would significantly increase the average delay in the network. Therefore, with increasingly high-speed ways for congestion avoidance in packet-switched net- networks, it is increasingly important to have mechanisms works. The gateway detects incipient congestion by com- that keep throughput high but average queue sizes low. puting the average queue size. The gateway could notify In the absence of explicit feedback from the gateway, connections of congestion either by dropping packets ar- there are a number of mechanisms that have been proriving at the gateway or by setting a bit in packet headers. posed for transport-layer protocols to maintain high through-When the average queue size exceeds a preset threshold, put and low delay in the network. Some of these proposed the gateway drops or marks each arriving packet with a mechanisms are designed to work with current gateways certain probability, where the exact probability is a func- [15, 23, 31, 33, 34], while other mechanisms are coution of the average queue size. pled with gateway scheduling algorithms that require per-RED gateways keep the average queue size low while connection state in the gateway [20, 22]. In the absence of allowing occasional bursts of packets in the queue. During explicit feedback from the gateway, transport-layer proto-
Citations
|
1790
|
Congestion avoidance and control
– Jacobson
- 1988
|
|
715
|
Probability inequalities for sums of bounded random variables
– Hoeffding
- 1963
|
|
319
|
A control-theoretic approach to flow control
– KESHAV
- 1993
|
|
301
|
Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic
– Zhang, Shenker, et al.
- 1991
|
|
276
|
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks
– Ramakrishan, Jain
- 1990
|
|
241
|
Connections with multiple congested gateways in packetswitched networks part 1: one-way traffic
– Floyd
- 1991
|
|
211
|
On Traffic Phase Effects in Packet-Switched Gateways
– Floyd, Jacobson
- 1992
|
|
193
|
Synchronization of Periodic Routing Messages
– Jacobson
- 1994
|
|
185
|
Internet Control Message Protocol
– Postel, ed
- 1981
|
|
162
|
Forecasting, Structural Time Series Models and the Kalman Filter
– Harvey
- 1989
|
|
144
|
Congestion Avoidance in Computer Networks with A Connectionless Network Layer: Part IV: A Selective Binary Feedback Scheme for General Topologies
– Ramakrishnan, Jain, et al.
- 1987
|
|
121
|
A new architecture for packet switching network protocols
– Zhang
- 1989
|
|
113
|
A Delay-Based Approach for Congestion Avoidance in Interconnected Heterogeneous Computer Networks
– Jain
- 1989
|
|
91
|
Supporting RealTime Applications
– Clark, Shenker, et al.
- 1992
|
|
78
|
Congestion control in computer networks: issues and trends
– Jain
- 1990
|
|
68
|
Analysis of Random Drop for Gateway Congestion Control
– Hashem
- 1989
|
|
67
|
A Network Simulator
– Keshav
- 1988
|
|
54
|
Oscillating Behavior of Network Traffic: A Case Study Simulation
– Zhang, Clark
- 1990
|
|
52
|
Probabilistic Analysis of Algorithms
– Hofri
- 1987
|
|
46
|
Dynamic adaptive windows for high speed data networks: Theory and simulations
– Mitra, Seery
- 1990
|
|
45
|
A new congestion control scheme: Slow start and search (Tri-S
– Wang, Crowcroft
- 1991
|
|
39
|
Recursive Estimation and Time-Series Analysis
– Young
- 1984
|
|
36
|
Congestion Control for High Speed Packet Switched Networks
– Bala, Cidon, et al.
- 1990
|
|
33
|
A table of series and products
– Hansen
- 1975
|
|
33
|
A hop by hop rate-based congestion control scheme
– Mishra, Kanakia
- 1992
|
|
32
|
Myths about congestion management in high-speed networks
– Jain
- 1992
|
|
25
|
On Traffic Phase Effects
– Floyd, Jacobson
- 1992
|
|
25
|
Something A Host Could Do with Source Quench
– PRUE, POSTEL
- 1987
|
|
15
|
Two Fast Implementations of the `Minimal Standard' Random Number Generator
– Carta
- 1990
|
|
11
|
Issues in Flexible Resource Management for Datagram Networks
– Floyd
- 1992
|
|
10
|
Myths about Congestion Management
– Jain
- 1990
|
|
10
|
NEST: A network simulation and prototyping tool
– Dupuy, Schwartz, et al.
- 1988
|
|
8
|
Eliminating Periodic Packet Losses
– Wang, Crowcroft
- 1992
|
|
7
|
Nest: a Network Simulation and Prototyping
– Dupuy, Schwartz, et al.
- 1988
|
|
5
|
A Delay-Based Approach for Congestion Avoidance
– Jain
- 1989
|
|
4
|
DTP: An Efficient Transport Protocol
– Sanghi, Agrawala
- 1991
|
|
3
|
The Performance of Adaptive Window Flow Controls in a Dynamic Load Environment
– Pingali, Tipper, et al.
- 1990
|
|
3
|
Some Performance Results for TCP over ATM with Congestion", to appear
– Romanow
- 1993
|
|
3
|
editors for the IETF Performance and Congestion Control Working Group, "Gateway congestion control survey", RFC 1254
– Mankin, Ramakrishnan
- 1991
|
|
2
|
Comments on the IETF performance and congestion control working group draft on gateway congestion control policies", unpublished
– Shenker
- 1989
|
