Multi-tenant admission control for agent inference: per-tenant quotas and fair queueing so one tenant cannot starve another under sustained overload. TypeScript.
-
Updated
Sep 7, 2026 - TypeScript
Multi-tenant admission control for agent inference: per-tenant quotas and fair queueing so one tenant cannot starve another under sustained overload. TypeScript.
Trace-driven experiments for admission control and fair scheduling
Generic, thread-safe SFQ(D) scheduler for weighted, cost-aware work.
An ns-3 QoS substrate: four pluggable strategy slots composing DiffServ, L4S, and CAKE as three clients, extensible via a registry of AQMs and schedulers.
Two campus gates, one parking lot, and a fair turn for every car. A rush-hour parking and valet app built in one day at the EAFIT Vibethon.
A bounded, clock-free Deficit Round Robin scheduler for caller-owned work IDs and integer costs. It exposes complete rounds, cancellation and credit accounting without executing jobs or sending packets.
To associate your repository with the fair-queueing topic, visit your repo's landing page and select "manage topics."