A Game-Theoretic Approach to Routing under Adversarial Conditions
2010 (English)In: Theoretical Computer Science: 6th IFIP TC 1/WG 2.2 International Conference, TCS 2010, Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010. Proceedings, Springer, 2010, 355-370 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Springer, 2010. 355-370 p.
, IFIP Advances in Information and Communication Technology, 323
Communication Systems Telecommunications
IdentifiersURN: urn:nbn:se:kth:diva-136805DOI: 10.1007/978-3-642-15240-5_26ScopusID: 2-s2.0-84879217328ISBN: 978-3-642-15240-5OAI: oai:DiVA.org:kth-136805DiVA: diva2:677230
6th IFIP International Conference on Theoretical Computer Science 2010 (TCS 2010),Held as Part of WCC 2010, Brisbane, Australia, September 20-23, 2010
QC 201401022013-12-092013-12-092014-01-02Bibliographically approved