MétaCan
Menu
Back to cohort
Record W2138719047 · doi:10.1109/glocom.2005.1578033

Fairness control in wavelength-routed WDM ring networks

2005· article· en· W2138719047 on OpenAlex
K. Mosharaf, Ioannis Lambadaris, J. Talim, A. Shokrani

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

VenueGLOBECOM '05. IEEE Global Telecommunications Conference, 2005. · 2005
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsCarleton University
Fundersnot available
KeywordsBlocking (statistics)Computer scienceHop (telecommunications)Wavelength-division multiplexingComputer networkScheme (mathematics)WavelengthDistributed computingMathematics

Abstract

fetched live from OpenAlex

We investigate a threshold-based wavelength allocation scheme in order to support fairness and service differentiation in WDM unidirectional ring networks. A ring network can handle different classes of traffic streams, which differ by their hop-counts (i.e., the number of hops used from source to destination). We assume that for each class of traffic, call interarrival and holding times are exponentially distributed. In such a network, classes of calls with smaller hop-counts, experience lower blocking rates than ones with greater hop-counts. In this paper, a multi-threshold wavelength allocation scheme is proposed to provide equal blocking probabilities experienced by different classes. A recursive simulation-based algorithm is designed to numerically compute the optimal thresholds. Simulation results compare the performance of our proposed scheme, with that of complete sharing and complete partitioning schemes

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.836
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0010.001
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.015
GPT teacher head0.247
Teacher spread0.232 · 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