Interdomain routing and games

We present a game-theoretic model that captures many of the intricacies of interdomain routing in today's Internet. In this model, the strategic agents are source nodes located on a network, who aim to send traffic to a unique destination node. The interaction between the agents is dynamic and complex -- asynchronous, sequential, and based on partial information. Best-reply dynamics in this model capture crucial aspects of the interdomain routing protocol de facto, namely the Border Gateway Protocol (BGP).

Authors

• Hagay Levin
• Michael Schapira
• Aviv Zohar

Keywords

• BGP
• distributed algorithmic mechanism design
• selfish routing