Distributed Dynamic Routing, Wavelength and Timeslot Assignment for Bandwidth on Demand in Agile All-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
In emerging agile all-optical networks, the next generation time division multiplexing technique in the optical domain is implemented on top of wavelength-division multiplexing to increase channel utilization and to support dynamic bandwidth demands. However, the corresponding dynamic routing, wavelength and timeslot assignment (DRWTA) problem has not yet been well addressed with respect to appropriately handling the bandwidth available. In this paper, we use dynamic programming and take the bottom-up approach to solve the DRWTA problem with the objective of minimizing blocking probability. We consider the ring topology and apply a distributed scheme to accommodate dynamic bandwidth requests in order to enhance network survivability and to decrease the degree of coordination among nodes. The proposed dynamic programming method decreases the runtime and improves time-related performance of the network
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