An exact analysis of the multi-class M/M/k priority queue with partial blocking

Andrei Sleptchenko, Aart van Harten, Matthijs C. van der Heijden

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)

Abstract

We consider a multi‐server queuing model with two priority classes that consist of multiple customer types. The customers belonging to one priority class customers are lost if they cannot be served immediately upon arrival. Each customer type has its own Poisson arrival and exponential service rate. We derive an exact method to calculate the steady state probabilities for both preemptive and nonpreemptive priority disciplines. Based on these probabilities, we can derive exact expressions for a wide range of relevant performance characteristics for each customer type, such as the moments of the number of customers in the queue and in the system, the expected postponement time and the blocking probability. We illustrate our method with some numerical examples
Original languageEnglish
Pages (from-to)527-548
Number of pages22
JournalStochastic models
Volume19
Issue number4
DOIs
Publication statusPublished - 2003

Keywords

  • IR-81242
  • METIS-207193
  • Priority queues
  • Loss systems
  • Multi‐class
  • Markov Processes

Fingerprint Dive into the research topics of 'An exact analysis of the multi-class M/M/k priority queue with partial blocking'. Together they form a unique fingerprint.

Cite this