Skip to main content
Log in

Multi-exit discriminator game for BGP routing coordination

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

Inter-Autonomous System (AS) links represent nowadays the real bottleneck of the Internet. Internet carriers may coordinate to efficiently balance the load, but the current practice is often based on an uncoordinated selfish routing. Firstly, we assess this issue by characterizing BGP route deviations across top-tier interconnections we could detect using recent Internet routing history data. Then, in order to improve the current practice, we present a novel game-theoretical framework to efficiently coordinate the routing on inter-AS links while modeling the non-cooperative carrier behavior. It relies on a coordinated use of the Multi-Exit Discriminator (MED) attribute of BGP, hence it is nicknamed ClubMED (Coordinated MED). We define the routing policy that shall be implemented upon Nash equilibria and Pareto-efficient profiles. We emulated the interconnection between the Internet2 and the Geant2 networks, comparing our proposition to the current BGP practice. The results show that the route stability can significantly be reinforced, the global routing cost can be significantly reduced, and the inter-AS link congestion can be avoided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Agarwal, S., Nucci, A., & Bhattacharyya, S. (2004). Controlling hot potatoes in intradomain traffic engineering. SPRINT RR04-ATL-070677.

  2. Balon, S., & Leduc, G. (2008). Combined Intra and inter-domain traffic engineering using hot-potato aware link weights optimization. arXiv:0803.2824.

  3. CAIDA ranking (website). http://as-rank.caida.org.

  4. Donnet, B., & Friedman, T. (2007). Internet topology discovery: a survey. IEEE Communications Surveys and Tutorials, 9(4), 2–15.

    Article  Google Scholar 

  5. Douville, R., Le Roux, J.-L., Rougier, J.-L., & Secci, S. (2008). A service plane over the PCE architecture for automatic multi-domain connection-oriented services. IEEE Comm. Magazine, 46(6), 94–102.

    Article  Google Scholar 

  6. Faratin, P., et al. (2007). Complexity of Internet interconnections: technology, incentives and implications for policy. In Proc. of TPRC 2007.

  7. Huffaker, B., et al. (2002). Distance metrics in the Internet. In Proc. of IEEE international telecommunications symposium (ITS) 2002.

  8. By courtesy of Y. Zhang. Internet2/Abilene topology and traffic dataset. http://www.cs.utexas.edu/~yzhang/research/AbileneTM.

  9. Larroca, F., & Rougier, J.-L. (2009). Routing games for traffic engineering. In Proc. of IEEE ICC 2009.

  10. Latapy, M., Magnien, C., & Ouédraogo, F. (2008). A radar for the Internet. In Proc. of ADN 2008.

  11. Lepropre, J., Balon, S., & Leduc, G. (2006). Totem: a toolbox for traffic engineering methods. In Proc. of INFOCOM 2006.

  12. LIP6 complex networks website, radar traces. http://data.complexnetworks.fr/Radar.

  13. Ma, R. T. B., et al. (2007). Internet economics: the use of Shapley value for ISP settlement. In Proc. of CoNEXT 2007.

  14. Ma, R., et al. (2008). Interconnecting eyeballs to content: a Shapley value perspective on ISP peering and settlement. In Proc. of SIGCOMM 2008.

  15. McPherson, D., & Gill, V. BGP MED considerations. RFC 4451.

  16. Monderer, D., & Shapley, L. S. (1996). Potential games. Games and Economic Behavior, 14(1), 124–143.

    Article  Google Scholar 

  17. Myerson, R. B. (1991). Game theory: analysis of conflict. Harvard: Harvard University Press.

    Google Scholar 

  18. PlanetLab website. http://www.planet-lab.org.

  19. Roth, A. E. (1988). The Shapley value, essays in honor of Lloyd S. Shapley. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  20. Secci, S., Rougier, J.-L., Pattavina, A., Patrone, F., & Maier, G. (2009). ClubMED: coordinated multi-exit discriminator strategies for peering carriers. In Proc. of 2009 5th Euro-NGI/IEEE conference on next generation Internet networks (NGI 2009), Aveiro, Portugal, 1–3 July 2009.

  21. Shrimali, G., et al. (2007). Cooperative inter-domain traffic engineering using Nash bargaining and decomposition. In Proc. of INFOCOM 2007.

  22. Teixeira, R., et al. (2005). TIE breaking: tunable interdomain egress selection. In Proc. of CoNEXT 2005.

  23. Teixeira, R., et al. (2008). Impact of hot-potato routing changes in IP networks. IEEE/ACM Transactions on Networking, 16(6), 1295–1307.

    Article  Google Scholar 

  24. Uhlig, S., et al. (2006). Providing public intradomain traffic matrices to the research community. Computer Communication Review, 36(1), 83–86.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Stefano Secci.

Additional information

A preliminary version of this paper has been published in the 2009 Next Generation Internet Networks (NGI 2009) conference proceedings (best paper award) [20].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Secci, S., Rougier, JL., Pattavina, A. et al. Multi-exit discriminator game for BGP routing coordination. Telecommun Syst 48, 77–92 (2011). https://doi.org/10.1007/s11235-010-9335-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-010-9335-x

Keywords

Navigation