Bandwidth Reservation in Optical WDM/TDM Star 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
Abstract — In this paper, we propose an off-line scheduling algorithm for an optical TDM/WDM star network composed of a non-blocking optical central switch and a set of edge switches, each capable of simultaneously transmitting (and receiving) at several different wavelengths. We implement a scheduling algorithm, which assigns a cost to each time slot destined to a particular destination and attempts to allocate each request a set of time slots with the lowest cost. This strategy provides low rejection probability for future requests. In order to reduce the signaling bandwidth and the computation complexity we require the scheduler to preserve the allocation of the existing connections by modifying the schedule for only the changes in the traffic request. For deallocating the terminating connections we propose two different techniques, with different performance and complexity. Then we enhance the performance of the simpler technique with a modification to the scheduling algorithm, which should be performed only for scheduling the first frame. I.
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