A Markovian analysis of additive-increase multiplicative-decrease algorithms

Advances in Applied Probability

Volumn 34, Issue 1, 2002, Pages 85-111

  Dumas, Vincent ^a   Guillemin, Fabrice ^a   Robert, Philippe ^a  

^a INRIA   (France)

Author keywords

Autoregressive processes; Convergence of invariant probabilities; Hitting times; Network protocols; TCP

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); NETWORK PROTOCOLS; PROBABILITY; REGRESSION ANALYSIS; TELECOMMUNICATION NETWORKS;

AUTOREGRESSIVE PROCESSES; CONGESTION AVOIDANCE;

MARKOV PROCESSES;

EID: 0036508747     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1019160951     Document Type: Article

References (26)

1. TCP congestion control
2. A stochastic model of TCP/IP with stationary random losses
3. State-dependent M/G/1 type queueing analysis for congestion control in data networks
4. TCP is max-plus linear
5. Resource sharing of TCP connections with different round trip times
6. Limit results for Markovian models of TCP
7. Connections with multiple congested gateways in packet-switched networks, Part 1: One way traffic
8. Congestion avoidance and control
9. Mathematical modeling of the Internet
10. TCP-friendly unicast rate-based flow control
11. Modeling TCP throughput: A simple model and its empirical validation
12. Bandwidth sharing and admission control for elastic traffic
13. Some observations on equation-based rate control
14. Global fairness of additive-increase and mutliplicative-decrease with heteregeneous round trip times