A theoretical analysis of feedback flow control
- 1 August 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 20 (4), 156-165
- https://doi.org/10.1145/99517.99547
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Making greed work in networks: a game-theoretic analysis of gateway service disciplinesPublished by Association for Computing Machinery (ACM) ,1990
- A connectionless congestion control algorithmACM SIGCOMM Computer Communication Review, 1989
- Analysis and simulation of a fair queueing algorithmACM SIGCOMM Computer Communication Review, 1989
- Analysis of the increase and decrease algorithms for congestion avoidance in computer networksComputer Networks and ISDN Systems, 1989
- Congestion avoidance and controlACM SIGCOMM Computer Communication Review, 1988
- A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layerACM SIGCOMM Computer Communication Review, 1988
- On Packet Switches with Infinite StorageIEEE Transactions on Communications, 1987
- Dynamic control of session input rates in communication networksIEEE Transactions on Automatic Control, 1984
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981