Efficient fair queuing with decoupled delay-bandwidth guarantees
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper we introduce a new scheduling system with decoupled delay bound and bandwidth allocation guarantees. It is based on an existing efficient fair scheduler, Frame-based Fair Queueing (FFQ), and therefore inherits the fairness, simplicity and efficiency of that policy. We combine a slightly modified version of an FFQ scheduler with the link sharing concept using rate estimator modules, in order to provide the capability of assigning delay bound and bandwidth allocation to each traffic class independently. This is achieved by defining two sets of rates, one for normal operation of FFQ which defines the delay bound of each class and the other for assigning bandwidth allocation to each class. In normal situations the system acts as a normal FFQ but if a class misbehaves, the system reacts and prevents that class from degrading delay and bandwidth of other classes.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it