Analyzing BGP Instances in Maude

Wang, Anduo; Talcott, Carolyn; Jia, Limin; Loo, Boon Thau; Scedrov, Andre

doi:10.1007/978-3-642-21461-5_22

Cited by 9 publications

(19 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our results show that the reduction-based analysis is much more effective than the prior approach of doing exhaustive search on unreduced instances [18]. The data demonstrate that we have not only gained speed, but also the ability to analyze network instances that were previously infeasible to study.…”

Section: Introductionmentioning

confidence: 59%

“…To validate our reduction method, we have extended our library for analysis of BGP configurations [18] to support automatic abstraction from dynamic (BGP) configurations to static (extended SPP) configurations, reduction based on SPP configurations, and integration with dynamic exhaustive search analysis. Using the original library BGP instances up to 25 nodes have been successfully analyzed in minutes.…”

Section: Network Reduction In Maudementioning

confidence: 99%

See 1 more Smart Citation

Reduction-Based Formal Analysis of BGP Instances

Wang

Talcott

Gurney

et al. 2012

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract. 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.

show abstract

Section: Introductionmentioning

confidence: 59%

Section: Network Reduction In Maudementioning

confidence: 99%

Reduction-Based Formal Analysis of BGP Instances

Wang

Talcott

Gurney

et al. 2012

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Rewriting logic have also been used [29] for simulating and performing state exploration of BGP instances to check for route oscillation. Analysis can be applied to topologies with up to 9 nodes, but they cannot distinguish between temporary and permanent oscillations.…”

Section: Discussion and Related Workmentioning

confidence: 99%

“…Protocols written in previous versions of DN languages could only be analysed by translating into "logic" (e.g. [29], [8]). But no proof of the correctness of the translation has ever been given.…”

Section: Convergence Analysis For Bgpmentioning

confidence: 99%

Declarative Framework for Specification, Simulation and Analysis of Distributed Applications

Russo

et al. 2016

IEEE Trans. Knowl. Data Eng.

View full text Add to dashboard Cite

Abstract-Researchers have recently shown that declarative database query languages, such as Datalog, could naturally be used to specify and implement network protocols and services. In this paper we present a declarative framework for the specification, execution, simulation and analysis of distributed applications. Distributed applications, including routing protocols, can be specified using a Declarative Networking language, called D2C, whose semantics captures the notion of a Distributed State Machine (DSM), i.e. a network of computational nodes that communicate with each other through the exchange of data. The D2C specification can be directly executed using the DSM computational infrastructure of our framework. The same specification can be simulated and formally verified. The simulation component integrates the DSM tool within a network simulation environment and allows developers to simulate network dynamics and collect data about the execution in order to evaluate application responses to network changes. The formal analysis component of our framework, instead, complements the empirical testing by supporting the verification of different classes of properties of distributed algorithms, including convergence of network routing protocols. To demonstrate the generality of our framework, we show how it can be used to analyse two classes of network routing protocols, a path vector and a Mobile Ad-Hoc Network (MANET) routing protocol, and execute a distributed algorithm for pattern formation in multi-robot systems.

show abstract

“…BGPVerif consists of two components. NetAnalyzer [10] is an automated analysis toolkit based on the Maude rewriting logic engine [4]. In NetAnalyzer, the BGP system is encoded as a transition system driven by rewriting rules.…”

Section: Introductionmentioning

confidence: 99%

Reduction-based analysis of BGP systems with BGPVerif

Wang

Gurney

Han

et al. 2012

Proceedings of the ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communi

Self Cite

View full text Add to dashboard Cite

Today's inter-domain routing protocol, the Border Gateway Protocol (BGP), is increasingly complicated and fragile due to policy misconfiguration by individual autonomous systems (ASes). Existing configuration analysis techniques are either manual and tedious, or do not scale beyond a small number of nodes due to the state explosion problem. To aid the diagnosis of misconfigurations in real-world large BGP systems, this paper presents BGPVerif , a reduction based analysis toolkit. The key idea is to reduce BGP system size prior to analysis while preserving crucial correctness properties. BGPVerif consists of two components, NetReducer that simplifies BGP configurations, and NetAnalyzer that automatically detects routing oscillation. BGPVerif accepts a wide range of BGP configuration inputs ranging from real-world traces (Rocketfuel network topologies), randomly generated BGP networks (GT-ITM), Cisco configuration guidelines, as well as arbitrary user-defined networks. BGPVerif illustrates the applicability, efficiency, and benefits of the reduction technique, it also introduces an infrastructure that enables networking researchers to interact with advanced formal method tool.

show abstract

Analyzing BGP Instances in Maude

Cited by 9 publications

References 19 publications

Reduction-Based Formal Analysis of BGP Instances

Reduction-Based Formal Analysis of BGP Instances

Declarative Framework for Specification, Simulation and Analysis of Distributed Applications

Reduction-based analysis of BGP systems with BGPVerif

Contact Info

Product

Resources

About