Analyzing BGP Instances in Maude

• Main Authors: Wang, Anduo, Talcott, Carolyn, Jia, Limin, Loo, Boon, Scedrov, Andre
• Other Authors: University of Pennsylvania, SRI International Menlo Park (SRI), Carnegie Mellon University Pittsburgh (CMU), University of Pennsylvania School of Veterinary Medicine, Roberto Bruni, Juergen Dingel, TC 6, WG 6.1
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2011
• Subjects: [INFO]Computer Science [cs]; [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]; Maude; Iceland
• Online Access: https://hal.inria.fr/hal-01583330; https://hal.inria.fr/hal-01583330/document; https://hal.inria.fr/hal-01583330/file/978-3-642-21461-5_22_Chapter.pdf; https://doi.org/10.1007/978-3-642-21461-5_22

International audience Analyzing Border Gateway Protocol (BGP) instances is a crucial step in the design and implementation of safe BGP systems. Today, the analysis is a manual and tedious process. Researchers study the instances by manually constructing execution sequences, hoping to either identify an oscillation or show that the instance is safe by exhaustively examining all possible sequences. We propose to automate the analysis by using Maude, a tool based on rewriting logic. We have developed a library specifying a generalized path vector protocol, and methods to instantiate the library with customized routing policies. Protocols can be analyzed automatically by Maude, once users provide specifications of the network topology and routing policies. Using our Maude library, protocols or policies can be easily specified and checked for problems. To validate our approach, we performed safety analysis of well-known BGP instances and actual routing configurations.