

Author: Kazimirsky Arseniy
Publisher: Taylor & Francis Ltd
ISSN: 0736-2994
Source: Stochastic Analysis and Applications, Vol.24, Iss.4, 2006-01, pp. : 703-718
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this article, we study BMAP / G /1 queue with service time distribution depending on number of processed items. This type of queue models the systems with the possibility of preliminary service. For the considered system, an efficient algorithm for calculating the stationary queue length distribution is proposed, and Laplace-Stieltjes transform of the sojourn time is derived. Little's law is proved. An optimization problem is considered.
Related content




Asymptotics in the MAP/G/1 Queue with Critical Load
By Kim Jeongsim
Stochastic Analysis and Applications, Vol. 28, Iss. 1, 2010-01 ,pp. :




Analysis of the GI/Geo/1 Queue with Disasters
Stochastic Analysis and Applications, Vol. 28, Iss. 1, 2010-01 ,pp. :