Related papers: Total variation estimates for the TCP process
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.…
In this paper, we derive an approximation for throughput of TCP Compound connections under random losses. Throughput expressions for TCP Compound under a deterministic loss model exist in the literature. These are obtained assuming the…
We study a Markov process with two components: the first component evolves according to one of finitely many underlying Markovian dynamics, with a choice of dynamics that changes at the jump times of the second component. The second…
The convergence rate in Wasserstein distance is estimated for empirical measures of ergodic Markov processes, and the estimate can be sharp in some specific situations. The main result is applied to subordinations of typical models excluded…
We present a framework for obtaining explicit bounds on the rate of convergence to equilibrium of a Markov chain on a general state space, with respect to both total variation and Wasserstein distances. For Wasserstein bounds, our main tool…
Convergence rate to the stationary distribution for continuous-time Markov processes can be studied using Lyapunov functions. Recent work by the author provided explicit rates of convergence in special case of a reflected jump-diffusion on…
Motivated by stability questions on piecewise deterministic Markov models of bacterial chemotaxis, we study the long time behavior of a variant of the classic telegraph process having a non-constant jump rate that induces a drift towards…
Let $X:=(X_t)_{t\geq 0}$ be an ergodic Markov process on $\real^d$, and $p>0$. We derive upper bounds of the $p$-Wasserstein distance between the invariant measure and the empirical measures of the Markov process $X$. For this we assume,…
We consider a one-dimensional stationary time series of fixed duration $T$. We investigate the time $t_{\rm m}$ at which the process reaches the global maximum within the time interval $[0,T]$. By using a path-decomposition technique, we…
In this paper, we derive an expression for computing average window size of a single TCP CUBIC connection under random losses. Throughput expression for TCP CUBIC has been computed earlier under deterministic periodic packet losses. We…
We study the approximation of a (finite) continuous-time Markov chain by a Markov chain on a reduced state space, and we provide formal error bounds for the approximated transient distributions in the Wasserstein distance. These bounds…
It is common practice to treat small jumps of L\'evy processes as Wiener noise and thus to approximate its marginals by a Gaussian distribution. However, results that allow to quantify the goodness of this approximation according to a given…
We obtain universal estimates on the convergence to equilibrium and the times of coupling for continuous time irreducible reversible finite-state Markov chains, both in the total variation and in the L^2 norms. The estimates in total…
In this work, we are concerned with existence and uniqueness of invariant measures for path-dependent random diffusions and their time discretizations. The random diffusion here means a diffusion process living in a random environment…
We estimate the distance in total variation between the law of a finite state Markov process at time t, starting from a given initial measure, and its unique invariant measure. We derive upper bounds for the time to reach the equilibrium.…
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as observables) is defined. When dealing with sampled traffic,…
The present report deals with the modeling of the long-term throughput, a.k.a., send rate, of the Transmission Control Protocol (TCP) under the following assumptions. (i) We consider a single 'infinite source' using a network path from…
This work is devoted to the Lipschitz contraction and the long time behavior of certain Markov processes. These processes diffuse and jump. They can represent some natural phenomena like size of cell or data transmission over the Internet.…
We study the long-time behavior of variants of the telegraph process with position-dependent jump-rates, which result in a monotone gradient-like drift toward the origin. We compute their invariant laws and obtain, via probabilistic…
We establish exact rates of convergence in the $p$-Wasserstein distance for the empirical measure of a class of non-symmetric jump processes, which are subordinated to a diffusion process on a compact Riemannian manifold. For the quadratic…