MétaCan
Menu
Back to cohort
Record W2159049494 · doi:10.4304/jcm.1.2.48-56

Round-trip Time Variation in SmoothTCP in the Face of Spurious Errors

2006· article· en· W2159049494 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

VenueJournal of Communications · 2006
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsWestern University
Fundersnot available
KeywordsSpurious relationshipVariation (astronomy)Computer scienceFace (sociological concept)StatisticsGeodesyMathematicsGeologyMachine learningPhysics

Abstract

fetched live from OpenAlex

Abstract — In this paper, we review the definition of a variant of TCP, called SmoothTCP, and describe one of its versions which uses ICMP-SQ messages as its primary control metric. This version of SmoothTCP is intended to be used in environments subject to spurious errors, such as in wireless networks. We evaluate the behavior of this version of SmoothTCP by comparing it with the behavior of Standard TCP in simulated environments with and without spurious errors. When there are no spurious errors, Standard TCP inherently drops packets and suffers large variations in the congestion window size causing large variations in round-trip time. In the case of spurious errors, Standard TCP encounters wide round-trip time variations around the retransmitted packet that was lost due to a spurious error. In both cases, SmoothTCP exhibits better performance with respect to round-trip time variation. Index Terms—congestion control, RTT, spurious errors, TCP performance, SmoothTCP, wireless performance.

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.001
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.663
Threshold uncertainty score0.354

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0020.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.013
GPT teacher head0.246
Teacher spread0.233 · 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