Performance analysis of AIMD mechanisms over a multi-state Markovian path
DOI10.1016/J.COMNET.2004.07.014zbMATH Open1101.68307OpenAlexW2010993886MaRDI QIDQ707155FDOQ707155
Authors: Eitan Altman, Konstantin Avrachenkov, Chadi Barakat, Parijat Dube 
Publication date: 9 February 2005
Published in: Computer Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comnet.2004.07.014
Recommendations
- Analysis of AIMD protocols over paths with variable delay
- Stochastic Equilibria of AIMD Communication Networks
- A unified approach to Markov decision problems and performance sensitivity analysis with discounted and average criteria: multichain cases
- A unified approach to Markov decision problems and performance sensitivity analysis
- AIMD dynamics and distributed resource allocation
- An ergodic AIMD algorithm with application to high-speed networks
- Nonhomogeneous place-dependent Markov chains, unsynchronised AIMD, and optimisation
- scientific article; zbMATH DE number 19238
- Guaranteed performance regions in Markovian systems with competing decision makers
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cited In (6)
- Mean field convergence of a model of multiple TCP connections through a buffer implementing RED
- A Markovian analysis of additive-increase multiplicative-decrease algorithms
- On the performance of additive increase multiplicative decrease (AIMD) protocols in hybrid space-terrestrial networks
- On the properties of an additive increase rate accelerator
- Analysis of AIMD protocols over paths with variable delay
- On the higher moments of TCP
This page was built for publication: Performance analysis of AIMD mechanisms over a multi-state Markovian path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707155)
