State-dependent M/G/1 type queueing analysis for congestion control in data networks

We study in this paper a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poisson process. We focus on the case when the transmission rate cannot exceed a certain maximum value. We write the Kolmogorov equations and we use Laplace transforms to calculate the distribution of the transmission rate in the steady state as well as its moments. Our model is particularly useful to study the behavior of TCP, the congestion control mechanism in the Internet. By a simple transformation, the problem can be reformulated in terms of an equivalent M/G/1 queue, where the transmission rate in the original model corresponds to the workload in the 'dual' queue. The service times in the queueing model are not i.i.d., and they depend on the workload in the system.

[1]  Charles Knessl,et al.  Asymptotic analysis of a state dependent M/G/1 queueing system , 1985 .

[2]  W. D. Ray,et al.  Stochastic Models: An Algorithmic Approach , 1995 .

[3]  Archan Misra,et al.  The window distribution of multiple TCPs with random loss queues , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[4]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[5]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[6]  Donald F. Towsley,et al.  A quantitative study of differentiated services for the Internet , 2000, Journal of Communications and Networks.

[7]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[8]  SemkeJeffrey,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .

[9]  V. M. Abramov.  Investigation of a queueing system with service depending on queue-length , 1991 .

[10]  Fred Baker,et al.  Assured Forwarding PHB Group , 1999, RFC.

[11]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[12]  C. Knessl,et al.  A queueing system with queue length dependent service times, with applications to cell discarding in ATM networks , 1999 .

[13]  Eitan Altman,et al.  TCP in presence of bursty losses , 2000, SIGMETRICS '00.

[14]  Matthew Mathis,et al.  The stationary behavior of ideal TCP congestion avoidance , 1996 .

[15]  Shun-Chen Niu.  ON QUEUES WITH DEPENDENT INTERARRIVAL AND SERVICE TIMES , 1981 .

[16]  C. Knessl,et al.  A state-dependent GI/G/1 queue , 1994 .

[17]  C. Knessl,et al.  Asymptotic analysis of a state-dependent M / G /1 queueing system , 1986 .

[18]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[19]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[20]  M. Posner,et al.  Single-Server Queues with Service Time Dependent on Waiting Time , 1973, Oper. Res..