An analytical model for fair rate calculation in resilient packet rings
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
Resilient packet ring (RPR) is a new medium access control (MAC) protocol for high-speed ring networks. It supports spatial reuse and, therefore, maintaining fairness among different nodes is a challenging task in RPR. To ensure fairness among nodes, a fairness algorithm is employed at each RPR node. In case of congestion, the fairness algorithm advertises a fair rate to all upstream nodes contributing to the congestion. In this paper, we develop an analytical model for fair rate calculation in the standard RPR fairness algorithm in the parking lot scenario. We first ignore the link propagation delay and model the system using a nonlinear discrete-time low-pass filter. We, then, consider the link propagation delay and develop a more realistic model. We verify our model by simulation results and analyze the effect of various parameters on the convergence time. Finally, we determine the low-pass filter coefficient to ensure that convergence time of the algorithm is within its minimum range
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 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