.png){kind=icon}
.png){kind=icon}
Return
On the AIMD Algorithm Under Saturation Constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2017.2651160.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
One of the most successful distributed resource allocation algorithms to be deployed in industry is the Additive-Increase Multiplicative-Decrease (AIMD) algorithm of Jain and Chiu. This algorithm already underpins the transport layer of the internet, and is now starting to find application in new areas in the context of SmartGrid and Smart Transportation applications. A distinguishing feature of these latter application areas, when compared with the internet, is the need to modify AIMD to account for lower and upper bounds in the resource allocated to individual agents. Our objective in this note is to demonstrate that the dynamic system arising from AIMD in this extended form has system theoretic properties similar to the classical algorithm.
Keywords:
AIMD
congestion control
convergence
distributed control
positive systems
resource allocation algorithm
TCP
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
View more organizations