Skip to Main content Skip to Navigation
Conference papers

A Game-Theoretic Approach to Routing under Adversarial Conditions

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, August 6, 2014 - 4:24:49 PM
Last modification on : Wednesday, October 31, 2018 - 4:36:14 PM
Long-term archiving on: : Wednesday, November 26, 2014 - 12:56:42 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



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⟩



Record views


Files downloads