MétaCan
Menu
Back to cohort
Record W2093314706 · doi:10.1109/mcom.2005.1381884

Providing multicast through recursive unicast

2005· article· en· W2093314706 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

VenueIEEE Communications Magazine · 2005
Typearticle
Languageen
FieldComputer Science
TopicNetwork Packet Processing and Optimization
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsMulticastComputer scienceComputer networkXcastProtocol Independent MulticastSource-specific multicastPragmatic General MulticastIP multicastDistance Vector Multicast Routing ProtocolUnicastDistributed computingOpen Shortest Path FirstMulticast addressInter-domainRouting protocolRouting (electronic design automation)Link-state routing protocol

Abstract

fetched live from OpenAlex

The group addressing model currently employed for supporting IP multicast has caused several implementation issues including global unique address allocation, sender admission control, and multicast forwarding state scalability. In this article we first review related work carried out to address these issues using different mechanisms and at different levels. We discuss their merits and deficiencies and also their possible combinations for improved performance. We then devise a protocol that works by introducing the idea of recursive unicast into an existing multicast routing protocol, multicast extension to OSPF (MOSPF), to achieve scalable multicast. Simulation results are used to demonstrate the high performance of the devised protocol in reducing computational overhead and forwarding state at routers and also in casing address allocation and admission control.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.601
Threshold uncertainty score0.614

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.001
Open science0.0030.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.047
GPT teacher head0.309
Teacher spread0.262 · 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