Adaptive AIMD Congestion Control

Alex Kesselman; Yishay Mansour

doi:10.1145/872035.872089

Adaptive AIMD Congestion Control

Alex Kesselman^*, Yishay Mansour

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Contribution to conference › Paper › peer-review

5 Scopus citations

Abstract

The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in changing environment. However, these objectives are contradicting in particular situations since the algorithm has to constantly 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.

Original language	English
Pages	352-359
Number of pages	8
DOIs	https://doi.org/10.1145/872035.872089
State	Published - 2003
Event	Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 - Boston, MA, United States Duration: 13 Jul 2003 → 16 Jul 2003

Conference

Conference	Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003
Country/Territory	United States
City	Boston, MA
Period	13/07/03 → 16/07/03

Keywords

Algorithms
Design
Performance

Access to Document

10.1145/872035.872089

Cite this

@conference{9d7bb7ef756b4e8ba322fcdd4a1bdac8,

title = "Adaptive AIMD Congestion Control",

abstract = "The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in changing environment. However, these objectives are contradicting in particular situations since the algorithm has to constantly 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.",

keywords = "Algorithms, Design, Performance",

author = "Alex Kesselman and Yishay Mansour",

year = "2003",

doi = "10.1145/872035.872089",

language = "אנגלית",

pages = "352--359",

note = "Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003 ; Conference date: 13-07-2003 Through 16-07-2003",

}

TY - CONF

T1 - Adaptive AIMD Congestion Control

AU - Kesselman, Alex

AU - Mansour, Yishay

PY - 2003

Y1 - 2003

N2 - The main objectives of a congestion control algorithm are high bandwidth utilization, fairness and responsiveness in changing environment. However, these objectives are contradicting in particular situations since the algorithm has to constantly 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 changing environment. However, these objectives are contradicting in particular situations since the algorithm has to constantly 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 - Algorithms

KW - Design

KW - Performance

UR - http://www.scopus.com/inward/record.url?scp=1142293087&partnerID=8YFLogxK

U2 - 10.1145/872035.872089

DO - 10.1145/872035.872089

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:1142293087

SP - 352

EP - 359

T2 - Twenty-Second Annual ACM Symposium on Principles of Distributed Computing, PODC 2003

Y2 - 13 July 2003 through 16 July 2003

ER -

Adaptive AIMD Congestion Control

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this