Distributed Network Monitoring and Debugging with SwitchPointer
summary
SwitchPointer stores only pointers in switches and keeps detailed telemetry at end-hosts, using switch memory as a "directory service" to locate per-epoch data. It uses a hierarchical epoch index (example: alpha=10, K=3 → 345 KB for 100k hosts and pushes top-level pointers at ~100 kbps), a minimal perfect hash (≈2.1 bits per host) to avoid collisions, and embeds linkID/epochID in packets. A software implementation on real testbeds debugs temporal and spatial cascades and shows no throughput loss for packets ≥256 B (22% drop at 128 B).
AI-written summary · about
chapters (16)
- 0:00Intro
- 0:19Network monitoring and debugging is complex
- 0:49An example: Too many red lights
- 3:07Switch Pointer Integrates the best of two worlds
- 3:59Switch Pointer in a nutshell Divides time into epochs
- 5:06Let's revisit "Too many red lights" problem
- 5:54Switch Pointer design
- 9:09Minimal Perfect Hash Functions
- 10:28Switch Pointer: Four technical challenges
- 11:32Switch Pointer - Coverage
- 12:35Problems Switch Pointer cannot debug
- 12:49A more complex example: Traffic cascades
- 14:53Switch Pointer overhead (software implementation)
- 15:40Conclusion
- 17:2515th USENIX Symposium on Networked Systems Design and implementation
- 18:19THE ADVANCED COMPUTING SYSTEMS ASSOCIATION
related talks
12mDebugging Transient Faults in Data Centers using Synchronized Network-wide Packet
16mClosed-loop Network Performance Monitoring and Diagnosis with SpiderMon
46mSelf-Programming Networks: Network Clock Synchronization, Event Playback and Real-time Action
32mSnabb Switch simple and fast packet networking
16mIMap: Fast and Scalable In-Network Scanning with Programmable Switches
32mSnabb Switch simple and fast packet networking
16mHeteroSketch: Coordinating Network-wide Monitoring in Heterogeneous and Dynamic Networks
23mNetwork Communication Debuggability and Observability at Scale
