We consider a popular model of congestion control in communication networks within the theory of generalized Nash equilibrium problems with shared constraints, where each player is a user who has to send his/her flow over a path in the network. The cost function of each player consists of two parts: a pricing and a utility term. Within this framework we assume that the network system manager can invest a given amount of money to improve the network by enhancing the capacity of its links and, because of limited financial resources, has to make a choice as to which of the links to improve. This choice is made with the help of a performance function which is computed for each set of improvements under consideration and has the property that, once the equilibrium has been reached, maximizes the aggregate utility and minimizes the sum of delays at the links. We model this problem as a nonlinear knapsack problem with generalized Nash equilibrium constraints and show some preliminary numerical experiments.
Passacantando, M., Raciti, F. (2021). Optimal Improvement of Communication Network Congestion via Nonlinear Programming with Generalized Nash Equilibrium Constraints. In R. Cerulli, M. Dell’Amico, F. Guerriero, D. Pacciarelli, A. Sforza (a cura di), Optimization and Decision Science (pp. 39-49). Springer [10.1007/978-3-030-86841-3_4].
Optimal Improvement of Communication Network Congestion via Nonlinear Programming with Generalized Nash Equilibrium Constraints
Passacantando, M;
2021
Abstract
We consider a popular model of congestion control in communication networks within the theory of generalized Nash equilibrium problems with shared constraints, where each player is a user who has to send his/her flow over a path in the network. The cost function of each player consists of two parts: a pricing and a utility term. Within this framework we assume that the network system manager can invest a given amount of money to improve the network by enhancing the capacity of its links and, because of limited financial resources, has to make a choice as to which of the links to improve. This choice is made with the help of a performance function which is computed for each set of improvements under consideration and has the property that, once the equilibrium has been reached, maximizes the aggregate utility and minimizes the sum of delays at the links. We model this problem as a nonlinear knapsack problem with generalized Nash equilibrium constraints and show some preliminary numerical experiments.File | Dimensione | Formato | |
---|---|---|---|
Passacantando-2021c-Optim decision science-AAM.pdf
Accesso Aperto
Descrizione: Contributo in libro
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Dimensione
210.67 kB
Formato
Adobe PDF
|
210.67 kB | Adobe PDF | Visualizza/Apri |
Passacantando-2021c-Optim decision science-VoR.pdf
Solo gestori archivio
Descrizione: Contributo in libro
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Dimensione
174.79 kB
Formato
Adobe PDF
|
174.79 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.