An asymptotic approximation for TCP CUBIC

DOI10.1007/S11134-018-9594-XMaRDI QIDQ2326236zbMATH OpenOpenAlexFDO

Authors Sudheer Poojary, Vinod Sharma

Publication date 7 October 2019

Published in Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic approximationperformance analysishigh-speed TCPTCP CUBIC

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of queueing theory (congestion, allocation, storage, traffic, etc.) (60K30) Internet topics (68M11)

Abstract: In this paper, we derive an expression for computing average window size of a single TCP CUBIC connection under random losses. Throughput expression for TCP CUBIC has been computed earlier under deterministic periodic packet losses. We validate this expression theoretically. We then use insights from the deterministic loss based model to derive an expression for computing average window size of a single TCP CUBIC connection under random losses. For this computation, we first consider the sequence of TCP CUBIC window evolution processes indexed by the drop rate, p and show that with a suitable scaling this sequence converges to a limiting Markov chain as p tends to 0. The stationary distribution of the limiting Markov chain is then used to derive the average window size for small packet error rates. We validate our model and approximations via simulations.

Recommendations

• An asymptotic approximation for TCP compound
• Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
• An extension of the square root law of TCP
• Asymptotic properties of a TCP model with time-outs
• On the higher moments of TCP
• Total variation estimates for the TCP process
• Towards more complete models of TCP latency and throughput

Cites work

• scientific article; zbMATH DE number 4215340 (Why is no real title available?)
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• An asymptotic approximation for TCP compound
• Applied Probability and Queues
• Comparison of TCP Reno and TCP Vegas: efficiency and fairness
• Providing QoS to TCP and real time connections in the Internet
• The existence of moments for stationary Markov chains

Cited in

(2)

• Asymptotic properties of a TCP model with time-outs
• An asymptotic approximation for TCP compound

Describes a project that uses

Uses Software

• CUBIC

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

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