MétaCan
Menu
Back to cohort
Record W2118757123 · doi:10.1109/icw.2005.14

A Novel Fairness Based Criticality Avoidance Routing Algorithm for Wavelength Routed Optical Networks

2005· article· en· W2118757123 on OpenAlex
S Pramod, S. Siddiqui, Hussein T. Mouftah

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceComputer networkBlocking (statistics)Hop (telecommunications)Routing algorithmNetwork routingStatic routingRouting (electronic design automation)Traffic groomingCriticalityDistributed computingRouting and wavelength assignmentLoad balancing (electrical power)Wavelength-division multiplexingRouting protocolAlgorithmWavelengthMathematics

Abstract

fetched live from OpenAlex

In conventional RWA algorithms the shorter lightpaths fragment the available wavelengths resulting in a higher blocking probability for longer hopcount lightpaths. In this paper we study a novel routing algorithm, which uses traffic classification to classify different hop count connection requests to provide fairness among short and long hop count traffic requests. Also our routing algorithm uses the link criticality information which is related to the number of available wavelengths on a link to provide load balancing over all the links in a network.

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

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.244
Teacher spread0.230 · 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

Quick stats

Citations4
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207