Competitive routing in multiuser communication networks
Authors:
- 1 January 1993
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 1 (5) , 510-521
Abstract
We consider a communication network shared by several selfish users. Each userseeks 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 ofsuch systems. For a two-node multiple-links system, uniqueness of the Nash equilibriumis proved under reasonable convexity conditions. It is shown that this Nash equilibriumpoint possesses interesting monotonicity properties. For general...Keywords
This publication has 16 references indexed in Scilit:
- Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environmentIEEE Transactions on Communications, 1992
- Optimal decentralized flow control of Markovian queueing networks with multiple controllersPerformance Evaluation, 1991
- Fairness in network optimal flow control: optimality of product formsIEEE Transactions on Communications, 1991
- Making greed work in networks: a game-theoretic analysis of gateway service disciplines1990
- Policy routing in Internet protocols1989
- Multi-Agent Customer Allocation in a Stochastic Service SystemManagement Science, 1985
- The DARPA Internet: Interconnecting Heterogeneous Computer Networks with GatewaysComputer, 1983
- The ARPA internet protocolComputer Networks (1976), 1981
- Traffic assignment problem for a general networkJournal of Research of the National Bureau of Standards, Section B: Mathematical Sciences, 1969
- Existence and Uniqueness of Equilibrium Points for Concave N-Person GamesEconometrica, 1965