Vulnerability of Selfish Routing to Attacks: Game-theoretic Models and Initial Results
In this paper, the authors report on work in progress on assessing and mitigating selfish routing vulnerability to strategic attacks. They explain mechanisms leading to this vulnerability, propose the corresponding game-theoretic model, solve this model for some particular case, and discuss implications of the vulnerability phenomenon. Their approach extends the well established research agenda on selfish routing by incorporating attacker(s) as separate agent(s) in the corresponding game. While each user makes its routing decision in attempt to minimize its transportation cost, the attacker(s) manipulate the link costs for the purpose of increasing the aggregate transportation cost to all or some users, e.g., by damaging the physical infrastructure or inserting malicious traffic as in Denial of Service (DoS) attack.