Architecting noncooperative networks

In noncooperative networks users make control decisions that optimize their own performance measure. Focusing on routing, we devise two methodologies for architecting noncooperative networks, that improve the overall network performance. These methodologies are motivated by problem settings arising in the provisioning and the run time phases of the network. For either phase, Nash equilibria characterize the operating point of the network. The goal of the provisioning phase is to allocate link capacities that lead to systemwide efficient Nash equilibria. In general, the solution of such design problems is counterintuitive, since adding link capacity might lead to a degradation of user performance. We show that, for systems of parallel links, such paradoxes cannot occur and the optimal solution coincides with the solution in the single-user case. We derive some extensions to general network topologies. During the run time phase, a manager controls the routing of part of the network flow. The manager is aware of the noncooperative behavior of the users and makes its routing decisions based on this information while aiming at improving the overall system performance. We obtain necessary and sufficient conditions for enforcing all equilibrium that coincides with the global systemwide optimum, and indicate that these conditions are met in many cases of interest.

[1]  Eitan Altman,et al.  Worst-case and Nash routing policies in parallel queues with uncertain service allocations , 1993 .

[2]  W. Nicholson Intermediate Microeconomics and Its Applications , 1975 .

[3]  Christos Douligeris,et al.  A game theoretic perspective to flow control in telecommunication networks , 1992 .

[4]  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.

[5]  Robert M Thrall,et al.  Mathematics of Operations Research. , 1978 .

[6]  Ariel Orda,et al.  Virtual path bandwidth allocation in multi-user networks , 1995, Proceedings of INFOCOM'95.

[7]  Aurel A. Lazar,et al.  On the existence of equilibria in noncooperative optimal flow control , 1995, JACM.

[8]  Pradeep Dubey,et al.  Inefficiency of Nash Equilibria , 1986, Math. Oper. Res..

[9]  Deborah Estrin,et al.  Pricing in computer networks: motivation, formulation, and example , 1993, TNET.

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

[11]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[12]  Flow control using the theory of zero sum Markov games , 1994, IEEE Trans. Autom. Control..

[13]  Scott Shenker,et al.  Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines , 1994, SIGCOMM.

[14]  Joel E. Cohen,et al.  A paradox of congestion in a queuing network , 1990, Journal of Applied Probability.

[15]  Ariel Orda,et al.  Achieving network optima using Stackelberg routing strategies , 1997, TNET.

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

[17]  Scott Shenker,et al.  Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1995, TNET.

[18]  R. Kellogg,et al.  Pathways to solutions, fixed points, and equilibria , 1983 .