… In this paper, we have considered a general version of AIMD congestion control, where the
increase value and decrease ratio in congestion window adjustment are parameters, a and p…

… We consider a network of n general AIMD sources. Each source is parameterised by an
additive increase parameter and a multiplicative decrease factor, denoted by α i and β i , …

… In Section 2, we discuss AIMD congestion control, and compare AIMD with MAIMD in …
general system model where users can have different round-trip times. We show that under AIMD, …

… The general (nonlinear) case. We next consider the general AIMD case in which a(·) is not
… case to demonstrate that, in the more general case as well, the operator A is a contraction …

… Now we turn to define the objectives of a congestion control algorithm. First we relate the …
4.1 General Properties of the ACC Algorithm In this section we study general properties of …

… AIMD. Then, we analytically compare the convergence time of SIMD, general AIMD [S, 221,
and binomial control … Binomial algorithms are a family of algorithms generalizing AIMD. The …

… general properties of these schemes and provides no information about the inherent limits of
congestion control … We introduce a robust variant of AIMD, called Robust-AIMD, designed to …

… [7], propose a standard AIMD congestion control algorithm known as General Additive
Increase, Multiplicative Decrease (GAIMD), which considers the increasing value and decreasing …

… the congestion control parameters. Then, the resource sharing between single-path TCP
flows and multipath MPTCP flows is viewed as a special case of the above general problem. …

… general properties of these schemes and provide no information about the inherent limits of
congestion control … Robust-AIMD, which can be regarded as a hybrid of traditional AIMD and …