MétaCan
Menu
Back to cohort
Record W2101563996 · doi:10.1109/cdc.2009.5399645

Robust power control of single sink optical networks with time-delays

2009· article· en· W2101563996 on OpenAlex
Nem Stefanovic, Lacra Pavel

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 Toronto
Fundersnot available
KeywordsControl theory (sociology)Computer scienceBounded functionMathematical optimizationMathematicsControl (management)

Abstract

fetched live from OpenAlex

We study the stability of game-theoretic based power control algorithms on multi-link optical networks in the presence of time-delays and uncertainties. The control algorithms, originally developed in the absence of time-delays and uncertainties, adjust the signal powers at the transmitters to solve the optical signal-to-noise ratio (OSNR) optimization problem. This minimizes the bit error rate of the signal channels. We apply the game-theoretic framework to a perturbed OSNR model in the presence of time-delays. Uncertainties in the OSNR model appear as norm-bounded uncertainties in the noise powers, system gains, and channel powers. The time-delays are due to signal propagation between the channel sources and OSNR output. We restrict our analysis to single sink network topologies. A primal-dual control scheme ensures convergence to the Nash equilibrium, and OSNR optimization. The resultant closed-loop system has two time-scales. Robust stability in the presence of time-delays is established via singular perturbation theory modified for Lyapunov-Krasovskii theory.

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 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.847
Threshold uncertainty score0.532

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.006
GPT teacher head0.178
Teacher spread0.171 · 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
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Optical Network TechnologiesFrench-language works237,207