SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Dynamic adaptive windows for high speed data networks: theory and simulations
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Analysis of dynamic congestion control protocols: a Fokker-Planck approximation
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
A unified set of proposals for control and design of high speed data networks
Queueing Systems: Theory and Applications
Congestion control in computer networks
Congestion control in computer networks
Dynamical behavior of rate-based flow control mechanisms
ACM SIGCOMM Computer Communication Review
A hop by hop rate-based congestion control scheme
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Warp control: a dynamically stable congestion protocol and its analysis
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Intelligent congestion control for ABR service in ATM networks
ACM SIGCOMM Computer Communication Review
Design of Robust Congestion Controllers for ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Bounds on the throughput of congestion controllers in the presence of feedback delay
IEEE/ACM Transactions on Networking (TON)
Network buffer requirements of the rate-based control mechanism for ABR services
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
QoS-sensitive transport of real-time MPEG video using adaptive redundancy control
Computer Communications
| Hi-index | 0.00 |
In this paper we analyze a class of delayed feedback schemes that achieves the dual goal of keeping buffers small and utilizations high, despite propagation delays and regardless of network rates. We analyze delayed feedback schemes as a system of delay-differential equations, in which we model the queue-length process and the rate at which a source transmits data as fluids. We assume that a stream of acknowledgements carries information about the state of a bottleneck queue back to the source, which adapts its transmission rate according to any monotone function of that state. We show stability for this class of schemes, in that their rate of transmission and queue length rapidly converge to a small neighborhood of the designed operating point. We identify the appropriate scaling of the model's parameters for the system to perform optimally.