MétaCan
Menu
Back to cohort
Record W2133740904 · doi:10.1109/wcnc.2003.1200662

Performance evaluations of SRMTP for reliable multicasting over satellite networks

2004· article· en· W2133740904 on OpenAlexaff
Chen Wang, Victor C. M. Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed systems and fault tolerance
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsMulticastComputer scienceComputer networkReliable multicastProtocol Independent MulticastProtocol (science)SatelliteDisseminationDistributed computingThe InternetCommunications satelliteData transmissionBroadbandIP multicastTransmission (telecommunications)TelecommunicationsEngineering

Abstract

fetched live from OpenAlex

A wide variety of network applications require the use of reliable multicast protocols to disseminate data from one source to a potentially large number of receivers simultaneously. Broadband satellite is an ideal transmission medium to support such applications. Although several reliable multicast protocols have been proposed for the Internet, they are not optimized for satellite networks, and the only known protocol developed specifically for reliable multicasting over satellite networks is MFTP. In this paper, we propose a novel set of window-based satellite reliable multicast transport protocols (SRMTPs) for bulk data transfer over broadband satellite networks, with and without the aid of satellite onboard processing (OBP) and buffering (OBB). These protocols employ a judicious combination of negative and positive acknowledgment sent over the shared return satellite channel in a round-robin fashion. Performance evaluation by simulations shows that SRMTP generally outperforms MFTP, especially when it is enhanced by OBP and OBB.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.009
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.009
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.286
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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations6
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicDistributed systems and fault toleranceFrench-language works237,207