Competitive routing in multiuser communication networks

The authors 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 noncooperative game. They investigate the Nash equilibrium of such systems. For a two-node multiple links system, uniqueness of the Nash equilibrium is proven 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 counterexample is presented. Nonetheless, uniqueness of the Nash equilibrium for general topologies is established under various assumptions. >

[1]  J. Goodman.  Note on Existence and Uniqueness of Equilibrium Points for Concave N-Person Games , 1965 .

[2]  Stella C. Dafermos,et al.  Traffic assignment problem for a general network , 1969 .

[3]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[4]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[5]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[6]  Carl A. Sunshine,et al.  The ARPA Internet Protocol , 1981, Comput. Networks.

[7]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[8]  Robert M. Hinden,et al.  The DARPA Internet: Interconnecting Heterogeneous Computer Networks with Gateways , 1983, Computer.

[9]  Hau L. Lee,et al.  Multi-Agent Customer Allocation in a Stochastic Service System , 1985 .

[10]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[11]  Tamer Basar,et al.  Distributed algorithms for the computation of noncooperative equilibria , 1987, Autom..

[12]  C. Partridge,et al.  Innovations in Internetworking , 1988 .

[13]  Donald F. Ferguson,et al.  An economy for flow control in computer networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Scott Shenker.  Making greed work in networks: a game-theoretic analysis of gateway service disciplines , 1990, SIGMETRICS '90.

[15]  Carl A. Sunshine.  Network Interconnection and Gateways , 1989, IEEE J. Sel. Areas Commun..

[16]  Scott Shenker,et al.  Efficient Network Allocations with Selfish Users , 1990, Performance.

[17]  Anastasios A. Economides,et al.  Multi-objective routing in integrated services networks: A game theory approach , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[18]  Christos Douligeris,et al.  Fairness in network optimal flow control: optimality of product forms , 1991, IEEE Trans. Commun..

[19]  Aurel A. Lazar,et al.  Optimal Decentralized Flow Control of Markovian Queueing Networks with Multiple Controllers , 1991, Perform. Evaluation.

[20]  Christos Douligeris,et al.  Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment , 1992, IEEE Trans. Commun..