On stochastic decomposition in the GI/M/1 queue with single exponential vacation

On stochastic decomposition in the GI/M/1 queue with single exponential vacation

0.00 Avg rating0 Votes
Article ID: iaor20073142
Country: Netherlands
Volume: 34
Issue: 6
Start Page Number: 706
End Page Number: 712
Publication Date: Nov 2006
Journal: Operations Research Letters
Authors: , ,
Keywords: stochastic processes
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.

Reviews

Required fields are marked *. Your email address will not be published.