MétaCan
Menu
Back to cohort
Record W2028550645 · doi:10.1109/netwks.2010.5624936

Design of path-segment-protecting p-cycles in survivable WDM mesh networks

2010· article· en· W2028550645 on OpenAlexaff
Brigitte Jaumard, Honghui Li, Samir Sebbah

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsConcordia University
Fundersnot available
KeywordsSurvivabilityScalabilityColumn generationComputer scienceDistributed computingNetwork planning and designWavelength-division multiplexingPath protectionPath (computing)Routing (electronic design automation)Network Access ProtectionComputer networkMathematical optimizationMathematics

Abstract

fetched live from OpenAlex

Survivability is an essential feature in the design of WDM mesh networks for continuous service delivery in the case of failures. Segment p-cycles (also known as flow p-cycles) offer an interesting protection approach with a good trade-off between protection capacity cost and recovery speed. In this paper, we propose a new design method for segment p-cycles based on a large scale optimization tool, namely column generation techniques (CG). In contrast with the conventional design approaches which pre-enumerate the candidate segment p-cycles and establish their protection relationships with the protected capacity, our CG based optimization approach dynamically generates segment p-cycles with their protection capabilities during the optimization process. Computational results show that our design approach of segment p-cycles is much more capacity efficient and scalable than the prevalent design approach in the literature. A saving of protection capacity in the range of 3% to 20% is achieved. In addition, our CG-based design is highly scalable, and much faster in large dense networks than the prevalent classical ILP-based optimization approach.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.001
Threshold uncertainty score0.003

Distilled classifier scores by category (both heads)

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.0010.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.014
GPT teacher head0.217
Teacher spread0.203 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Quick stats

Citations4
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207