Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A positive systems model of TCP-like congestion control: asymptotic results
IEEE/ACM Transactions on Networking (TON)
TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Nonlinear AIMD Congestion Control and Contraction Mappings
SIAM Journal on Control and Optimization
A comprehensive TCP fairness analysis in high speed networks
Computer Communications
Congestion control with multipacket feedback
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 22.14 |
In this paper we establish basic stability results for a class of nonlinear AIMD (additive-increase multiplicative-decrease) algorithms. We consider networks in which the nonlinearity enters through the multiplicative-decrease mechanism. In particular, where the multiplicative-decrease function depends in a nonlinear fashion on the achieved rate. For synchronized deterministic networks, we establish stability and convergence results. For non-synchronized stochastic networks, basic convergence results are also established. In particular, we give conditions for the existence of a unique invariant stationary distribution, and conditions under which time- and ensemble-averages converge to the same unique value (irrespective of initial conditions).