MétaCan
Menu
Back to cohort
Record W2537838804 · doi:10.1109/ants.2011.6163642

Using decomposition techniques for the design of survivable logical topologies

2011· article· en· W2537838804 on OpenAlexaff
Brigitte Jaumard, Anh H. Hoang, Minh N. Bùi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsConcordia University
Fundersnot available
KeywordsSurvivabilityNetwork topologyHeuristicsComputer scienceScalabilityBenchmark (surveying)Distributed computingColumn generationTopology (electrical circuits)Computer networkMathematical optimizationMathematics

Abstract

fetched live from OpenAlex

We study the design of logical survivable topologies for service protection against single or multiple failures in IP-over-WDM networks where protection can be provided either at the optical layer, or at the network (IP) layer. Indeed, synergies need to be developed between IP and optical layers in order to optimize the resource utilization and to reduce the costs and the energy consumption of the future networks. We propose a new optimization model, an enhanced cutset model, which relies on a column generation reformulation for the design of a survivable logical topology. It is a highly scalable model and it makes possible the (near) exact solution of several benchmark instances, which were only solved with the help of heuristics so far. In addition, much larger instances than in previous studies can be solved as the proposed formulation avoids the explicit or implicit enumeration of cutsets. In the numerical experiments, we explore how survivability evolves when the number of failure sets increases.

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: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.402
Threshold uncertainty score0.190

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.125
GPT teacher head0.310
Teacher spread0.185 · 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
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

Citations1
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207