ExpectAll: A BDD Based Approach for Link Failure Resilience in Elastic Optical Networks
summary
ExpectAll encodes all Routing and Spectrum Allocation solutions into binary decision diagrams and answers failure queries orders of magnitude faster than ILP, returning a replacement route+spectrum in under the 50 ms target on Deutsche Telekom and CANTO tests for up to five simultaneous failed links. Implementation uses a Python CUDD wrapper, precomputes BDDs in roughly one hour for up to 9 protected demands, and exposes the current scalability ceiling: query-time is excellent, build-time and exponential growth with demand count remain the bottleneck.
AI-written summary · about
chapters (13)
- 0:00ExpectAll introduction
- 1:04Routing and spectrum assignment
- 3:56Classical solutions limits
- 6:48Problem definition and encoding
- 9:40BDD for compact solutions
- 12:11Building RSA BDD
- 15:27Extracting optimal solutions
- 16:53Optimizing BDD construction
- 19:23Failover with precomputed BDDs
- 21:12Performance evaluation
- 23:22Scalability challenges
- 23:45Conclusion and future work
- 25:08Q&A
related talks
17mHEDGE: Traffic Engineering with Probabilistic Link Capacities
17mVerifying maximum link loads in a changing world
26mF10: A Fault-Tolerant Engineered Network
29mSynthesis of dependable and self-driving communication networks
16mExpress Lane to Efficiency and Reliability: Multi-Dimensional Control in Meta’s Express..
12mZooRoute: Enhancing Cloud-Scale Network Reliability via Candidate Path Provisioning...
32mLive Q+A 2
41mRerouting Flows when Links Fail