Abstract
In this paper we consider some properties on prices under flow control in a network that is to be shared by noncooperative users. Each user is faced with an optimization problem which is formulated as the minimization of its own criterion subject to constraint on the flows of the other users. The operating points of the network are the Nash equilibria of the underlying routing game. Our objective is to study the behavior of prices of all users when the network designer needs to allocate capacities to network links. For parallel links topologies, we show that degradation of the performances such as prices will not take place, as well as the users may find it beneficial to improve their requests
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Altman E, El Azouzi R, Vyacheslav V (2002a) Non-cooperative routing in loss networks. Performance Eval 49(1–4):257–272
Altman E, Başar T, Srikant R (2002b) Nash equilibria for combined flow control and routing in networks: asymptotic behavior for a large number of users. IEEE Trans Automatic Control 47(6):917–930
Altman E, El Azouzi R, Pourtallier O (2003) Avoiding paradoxes in multi-agent competitive routing. Comput Networks 43:133–146
El Azouzi R (2002) Avoiding paradox in routing games in networks when travel demand is elastic. Proceeding of the Tenth International Symposium on Dynamic Game and Applications, Saint-Petersburg, Russia
Azouzi R, El Kamili M, Altman E, Abbad M, Başar T (2005) Combined competitive flow control and routing in networks with hard side-constraints. In: Boukas EK, Malham RP (eds) analysis control and optimization of complex dynamic systems. 162–192, Springer
Haurie A, Marcotte P (1985) On the relationship between Nash–Cournot and wardrop equilibria. Networks 15:295–308
Korilis YA, Lazar A, Orda A (1995) Architecting noncooperative networks. IEEE J Selected Areas Commun 13(7):1241–1251
Korilis YA, Lazar A, Orda A (1997) Capacity allocation under noncooperative routing. IEEE Trans Automatic Control 42(3):309–325
Korilis YA, Lazar A, Orda A (1999) Avoiding the Braess paradox in noncooperative network. J Appl Probab 36:211–222
Orda A, Rom R, Shimkin N (1993) Competitive routing in multi-user communication networks. IEEE/ACM Trans Networks 1:510–520
Patriksson M (1994) The traffic assignment problem: models and methods. VSP BV, AH Zeist, The Netherlands
Rhee SH, Konstantopoulos T (1998) Optimal flow control and capacity allocation in multi-service networks. 37th IEEE Conference Decision and Control, Tampa, Florida
Rhee SH, Konstantopoulos T (1999) Decentralized optimal flow control with constrained source rates. IEEE Commun Lett 3(6):188–200
The ATM Forum Technical Committee (1999) Traffic management specification, version 4.1. AF-TM-0121.000
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Abbad, M., Azouzi, R.E. & Kamili, M.E. The Problem of Capacity Addition in Multi-user Elastic Demand Communication Networks. Math Meth Oper Res 63, 461–471 (2006). https://doi.org/10.1007/s00186-005-0055-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00186-005-0055-z