IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-030-84721-0_27.html
   My bibliography  Save this book chapter

Congestion Control and Optimal Maintenance of Communication Networks with Stochastic Cost Functions: A Variational Formulation

In: Mathematical Analysis in Interdisciplinary Research

Author

Listed:
  • Mauro Passacantando

    (University of Pisa)

  • Fabio Raciti

    (University of Catania)

Abstract

We consider a game theory model of congestion control in communication networks, where each player is a user who wishes to maximize his/her flow over a path in the network. We allow for stochastic fluctuations of the cost function of each player, which consists of two parts: a pricing and a utility term. The solution concept we look for is the mean value of the (unique) variational Nash equilibrium of the game. Furthermore, we assume that it is possible to invest a certain amount of money to improve the network by enhancing the capacity of its links and, because of limited financial resources, an optimal choice of the links to improve has to be made. We model the investment problem as a nonlinear knapsack problem with generalized Nash equilibrium constraints in probabilistic Lebesgue spaces and solve it numerically for some examples.

Suggested Citation

  • Mauro Passacantando & Fabio Raciti, 2021. "Congestion Control and Optimal Maintenance of Communication Networks with Stochastic Cost Functions: A Variational Formulation," Springer Optimization and Its Applications, in: Ioannis N. Parasidis & Efthimios Providas & Themistocles M. Rassias (ed.), Mathematical Analysis in Interdisciplinary Research, pages 599-617, Springer.
    • Handle: RePEc:spr:spochp:978-3-030-84721-0_27
    DOI: 10.1007/978-3-030-84721-0_27
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-3-030-84721-0_27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.