Congestion load balancing game with losses - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Congestion load balancing game with losses


We study the symmetric version of the load balancing game introduced by H. Kameda. We consider a non-splittable atomic game with lossy links. Thus costs are not additive and flow is not conserved (total flow entering a link is greater than the flow leaving it). We show that there is no unique equilibrium in the game. We identify several symmetric equilibria and show how the number of equilib-ria depends on the problem's parameters. We compute the globally optimal solution and compare its performance to the equilibrium. We finally identify the Kameda paradox which was introduced initially in networks without losses.
Fichier principal
Vignette du fichier
ldieee.pdf (249.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02931311 , version 1 (06-09-2020)


  • HAL Id : hal-02931311 , version 1


Babacar Toure, Simon Paturel, Eitan Altman. Congestion load balancing game with losses. WINCOM'20 - 8th International Conference on Wireless Networks and Mobile Communications, Oct 2020, Reims, France. ⟨hal-02931311⟩
227 View
196 Download


Gmail Facebook Twitter LinkedIn More