A Study of Fast Flexible Bandwidth Assignment Methods and their Blocking Probabilities for Metro Agile All-optical Ring 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 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 (RWTA) problem has not yet been well addressed with respect to appropriately handling the bandwidth availability. In this paper, we consider a ring topology and apply local-information-based distributed schemes to accommodate fast dynamic bandwidth requests in order to enhance network survivability and to decrease the degree of coordination among nodes. We propose an analytical model to iteratively compute blocking performance of single-fibre networks and present RWTA algorithms for multi-fibre networks based on an indexed fibre designation scheme in order to enhance network blocking performance in all-optical metro networks. A systematic study of the possible combinations of algorithms has been performed, which showed not only that packed algorithms reduce blocking probability, but also that our indexed fibre designation scheme enhances performance.
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.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