Asynchronous algorithms for network utility maximisation with a single bit

Title: Asynchronous algorithms for network utility maximisation with a single bit
Creator: Wirth, Fabian; Stuedli, Sonja; Yu, Jia Yuan; Corless, Martin; Shorten, Robert
Relation: 2015 European Control Conference (ECC). Proceedings of the 2015 European Control Conference (Linz, Austria 15-17 July, 2015) p. 291-296
Publisher Link: http://dx.doi.org/10.1109/ECC.2015.7330559
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Resource Type: conference paper
Date: 2015
Description: We present a convergence result for a nonhomogeneous Markov chain that arises in the study of networks employing the additive-increase multiplicative decrease (AIMD) algorithm. We then use this result to solve the network utility maximisation (NUM) problem.
Subject: feedback; telecommunication congestion control; transport protocols
Identifier: http://hdl.handle.net/1959.13/1315799
Identifier: uon:22998
Identifier: ISBN:9783952426937
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format