MétaCan
Menu
Back to cohort

Robust Design and Management of Optical Networks

2011· book-chapter· en· W2488327214 on OpenAlex
Hussein T. Mouftah, Burak Kantarcı

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

VenueIGI Global eBooks · 2011
Typebook-chapter
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsUnavailabilitySurvivabilityProvisioningComputer scienceComputer networkRobustness (evolution)Network planning and designSoftware deploymentService (business)Distributed computingIT service continuityReliability engineeringEngineeringBusiness

Abstract

fetched live from OpenAlex

High capacity advantage of optical networks also introduces the risk of huge data loss in case of a service interruption, even if the outage lasts a short time. Therefore, survivable and reliable design and management of optical networks is urgent. However, deployment of efficient survivability policies does not always guarantee the continuity of the service. Long failure restoration delays, multiple failures, and lack of protection resources may lead to service unavailability. Hence, connection availability arises as a design constraint, and it is defined as the probability of a connection being in the operating state at any time. Availability-constrained optical network design and availability-constrained connection provisioning are two important problems to guarantee robustness of connections in a survivable 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: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.602
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.0010.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.028
GPT teacher head0.210
Teacher spread0.181 · 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