Journal ArticleDOI
Random early detection gateways for congestion avoidance
Sally Floyd,Van Jacobson +1 more
Reads0
Chats0
TLDR
Red gateways are designed to accompany a transport-layer congestion control protocol such as TCP and have no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time.Abstract:Â
The authors present random early detection (RED) gateways for congestion avoidance in packet-switched 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 present 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 synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways. >read more
Citations
More filters
Posted Content
Forecasting, Structural Time Series Models and the Kalman Filter
TL;DR: In this paper, the authors provide a unified and comprehensive theory of structural time series models, including a detailed treatment of the Kalman filter for modeling economic and social time series, and address the special problems which the treatment of such series poses.
Journal ArticleDOI
The click modular router
TL;DR: On conventional PC hardware, the Click IP router achieves a maximum loss-free forwarding rate of 333,000 64-byte packets per second, demonstrating that Click's modular and flexible architecture is compatible with good performance.
TCP Congestion Control
TL;DR: This document defines TCP's four intertwined congestion control algorithms: slow start, congestion avoidance, fast retransmit, and fast recovery, as well as discussing various acknowledgment generation methods.
Journal ArticleDOI
Fair end-to-end window-based congestion control
Jeonghoon Mo,Jean Walrand +1 more
TL;DR: The existence of fair end-to-end window-based congestion control protocols for packet-switched networks with first come-first served routers is demonstrated using a Lyapunov function.
Proceedings ArticleDOI
Modeling TCP throughput: a simple model and its empirical validation
TL;DR: In this article, the authors developed a simple analytic characterization of the steady state throughput, as a function of loss rate and round trip time for a bulk transfer TCP flow, i.e., a flow with an unlimited amount of data to send.
References
More filters
Proceedings ArticleDOI
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
TL;DR: This paper uses simulation to study the dynamics of the congestion cent rol algorithm embedded in the BSD 4.3-Tahoe TCP implementation and finds that the one-way traffic clustering and loss-synchronization phenomena persist in this new situation, albeit in a slightly modified form.
Journal ArticleDOI
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
TL;DR: It is shown that in a network with no bias against connections with longer roundtrip times and with no biases against bursty traffic, a connection with multiple congested gateways can receive an acceptable level of throughput.
Book
Recursive Estimation and Time-Series Analysis: An Introduction for the Student and Practitioner
TL;DR: The CAPTAIN Toolbox for recursive estimation and time series analysis has been developed at Lancaster, for use in the MatlabTM software environment (see Appendix G). Consequently, the present version of the book is able to exploit the many computational routines that are contained in this widely available Toolbox, as well as some of the other routines in Matlab TM and its other toolboxes.
Journal ArticleDOI
Traffic phase effects in packet-switched gateways
Sally Floyd,Van Jacobson +1 more
TL;DR: This paper defines the notion of traffic phase in a packet-switched network and describesHow phase differences between competing traffic streams can be the dominant factor in relative throughput and suggests that simply coding a gateway to drop a random packet from its queue on overflow is often sufficient.
Journal ArticleDOI
A binary feedback scheme for congestion avoidance in computer networks
TL;DR: The scheme is distributed, adapts to the dynamic state of the network, converges to the optimal operating point, is quite simple to implement, and has low overhead.