On the ergodicity of AIMD networks.
Shorten, Robert and King, Chris and Wirth, Fabian and Leith , Douglas (2007) On the ergodicity of AIMD networks. In: Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007. IEEE, pp. 3283-3287. ISBN 1-4244-0988-8
In this paper we study communication networks that employ drop-tail queueing and Additive-Increase Multiplicative-
Decrease (AIMD) congestion control algorithms. A basic assumption in the study of such networks is that the underlying stochastic process is ergodic. In this paper we present a proof of ergodicity for such networks under very general assumptions.
|Additional Information:||©0000 IEEE. Reprinted from Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4282283&isnumber=4282135|
|Keywords:||Queueing theory; Stochastic processes; Telecommunication congestion control; AIMD congestion control algorithm; Additive-increase multiplicative-decrease network; Drop-tail queueing algorithm; Stochastic process; ACC '07; Hamilton Institute.|
|Subjects:||Science & Engineering > Hamilton Institute|
Science & Engineering > Computer Science
|Deposited By:||Hamilton Editor|
|Deposited On:||22 Dec 2009 12:41|
Repository Staff Only: item control page