Reduction-Based Formal Analysis of BGP Instances

  • Anduo Wang
  • Carolyn Talcott
  • Alexander J. T. Gurney
  • Boon Thau Loo
  • Andre Scedrov
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7214)


Today’s Internet interdomain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfigurations by individual autonomous systems (ASes). These misconfigurations are often difficult to manually diagnose beyond a small number of nodes due to the state explosion problem. To aid the diagnosis of potential anomalies, researchers have developed various formal models and analysis tools. However, these techniques do not scale well or do not cover the full set of anomalies. Current techniques use oversimplified BGP models that capture either anomalies within or across ASes, but not the interactions between the two. To address these limitations, we propose a novel approach that reduces network size prior to analysis, while preserving crucial BGP correctness properties. Using Maude, we have developed a toolkit that takes as input a network instance consisting of ASes and their policy configurations, and then performs formal analysis on the reduced instance for safety (protocol convergence). Our results show that our reductionbased analysis allows us to analyze significantly larger network instances at low reduction overhead.


Route Selection Good Route Border Gateway Protocol Network Instance Route Advertisement 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)zbMATHGoogle Scholar
  2. 2.
    Feamster, N., Johari, R., Balakrishnan, H.: Implications of autonomy for the expressiveness of policy routing. In: ACM SIGCOMM (2005)Google Scholar
  3. 3.
    Feldmann, A., Maennel, O., Mao, Z.M., Berger, A., Maggs, B.: Locating Internet routing instabilities. In: ACM SIGCOMM (2004) Google Scholar
  4. 4.
    Flavel, A., Roughan, M., Bean, N., Shaikh, A.: Where’s Waldo? Practical Searches for Stability in iBGP. In: Proc. International Conference on Network Protocols, ICNP (October 2008)Google Scholar
  5. 5.
    Gao, L., Griffin, T.G., Rexford, J.: Inherently safe backup routing with BGP. In: IEEE INFOCOM (2001)Google Scholar
  6. 6.
    Gao, L., Rexford, J.: Stable Internet routing without global coordination. In: ACM SIGMETRICS (2000)Google Scholar
  7. 7.
    Griffin, T.G.: The stratified shortest-paths problem. In: COMSNETS (2010)Google Scholar
  8. 8.
    Griffin, T.G., Jaggard, A., Ramachandran, V.: Design principles of policy languages for path vector protocols. In: ACM SIGCOMM (2003)Google Scholar
  9. 9.
    Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE Trans. on Networking 10, 232–243 (2002)CrossRefGoogle Scholar
  10. 10.
    Griffin, T.G., Wilfong, G.: An analysis of BGP convergence properties. In: SIGCOMM (1999)Google Scholar
  11. 11.
    Haeberlen, A., Avramopoulos, I., Rexford, J., Druschel, P.: NetReview: Detecting when interdomain routing goes wrong. In: NSDI (2009)Google Scholar
  12. 12.
    Labovitz, C., Malan, G.R., Jahanian, F.: Internet Routing Instability. TON (1998)Google Scholar
  13. 13.
    Meseguer, J.: Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96(1), 73–155 (1992)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Schapira, M., Zhu, Y., Rexford, J.: Putting BGP on the right path: A case for next-hop routing. In: ACM SIGCOMM HotNets (October 2010)Google Scholar
  15. 15.
    Sobrinho, J.: Network routing with path vector protocols: theory and applications. In: SIGCOMM (2003)Google Scholar
  16. 16.
    Vutukuru, M., Valiant, P., Kopparty, S., Balakrishnan, H.: How to Construct a Correct and Scalable iBGP Configuration. In: IEEE INFOCOM, Barcelona, Spain (April 2006)Google Scholar
  17. 17.
    Wang, A., Talcott, C., Gurney, A.J.T., Loo, B.T., Scedrov, A.: Reduction-based formal analysis of BGP instances. University of Pennsylvania Department of Computer and Information Science Technical Report (2012),
  18. 18.
    Wang, A., Talcott, C., Jia, L., Loo, B.T., Scedrov, A.: Analyzing BGP Instances in Maude. In: Bruni, R., Dingel, J. (eds.) FORTE 2011 and FMOODS 2011. LNCS, vol. 6722, pp. 334–348. Springer, Heidelberg (2011)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Anduo Wang
    • 1
  • Carolyn Talcott
    • 1
  • Alexander J. T. Gurney
    • 1
  • Boon Thau Loo
    • 1
  • Andre Scedrov
    • 1
  1. 1.SRI InternationalUniversity of PennsylvaniaUSA

Personalised recommendations