MétaCan
Menu
Back to cohort
Record W2129006062 · doi:10.1109/ccece.1993.332352

Overflow control in multicast networks

2002· article· en· W2129006062 on OpenAlex
Xinyi Liu, H.T. Mouftah

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 institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of CanadaInstituto de Telecomunicações
KeywordsMulticastComputer scienceComputer networkFIFO (computing and electronics)Protocol Independent MulticastDistributed computingSource-specific multicastNetwork packetThroughputPragmatic General MulticastQueueOperating system

Abstract

fetched live from OpenAlex

Multicast switches have found many applications in communication networks. A common design of multicast switches is a tandem of a copy network and a point-to-point routing network. The occurrence of overflow is an inherent problem in copy networks. This paper presents an overflow control mechanism in copy networks, which consists of 3 parts: input packet-splitting stage, shared-memory FIFO queue and copy distribution network. The proposed design provides a maximum throughput for the copy network with access fairness capability. A simulation study is also presented to evaluate and compare the performance of this architecture with other previous work.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

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.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.994
Threshold uncertainty score0.276

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.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.014
GPT teacher head0.201
Teacher spread0.187 · 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

Citations4
Published2002
Admission routes2
Has abstractyes

Explore more

Same topicInterconnection Networks and SystemsFrench-language works237,207