Skip to main content

Advertisement

Springer Nature Link
Log in

The Problem of Capacity Addition in Multi-user Elastic Demand Communication Networks

  • Original Article
  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

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

    Article  MATH  Google Scholar 

  • 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

    Article  Google Scholar 

  • Altman E, El Azouzi R, Pourtallier O (2003) Avoiding paradoxes in multi-agent competitive routing. Comput Networks 43:133–146

    Article  MATH  Google Scholar 

  • 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

    Article  MATH  MathSciNet  Google Scholar 

  • Korilis YA, Lazar A, Orda A (1995) Architecting noncooperative networks. IEEE J Selected Areas Commun 13(7):1241–1251

    Article  Google Scholar 

  • Korilis YA, Lazar A, Orda A (1997) Capacity allocation under noncooperative routing. IEEE Trans Automatic Control 42(3):309–325

    Article  MATH  MathSciNet  Google Scholar 

  • Korilis YA, Lazar A, Orda A (1999) Avoiding the Braess paradox in noncooperative network. J Appl Probab 36:211–222

    Article  MATH  MathSciNet  Google Scholar 

  • Orda A, Rom R, Shimkin N (1993) Competitive routing in multi-user communication networks. IEEE/ACM Trans Networks 1:510–520

    Article  Google Scholar 

  • 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

    Article  Google Scholar 

  • The ATM Forum Technical Committee (1999) Traffic management specification, version 4.1. AF-TM-0121.000

Download references

Author information

Authors and Affiliations

  1. Département Math-Info, Faculté des sciences, BP 1014, 10000, Rabat, Maroc

    M. Abbad & M. El. Kamili

  2. LIA–CERI 339 chemin des Meinajariès, BP1228, 84911, AVIGNON Cedex 9, France

    R. El. Azouzi

Authors
  1. M. Abbad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. El. Azouzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. El. Kamili
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Abbad.

Rights and permissions

Reprints 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

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00186-005-0055-z

Keywords