MétaCan
Menu
Back to cohort
Record W2083923465 · doi:10.1049/iet-com:20060082

Limited-perimeter vector matching fault-localisation protocol for transparent all-optical communication networks[Note 1]

2007· article· en· W2083923465 on OpenAlex

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

VenueIET Communications · 2007
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceScalabilityDistributed computingFlooding (psychology)Protocol (science)Computer networkFault detection and isolation

Abstract

fetched live from OpenAlex

A novel fault-localisation protocol is constructed based on the principles of distributed control and management mechanisms. The proposed protocol has high scalability and speed, but at the cost of increased computational complexity. To provide the maximum level of transparency, the protocol skips any optical power monitoring or spectrum analysis at the intermediate nodes of established lightpaths. Moreover, to narrow down the associated time and space complexities, it restricts the fault-localisation area to a small area called limited-perimeter. These functions are implemented by means of five phases, namely pausing, flooding, multicasting, matching, and concluding. Although the protocol has been developed to pinpoint single failures, it could track down multiple failures that occur in nonoverlapped limited-perimeters. To evaluate the performance of the proposed method, time and space complexities are calculated and compared with a counterpart protocol that does not limit the fault-localisation area.

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

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.000
Research integrity0.0000.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.065
GPT teacher head0.355
Teacher spread0.290 · 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