Enhancing network diagnosis with reflection in Prolog (extended abstract)
summary
Claims that adding reflection to Prolog lets automated diagnosis both catch and explain BGP oscillations, demonstrated by a runnable XSB prototype that reproduces the RFC 3345 oscillation example. The IBGP model is compact — about 77 lines for the protocol encoding — and the explanation generator is a 10-line meta-interpreter that emits selective proof trees. Code and test-generation harness are on GitHub, the approach produces human-readable traces for nonconvergent runs and scales to synthetic tests, early but functional.
AI-written summary · about
chapters (15)
- 0:00Network diagnosis with Prolog
- 1:04Limitations of traditional tools
- 3:36Diagnosing real-world networks
- 5:04Prolog for network debugging
- 5:46Internet routing and BGP
- 8:58BGP oscillation example
- 12:53Prolog for BGP debugging
- 13:14Prolog implementation of BGP
- 16:50BGP encoding in Prolog
- 17:10Proof trees with meta-interpreter
- 18:57Comparison with logic tools
- 20:27Prolog for network analysis
- 21:12Network diagnosis vs program analysis
- 22:36Future of Prolog in networking
- 23:41Q&A
related talks
12mxBGP: Faster Innovation in Routing Protocols
21mPartial Evaluation as a primitive in modern network troubleshooting (Talk Proposal)
35mRoute to Bugs: Analyzing the Security of BGP Message Parsing
29mSynthesis of dependable and self-driving communication networks
16mEnhancing Global Network Monitoring with Magnifier
33mOPENED Tool for Managing eBPF Heterogeneity
32mActive Fault Finding in Networks
18mMESSI: Behavioral Testing of BGP Implementations