Preliminary results in routing games

In this paper, we determine routing policies for a data transmission network that are robust with respect to attempts of packet interception by an adversary. This problem is formulated as a zero-sum game between the designer of the routing algorithm and an adversary that attempts to intersect packets. We show that, for some versions of the game, the optimal routing policies also maximize the throughput between the source to the destination node. In this paper, we also list problems in this area that remain open.