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
CDC 2015
Conference paper
On the modified AIMD algorithm for distributed resource management with saturation of each user's share
Abstract
Recently the additive increase multiplicative decrease (AIMD) algorithm has been applied in fields other than congestion control in communications networks. A major attribute of these new applications is that the share of each user is bounded. Simulations suggest that AIMD performs well, even in the case of individual constraints on each user. In this paper, we provide a formal proof of exponential convergence to a unique fixed-point for the AIMD algorithm under individual user constraints.