A Game-Theoretic Approach to Routing under Adversarial Conditions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A Game-Theoretic Approach to Routing under Adversarial Conditions


We present a game-theoretic framework for modeling and solving routing problems in dynamically changing networks. The model covers the aspects of reactivity and non-termination, and it is motivated by quality-of-service provisioning in cognitive radio networks where data transmissions are interfered by primary systems. More precisely, we propose an infinite two-player game where a routing agent has to deliver network packets to their destinations while an adversary produces demands by generating packets and blocking connections. We obtain results on the status of basic problems, by showing principal limitations to solvability of routing requirements and singling out cases with algorithmic solutions.
Fichier principal
Vignette du fichier
03230355.pdf (181.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01054447 , version 1 (06-08-2014)





James Gross, Frank G. Radmacher, Wolfgang Thomas. A Game-Theoretic Approach to Routing under Adversarial Conditions. 6th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science (TCS) / Held as Part of World Computer Congress (WCC), Sep 2010, Brisbane, Australia. pp.355-370, ⟨10.1007/978-3-642-15240-5_26⟩. ⟨hal-01054447⟩
68 View
58 Download



Gmail Facebook Twitter LinkedIn More