LOUP: The Principles and Practice of Intra-Domain Route Dissemination
summary
Claims that SOUP and LOUP fix iBGP pathologies by ordering route application, with SOUP provably loop-free under a stable topology and "tell me when" optimization (LOUP) that cuts convergence time at the cost of rare transient loops under high churn. Implements hop-by-hop reverse-forwarding waves, reverse activation for withdrawals, a Quagga implementation, and evaluates scalability and correctness in Hurricane Electric simulations and measurements; shows control-plane delays can make loops last hundreds of milliseconds.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:13The Routing System
- 3:07Full Mesh IBGP
- 4:47Synthetic Example
- 6:06Why Care
- 7:39Wavefront Property
- 8:20Complex Topology
- 14:58LOUP
- 16:31Evaluation
related talks
20mContra: A Programmable System for Performance aware Routing
34mHyperRouter: Lessons Learnt from Building an L4 Load...
21mPanorama: Optimizing Internet-scale Users’ Routes from End to End
17mPractical Intent-driven Routing Configuration Synthesis
32mLeveraging open source dynamic routing to implement a spine/leaf in datacenter
35mWhy OCP networking performances on VMs are suboptimal and how to improve them by 5x
21mImproving L4 Routing Consistency
16mOpenOptics: Enabling Open Research and Implementation of Optical Data Center Networks