1 results
On the settling time of the congested GI/G/1 queue
-
- Journal:
- Advances in Applied Probability / Volume 22 / Issue 4 / December 1990
- Published online by Cambridge University Press:
- 01 July 2016, pp. 929-956
- Print publication:
- December 1990
-
- Article
- Export citation
-
We analyze a stable GI/G/1 queue that starts operating at time t = 0 with N0 ≠ 0 customers. First, we analyze the time
required for this queue to empty for the first time. Under the assumption that both the interarrival and the service time distributions are of the exponential type, we prove that 
, where λ and μ are the arrival and the service rates. Furthermore, assuming in addition that the interarrival time distribution is of the non-lattice type, we show that the settling time of the queue is essentially equal to N0/(μ –λ); that is, we prove that
where 
is the total variation distance between the distribution of the number of customers in the system at time t and its steady-state distribution. Finally, we show that there is a similarity between the queue we analyze and a simple fluid model.
required for this queue to empty for the first time. Under the assumption that both the interarrival and the service time distributions are of the exponential type, we prove that 
, where 
is the total variation distance between the distribution of the number of customers in the system at time 