An adaptive MAC polling protocol for ethernet passive optical networks
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
Medium access control (MAC) is one of the most crucial issues in Ethernet passive optical networks (EPONs). To prevent data of different optical network units (ONUs) from collision in the upstream direction, an EPON system must employ a MAC mechanism to arbitrate access to the shared upstream channel and at the same time efficiently share the bandwidth of the upstream channel among all ONUs. In this paper, we present an adaptive MAC polling protocol for an EPON system. This polling protocol uses an adaptive scheduling algorithm called the earliest-packet-first (EPF) algorithm that schedules the transmission order of different ONUs based on the arrival time of the first packet waiting in the queue of each ONU and always schedules the ONU with the earliest packet to transmit first in each polling. The purpose is to reduce the packet delay in the system and thus provide better quality of service for end users.
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