MétaCan
Menu
Back to cohort
Record W2118117953 · doi:10.1109/pacrim.1997.620374

End-to-end acknowledgments for indirect TCP over wireless internetworks

2002· article· en· W2118117953 on OpenAlexaff
Victor Chim, Victor C. M. Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsZeta-TCPComputer networkTCP accelerationComputer scienceTCP global synchronizationTCP hole punchingTCP Friendly Rate ControlTCP tuningTCP WestwoodCompound TCPTransmission Control ProtocolNetwork packet

Abstract

fetched live from OpenAlex

The Internet today is evolved from traditional networks made up of fixed hosts and links. Consequently, protocols for Internet communications, such as TCP, are designed to perform well over fixed networks. The next generation Internet will likely incorporate wireless links and mobile hosts. Characteristics of wireless networks such as higher bit error rates and host mobility result in degraded end-to-end TCP performance. Indirect TCP (I-TCP) has been proposed as an alternative to end-to-end TCP to improve performance. However, the protocol violates the end-to-end semantics of TCP acknowledgments. We propose a modification to I-TCP to maintain the end-to-end semantics, by delaying acknowledgments to the sender until correct reception of the corresponding data at the end host TCP receiver is verified. Preliminary simulation results indicate that our modified I-TCP with end-to-end acknowledgments does not compromise the performance gain obtained by I-TCP. Rather, a slight performance increase is seen at low bit error rates.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.958
Threshold uncertainty score1.000

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.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.001

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.021
GPT teacher head0.238
Teacher spread0.217 · 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.

Study designOther design
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

Citations3
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207