MétaCan
Menu
Back to cohort
Record W2163278739 · doi:10.1109/dnsr.2004.1344723

Petri net approach to improving SACK TCP resilience

2004· article· en· W2163278739 on OpenAlexaff
Qiang Ye, M.H. MacGregor

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsSackZeta-TCPTCP global synchronizationTCP accelerationTCP Friendly Rate ControlComputer scienceCompound TCPComputer networkTCP tuningTCP hole punchingCUBIC TCPTCP Westwood plusTCP delayed acknowledgmentTransmission Control ProtocolDistributed computingEngineering

Abstract

fetched live from OpenAlex

The transmission control protocol (TCP) was designed to provide a reliable end-to-end network connection. The most up-to-date TCP version, SACK TCP, was designed to be capable of surviving multiple segment loss. However, it has been found that if too many segments in one transmission window are lost, even if SACK TCP transitions into fast recovery, it is still possible that timeout will finally occur and the performance will be degraded significantly. In this paper we propose a change in TCP that decreases the impact of lost segments by at least 75%. We modeled the improved SACK TCP with Design/CPN and verified formally that this change leaves TCP "correct" in the sense that all states are bounded and the desired final state is always reachable from the initial state.

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: Methods · Consensus signal: none
Teacher disagreement score0.901
Threshold uncertainty score0.418

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.008
GPT teacher head0.203
Teacher spread0.195 · 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
GenreMethods

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

Citations4
Published2004
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207