On the long time behavior of the TCP window size process

DOI10.1016/J.SPA.2010.03.019MaRDI QIDQ983175zbMATHOpenAlexFDO

Authors Djalil Chafaï, Florent Malrieu, Katy Paroux

Publication date 3 August 2010

Published in Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

queueing theorycouplingexponential ergodicitynetwork protocolspiecewise deterministic Markov processesadditive increase-multiplicative decrease processes

Mathematics Subject Classification ID

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

Abstract: The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in $[0,infty)$, is ergodic and irreversible. It belongs to the Additive Increase Multiplicative Decrease class of processes. The sample paths are piecewise linear deterministic and the whole randomness of the dynamics comes from the jump mechanism. Several aspects of this process have already been investigated in the literature. In the present paper, we mainly get quantitative estimates for the convergence to equilibrium, in terms of the $W_1$ Wasserstein coupling distance, for the process and also for its embedded chain.

Recommendations

• Total variation estimates for the TCP process
• On the higher moments of TCP
• Transient Moments of the TCP Window Size Process
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm

Cites work

• scientific article; zbMATH DE number 3901778 (Why is no real title available?)
• scientific article; zbMATH DE number 49698 (Why is no real title available?)
• scientific article; zbMATH DE number 1909499 (Why is no real title available?)
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• A SINGLE CHANNEL ON/OFF MODEL WITH TCP-LIKE CONTROL
• AIMD algorithms and exponential functionals
• An extension of the square root law of TCP
• Concentration inequalities for Euler schemes
• Ergodicity properties of stress release, repairable system and workload models
• Interacting multi-class transmissions in large stochastic networks
• Logarithmic Sobolev Inequalities
• Markov chains and stochastic stability
• On logarithmic Sobolev inequalities. With a preface of Dominique Bakry and Michel Ledoux
• Perpetuities with thin tails
• Rate of convergence for ergodic continuous Markov processes: Lyapunov versus Poincaré
• Stability and Ergodicity of Piecewise Deterministic Markov Processes
• Stability of perpetuities
• TCP and iso-stationary transformations
• TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
• Tail asymptotics for exponential functionals of Lévy processes
• The concentration of measure phenomenon
• Transient Moments of the TCP Window Size Process

Cited in

(34)

• Interval fragmentations with choice: equidistribution and the evolution of tagged fragments
• Quantitative speeds of convergence for exposure to food contaminants
• Exponential ergodicity for stochastic equations of nonnegative processes with jumps
• Limit theorems for some branching measure-valued processes
• Transient Moments of the TCP Window Size Process
• Stochastic stability and stabilization of positive systems with Markovian jump parameters
• Spectral gap for the growth-fragmentation equation via Harris's theorem
• Total variation estimates for the TCP process
• Asynchronous exponential growth of the growth-fragmentation equation with unbounded fragmentation rate
• Some simple but challenging Markov processes
• A nonexpanding transport distance for some structured equations
• A probabilistic view on the long-time behaviour of growth-fragmentation semigroups with bounded fragmentation rates
• Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
• Window-Games between TCP Flows
• Exact simulation of the jump times of a class of piecewise deterministic Markov processes
• Hypocoercive relaxation to equilibrium for some kinetic models
• Periodic asymptotic dynamics of the measure solutions to an equal mitosis equation
• Optimal Markovian coupling and exponential convergence rate for the TCP process
• A non‐conservative Harris ergodic theorem
• A probabilistic look at conservative growth-fragmentation equations
• High-dimensional MCMC with a standard splitting scheme for the underdamped Langevin diffusion
• Optimal stopping for partially observed piecewise-deterministic Markov processes
• Lower bound for the coarse Ricci curvature of continuous-time pure-jump processes
• Long time behavior of telegraph processes under convex potentials
• Stochastic stability analysis and \(L_\infty\)-gain controller design for positive Markov jump systems with time-varying delays
• A bitcoin-inspired infinite-server model with a random fluid limit
• Self-adaptive congestion control for multiclass intermittent connections in a communication network
• Optimal strategies for impulse control of piecewise deterministic Markov processes
• TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
• A probabilistic approach to spectral analysis of growth-fragmentation equations
• Optimal control of partially observable piecewise deterministic Markov processes
• Piecewise deterministic Markov process -- recent results
• Stability of piecewise deterministic Markovian metapopulation processes on networks
• Statistical estimation of jump rates for a piecewise deterministic Markov processes with deterministic increasing motion and jump mechanism

This page was built for publication: On the long time behavior of the TCP window size process

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