Splittable Routing Games in Ring Topology with Losses

Sami Dallali (1) , Clara Fontaine (2, 1, 3) , Eitan Altman (4, 5, 6)

1 CentraleSupélec
2 CSL - Computer Systems Lab - School of Electrical and Computer Engineering - Cornell University
3 NUS - National University of Singapore
4 NEO - Network Engineering and Operations
5 LINCS - Laboratory of Information, Network and Communication Sciences
6 LIA - Laboratoire Informatique d'Avignon

We consider a splittable atomic game with lossy links on a ring in which the cost that each player i minimizes is their own loss rate of packets. The costs are therefore non-additive (unlike costs based on delays or tolls) and moreover, there is no flow conservation (total flow entering a link is greater than the flow leaving it). We derive a closed-form for the equilibrium, which allows us to obtain insight on the structure of the equilibrium. We also derive the globally optimal solution and obtain conditions for the equilibrium to coincide with the globally optimal solution.

Mots clés: Routing games; Loss probabilities; Ring topology

Domaines: Informatique et théorie des jeux [cs.GT]

Sami Dallali, Clara Fontaine, Eitan Altman. Splittable Routing Games in Ring Topology with Losses. ASMTA 2021 - 26th International Conference on Analytical & Stochastic Modelling Techniques & Applications, Dec 2021, Virtual, Japan. ⟨10.1007/978-3-030-91825-5_18⟩. ⟨hal-03340020⟩