~/talk

A Layered Formal Methods Approach to Answering Queue-related Queries

Talkat NSDI '25 · 2025-04-28..04-30· [networking]
links:none on file
links:none on file
links:none on file
slides:none on file

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

  1. 0:00Introduction
  2. 1:47Latency SLOs with limited data
  3. 3:57Queue length query problem
  4. 6:46Quasi's layered formal methods
  5. 9:37Quasi's over-approximate analysis
  6. 12:29Quasi's exact analysis
  7. 13:52Evaluation and comparison
  8. 15:38Key takeaways
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.