• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A binary feedback scheme for congestion avoidance in computer networks (1990)

Cached

  • Download as a PDF

Download Links

  • [www.cs.wustl.edu]
  • [www.cs.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cs.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cse.wustl.edu]
  • [www.cs.wustl.edu]
  • [www.cs.wustl.edu]
  • [www.ecse.rpi.edu]
  • [www-cse.ucsd.edu]
  • [www.cse.ucsc.edu]
  • [www.soe.ucsc.edu]
  • [www.cs.toronto.edu]
  • [www.cs.columbia.edu]
  • [www.cs.toronto.edu]
  • [www.research.att.com]
  • [www.cse.wustl.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by K. K. Ramakrishnan , Raj Jain
Venue:ACM TRANSACTIONS ON COMPUTER SYSTEMS
Citations:291 - 20 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Ramakrishnan90abinary,
    author = {K. K. Ramakrishnan and Raj Jain},
    title = {A binary feedback scheme for congestion avoidance in computer networks},
    journal = {ACM TRANSACTIONS ON COMPUTER SYSTEMS},
    year = {1990},
    volume = {8},
    pages = {158--181}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses feedback from the network to the users of the network. The interesting challenge for the scheme is to use a minimal amount of feedback (one bit in each packet) from the network to adjust the amount of traffic allowed into the network. The servers in the network detect congestion and set a congestion indication bit on packets flowing in the forward direction. The congestion indication is commu-nicated back to the users through the transport level acknowledgement. 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 while operational. The scheme also addresses a very important aspect of fairness in the service provided to the various sources utilizing the network. The scheme at-tempts to maintain fairness in service provided to multiple sources. This paper presents the scheme and the analysis that went into the choice of the various decision mechanisms. We also address the performance of the scheme under transient changes in the network and for pathological conditions.

Citations

929 Computer Networks - Tanenbaum - 1981
678 Transmission control protocol - Postel - 1981
331 A Quantitative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems - Jain, Chiu, et al. - 1984
142 Congestion Avoidance in Computer Networks with a Connectionless Network Layer - Jain, Ramakrishnan - 1988
98 Flow control: A comparative survey - Gerla, Kleinrock - 1980
85 Congestion control in IP/TCP Internetworks,” Request for Comments (RFC - Nagle - 1984
47 A timesout-based congestion control scheme for window flow-controlled networks - Jain - 1986
29 Balanced job bound analysis of queueing networks - Zahorjan, Sevcik, et al. - 1982
20 and deterministic rules of thumb for probabilistic problems in computer communications - Kleinrock, “Power - 1979
15 On flow control in computer networks - Kleinrock - 1978
15 Congestion control in tcp/ip internetworks - Nagle - 1984
11 Routing and Flow Control in Systems Network Architecture - Ahuja
10 and D:Grillo, “Flow control in local-area networks of interconnected token rings - Bux - 1985
8 Free buffer allocation-An investigation by simulation - Giessler, Haanle, et al. - 1978
7 Analysis of the dynamic window congestion control protocol in heterogeneous environments including satellite links - Ramakrishnan - 1984
6 Experiments in congestion control techniques - MAJITHIA, IRLAND, et al. - 1979
5 Majithia et al., “Experiments in congestion control techniques - C - 1979
4 Queueing and delay analysis of a buffer pool with resume level - Reiser - 1983
3 Free Butler Allocation - An Investigation by Simulation - Giessler, Haanle, et al. - 1978
3 aud Leouard Kleinrock. Flow control: a comparative survey - Gerla - 1980
3 An analytic nrodel for Row control schemes iu conununicotion network nodes - Peter - 1986
3 A timeout,-hased congestiou control scheme for window flow-controlled networks - Jsiu - 1986
3 A Quantitative Measure OJ Fairness and Discrintnntron /or Resource Allocation in Shared Systems - Jain, Chiu, et al. - 1984
3 Congestion Avoitlnnce in Coruputer Net,works with a Counectionless Network Layer - Ramakrishnau - 1988
3 and deterministic rules of thurub for probabilistic problems ia computer communications - Power - 1979
3 Analysis of a dynamic window congestion control protocol iu heterogeneous environments including satellite links - Ratnakrishaau - 1986
3 Computer Networks - Tzmenbaun - 1981
3 and Htmg-Ming Yea. Design algorithm for a hysteresis buffer congestion corurol strategy - Yum - 1983
2 Free buffer allocation - an investigation by simulation. Computer Networks - Giessler, Haanle, et al. - 1978
2 An analytic model for flow control schemes in communication network nodes - Harrison - 1984
2 Design algorithm for a hysteresis buffer congestion control strategy - Yum, Yen - 1983
1 Flow control in locM-area networks of interconnected token rings - Bux, Grillo - 1985
1 International Organization for Standardization. ISO 8073: Information Processing Systems - Open Systems Interconnection - Connection Oriented Transport Protocol Specification - Jain - 1986
1 DECnet digital network architecture (phase IV) general description - CORPORATION - 1982
1 ISO 8073: Information Processing Systems - Open Systems Interconnection - Connection Oriented Transport Protocol Specification - Jain - 1986
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University