MétaCan
Menu
Back to cohort
Record W4387450880 · doi:10.3390/computation11100202

Enhancing Network Availability: An Optimization Approach

2023· article· en· W4387450880 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

VenueComputation · 2023
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsUniversity of Winnipeg
Fundersnot available
KeywordsBackupMultipath propagationComputer scienceMultipath routingRobustness (evolution)Load balancing (electrical power)Computer networkDistributed computingHigh availabilityDisjoint setsPath (computing)Quality of serviceRouting (electronic design automation)Routing protocolLink-state routing protocol

Abstract

fetched live from OpenAlex

High availability is vital for network operators to ensure reliable services. Network faults can disrupt functionality and require quick recovery. Multipath networking enhances availability through load balancing and optimal link utilization. However, equal-cost multipath (ECMP) routing has limitations in effectively using multipaths, decreasing network availability. This paper proposes a three-phase disjoint-path framework that improves availability by directing traffic flows through separate paths. The framework provides effective load balancing and meets various service requirements. It includes the Optimization phase for identifying optimal multipath solutions, the Path Separation phase for dividing the multipath into working and backup sets, and the Quality Assessment phase for evaluating the robustness of both sets using topological metrics and micro-based characteristics. The simulations demonstrate the proposed framework’s validation and effectiveness in enhancing network availability.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.336
Threshold uncertainty score0.456

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
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.028
GPT teacher head0.258
Teacher spread0.230 · 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