Compound TCP with Random Losses

Abstract

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 delayproducts. 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.

Throughput of TCP over Cognitive Radio Channels

“…Such an approximation has been used before in [23], [24]. Our simulation results below justify the approximations made in this analytical model.…”

Analysis of multiple flows using different high speed TCP protocols on a general network

“…Any packet received can be in error with probability p independent of other packets. This is a realistic assumption for wireless links and is commonly made for TCP models in the literature ( [20], [21], [22], [31], [35], [37], ). We assume that only TCP data packets are lost.…”

“…We can approximate R n as R n ≈ max{∆, Wn µ }. This approximation is quite commonly made [13], [37]. Let R be a random variable with the stationary distribution of {R n }.…”

“…We note that Markovian models for TCP CUBIC and TCP Compound are also developed in [35] and [37]. These papers look at the window sizes at the drop epochs and show that this process forms a discrete time Markov chain.…”

Approximate theoretical models for TCP connections using different high speed congestion control algorithms in a multihop network

“…Models for analysis of TCP CUBIC can be found in [6] and [17] and for TCP Compound in [7] and [18]. In [1] and [2], we developed models for CUBIC and Compound TCP respectively.…”