MétaCan
Menu
Back to cohort
Record W1920743835 · doi:10.1109/icc.2003.1204596

Recovery from control plane failures in the CR-LDP signalling protocol

2004· article· en· W1920743835 on OpenAlexaff
Jing Wu, J.M. Savoie, Delfin Y. Montuno, Hussein T. Mouftah

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicInterconnection Networks and Systems
Canadian institutionsUniversity of OttawaNortel (Canada)Communications Research Centre Canada
Fundersnot available
KeywordsComputer networkNode (physics)Protocol (science)Channel (broadcasting)Forwarding planeComputer scienceControl channelUpstream (networking)Routing control planeDownstream (manufacturing)Routing protocolRouting (electronic design automation)EngineeringNetwork packet

Abstract

fetched live from OpenAlex

When the control and data planes are physically separate, it is important to maintain the established connections in the data plane even if the protocol plane fails. Channel status is maintained by a signalling protocol. Channel status information will be permanently lost as a result of a failure in the control plane having no recovery capability of the constrained-based routing label distribution protocol (CR-LDP). A recovery mechanism for channel status information is proposed in this paper. A downstream node stores a label information database (LID) of assignable (free) labels for each incoming link. A copy of the LID redundantly stored in the upstream node as a label information mirror (LIM). Each LIM and the corresponding LID are synchronised. The recovery of channel status information is guaranteed.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.978
Threshold uncertainty score0.291

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.0010.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.014
GPT teacher head0.236
Teacher spread0.222 · 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

Citations3
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicInterconnection Networks and SystemsFrench-language works237,207