MétaCan
Menu
Back to cohort
Record W2896994717 · doi:10.1109/rndm.2018.8489819

Dual-Failure Restorability of Meta-Mesh Networks

2018· article· en· W2896994717 on OpenAlexaff
Andres Castillo, Tetsuhei Nakashima‐Paniagua, John Doucette

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceSurvivabilitySpare partNetwork topologyTraverseDistributed computingMesh networkingComputer networkOptical mesh networkDual (grammatical number)Wireless mesh networkReliability engineeringTopology (electrical circuits)EngineeringTelecommunications

Abstract

fetched live from OpenAlex

The meta-mesh approach was previously proposed as an innovative method for improving the capacity efficiency of span restoration in sparse network topologies. The fundamental idea is to route lightpaths that fully transit chains of degree-2 nodes onto logical bypass spans that physically traverse the chain, but which are allowed to fail back to the anchor nodes or degree-3 nodes of the chain. From the transiting lightpath perspective, the effect is an increase in network connectivity from which a decrease in required spare capacity is allowed. Prior work on the meta-mesh approach considered only single span failure restorability. The work herein addresses the issue of dual-failure survivability by developing an ILP design model that produces a minimum-cost meta-mesh network design that is fully restorable in the event of all possible dual span failures scenarios.

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 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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.694
Threshold uncertainty score0.419

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.020
GPT teacher head0.237
Teacher spread0.217 · 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 teacher head, not a consensus.

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

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

Citations2
Published2018
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207