Reference queue tracking strategies for delay guarantees in ATM networks
Bibliographic record
Abstract
A class of service scheduling schemes called the reference queue tracking (RQT) schemes is identified, and their ability to provide delay bounds on a per-VC basis is studied. A statistical multiplexer appears to an incoming VC stream as a single server queue whose service rate (bandwidth) is controlled by the service scheduling scheme. We refer to this queue as the virtual connection queue (VCQ). Corresponding to each VCQ, the RQT schemes use a fictitious single server reference queue (RQ) which is also fed with the VC stream but which is served at a constant rate equal to the allocated bandwidth of the VC. The RQT schemes serve VCs in such a way that some selected parameters of the VCQs track those of the corresponding RQs. An important property of a service scheduling scheme is the ability to guarantee that no cells depart from the VCQs later than from the corresponding RQs. Four schemes belonging to the RQT class are identified and their ability to satisfy the above property is investigated.
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.
How this classification was reachedexpand
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.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".