Topology Reconfiguration Mechanism for Traffic Engineering in WDM Optical Network
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
Optical wavelength division multiplexed (WDM) networks provide an excellent transmission medium for voice and data traffic, streaming media, and high performance and grid computing needs. Rearrangeability is one compelling characteristic of WDM optical networks that allows network operators to rearrange the networks in response to changing traffic demands and element failures to provide improved network performance. Under changing traffic flows and abhorrent network conditions reconfiguration is an ongoing process. Available approaches are not able to handle extreme load conditions, traffic bursts, and element failures and, so far, these approaches cover only limited aspects of the problem of automated reconfiguration. In this work we present an adaptive reconfiguration mechanism for WDM optical networks (ARWON). Two heuristically based algorithms, combination algorithm (CA) and multi lightpath change (MLPC) algorithm, are also proposed to support implementation of ARWON. Simulation experiments covered all ranges of traffic flows and element failure scenario and performance of ARWON was validated with an established contemporary reconfiguration algorithm. Results show that under all loading conditions and link failure scenario ARWON performed better than the comparison algorithm. Under extreme loading conditions ARWON incurred 11 times less traffic loss than single lightpath change (SLPC) algorithm and on average SLPC was carrying 20 more lightpaths than ARWON, per observation cycle, that were 100 percent loaded. Under link failure scenario ARWON recovered faster and rerouted the traffic in one step, whereas SLPC recovered slowly and recovery took much longer duration than ARWON. For other loading conditions, ranging from low to high loading, it was observed that during early stages of simulation ARWON performs at par or marginally better than SLPC. Performance of ARWON steadily improves as simulation progresses over longer duration.
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