MétaCan
Menu
Back to cohort
Record W2150756961 · doi:10.1109/glocom.2009.5426237

Altering Grooming Decisions to Enhance p-Cycle Design Efficiency

2009· article· en· W2150756961 on OpenAlexaff
Diane Prisca Onguetou, W.D. Grover

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsTraffic groomingSet (abstract data type)Computer sciencePath (computing)Computer networkDistributed computingWork (physics)EngineeringWavelength-division multiplexing

Abstract

fetched live from OpenAlex

In most prior work on survivable network design, lower level connection requirements are assumed to have already been "groomed" into a required set of lightpath demands. In this work, we show how grooming decisions can be directly integrated into an overall p-cycle network design for more efficiency. We use this new ability to understand how the number of grooming sites affects overall network efficiency and how grooming decisions can interact with the p-cycle protection strategy. In test case results a set of STM-1 demands are groomed into a set of STM-16 transport connections in a way that is jointly optimal considering both working path capacities and p-cycles formed to protect those paths. The study also compares different criteria for selecting grooming sites.

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.485
Threshold uncertainty score0.484

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.014
GPT teacher head0.268
Teacher spread0.254 · 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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207