Verifying maximum link loads in a changing world
Tibor Schneider, Stefano Vissicchio, Laurent Vanbever
Abstract
To meet ever more stringent requirements, network operators often need to reason about worst-case link loads. Doing so involves analyzing traffic forwarding after failures and BGP route changes. State-of-the-art systems identify failure scenarios causing congestion, but they ignore route changes.
We present Velo, the first verification system that efficiently finds maximum link loads under failures and route changes.
The key building block of Velo is its ability to massively reduce the gigantic space of possible route changes thanks to (i) a router-based abstraction for route changes, (ii) a theoretical characterization of scenarios leading to worst-case link loads, and (iii) an approximation of input traffic matrices. We fully implement and extensively evaluate Velo. Velo takes only a few minutes to accurately compute all worst-case link loads in large ISP networks. It thus provides operators with critical support to robustify network configurations, improve network management and take business decisions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext d6aa6303-2978-4ca5-9f2e-800b6dbdaee9Builds on12
- Tiramisu: Fast Multilayer Network VerificationAnubhavnidhi Abhashkumar, Aaron Gember-Jacobson, Aditya AkellaNSDI 2020 · 146 citations
- DOTE: Rethinking (Predictive) WAN Traffic EngineeringYarin Perry, Felipe Vieira Frujeri, Chaim Hoch, Srikanth Kandula et al.NSDI 2023 · 81 citations
- Probabilistic Verification of Network ConfigurationsSamuel Steffen, Timon Gehr, Petar Tsankov, Laurent Vanbever et al.SIGCOMM 2020 · 60 citations
- Snowcap: synthesizing network-wide configuration updatesTibor Schneider, Rüdiger Birkner, Laurent VanbeverSIGCOMM 2021 · 34 citations
- Symbolic router executionPeng Zhang, Dan Wang, Aaron Gember-JacobsonSIGCOMM 2022 · 31 citations
Related papers
- A General and Efficient Approach to Verifying Traffic Load Properties under Arbitrary k FailuresRuihan Li, Yifei Yuan, Fangdan Ye, Mengqi Liu et al.SIGCOMM 2024 · 10 citations
- Detecting network load violations for distributed control planesKausik Subramanian, Anubhavnidhi Abhashkumar, Loris D'Antoni, Aditya AkellaPLDI 2020 · 17 citations
- Reasoning about Network Traffic Load Property at Production ScaleRuihan Li, Fangdan Ye, Yifei Yuan, Ruizhen Yang et al.NSDI 2024 · 13 citations
- Fast SMT-Based Fault Tolerance Verification for Wide Area NetworksNing Kang, Peng Zhang, Hao Li, Jianyuan ZhangFM 2026
- Expresso: Comprehensively Reasoning About External Routes Using Symbolic SimulationDan Wang, Peng Zhang, Aaron Gember-JacobsonSIGCOMM 2024 · 7 citations
