DocumentCode
3160744
Title
On the ergodicity of AIMD networks
Author
Shorten, Robert ; King, Chris ; Wirth, Fabian ; Leith, Douglas
Author_Institution
NUI Maynooth, Maynooth
fYear
2007
fDate
9-13 July 2007
Firstpage
3283
Lastpage
3287
Abstract
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.
Keywords
queueing theory; stochastic processes; telecommunication congestion control; AIMD congestion control algorithm; additive-increase multiplicative-decrease network; drop-tail queueing algorithm; stochastic process; Cities and towns; Communication networks; Communication system control; Concrete; Convergence; Stochastic processes; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference, 2007. ACC '07
Conference_Location
New York, NY
ISSN
0743-1619
Print_ISBN
1-4244-0988-8
Electronic_ISBN
0743-1619
Type
conf
DOI
10.1109/ACC.2007.4282283
Filename
4282283
Link To Document