TY - JOUR
T1 - Adaptive AIMD congestion control
AU - Kesselman, Alex
AU - Mansour, Yishay
PY - 2005/7
Y1 - 2005/7
N2 - The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in a changing environment. However, these objectives are contradicting in particular situations since the algorithm constantly has to probe available bandwidth, which may affect its stability. This paper proposes a novel congestion control algorithm that achieves high bandwidth utilization providing fairness among competing connections and, on the other hand, is sufficiently responsive to changes of available bandwidth. The main idea of the algorithm is to use adaptive setting for the additive increase/multiplicative decrease (AIMD) congestion control scheme, where parameters may change dynamically, with respect to the current network conditions.
AB - The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in a changing environment. However, these objectives are contradicting in particular situations since the algorithm constantly has to probe available bandwidth, which may affect its stability. This paper proposes a novel congestion control algorithm that achieves high bandwidth utilization providing fairness among competing connections and, on the other hand, is sufficiently responsive to changes of available bandwidth. The main idea of the algorithm is to use adaptive setting for the additive increase/multiplicative decrease (AIMD) congestion control scheme, where parameters may change dynamically, with respect to the current network conditions.
KW - AIMD
KW - Adaptive congestion control
UR - http://www.scopus.com/inward/record.url?scp=23944460114&partnerID=8YFLogxK
U2 - 10.1007/s00453-005-1160-3
DO - 10.1007/s00453-005-1160-3
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:23944460114
SN - 0178-4617
VL - 43
SP - 97
EP - 111
JO - Algorithmica
JF - Algorithmica
IS - 1-2
ER -