Additive increase adaptive decrease congestion control: a mathematical model and its experimental validation

Due to the fundamental end-to-end design principle of the TCP/IP for which the network cannot supply any explicit feedback, today the TCP congestion control algorithm implements an additive increase multiplicative decrease (AIMD) algorithm. It is widely recognized that the AIMD mechanism is at the c...

Full description

Saved in:
Bibliographic Details
Main Authors: Grieco, L.A., Mascolo, S., Ferorelli, R.
Format: Conference Proceeding
Language:English
Subjects:
Adaptive control
Algorithm design and analysis
Bandwidth
Feedback
Internet
Mathematical model
Programmable control
Stability
TCPIP
Throughput
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Due to the fundamental end-to-end design principle of the TCP/IP for which the network cannot supply any explicit feedback, today the TCP congestion control algorithm implements an additive increase multiplicative decrease (AIMD) algorithm. It is widely recognized that the AIMD mechanism is at the core of the stability of end-to-end congestion control. In this paper we describe a new mechanism we call additive increase adaptive decrease (AIAD). The key concept of the adaptive decrease mechanism is to adapt congestion window reductions to the bandwidth available at the time the congestion is experienced. We propose Westwood++ TCP as an implementation of the AIAD paradigm, and we consider Reno TCP as an example of the AIMD mechanism for comparison. We derive a mathematical model of the throughput of the AIAD mechanism that shows that Westwood++ is stable, is friendly to Reno and increases the fairness in bandwidth utilization. To confirm the validity of the theoretical model Internet measurements are reported.
ISSN:1530-1346
2642-7389
DOI:10.1109/ISCC.2002.1021772