State-dependent M/G/1 type queueing analysis for congestion control in data networks
We study 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. The distribution of the transmission rate in steady state as well as its moments are determined. Our model is particularly useful to study the behavior of TCP, the congestion control mechanism in the Internet. Burstiness of packet losses is captured by allowing congestion signals to arrive in batches. 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.
|Queueing theory (msc 60K25), Performance evaluation; queueing; scheduling (msc 68M20), Communication networks (msc 90B18), Queues and service (msc 90B22)|
|Logistics (theme 3), Energy (theme 4)|
|CWI. Probability, Networks and Algorithms [PNA]|
Altman, E, Avrachenkov, K, Barakat, C, & Núñez Queija, R. (2000). State-dependent M/G/1 type queueing analysis for congestion control in data networks. CWI. Probability, Networks and Algorithms [PNA]. CWI.