Sketchovsky: Enabling Ensembles of Sketches on Programmable Switches
summary
Sketchovsky implements five cross-sketch optimizations, a heuristic strategy finder and an automatic code composer to pack multiple sketches onto a Tofino-class programmable switch; it reuses hash results, merges counter arrays and shares SRAM/SLU to cut resource use. Evaluation on real packet traces shows feasibility for up to 18 sketch instances, reduces critical resources by up to 45%, uses hash reuse and counter merging, and preserves or improves measurement accuracy.
AI-written summary · about
chapters (10)
- 0:00Intro
- 0:32Network measurement is essential for management
- 1:17Ensemble of sketches on programmable switch is promising
- 4:27Sketchovsky Overview
- 6:08Sketches have three common workflow steps
- 8:17Hash1: Reusing hash results reduces hash units
- 10:22Ctr1: Reusing counter arrays can reduce memory
- 11:37Problem formulation for strategy finder
- 12:50Search space decomposition across workflow steps
- 16:15Conclusion
related talks
15mSketchLib: Enabling Efficient Sketch-based Monitoring on Programmable Switches
15mAutoSketch: Automatic Sketch-Oriented Compiler for Query-driven Network Telemetry
14mOctoSketch: Enabling Real-Time, Continuous Network Monitoring over Multiple Cores
16mHeteroSketch: Coordinating Network-wide Monitoring in Heterogeneous and Dynamic Networks
15mSketchPipe: Toward Accurate Sketch-based Network Measurement on Multi-Pipeline...
14mModular Switch Programming Under Resource Constraints
22mSoftware Defined Traffic Measurement with OpenSketch
12mToward Nearly-Zero-Error Sketching via Compressive Sensing
