Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm

DOI10.1239/JAP/1189717533MaRDI QIDQ5440635zbMATH OpenOpenAlexFDO

Authors Teunis J. Ott, Jason Swanson

Publication date 5 February 2008

Published in Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

congestion avoidancestationary distributionstochastic differential equationTCP/IPWeak convergence

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Stationary stochastic processes (60G10) Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Discrete-time Markov processes on general state spaces (60J05)

Abstract: The Transmission Control Protocol (TCP) is a Transport Protocol used in the Internet. Ott has introduced a more general class of candidate Transport Protocols called "protocols in the TCP Paradigm". The long run objective of studying this larger class is to find protocols with promising performance characteristics. This paper studies Markov chain models derived from protocols in the TCP Paradigm. Protocols in the TCP Paradigm, as TCP, protect the network from congestion by reducing the "Congestion Window" (the amount of data allowed to be sent but not yet acknowledged) when there is packet loss or packet marking, and increasing it when there is no loss. When loss of different packets are assumed to be independent events and the probability p of loss is assumed to be constant, the protocol gives rise to a Markov chain {W_n}, where W_n is the size of the congestion window after the transmission of the n-th packet. For a wide class of such Markov chains, we prove weak convergence results, after appropriate rescaling of time and space, as p tends to 0. The limiting processes are defined by stochastic differential equations. Depending on certain parameter values, the stochastic differential equation can define an Ornstein-Uhlenbeck process or can be driven by a Poisson process.

Recommendations

• Asymptotic properties of a TCP model with time-outs
• On the higher moments of TCP
• TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
• On the long time behavior of the TCP window size process
• TCP and iso-stationary transformations

Cites work

• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• AIMD algorithms and exponential functionals
• Analysis of AIMD protocols over paths with variable delay
• Analysis of MIMD congestion control algorithm for high speed networks
• scientific article; zbMATH DE number 2088566 (Why is no real title available?)
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 2006037 (Why is no real title available?)
• Modelling and performance evaluation methodology. Proceedings of the International Seminar, Paris, France, January 24-26, 1983. (INRIA)
• Rate of convergence for the `square root formula' in the Internet transmission control protocol
• STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION
• TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
• Weak limit theorems for stochastic integrals and stochastic differential equations

Cited in

(25)

• Stochastic convex ordering for multiplicative decrease internet congestion control
• Delay-based TCP congestion avoidance: A network calculus interpretation and performance improvements
• Harris ergodicity of a split transmission control protocol
• TCP and iso-stationary transformations
• An asymptotic approximation for TCP CUBIC
• Asymptotic properties of a TCP model with time-outs
• An asymptotic approximation for TCP compound
• Hitting times and the running maximum of Markovian growth-collapse processes
• Steady state and scaling limit for a traffic congestion model
• Rate of convergence for the `square root formula' in the Internet transmission control protocol
• TRANSIENT BEHAVIOR OF PROCESSES IN THE TCP PARADIGM
• On the fractal behavior of {TCP}
• STOCHASTICALLY SCALABLE FLOW CONTROL
• On the higher moments of TCP
• Self-adaptive congestion control for multiclass intermittent connections in a communication network
• STOCHASTIC DIFFERENTIAL EQUATION FOR TCP WINDOW SIZE: ANALYSIS AND EXPERIMENTAL VALIDATION
• A Markovian analysis of additive-increase multiplicative-decrease algorithms
• An average queue‐length‐difference–based congestion detection algorithm in TCP/AQM network
• Modeling window based congestion control protocols with many flows
• A SINGLE CHANNEL ON/OFF MODEL WITH TCP-LIKE CONTROL
• A bitcoin-inspired infinite-server model with a random fluid limit
• Some simple but challenging Markov processes
• An extension of the square root law of TCP
• HTTP turbulence
• On the long time behavior of the TCP window size process

This page was built for publication: Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm

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