A novel distributed control protocol in dynamic wavelength-routed optical networks
Bibliographic record
Abstract
Path selection has long been one of the most important issues in the network design and management, which is also referred to as routing and wavelength assignment in the optical network domain. In this article we investigate the RWA problem for dynamic wavelength-routed mesh networks in a fully distributed controlled environment. We present a novel routing and signaling protocol called Asynchronous Criticality Avoidance (ACA), which is devised to reduce the mutual interference between lightpaths launched by different source-destination pairs to improve network performance in terms of blocking probability. With the fixed alternate routing architecture, the ACA protocol dynamically marks a set of wavelength channels as critical if the occupancy of the channels causes a bottleneck between an S-D pair with a width equal to or narrower than a predefined threshold. To support a distributed control environment, a suite of signaling processes is devised to realize the criticality avoidance mechanism, with which a two-stage routing and wavelength assignment (or criticality avoidance routing) is performed. The ACA protocol has been shown by simulations to be capable of better performance than existing schemes.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".