Congestion Avoidance and Control (1988)
http://catarina.usc.edu/yaxu/551/../Vegas/Referenc
http://eecs.harvard.edu/~jonathan/papers/1988/tcp8
http://cs.wisc.edu/~cs736-1/cs736.html/Papers/jaco
http://www-db.stanford.edu/~manku/quals/zpapers/95
http://www.gta.ufrj.br/diffserv/congavoid.ps.gz
http://www.cs.wisc.edu/~remzi/Classes/736/Fall2000
CiteULike | DBLP
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Van Jacobson (Karel was not an author of the SIGCOMM paper. The Original SIGCOMM paper is available and and we don't want to try re-writing history.) and Van Jacobson and Michael J. Karels},
title = {Congestion Avoidance and Control},
year = {1988}
}
Bookmarks
OpenURL
Abstract:
This paper is a brief description of (i) -- (v) and the rationale behind them. (vi) is an algorithm recently developed by Phil Karn of Bell Communications Research, described in [15]. (vii) is described in a soon-to-be-published RFC (Arpanet "Request for Comments"). Algorithms (i) -- (v) spring from one observation: The flow on a tcp connection (or iso tp-4 or Xerox ns spp connection) should obey a `conservation of packets' principle. And, if this principle were obeyed, congestion collapse would become the exception rather than the rule. Thus congestion control involves finding places that violate conservation and fixing them. By `conservation of packets' we mean that for a connection `in equilibrium', i.e., running stably with a full window of data in transit, the packet flow is what a physicist would call `conservative': A new packet isn't put into the network until an old packet leaves. The physics of flow predicts that systems with this property should be robust in the face of congestion.
