Link-Disjoint Shortest-Delay Path-Pair Computation Algorithms for Shared Mesh Restoration Networks
Bibliographic record
Abstract
We present two novel double-constrained routing algorithms, called: Two-step Delay-constrained Pool Sharing (TDPS) and One-step Delay-constrained Pool Sharing (ODPS), in a survivable mesh network. The goal of both algorithms is to compute a pair of link-disjoint primary and backup paths between a given source and destination nodes, which guarantees full recovery from any single link failure in the network. Our objective is to minimize simultaneously the total end-to-end delay time along the primary and backup paths and the resources (such as backup bandwidth) used in the network. Using simulation, we have studied both TDPS and ODPS algorithms on three existing North-American transport networks. We show that the ODPS scheme eliminates the trap-topology problem associated with many two-step link-disjoint path computation algorithms proposed in the literature. It also outperforms TDPS in terms of the total end-to-end delay along the working and backup paths.
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.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 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".