A Sharing Token Traffic Scheduling Algorithm in Multi-logical Links Based on Feedback Information
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
Traffic scheduling aims at improving network resource utilization and network application performance.Currently,many researches can be found about traffic scheduling algorithm.However,since logical links in broadband network access are dynamic,real-time and distributed,those scheduling algorithms did not fit for the case well.In this paper,the feature of traffic scheduling in multi logical links is discussed,and a model of sharing token buffer traffic scheduling is also designed.A sharing token traffic scheduling algorithm in multi-logical links based on feedback information is presented.In this algorithm,the traffic scheduling of links is based on the feedback information of token numbers in sharing token buffer.Experimental results demonstrated that this algorithm diminished latency,and the shape and throughout capacity of traffic were better than other traditional algorithms.
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.001 |
| 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