Lightyear: Using Modularity to Scale BGP Control Plane Verification

Tang, Alan; Beckett, Ryan; Benaloh, Steven; Jayaraman, Karthick; Patil, Tejas; Millstein, Todd; Varghese, George

doi:10.1145/3603269.3604842

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article3

Other2

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Network Can Help Check Itself: Accelerating SMT-based Network Configuration Verification Using Network Domain Knowledge

Fang,

Ding,

Huang

et al. 2024

IEEE INFOCOM 2024 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Network Can Help Check Itself: Accelerating SMT-based Network Configuration Verification Using Network Domain Knowledge

Fang,

Ding,

Huang

et al. 2024

IEEE INFOCOM 2024 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

Kirigami, the Verifiable Art of Network Cutting

Thijm,

Beckett,

Gupta

et al. 2024

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Modular Data Plane Verification for Compositional Networks

Liu,

Zhang,

et al. 2023

Proc. ACM Netw.

View full text Add to dashboard Cite

Modern networks are increasingly using layering and bridging to form a compositional architecture. Layering protocols like VXLAN create multiple overlay networks on top of a single underlay network infrastructure. This makes network configurations even more complex, and error-prone. To check the correctness of such compositional networks, one needs to model the dependency across multiple layers (underlay and overlay) and multiple domains (different VPNs/VPCs). Existing verifiers, which are optimized to scale in single-layer single-domain networks, exhibit scalability limitations when applied to compositional networks. This paper proposes MNV, a modular network verifier that scales to large compositional networks. At its core is a new verification method termed decompose-merge reasoning, which decomposes the network into self-contained modules, verifies each module independently, and merges the verification results. Our experiments show that for a typical data center network virtualized with VXLAN, to check reachability for more than 100 million pairs of subnets, MNV is at least 100x faster than state-of-the-art tools.

show abstract

Lightyear: Using Modularity to Scale BGP Control Plane Verification

Cited by 5 publications

References 17 publications

Network Can Help Check Itself: Accelerating SMT-based Network Configuration Verification Using Network Domain Knowledge

Network Can Help Check Itself: Accelerating SMT-based Network Configuration Verification Using Network Domain Knowledge

Kirigami, the Verifiable Art of Network Cutting

Modular Data Plane Verification for Compositional Networks

Contact Info

Product

Resources

About