MétaCan
Menu
Back to cohort
Record W2117317341 · doi:10.1145/1247721.1247722

Performance evaluation and analysis of delay tolerant networking

2007· article· en· W2117317341 on OpenAlex
Earl Oliver, Hossein Falaki

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 Waterloo
FundersNational Science Council
KeywordsComputer scienceBottleneckDelay-tolerant networkingComputer networkTransfer (computing)WirelessInteractive kioskTelecommunicationsEmbedded systemWireless ad hoc networkOperating systemVehicular ad hoc network

Abstract

fetched live from OpenAlex

Wireless opportunistic connections are the primary mechanism for transferring data between disconnected nodes, such as vehicles, remote sensors, or village kiosks DieselNet, SeNDT, KioskNet in a delay tolerant network (DTN). Opportunistic connections may last from seconds, as in the case of a rapid drive-by, to several minutes. During this short connection window, it is important to maximize data transfer between DTN nodes. We use microbenchmarks to study the wireless transfer performance of the DTN reference implementation, which is the most widely used DTN implementation today implementing. Existing DTN deployments utilize low-cost, low-power devices that tend to have slow CPUs KioskNet. Based on these characteristics, we hypothesize about the effect of control parameters on opportunistic data transfer. We test our hypotheses through a series of experiments and show that the principal performance bottleneck is the CPU. We also found that the choice of DTN bundle size affects performance by a factor of up to 60.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.960
Threshold uncertainty score0.268

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.001
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.030
GPT teacher head0.277
Teacher spread0.247 · 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

Citations30
Published2007
Admission routes1
Has abstractyes

Explore more

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