Adversary Games in Secure/Reliable Network Routing

Gruia Calinescu; Sanjiv Kapoor; Michael Quinn; Junghwan Shin

Game Theory for Networks. 2nd International ICST Conference, GAMENETS 2011, Shanghai, China, April 16-18, 2011, Revised Selected Papers

Research Article

Adversary Games in Secure/Reliable Network Routing

Download

427 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-30373-9_18,
    author={Gruia Calinescu and Sanjiv Kapoor and Michael Quinn and Junghwan Shin},
    title={Adversary Games in Secure/Reliable Network Routing},
    proceedings={Game Theory for Networks. 2nd International ICST Conference, GAMENETS 2011, Shanghai, China, April 16-18, 2011, Revised Selected Papers},
    proceedings_a={GAMENETS},
    year={2012},
    month={10},
    keywords={zero-sum games Nash equilibrum network flows concurrent flows},
    doi={10.1007/978-3-642-30373-9_18}
}

Gruia Calinescu
Sanjiv Kapoor
Michael Quinn
Junghwan Shin
Year: 2012
Adversary Games in Secure/Reliable Network Routing
GAMENETS
Springer
DOI: 10.1007/978-3-642-30373-9_18

Gruia Calinescu¹^,*, Sanjiv Kapoor¹^,*, Michael Quinn¹^,*, Junghwan Shin¹^,*

1: Illinois Institute of Technology

*Contact email: calinescu@iit.edu, kapoor@iit.edu, mquinn4@iit.edu, jshin7@iit.edu

Abstract

In this paper, we consider security aspects of network routing in a game-theoretic framework where an attacker is empowered with an ability for intrusion into edges of the network; on the other hand, the goal of designer is to choose routing paths.

Keywords: zero-sum games Nash equilibrum network flows concurrent flows

Published: 2012-10-08

: http://dx.doi.org/10.1007/978-3-642-30373-9_18