MétaCan
Menu
Back to cohort
Record W1517915569 · doi:10.1109/icnp.1999.801921

A logical ring reliable multicast protocol for mobile nodes

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Agent-Based Network Management
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMulticastComputer networkComputer scienceProtocol Independent MulticastInternet Group Management ProtocolReliable multicastPragmatic General MulticastToken ringSource-specific multicastDistance Vector Multicast Routing ProtocolProtocol (science)Base stationDistributed computingIP multicastHandoverXcastSecurity token

Abstract

fetched live from OpenAlex

A protocol for the reliable multicast of data to mobile hosts is described. A logical ring is maintained between all the base stations that handle the multicast traffic of the same multicast group. A token passing protocol enforces a consistent view between all base stations with respect to the frames that are considered delivered to all mobiles. The interaction of the reliable multicasting and the handoff events of the mobiles is controlled by a special handoff protocol. A description of the management protocol is also given. We use simulation results to illustrate the feasibility of the approach and reveal the performance interplay between the base station buffer size and the token rotation frequency.

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: none
Teacher disagreement score0.456
Threshold uncertainty score0.463

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.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.039
GPT teacher head0.318
Teacher spread0.279 · 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

Citations18
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicMobile Agent-Based Network ManagementFrench-language works237,207