Competitive Routing in Multi-User Communication Networks (1993)
Cached
Download Links
- [www.comnet.technion.ac.il]
- [www-ee.technion.ac.il]
- DBLP
Other Repositories/Bibliography
| Venue: | IEEE/ACM Transactions on Networking |
| Citations: | 148 - 18 self |
BibTeX
@ARTICLE{Orda93competitiverouting,
author = {Ariel Orda and Raphael Rom and Nahum Shimkin},
title = {Competitive Routing in Multi-User Communication Networks},
journal = {IEEE/ACM Transactions on Networking},
year = {1993},
volume = {1},
pages = {510--521}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider a communication network shared by several selfish users. Each user seeks to optimize its own performance by controlling the routing of its given flow demand, giving rise to a non-cooperative game. We investigate the Nash equilibrium of such systems. For a two-node multiple-links system, uniqueness of the Nash equilibrium is proved under reasonable convexity conditions. It is shown that this Nash equilibrium point possesses interesting monotonicity properties. For general networks, these convexity conditions are not sufficient for guaranteeing uniqueness, and a counter example is presented. Nonetheless, uniqueness of the Nash equilibrium for general topologies is established under various assumptions. Also with Sun Microsystems, Mountain View, CA 1 1 Introduction Traditional computer networks were designed with a single administrative domain in mind. That is, the network is designed and operated as a single entity with a single control objective. A single control object...
Citations
No citations identified.
