MétaCan
Menu
Back to cohort
Record W2154513820

TCP with Adaptive Delay and Loss Response for Heterogeneous Networks

2009· article· en· W2154513820 on OpenAlexaff
Modupe Omueti, Ljiljana Trajković

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNetwork Traffic and Congestion Control
Canadian institutionsSimon Fraser University
Fundersnot available
KeywordsTCP global synchronizationTCP Friendly Rate ControlTCP accelerationTCP Westwood plusZeta-TCPComputer scienceComputer networkCUBIC TCPCompound TCPTCP tuningTCP WestwoodH-TCPTransmission Control Protocol
DOInot available

Abstract

fetched live from OpenAlex

Long propagation delays and high bit error rates in heterogeneous networks with geostationary earth orbit (GEO) satellite links have negative impact on the performance of Transmission Control Protocol (TCP). In this paper, we propose modifications to TCP by introducing adaptive delay and loss response (TCP-ADaLR) to mitigate the adverse effects of satellite link characteristics. The proposed modifications incorporate delayed acknowledgment (ACK) recommended for Internet hosts. TCP-ADaLR introduces adaptive window increase and loss recovery mechanisms to address TCP performance degradation in satellite networks. We evaluate and compare the performance of TCP-ADaLR, TCP SACK, and TCP NewReno, with delayed ACK enabled and disabled. In the absence of losses, TCP-ADaLR exhibits the shortest user-perceived latency for HTTP and FTP applications. In the presence of only congestion losses, TCP-ADaLR shows comparable performance to TCP SACK and TCP NewReno. In the presence of only error losses, TCP-ADaLR exhibits improvements up to 61 % and 76 % in throughput and utilization, respectively. In the presence of both congestion and error losses, TCP-ADaLR exhibits goodput and throughput improvements up to 43%. TCP-ADaLR exhibits the best performance in the absence of losses and in the presence of losses due to both congestion and errors. It also friendly to TCP NewReno, exhibits better fairness, and maintains TCP end-to-end semantics.

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.937
Threshold uncertainty score0.340

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.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.008
GPT teacher head0.209
Teacher spread0.201 · 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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicNetwork Traffic and Congestion ControlFrench-language works237,207