Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Congestion Avoidance and Control Van Jacobson
 

Summary: Congestion Avoidance and Control
Van Jacobson
Lawrence Berkeley Laboratory
Michael J. Karels
University of California at Berkeley
November, 1988
Introduction
Computer networks have experienced an explosive growth over the past few years and with
that growth have come severe congestion problems. For example, it is now common to see
internet gateways drop 10% of the incoming packets because of local buffer overflows.
Our investigation of some of these problems has shown that much of the cause lies in
transport protocol implementations (not in the protocols themselves): The `obvious' ways
to implement a window-based transport protocol can result in exactly the wrong behavior
in response to network congestion. We give examples of `wrong' behavior and describe
some simple algorithms that can be used to make right things happen. The algorithms are
rooted in the idea of achieving network stability by forcing the transport connection to obey
a `packet conservation' principle. We show how the algorithms derive from this principle
and what effect they have on traffic over congested networks.
In October of '86, the Internet had the first of what became a series of `congestion col-
lapses'. During this period, the data throughput from LBL to UC Berkeley (sites separated

  

Source: Akella, Aditya - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences