Raha: A General Tool to Analyze WAN Degradation
Behnaz Arzani, Sina Taheri, Pooria Namyar, Ryan Beckett, Siva Kesava Reddy Kakarla, Elnaz Jalilipour
Abstract
Raha is the first general tool that can analyze probable degradation of traffic engineered networks under arbitrary failures and traffic shifts to prevent outages. Raha addresses a significant gap in prior work which consider only (1) ≤ 𝑘 failures;
(2) specific traffic engineering schemes; and (3) the maximum impact of failures irrespective of the network design point.
Our insight is to formulate the problem in terms of heuristic analysis, where one seeks to maximize the performance gap between the network design point (i.e., the network with no failures) and the network under failures. We invent techniques that allow us to exploit the mechanisms within these tools to encode the problem into components which can handle them. We present extensive experiments on Microsoft's production network and those of Topology Zoo that demonstrate Raha is scalable and can effectively solve the problem. We use Raha to propose capacity augments that allow operators to mitigate potential problems and avoid future outages. Our results show Raha can find ≥ 2× higher degradations compared to those tools that only consider up to 2 failures.
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 9859299e-0c3a-4c65-89f1-dfe7af10ebbfCited by top-tier papers1
Ask how each one uses itBuilds on16
- Network planning with deep reinforcement learningHang Zhu, Varun Gupta, Satyajeet Singh Ahuja, Yuandong Tian et al.SIGCOMM 2021 · 108 citations
- Contracting Wide-area Network Topologies to Solve Flow Problems QuicklyFiras Abuzaid, Srikanth Kandula, Behnaz Arzani, Ishai Menache et al.NSDI 2021 · 101 citations
- DOTE: Rethinking (Predictive) WAN Traffic EngineeringYarin Perry, Felipe Vieira Frujeri, Chaim Hoch, Srikanth Kandula et al.NSDI 2023 · 81 citations
- Capacity-efficient and uncertainty-resilient backbone network planning with hoseSatyajeet Singh Ahuja, Varun Gupta, Vinayak Dangui, Soshant Bali et al.SIGCOMM 2021 · 40 citations
- ARROW: restoration-aware traffic engineeringZhizhen Zhong, Manya Ghobadi, Alaa Khaddaj, Jonathan Leach et al.SIGCOMM 2021 · 37 citations
Related papers
- PreTE: Traffic Engineering with Predictive FailuresCongcong Miao, Zhizhen Zhong, Yiren Zhao, Arpit Gupta et al.SIGCOMM 2025 · 6 citations
- Finding Adversarial Inputs for Heuristics using Multi-level OptimizationPooria Namyar, Behnaz Arzani, Ryan Beckett, Santiago Segarra et al.NSDI 2024 · 16 citations
- ECOTE: Priority-Aware Optical Restoration for WAN Traffic EngineeringYiren Zhao, Kunling He, Zhiquan Wang, Ran Shu et al.EuroSys 2026
- Verifying maximum link loads in a changing worldTibor Schneider, Stefano Vissicchio, Laurent VanbeverNSDI 2025 · 5 citations
- 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
