MétaCan
Menu
Back to cohort
Record W1931619652 · doi:10.1109/icc.2003.1204597

Extending the p-cycle concept to path-segment protection

2004· article· en· W1931619652 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsStraddlePath (computing)Path protectionSpan (engineering)Computer scienceGeneralizationNode (physics)Flow (mathematics)Network Access ProtectionScheme (mathematics)Distributed computingComputer networkTopology (electrical circuits)MathematicsEngineeringWavelength-division multiplexingStructural engineering

Abstract

fetched live from OpenAlex

This work introduces a significant extension to the method p-cycles for network protection. The main advance is the generalization of the p-cycle concept to protect multi-span segments of contiguous working flow, not only spans that lie on the cycle or directly straddle the p-cycle. This effectively extends the p-cycle technique to include path protection or protection of any flow segment along a path as well as the original span protection use of p-cycles. It also gives an inherent means of transit flow protection against node loss. We develop a capacity optimization model for the new scheme and compare it to prior p-cycle designs and other types of efficient mesh-survivable networks. Results show that path-segment-protecting p-cycles have capacity efficiency near that of a path-restorable network is to suggest the use of flow p-cycles to protect transparent optical express flows through a regional 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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.898
Threshold uncertainty score0.212

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.009
GPT teacher head0.217
Teacher spread0.208 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations27
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207