MétaCan
Menu
Back to cohort

Energy Consumption Reduction of the Spectrally-Spatially Flexible Optical Networks Based on the Energy Savings Algorithm

2020· article· en· W3107227623 on OpenAlexaff
Joseph Gotengco, Justin Tran, Jason Soukchamroeun, Diego Felix de Almeida, Michał Aibin

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsBritish Columbia Institute of Technology
Fundersnot available
KeywordsTestbedEnergy consumptionComputer scienceBandwidth (computing)Reduction (mathematics)Routing (electronic design automation)Energy conservationEnergy (signal processing)Efficient energy useBlocking (statistics)Computer networkRouting algorithmDistributed computingAlgorithmRouting protocolEngineeringMathematicsElectrical engineering

Abstract

fetched live from OpenAlex

Energy reduction and conservation is gaining interest in our society rapidly in the last decade. In this paper, we design an energy-efficient algorithm for the problem of Routing, Modulation, Core and Spectrum Assignment in Spectrally-Spatially Flexible Optical Networks (SS-FON). We then evaluate our approach using existing, real-life networks in the simulation testbed. Two primary metrics of the evaluation are energy usage, which directly relates to the operational cost of the networks, as well as bandwidth blocking probability, which affects how many customers network operators can serve. Our algorithm achieves similar efficiency for routing as the ones in the literature with the average double reduction of the energy consumption.

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

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.013
GPT teacher head0.199
Teacher spread0.186 · 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

Citations3
Published2020
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207