On AIMD Congestion Control in Multiple Bottleneck Networks.
Kellett, Christopher M. and Middleton, Richard H. and Shorten, Robert N. (2007) On AIMD Congestion Control in Multiple Bottleneck Networks. IEEE Communications Letters . pp. 631-633. ISSN 1089-7798
We consider a linear algebraic model of the Additive-Increase Multiplicative-Decrease congestion control algorithm and present results on average fairness and convergence for multiple bottleneck networks. Results are presented for
networks of both long-lived and short-lived flows.
|Additional Information:||"©2007 IEEE. Reprinted from IEEE Communications Letters. 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=4273784&isnumber=4273758&tag=1|
|Keywords:||Mathematical analysis; Matrix algebra; Telecommunication congestion control; AIMD congestion control; Additive-increase multiplicative-decrease congestion control algorithm; Linear algebraic model; Multiple bottleneck networks; Hamilton Institute.|
|Subjects:||Science & Engineering > Hamilton Institute|
Science & Engineering > Computer Science
Science & Engineering > Mathematics
|Deposited By:||Hamilton Editor|
|Deposited On:||14 Dec 2009 17:28|
|Journal or Publication Title:||IEEE Communications Letters|
Repository Staff Only: item control page