Analysis of a finite buffer model with two servers and two nonpreemptive priority classes
AbstractIn 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 192 (2009)
Issue (Month): 1 (January)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Two-class and two-server queueing model Nonpreemptive priority Waiting time Steady-state distribution Blocking probability;
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Feng, Wei & Adachi, Kouichi & Kowada, Masashi, 2002. "A two-queue and two-server model with a threshold-based control service policy," European Journal of Operational Research, Elsevier, vol. 137(3), pages 593-611, March.
- Wagner, Dietmar, 1997. "Waiting times of a finite-capacity multi-server model with non-preemptive priorities," European Journal of Operational Research, Elsevier, vol. 102(1), pages 227-241, October.
- Walraevens, Joris & Maertens, Tom & Bruneel, Herwig, 2013. "A semi-preemptive priority scheduling discipline: Performance analysis," European Journal of Operational Research, Elsevier, vol. 224(2), pages 324-332.
- Bruneel, Herwig & Maertens, Tom & Walraevens, Joris, 2014. "Class clustering destroys delay differentiation in priority queues," European Journal of Operational Research, Elsevier, vol. 235(1), pages 149-158.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.