Referenced Items are not available for this document.
We study communication networks that employ drop-tail queueing and Additive-Increase Multiplicative-Decrease (AIMD) congestion control algorithms. It is shown that the theory of nonnegative matrices may be employed to model such networks. In particular, important network properties, such as: 1) fairness; 2) rate of convergence; and 3) throughput, can be characterized by certain nonnegative matrices. We demonstrate that these results can be used to develop tools for analyzing the behavior of AIMD communication networks. The accuracy of the models is demonstrated by several NS studies
Published in:
Networking, IEEE/ACM Transactions on
(Volume:14
,
Issue:
3
)
Date of Publication: June 2006
- Page(s):
- 616 - 629
- ISSN :
- 1063-6692
- INSPEC Accession Number:
- 8955348
- Digital Object Identifier :
- 10.1109/TNET.2006.876178
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 19 June 2006
- Issue Date :
- June 2006
- Sponsored by :
- Association for Computing Machinery
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.
