An asymptotic approximation for TCP CUBIC
From MaRDI portal
Publication:2326236
DOI10.1007/s11134-018-9594-xzbMath1484.68036arXiv1510.08496OpenAlexW2962967457MaRDI QIDQ2326236
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
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)
Uses Software
Cites Work
- Providing QoS to TCP and real time connections in the Internet
- An asymptotic approximation for TCP compound
- The existence of moments for stationary Markov chains
- A Markovian analysis of additive-increase multiplicative-decrease algorithms
- Applied Probability and Queues
- Comparison of TCP Reno and TCP Vegas: efficiency and fairness
- Unnamed Item
This page was built for publication: An asymptotic approximation for TCP CUBIC