A New Insight and Approach to Node Failure Protection with Ordinary p-Cycles
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
Since the advent of p-cycles it has been understood that, in addition to their span-protecting properties, p-cycles have the same inherent protection as a BLSR ring to "on-cycle" demands that transit a failed node. It has remained less clear how to protect straddling demand flows from node failure as well. Other work has sought to achieve full node protection with extensions of the p-cycle concept such as node-encircling p-cycles, path-segment or "flow"-protecting p-cycles, and failure independent path-protecting p-cycles. Here we report a rather simple and useful finding about the problem-that high levels of node failure protection can be achieved with an ordinary set of p- cycles which designed in a way that every demand that transits a node in a straddling manner is also intercepted at points upstream and downstream on its route by some other p-cycle. We first characterize the inherent properties of ordinary minimum- capacity p-cycle network designs when inspected for use from this new standpoint. We then alter the basic network design model to maximize node restorability and even achieve 100% protection against both single node and span failures, with little additional capacity. The practical importance is that the simplicity of basics-cycles is retained, and only one set ofp-cycles is required, while efficiently achieving node failure protection either for priority paths or for all demands in a network.
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