An asymptotic approximation for TCP CUBIC

Sudheer Poojary () and Vinod Sharma ()
Additional contact information
Sudheer Poojary: University of Avignon
Vinod Sharma: Indian Institute of Science

Queueing Systems: Theory and Applications, 2019, vol. 91, issue 1, No 7, 203 pages

Abstract: Abstract In this paper, we derive an expression for computing the average window size of a single TCP CUBIC connection under random losses. For this we consider a throughput expression for TCP CUBIC computed earlier under deterministic periodic packet losses. We validate this expression theoretically. We then use insights from the deterministic loss-based model to scale appropriately a sequence of Markov chains with random losses indexed by the probability of loss p. We show that 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 then use a simple approximation to extend our current results with negligible queuing to a setup with multiple connections and non-negligible queuing. We validate our model and approximations via simulations.

Keywords: TCP CUBIC; High-speed TCP; Asymptotic approximation; Performance analysis; 68M12; 68M11; 60J10; 90B18 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-018-9594-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:91:y:2019:i:1:d:10.1007_s11134-018-9594-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-018-9594-x

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().