MétaCan
Menu
Back to cohort
Record W2100697149 · doi:10.1145/1247694.1247709

Performance modeling of network coding in epidemic routing

2007· article· en· W2100697149 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
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsComputer scienceLinear network codingComputer networkRouting protocolCoding (social sciences)Multipath routingDistributed computingStatic routingRouting (electronic design automation)Network packet

Abstract

fetched live from OpenAlex

Epidemic routing has been proposed to reduce the data transmission delay in opportunistic networks, in which data can be either replicated or network coded along the opportunistic multiple paths. In this paper, we introduce an analytical framework to study the performance of network coding based epidemic routing, in comparison with replication based epidemic routing. With extensive simulations, we show that our model successfully characterizes these two protocols and demonstrates the superiority of network coding in opportunistic networks when bandwidth and node buffers are limited. We then propose a priority variant of the network coding based protocol, which has the salient feature that the destination can decode a high priority sub-set of the data much earlier than it can decode any data without the priority scheme. Our analytical results provide insights into how network coding based epidemic routing with priority can reduce the data transmission delay while inducing low overhead.

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.002
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.814
Threshold uncertainty score0.341

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.038
GPT teacher head0.257
Teacher spread0.219 · 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

Citations78
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207