Referenced Items are not available for this document.
In this paper, we study the problem of designing globally stable, scalable congestion control algorithms for the Internet. Prior work has primarily used linear stability as the criterion for such a design. Global stability has been studied only for single node, single source problems. Here, we obtain conditions for a general topology network accessed by sources with heterogeneous delays. We obtain a sufficient condition for global stability in terms of the increase/decrease parameters of the congestion control algorithm and the price functions used at the links
Published in:
Networking, IEEE/ACM Transactions on
(Volume:14
,
Issue:
3
)
Date of Publication: June 2006
- Page(s):
- 579 - 590
- ISSN :
- 1063-6692
- INSPEC Accession Number:
- 8955345
- Digital Object Identifier :
- 10.1109/TNET.2006.876164
- 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.
