MétaCan
Menu
Back to cohort
Record W25508443 · doi:10.6138/jit.2011.12.3.09

A General Availability-Aware Survivable Routing Architecture on GMPLS-Based Recovery

2011· article· en· W25508443 on OpenAlexaff
János Tapolcai, Shin Jer Yang, Pin‐Han Ho

Bibliographic record

Venue網際網路技術學刊 · 2011
Typearticle
Languageen
FieldEngineering
TopicAdvanced Optical Network Technologies
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceComputer networkMultiprotocol Label SwitchingBackupLabel switchingRouting (electronic design automation)Distributed computingAutomatically switched optical networkSurvivabilityRouting control planeQuality of service

Abstract

fetched live from OpenAlex

This article introduces a novel dynamic availability-aware survivable routing architecture under the framework of Generalized Multi-Protocol Label Switching (GMPLS)-based recovery, which aims to achieve better generality for the network operation in meeting the end-to-end (E2E) availability requirement of each connection. The article first defines the partial restorability, justifies the feasibility of equipping a connection with partial restorability under the GMPLS control plane, and highlights the approach of evaluating the E2E availability for a pair of working and partially restorative Shared Risk Group (SRG)-disjoint shared backup Label Switched Paths (LSPs). Simulation is conducted to verify the proposed survivable routing architecture. The final results indicate that the proposed survivable routing framework has a great ability in meeting the E2E availability requirement by engineering the effective restoration fraction of each connection with a fine granularity.

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.

How this classification was reachedexpand

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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.186
Threshold uncertainty score0.949

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.020
GPT teacher head0.209
Teacher spread0.189 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2011
Admission routes1
Has abstractyes

Explore more

Same venue網際網路技術學刊Same topicAdvanced Optical Network TechnologiesFrench-language works237,207