Article ID Journal Published Year Pages File Type
1143276 Operations Research Letters 2006 7 Pages PDF
Abstract

We consider a GI/M/1 queueing system in which the server takes exactly one exponential vacation each time the system empties. We derive the PGF of the stationary queue length and the LST of the stationary FIFO sojourn time. We show that both the queue length and the sojourn time can be stochastically decomposed into meaningful quantities.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
On stochastic decomposition in the GI/M/1 queue with single exponential vacation
Authors
, , ,