MétaCan
Menu
Back to cohort
Record W2143016553 · doi:10.1109/aina.2007.121

Reliable Strict Quality-of-Service with Unreserved Backup Paths

2007· article· en· W2143016553 on OpenAlex
I‐Chen Wu, M.R. Ito

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

VenueProceedings · 2007
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsBackupComputer scienceReservationPath (computing)Computer networkQuality of serviceService qualityService (business)Distributed computingDatabase

Abstract

fetched live from OpenAlex

Guaranteed, high-quality service in a computer network often requires a single reserved path. Such a path can easily suffer from single point failures. Thus, to continuously provide the same high-quality service guarantee both before and after a link failure, each flow requires both a reserved primary path and a backup path. One solution category involves eliminating resource reservation on the backup paths, and instead, computes a posteriori good unreserved backup paths to provide strict high quality service in the event of a link failure. This paper provides a solution (AvoidPBO-S) in this category that uses good unreserved backup paths to offer the same strict service guarantee despite a link failure. Initial test results show that there is only a very small likelihood that an unreserved AvoidPBO-S backup path fails to provide the kind of service guarantee as the primary path, and that AvoidPBO-S backup paths perform well compared to other methods.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.649
Threshold uncertainty score0.476

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.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.024
GPT teacher head0.256
Teacher spread0.232 · 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