About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
GLOBECOM 2001
Conference paper
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.