A comparison of two popular end-to-end congestion control algorithms: The case of AIMD and AIPD

Abstract

The focus of this paper is to compare two popular end-to-end congestion control algorithms in the literature, namely, AIMD (additive increase/muitiplicative decrease) and AIPD (additive increase/loss proportional decrease). We clarify the definitions of AIMD and AIPD algorithms, and compare them in various aspects such as convergence, steady state throughput, fairness characteristics, and the corresponding utility functions. The comparison is based on a simple mathematical analysis and a set of simulation results using the ns-2 simulator.