Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arye, M., Harrison, R., Wang, R.: The Next 10,000 BGP Gadgets: Lightweight Modeling for the Stable Paths Problem. Princeton COS598D course project report
Bhargavan, K., Obradovic, D., Gunter, C.A.: Formal verification of standards for distance vector routing protocols. J. ACM 49(4), 538–576 (2002)
Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C.: All About Maude: A High-Performance Logical Framework. Springer, Heidelberg (2007)
Denker, G., Meseguer, J., Talcott, C.: Formal specification and analysis of active networks and communication protocols: The maude experience. DARPA Information Survivability Conference and Exposition (2000)
Feamster, N., Johari, R., Balakrishnan, H.: Implications of Autonomy for the Expressiveness of Policy Routing. In: ACM SIGCOMM, Philadelphia, PA (August 2005)
Flavel, A., Roughan, M.: Stable and flexible iBGP. In: ACM SIGCOMM (2009)
Gao, L., Rexford, J.: Stable internet routing without global coordination. In: SIGMETRICS (2000)
Goodloe, A., Gunter, C.A., Stehr, M.-O.: Formal prototyping in early stages of protocol design. In: Proc. ACM WITS 2005 (2005)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE Trans. on Networking 10, 232–243 (2002)
Labovitz, C., Malan, G.R., Jahanian, F.: Internet Routing Instability. TON (1998)
Maude, http://maude.cs.uiuc.edu/
Meseguer, J.: Conditional Rewriting Logic as a Unified Model of Concurrency. Theoretical Computer Science 96(1), 73–155 (1992)
Ölveczky, P.C., Meseguer, J.: Real-time maude: A tool for simulating and analyzing real-time and hybrid systems. Electr. Notes Theor. Comput. Sci. 36 (2000)
PVS Specification and Verification System, http://pvs.csl.sri.com/
Schapira, M., Zhu, Y., Rexford, J.: Putting BGP on the right path: A case for next-hop routing. In: HotNets (October 2010)
Spring, N., Mahajan, R., Wetherall, D.: Measuring ISP topologies with Rocketfuel. In: SIGCOMM 2002 (2002)
Subramanian, L., Caesar, M., Ee, C.T., Handley, M., Mao, M., Shenker, S., Stoica, I.: HLP: A Next-generation Interdomain Routing Protocol. In: SIGCOMM (2005)
Wang, A., Talcott, C., Jia, L., Loo, B.T., Scedrov, A.: Analyzing BGP instances in maude. University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-11-08 (2011), http://netdb.cis.upenn.edu/papers/bgpMaudeTR.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, A., Talcott, C., Jia, L., Loo, B.T., Scedrov, A. (2011). Analyzing BGP Instances in Maude. In: Bruni, R., Dingel, J. (eds) Formal Techniques for Distributed Systems. FMOODS FORTE 2011 2011. Lecture Notes in Computer Science, vol 6722. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21461-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-21461-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21460-8
Online ISBN: 978-3-642-21461-5
eBook Packages: Computer ScienceComputer Science (R0)