MétaCan
Menu
Back to cohort
Record W2548029077 · doi:10.1109/ccece.2016.7726789

Solving very large RWA data instances

2016· article· en· W2548029077 on OpenAlexafffund
Brigitte Jaumard, Maryam Daryalal

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of CanadaConcordia UniversityNational Science Foundation
KeywordsTestbedHeuristicsRouting and wavelength assignmentComputer scienceNoveltyHeuristicExploitRouting (electronic design automation)AlgorithmMathematical optimizationWavelengthWavelength-division multiplexingMathematicsArtificial intelligenceComputer network

Abstract

fetched live from OpenAlex

While the Routing and Wavelength Assignment (RWA) has been widely studied, few studies attempt to solve realistic size instances, namely, with 150 wavelengths per fiber and a few hundred nodes. Indeed, state of the art is closer to around 20 nodes and 30 wavelengths, regardless of what the authors consider, heuristics or exact methods with very few exceptions. In this paper, we are interested in reducing the gap between realistic data sets and testbed instances that are often used, using exact methods. Even if exact methods may fail to solve in reasonable time very large instances, they however output bounds on the accuracy of the heuristic solutions. The novelty of our work is to exploit the observations that optimal solutions contain a very large number of lightpaths associated with shortest paths or k shortest paths with a small k. We propose different RWA algorithms that lead to solve exactly or near exactly much larger instances than in the literature with up to 150 wavelengths and 50 nodes.

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.002
metaresearch head score (Gemma)0.011
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.009
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.011
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0020.001
Research integrity0.0030.003
Insufficient payload (model declined to judge)0.0090.001

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.021
GPT teacher head0.239
Teacher spread0.218 · 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
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

Citations0
Published2016
Admission routes2
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207