Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
From MaRDI portal
Publication:5440635
DOI10.1239/jap/1189717533zbMath1233.60016arXivmath/0608476OpenAlexW2169810579MaRDI QIDQ5440635
Publication date: 5 February 2008
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0608476
Central limit and other weak theorems (60F05) Stationary stochastic processes (60G10) Discrete-time Markov processes on general state spaces (60J05) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10)
Related Items (8)
TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM ⋮ Hitting Times and the Running Maximum of Markovian Growth-Collapse Processes ⋮ A Bitcoin-inspired infinite-server model with a random fluid limit ⋮ TCP and iso-stationary transformations ⋮ Some simple but challenging Markov processes ⋮ Steady state and scaling limit for a traffic congestion model ⋮ STOCHASTICALLY SCALABLE FLOW CONTROL ⋮ Rate of convergence for the `square root formula' in the Internet transmission control protocol
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modelling and performance evaluation methodology. Proceedings of the International Seminar, Paris, France, January 24-26, 1983. (INRIA)
- Weak limit theorems for stochastic integrals and stochastic differential equations
- AIMD algorithms and exponential functionals
- Analysis of AIMD protocols over paths with variable delay
- Analysis of MIMD congestion control algorithm for high speed networks
- Rate of convergence for the `square root formula' in the Internet transmission control protocol
- TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
- STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION
- A Markovian analysis of additive-increase multiplicative-decrease algorithms
This page was built for publication: Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
