MétaCan
Menu
Back to cohort
Record W1955612129 · doi:10.1109/mascot.1998.693680

Approaches to link-state alternate path routing in connection-oriented networks

2002· article· en· W1955612129 on OpenAlexaff
M. Sivabalan, Hussein T. Mouftah

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer scienceComputer networkLink-state routing protocolDistributed computingRouting protocolStatic routingDynamic Source RoutingRouting (electronic design automation)Path vector protocolPolicy-based routingPath (computing)Equal-cost multi-path routing

Abstract

fetched live from OpenAlex

Alternate path routing (APR) can be used to achieve efficient routing in communications networks. We describe several approaches to APR in connection-oriented networks running link-state routing protocol, and evaluate their performance using call-level simulations. We assume source routing paradigm where primary paths for calls are computed only at source nodes. However, depending on the approach, alternate paths can be computed at source, intermediate or even destination nodes. We present simulation results to show that, if not carefully used, APR may degrade network performance under heavy load. Finally, we describe two mechanisms for improving APR, and address some of their implementation issues.

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.972
Threshold uncertainty score0.537

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.001
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.046
GPT teacher head0.204
Teacher spread0.158 · 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

Citations1
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207