MétaCan
Menu
Back to cohort
Record W2097050598 · doi:10.1109/glocom.1999.831605

Reducing buffer requirement for VC-merge capable ATM switches

2003· article· en· W2097050598 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicInterconnection Networks and Systems
Canadian institutionsUniversity of Ottawa
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMultiprotocol Label SwitchingComputer scienceComputer networkLabel switchingBuffer (optical fiber)ScalabilityRouterMerge (version control)Label Distribution ProtocolDistributed computingQuality of serviceOperating systemParallel computing

Abstract

fetched live from OpenAlex

The multiprotocol label switching (MPLS) paradigm of integrating layer-3 routing with layer-2 switching has been proposed as a viable alternative to today's router architecture. When MPLS is applied to the design of large core routers, label merging is required in order to support scalability. In this paper, we assume that ATM is the layer-2 switching mechanism. We investigate the impact of VC merging on buffer requirement. Results indicate that buffer requirement of VC merging can be excessive when compared to non-VC merging. This is in contrast to previous findings. We propose three schemes to significantly reduce the buffer requirement for VC merging.

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: Methods · Consensus signal: none
Teacher disagreement score0.947
Threshold uncertainty score0.332

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.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.035
GPT teacher head0.257
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

Quick stats

Citations7
Published2003
Admission routes2
Has abstractyes

Explore more

Same topicInterconnection Networks and SystemsFrench-language works237,207