AIMD algorithms and exponential functionals
From MaRDI portal
The asymptotic behaviour of a connection transmitting packets into a network according to a general additive-increase multiplicative-decrease (AIMD) algorithm is investigated. The stationary properties of this algorithm are analyzed when the rate of occurrence of clumps (loss of packets) becomes arbitrary small. From a probabilistic point of view, it is shown that exponential functionals associated to compound Poisson processes play a key role. A formula for the fractional moments and some density functions are obtained. Analytically, to derive the explicit expression of the distributions involved, the natural framework of this study turns out to be the q-calculus. Different loss models are then compared using concave ordering. It is shown, quite surprisingly, that for a fixed loss rate, the correlated loss model has higher throughput than an uncorrelated loss one.
Recommendations
- Asymptotic analysis of a nonlinear AIMD algorithm
- scientific article; zbMATH DE number 2152673
- Auxiliary-function minimization algorithms
- Exponentially convergent algorithms for abstract differential equations
- On the AIMD Algorithm Under Saturation Constraints
- A multiplicative Gauss-Newton minimization algorithm: theory and application to exponential functions
- scientific article; zbMATH DE number 3916254
- Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions
- Computing exponential for iterative splitting methods: algorithms and applications
- A family of the functional epsilon algorithms for accelerating convergence
Cites work
- A Markovian analysis of additive-increase multiplicative-decrease algorithms
- Exponential functionals of Brownian motion and related processes
- scientific article; zbMATH DE number 994429 (Why is no real title available?)
- scientific article; zbMATH DE number 2127961 (Why is no real title available?)
- scientific article; zbMATH DE number 3852171 (Why is no real title available?)
- scientific article; zbMATH DE number 3686499 (Why is no real title available?)
- scientific article; zbMATH DE number 194092 (Why is no real title available?)
- scientific article; zbMATH DE number 1231230 (Why is no real title available?)
- scientific article; zbMATH DE number 571346 (Why is no real title available?)
- scientific article; zbMATH DE number 737285 (Why is no real title available?)
- scientific article; zbMATH DE number 1163909 (Why is no real title available?)
- scientific article; zbMATH DE number 206027 (Why is no real title available?)
- scientific article; zbMATH DE number 227027 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- scientific article; zbMATH DE number 3403539 (Why is no real title available?)
- Mellin transforms and asymptotics: Harmonic sums
- On subordinators, self-similar Markov processes and some factorizations of the exponential variable
- Probability approximations via the Poisson clumping heuristic
- Ruin problems with compounding assets
Cited in
(51)- Asymptotic analysis of Lévy-driven tandem queues
- A fluid model for a relay node in an ad hoc network: the case of heavy-tailed input
- Interacting multi-class transmissions in large stochastic networks
- On the minimal travel time needed to collect \(n\) items on a circle.
- On random coefficient INAR(1) processes
- Nonparametric estimation of jump rates for a specific class of piecewise deterministic Markov processes
- Optimal Markovian coupling and exponential convergence rate for the TCP process
- Long-time behavior and Darwinian optimality for an asymmetric size-structured branching process
- TCP and iso-stationary transformations
- Thin tails of fixed points of the nonhomogeneous smoothing transform
- Tail asymptotics for exponential functionals of Lévy processes
- Statistical estimation of jump rates for a piecewise deterministic Markov processes with deterministic increasing motion and jump mechanism
- A multi-class mean-field model with graph structure for TCP flows
- Hitting times and the running maximum of Markovian growth-collapse processes
- Steady state and scaling limit for a traffic congestion model
- Critical Scale for a Continuous AIMD Model
- Rate of convergence for the `square root formula' in the Internet transmission control protocol
- Piecewise deterministic Markov process -- recent results
- TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
- FUNCTIONALS OF BROWNIAN BRIDGES ARISING IN THE CURRENT MISMATCH IN D/A CONVERTERS
- On the Dependence Structure of Gaussian Queues
- On the higher moments of TCP
- Self-adaptive congestion control for multiclass intermittent connections in a communication network
- A scaling analysis of a cat and mouse Markov chain
- Deterministic and stochastic convergence properties of AIMD algorithms with nonlinear back-off functions
- Iterated random functions and regularly varying tails
- A Lévy input fluid queue with input and workload regulation
- Limit theorems for some branching measure-valued processes
- A Markov-modulated growth collapse model
- DES and RES processes and their explicit solutions
- Fractional moments of solutions to stochastic recurrence equations
- Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm
- Transient Moments of the TCP Window Size Process
- A Lévy input model with additional state-dependent services
- A bitcoin-inspired infinite-server model with a random fluid limit
- Variability and singularity arising from a piecewise-deterministic Markov process applied to model poor patient compliance in the multi-IV case
- Unified approach for solving exit problems for additive-increase and multiplicative-decrease processes
- Some simple but challenging Markov processes
- A survey on performance analysis of warehouse carousel systems
- Precise asymptotics for the density and the upper tail of exponential functionals of subordinators
- Partial versus total resetting for Lévy flights in d dimensions: similarities and discrepancies
- Stochastic chemical reaction networks with discontinuous limits and AIMD processes
- Quasi-stationary distributions and Yaglom limits of self-similar Markov processes
- Recent developments in exponential functionals of Lévy processes
- Asymptotic behavior of generalized processor sharing queues under subexponential assumptions
- An extension of the square root law of TCP
- Statistical inference for generalized Ornstein-Uhlenbeck processes
- Iterated random functions and slowly varying tails
- On the relation between the AINV and the FAPINV algorithms
- A new formula for some linear stochastic equations with applications
- On the long time behavior of the TCP window size process
This page was built for publication: AIMD algorithms and exponential functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1431551)
