Skip to Main content Skip to Navigation
Reports

Compound TCP with Random Losses

Abstract : We analyze the performance of a single, long-lived, Compound TCP (CTCP) connection in the presence of random packet losses. CTCP is a new version of TCP implemented in Microsoft Windows to improve the performance on networks with large bandwidth delay-products. We derive a Markovian model for the CTCP sending window and compute the steady state distribution of the window and the average throughput of a CTCP connection. We observe that the previous approximation, using a ``typical cycle", underestimates the average window and its variance while the Markovian model gives more accurate results. We use our model to compare CTCP and TCP Reno. We notice that CTCP gives always a throughput equal or greater than Reno, while relative performance in terms of jitter depends on the specific network scenario: CTCP generates more jitter for moderate-high drop rate values, while the opposite is true for low drop rate values.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00346050
Contributor : Giovanni Neglia Connect in order to contact the contributor
Submitted on : Monday, January 5, 2009 - 5:10:18 PM
Last modification on : Tuesday, February 2, 2021 - 2:26:02 PM
Long-term archiving on: : Saturday, November 26, 2016 - 4:28:27 AM

File

RR6736.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00346050, version 2

Collections

Citation

Alberto Blanc, Konstantin Avrachenkov, Denis Collange, Giovanni Neglia. Compound TCP with Random Losses. [Research Report] RR-6736, INRIA. 2008. ⟨inria-00346050v2⟩

Share

Metrics

Record views

555

Files downloads

448