MétaCan
Menu
Back to cohort
Record W1986476690 · doi:10.1145/1185373.1185423

Proactively controlling round-trip time variation and packet drops using SmoothTCP-q

2006· article· en· W1986476690 on OpenAlexaff
Elvis M. Vieira, Michael Bauer

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsWestern University
Fundersnot available
KeywordsComputer networkComputer scienceTCP global synchronizationInternet Control Message ProtocolRouterNetwork packetQuality of serviceNetwork congestionReal-time computing

Abstract

fetched live from OpenAlex

Packet drops are the primary means of signalling congestion in TCP. However, packet drops have a great impact on round-trip time (RTT) variation of TCP applications. A different and more proactive approach is used by SmoothTCP-q, where ICMP-SQ messages are sent directly to the sender every time a threshold is reached in the queue size of the router. In this mechanism, SmoothTCP-q tries to avoid packet drops since it is not necessary to overload the router queue to discover the network bandwidth as Standard TCP does. As a result, SmoothTCP-q generally presents better quality of service characteristics in terms of RTT variation and packet drops when compared to TCP. In this paper we describe SmoothTCP-q and illustrate its main characteristics related to this proactive property.

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

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.001
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.007
GPT teacher head0.192
Teacher spread0.185 · 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 teacher head, 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

Citations2
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207