SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance in computer networks with a connectionless network layer
Innovations in Internetworking
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A connectionless congestion control algorithm
ACM SIGCOMM Computer Communication Review
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A control-theoretic approach to flow control
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Loss-load curves: support for rate-based congestion control in high-speed datagram networks
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Performance analysis of a feedback congestion control policy under non-negligible propagation delay
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Analysis of dynamic congestion control protocols: a Fokker-Planck approximation
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Dynamics of congestion control and avoidance of two-way traffic in an OSI testbed
ACM SIGCOMM Computer Communication Review
Rate controls in standard transport layer protocols
ACM SIGCOMM Computer Communication Review
Warp control: a dynamically stable congestion protocol and its analysis
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Reserved bandwidth and reservationless traffic in rate allocating servers
ACM SIGCOMM Computer Communication Review
Feedback control of congestion in packet switching networks: the case of a single congested node
IEEE/ACM Transactions on Networking (TON)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A control-theoretic approach to flow control
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
The performance of TCP/IP for networks with high bandwidth-delay products and random loss
IEEE/ACM Transactions on Networking (TON)
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end congestion control for the internet: delays and stability
IEEE/ACM Transactions on Networking (TON)
Stability and performance analysis of rate-based feedback flow controlled ATM networks
Queueing Systems: Theory and Applications
Adaptive AIMD congestion control
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Methodological frameworks for large-scale network analysis and design
ACM SIGCOMM Computer Communication Review
Exogenous-loss aware traffic management in overlay networks toward global fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
What does control theory bring to systems research?
ACM SIGOPS Operating Systems Review
Efficiency of Scalar-Parameterized Mechanisms
Operations Research
QoS-sensitive transport of real-time MPEG video using adaptive redundancy control
Computer Communications
| Hi-index | 0.00 |
Congestion is a longstanding problem in datagram networks. One congestion avoidance technique is feedback flow control, in which sources adjust their transmission rate in response to congestion signals sent (implicitly or explicitly) by network gateways. The goal is to design flow control algorithms which provide time-scale invariant, fair, stable, and robust performance. In this paper we introduce a simple model of feedback flow control, in which sources make synchronous rate adjustments based on the congestion signals and other local information, and apply it to a network of Poisson sources and exponential servers. We investigate two different styles of feedback, aggregate and individual, and two different gateway service disciplines, FIFO and Fair Share. The purpose of this paper is to identify, in the context of our simple model, which flow control design choices allow us to achieve our performance goals.Aggregate feedback flow control, in which congestion signals reflect only the aggregate congestion at the gateways, can provide time-scale invariant and stable performance, but not fair or robust performance. The properties of individual feedback flow control, in which the congestion signals reflect the congestion caused by the individual source, depend on the service discipline used in the gateways. Individual feedback with FIFO gateways can provide time-scale invariant, fair, and stable performance, but not robust performance. Individual feedback with Fair Share gateways can achieve all four performance goals. Furthermore, its stability properties are superior to those of the other two design choices. By making robust and more stable performance possible, gateway service disciplines play a crucial role in realizing effective flow control.