Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of a rate-based control strategy with delayed feedback
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
TCP and explicit congestion notification
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
End-to-end congestion control for the internet: delays and stability
IEEE/ACM Transactions on Networking (TON)
Mean FDE models for Internet congestion control under a many-flows regime
IEEE Transactions on Information Theory
Hop-by-hop congestion control over a wireless multi-hop network
IEEE/ACM Transactions on Networking (TON)
A non-equilibrium analysis and control framework for active queue management
Automatica (Journal of IFAC)
Bounds estimation and practical stability of AIMD/RED systems with time delays
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We consider decentralized congestion control algorithms for low-loss operation of the Internet using the ECN bit. There has been much analysis of such algorithms, but with a few exceptions, these typically ignore the effect of feedback delays in the network on stability. We study a single node with many flows passing through it, with each flow (possibly) having a different round-trip delay. Using a fluid model for the flows, we show that even with delays, the total data rate at the router is bounded; and this bound shows that the (peak) total rate grows linearly with increase in system size, i.e., the fraction of overprovisioning required is constant with respect to N, the number of flows in the system. Further, for typical user data rates and delays seen in the Internet today, the bound is very close to the data rate at the router without delays. Earlier results by Johari and Tan have given conditions for a linearized model of the network to be (locally) stable. We show that even when the linearized model is not stable, the nonlinear model is upper bounded, i.e., the total rate at the bottleneck link is upper bounded, and the upper bound is close to the equilibrium rate for TCP.