A disjoint route-sets approach to design of path-protecting p-cycle 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
Recent work has proposed the concept of failure-independent path-protecting (FIPP) p-cycles as a pre-connected, failure independent, path-protecting network architecture [A. Kodian, W. D. Grover (2005)]. FIPP p-cycles extend p-cycles by adding the property, like shared backup path protection (SBPP), of providing end-to-end failure independent path switching against either span or node failures. Especially in a transparent or translucent optical network, the property of pre-cross-connection of protection paths can be even more important than just increasing restoration-speed: when optical protection paths are pre-cross-connected, they can be guaranteed in advance to work when required. FIPP p-cycles therefore offer a fully pre-connected, alternative to SBPP in which protection paths must be assembled on the fly from spare wavelength channels. Design results from small networks in [A. Kodian, W. D. Grover (2005)] showed that FIPP p-cycle designs can be as efficient as SBPP but it is very difficult to design larger networks using the ILP design model in [A. Kodian, W. D. Grover (2005)]. We now develop a new ILP model and a related heuristic method for FIPP p-cycle design that produces network designs with much faster runtimes. Results indicate that the heuristic generates FIPP p-cycle designs that have total capacity costs within 10-18% of optimally designed SBPP solutions.
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