Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
复制标题
DOI:
10.1016/j.ejor.2007.09.021
复制
发表时间:
2009
期刊:
影响因子:
--
通讯作者:
W. Feng;Masataka Umemura
中科院分区:
文献类型:
--
作者:
W. Feng;Masataka Umemura
In this paper, we analyze a finite buffer queueing model with two servers and two nonpreemptive priority service classes. The arrival streams are independent Poisson processes, and the service times of the two classes are exponentially distributed with different means. One of the two servers is reserved exclusively for one class with high priority and the other server serves the two classes according to a nonpreemptive priority service schedule. For the model, we describe its dynamic behavior by a four-dimensional continuous-time Markov process. Applying recursive approaches we present the explicit representation for the steady-state distribution of this Markov process. Then, we calculate the Laplace–Stieltjes Transform and the steady-state distribution of the actual waiting times of two classes of customers. We also give some numerical comparison results with other queueing models.