On the AIMD algorithm under saturation constraints

Title: On the AIMD algorithm under saturation constraints
Creator: Stüdli, S.; Corless, M.; Middleton, R. H.; Shorten, R.
Relation: IEEE Transactions on Automatic Control Vol. 62, Issue 12, p. 6392-6398
Publisher Link: http://dx.doi.org/10.1109/TAC.2017.2651160
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Resource Type: journal article
Date: 2017
Description: 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 Smart Grid 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.
Subject: convergence; heuristic algorithms; resource management; context awareness; transportation; artificial intelligence
Identifier: http://hdl.handle.net/1959.13/1398682
Identifier: uon:34480
Identifier: ISSN:0018-9286
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format