An ergodic AIMD algorithm with application to high-speed networks

Abstract

In this article we propose a version of the Additive-Increase Multiplicative-Decrease (AIMD) algorithm that provides a suitable basis to develop congestion control protocols that can be deployed in both conventional and high-speed communication networks. Our algorithm retains many of the properties of the standard AIMD algorithm. However, unlike other non-standard AIMD algorithms, our scheme can be shown to be ergodic under very general assumptions.

Keywords:

• congestion control
• switched linear systems
• stochastic hybrid systems
• iterated function systems
• distributed resource allocation

Acknowledgements

This work was supported by Science Foundation Ireland. R. Shorten acknowledges gratefully helpful discussions with Uri Rothblum on the use of contraction mappings for studying nonlinear AIMD problems.