MétaCan
Menu
Back to cohort
Record W1948139703 · doi:10.1109/icc.1999.767954

Improving end-to-end performance of TCP using link-layer retransmissions over mobile internetworks

2003· article· en· W1948139703 on OpenAlexaff
Jensen Wong, Victor C. M. Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer networkComputer scienceTCP accelerationDatagramZeta-TCPTCP global synchronizationTCP tuningLink layerTCP Westwood plusTCP WestwoodTCP Friendly Rate ControlData link layerCUBIC TCPTransmission Control ProtocolNetwork packetWirelessPhysical layerOperating system

Abstract

fetched live from OpenAlex

TCP does not perform well in networks with high packet error rates, such as those with wireless links, since TCP assumes network congestion to be the major cause for packet losses. Wireless losses make TCP unnecessarily initiate its congestion control mechanism which results in poor performance in the form of low throughput and high interactive delay. We investigate, through computer simulations, the end-to-end effects of link-layer retransmissions on TCP Reno over a low-data-rate wireless link. Our results show that, by using the more effective selective-reject ARQ at the link layer, the problem of competitive retransmissions between TCP and link layer is much less serious than previously reported. We show that a non-sequencing link layer in combination with fragmentations of datagrams at the base stations and mobile hosts can be employed without significantly degrading TCP performance. We propose link-layer modifications for best-effort retransmissions to reduce possible adverse effect of link-layer resets on TCP.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.010
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.002
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0010.001
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.014
GPT teacher head0.240
Teacher spread0.226 · 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 source (direct Gemma or distilled Codex), 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

Citations45
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207