A Layered Formal Methods Approach to Answering Queue-related Queries
summary
QuASI answers whether queue-related queries (e.g., whether a queue could exceed a threshold, burst occurrence, max buffer occupancy) are possible using only per-port minute packet counts by checking existence of a consistent packet trace. It uses a lossless enqueue-rate abstraction, a two-layer pipeline with a fast over-approximation layer that builds a cover-set and representative traces and reduces consistency to a 0/1 matrix (Gale–Ryser), and an SMT-based exact check for positives. Claims no false positives or false negatives, is up to 106X faster than prior work, and scales to hundreds of millions of time steps.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:47Latency SLOs with limited data
- 3:57Queue length query problem
- 6:46Quasi's layered formal methods
- 9:37Quasi's over-approximate analysis
- 12:29Quasi's exact analysis
- 13:52Evaluation and comparison
- 15:38Key takeaways
related talks
16mManaging Congestion Control Heterogeneity on the Internet with Approximate Performance...
15mFormal Methods for Network Performance Analysis
16mGearbox: A Hierarchical Packet Scheduler for Approximate Weighted Fair Queuing
25mApproximating Fair Queueing on Reconfigurable Switches
12mTwenty Years After: Hierarchical Core-Stateless Fair Queueing
20mHarmony: A Congestion-free Datacenter Architecture
22mProgrammable Calendar Queues for High-speed Packet Scheduling
17mTowards provably performant congestion control
