Referenced Items are not available for this document.
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.
Published in:
Communications Letters, IEEE
(Volume:11
,
Issue:
7
)
Date of Publication: July 2007
- Page(s):
- 631 - 633
- ISSN :
- 1089-7798
- INSPEC Accession Number:
- 9611788
- Digital Object Identifier :
- 10.1109/LCOMM.2007.070250
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 16 July 2007
- Issue Date :
- July 2007
- Sponsored by :
- IEEE Communications Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
