On the ergodicity of AIMD networks

In this paper we study communication networks that employ drop-tail queueing and Additive-Increase Multiplicative- Decrease (AIMD) congestion control algorithms. A basic assumption in the study of such networks is that the underlying stochastic process is ergodic. In this paper we present a proof of ergodicity for such networks under very general assumptions.