MétaCan
Menu
Back to cohort
Record W1919549520

Distributed design and provisioning of survivable multi-domain optical networks

2013· article· en· W1919549520 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

VenueOptical Network Design and Modelling · 2013
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversité de MontréalConcordia University
Fundersnot available
KeywordsComputer scienceProvisioningScalabilityHeuristicsDistributed computingComputer networkDomain (mathematical analysis)Bandwidth (computing)Scheme (mathematics)Traffic groomingWavelength-division multiplexingMathematics
DOInot available

Abstract

fetched live from OpenAlex

Providing protection in multi-domain optical networks amounts to ensuring protection for the inter-domain links. Due to scalability issues, almost all previous studies focused on heuristics. In this study, under the assumption of a distributed network management, we propose a large scale optimization ILP model allowing to obtain exact solutions with various traffic instances, on a network with 10 domains. The model relies on p-cycles in order to protect the inter-domain links, and on FIPP p-cycles for the segment/path protection in each individual domain. Experiments were successfully conducted on a multi-domain network with 10 domains. They include a comparison of bandwidth requirements between the proposed distributed scheme and a centralized scheme.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.349
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.001
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.024
GPT teacher head0.214
Teacher spread0.190 · 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