Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 22, 2005 | public
Book Section - Chapter Open

Network equilibrium of heterogeneous congestion control protocols

Abstract

When heterogeneous congestion control protocols that react to different pricing signals share the same network, the resulting equilibrium may no longer be interpreted as a solution to the standard utility maximization problem. We prove the existence of equilibrium under mild assumptions. Then we show that multi-protocol networks whose equilibria are locally non-unique or infinite in number can only form a set of measure zero. Multiple locally unique equilibria can arise in two ways. First, unlike in the single-protocol case, the set of bottleneck links can be non-unique with heterogeneous protocols even when the routing matrix has full row rank. The equilibria associated with different sets of bottleneck links are necessarily distinct. Second, even when there is a unique set of bottleneck links, network equilibrium can still be non-unique, but is always finite and odd in number. They cannot all be locally stable unless it is globally unique. Finally, we provide various sufficient conditions for global uniqueness. Numerical examples are used throughout the paper to illustrate these results.

Additional Information

© Copyright 2005 IEEE. Reprinted with permission. We thank Kim Border and John Ledyard of Caltech, and Ramesh Johari of Stanford for useful discussions, and R. Srikant of UIUC for some references. This work is performed as part of the FAST Project supported by NSF, ARO, AFOSR and Cisco. We also thank the support from NSF Grants CCF-0440443, CNS-0417607, CNS-0427677, and SISL Fellowship.

Files

TANinfocomm05.pdf
Files (2.2 MB)
Name Size Download all
md5:9648d009c62d80297eda425c782bddde
2.2 MB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023