Connection management algorithm for advance lightpath reservation in WDM 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
Advance reservation is a topic that is rarely discussed within the domain of wavelength division multiplexed (WDM) networks. However, for many emerging applications in the telecommunication and/or grid computing industries, a demand for a high bandwidth communication channel as well as a guarantee on resource availability certainly exists. Such applications include: remote surgery, remote experimentation with teleobservation capabilities, teleconferencing, and bulk transfers. In this paper, we present a new model for reserving advance lightpath requests in a centralized system. This model attempts to “migrate,” i.e., move previously reserved lightpaths to candidate wavelengths in order to lower the system’s blocking probability. We have tailored different lightpath migration algorithms to address two specific network objectives: 1) minimize the number of hops a new request traverses after migration, and 2) minimize the number of migrated lightpaths. In terms of blocking probability, the lightpath migration algorithms show a significant improvement over the original advance lightpath reservation model.
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