Separating resource reservations from service requests to improve the performance of optical burst-switching 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 this paper, we introduce a new signalling architecture called Dual-header Optical Burst Switching (DOBS) for next generation burst-switching optical networks. DOBS decouples the resource reservation process from the service request process in core nodes and allows for delayed scheduling to be implemented. This relaxes the constraints on burst scheduling operations and allows the offset sizes of bursts to be precisely controlled in core nodes without the use of fiber delay line buffers. This allows for increased flexibility, control, and performance. To demonstrate the benefit of delayed scheduling and core. node offset control, we examine the performance of a DOBS system in which the offset size of every burst on a core link is set to a constant value. Using simulation and analysis, we show that the resulting constant-scheduling-offset (CSO) system realizes lower ingress delay, higher throughput, and better fairness than conventional single-header OBS systems, while simultaneously requiring only O(1) burst scheduling complexity. In a 16-channel system with full wavelength conversion and no fiber delay line buffers, the CSO DOBS system achieved a blocking probability 50% lower than that of a similar LAUC-VF JET OBS system. The CSO DOBS system also achieved perfect fairness, both with respect to burst length and with respect to the residual path length of bursts
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.002 |
| 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.002 |
| 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