Peering equilibrium multipath routing: a game theory framework for internet peering settlements

  • Authors:
  • Stefano Secci;Jean-Louis Rougier;Achille Pattavina;Fioravante Patrone;Guido Maier

  • Affiliations:
  • LIP6, Université Pierre et Marie Curie, Paris, France;Institut Telecom, Telecom ParisTech, LTCI, CNRS, Paris, France;Politecnico di Milano, Milan, Italy;Università di Genova, Genova , Italy;Politecnico di Milano, Milan, Italy

  • Venue:
  • IEEE/ACM Transactions on Networking (TON)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is generally admitted that interdomain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, which use independent and "selfish" routing policies. We are interested in identifying possible "light" coordination strategies that would allow carriers to better control their peering links while preserving their independence and respective interests. We propose a robust multipath routing coordination framework for peering carriers, which relies on the multiple-exit discriminator (MED) attribute of Border Gateway Protocol (BGP) as signaling medium. Our scheme relies on a game theory modeling, with a non-cooperative potential game considering both routing and congestions costs. Peering equilibrium multipath (PEMP) coordination policies can be implemented by selecting Pareto-superior Nash equilibria at each carrier. We compare different PEMP policies to BGP Multipath schemes by emulating a realistic peering scenario. Our results show that the routing cost can be decreased by roughly 10% with PEMP. We also show that the stability of routes can be significantly improved and that congestion can be practically avoided on the peering links. Finally, we discuss practical implementation aspects and extend the model to multiple players highlighting the possible incentives for the resulting extended peering framework.