An asymptotic approximation for TCP compound

DOI10.1007/S11134-016-9509-7zbMATH Open1409.68062arXiv1511.01344OpenAlexW2199607649MaRDI QIDQ2397972FDOQ2397972

Vinod Sharma, Sudheer Poojary

Publication date: 14 August 2017

Published in: Queueing Systems (Search for Journal in Brave)

Abstract: In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the window sizes are continuous, i.e., a fluid behaviour is assumed. We validate this model theoretically. We show that under the deterministic loss model, the TCP window evolution for TCP Compound is periodic and is independent of the initial window size. We then consider the case when packets are lost randomly and independently of each other. We discuss Markov chain models to analyze performance of TCP in this scenario. We use insights from the deterministic loss model to get an appropriate scaling for the window size process and show that these scaled processes, indexed by p, the packet error rate, converge to a limit Markov chain process as p goes to 0. We show the existence and uniqueness of the stationary distribution for this limit process. Using the stationary distribution for the limit process, we obtain approximations for throughput, under random losses, for TCP Compound when packet error rates are small. We compare our results with ns2 simulations which show a good match.

Full work available at URL: https://arxiv.org/abs/1511.01344

zbMATH Keywords

asymptotic approximationperformance analysishigh-speed TCPTCP compound

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Applied Probability and Queues
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• Modelling TCP congestion control dynamics in drop-tail environments
• The existence of moments for stationary Markov chains
• Measure theory and probability theory.
• Stability and analysis of TCP connections with RED control and exogenous traffic

Cited In (4)

• An asymptotic approximation for TCP CUBIC
• Asymptotic properties of a TCP model with time-outs
• On the second eigenvalue of matrices associated with TCP
• Towards more complete models of TCP latency and throughput

Uses Software

• CUBIC

   Recommendations

• An asymptotic approximation for TCP CUBIC 👍 👎
• Asymptotic properties of a TCP model with time-outs 👍 👎
• Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm 👍 👎
• Towards more complete models of TCP latency and throughput 👍 👎
• TCP in presence of bursty losses 👍 👎

This page was built for publication: An asymptotic approximation for TCP compound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397972)