Merging engine implementation for intra-frame sharing in multi-tenant virtual 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
High up-front capital expenditures impede the widespread deployment of passive optical networks (PONs). A multi-tenant solution, in which multiple network operators virtually share PON infrastructure and bandwidth resources, can result in significant cost savings. First, we investigate the viability of virtual PONs, in which virtual network operators share a portion of the upstream bandwidth in a frame. Each PON schedules its frame-level capacity using a dedicated dynamic bandwidth assignment algorithm, resulting in the generation of an independent bandwidth map (BMap). Second, we implement at the optical line terminal a merging engine that combines individual virtual BMaps into a single physical BMap, which is then transmitted to all optical network units. Our novel traffic merging algorithm is capable of consolidating traffic across all transmission containers. We apply this merging engine on top of the 10-Gbit-capable PON module and validate our approach using network simulator 3. The results show that our proposed intra-frame sharing technique, when integrated with our traffic merging algorithm, significantly outperforms the standard inter-frame sharing approach in terms of both latency and packet loss. Furthermore, we observed that best-effort traffic is affected most for all resource constraint scenarios of intra-frame sharing.
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.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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