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
Book
Congestion avoidance in computer networks with a connectionless network layer
TL;DR: In this article, the authors compare the concept of congestion avoidance with that of congestion control and propose a binary feedback scheme to increase or decrease the load of the users to make optimal use of the resources.
Proceedings ArticleDOI
A hop by hop rate-based congestion control scheme
Partho P. Mishra,Hemant Kanakia +1 more
TL;DR: The results indicate that the proposed hop-by-hop rate-based mechanism for congestion control displays stable behavior for a wide range of traffic conditions and diverse network topologies, and is better than that of the end-to-end control schemes studied here.
Journal ArticleDOI
A new congestion control scheme: slow start and search (Tri-S)
Zheng Wang,Jon Crowcroft +1 more
TL;DR: This paper presents a new scheme in which the optimal operating point is obtained by evaluation of throughput gradient and resource sharing is adjusted only at the beginning and the end of a connection.
Analysis of random drop for gateway congestion control. M.S. Thesis
TL;DR: In this article, a gateway congestion control policy, called Random Drop, is proposed to relieve resource congestion upon buffer overflow by choosing a random packet from the service queue to be dropped.
Congestion control in computer networks
TL;DR: This thesis examines the problem of congestion control in reservationless packet switched wide area data networks by modeling a conversation as a linear system in a simple control-theoretic approach, which is used to synthesize a robust and provably stable flow control protocol.