TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
From MaRDI portal
Publication:3521213
DOI10.1017/S0269964808000259zbMath1151.68328MaRDI QIDQ3521213
Teunis J. Ott, Johannes H. B. Kemperman
Publication date: 21 August 2008
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network protocols (68M12)
Related Items (6)
Hitting Times and the Running Maximum of Markovian Growth-Collapse Processes ⋮ TCP and iso-stationary transformations ⋮ On the long time behavior of the TCP window size process ⋮ Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm ⋮ Some simple but challenging Markov processes ⋮ Transient Moments of the TCP Window Size Process
Cites Work
- AIMD algorithms and exponential functionals
- Rate of convergence for the `square root formula' in the Internet transmission control protocol
- STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION
- A Markovian analysis of additive-increase multiplicative-decrease algorithms
- Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
This page was built for publication: TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
