Path-protecting p -cycles and the protected working capacity envelope concept: addressing the needs of dynamic transparent optical networks
Bibliographic record
Abstract
Two important aspects of optical networking are to ensure transmission integrity when connecting optically transparent channels in real time for protection, and the handling of dynamic demand, especially when survivability considerations are added. The prevalent approach for providing protected dynamic lightpath services is signaling intensive, database dependent, and requires on-the-fly cross-connection of standby lightwave channels to form protection paths. With two inter-related new concepts, we address concerns about on-the-fly concatenation of transparent optical channels to form protection paths and improve the scalability, and reduce database dependence and signalling intensity associated with current methods. An extension of the <i>p</i>-cycles concept to end-to-end path protection, in conjunction with the concept of a protected working capacity envelope for dynamic provisioning (which has no per-connection signaling for backup path establishment) yields a highly efficient network architecture in which protection paths are fully pre-cross-connected prior to failure and only the two lightpath end-nodes need to detect path failure and switch the lightpath (or its traffic) into a corresponding pre-planned path-protecting <i>p</i>-cycle.
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 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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".