Joint queue length distribution of multi-class, single-server queues with preemptive priorities

DOI10.1007/S11134-015-9460-ZzbMATH Open1330.60114arXiv1411.3176OpenAlexW1753681538WikidataQ59425628 ScholiaQ59425628MaRDI QIDQ904963FDOQ904963

Authors: Andrei Sleptchenko, Jori Selen, Ivo Adan, G. J. Van Houtum 

Publication date: 14 January 2016

Published in: Queueing Systems (Search for Journal in Brave)

Abstract: In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a multi-dimensional Markov process, where the coordinates keep track of the number of customers of each class in the system. Based on matrix-analytic techniques and probabilistic arguments we develop a recursive method for the exact determination of the equilibrium joint queue length distribution. The method is applied to a spare parts logistics problem to illustrate the effect of setting repair priorities on the performance of the system. We conclude by briefly indicating how the method can be extended to an $M/M/1$ queueing system with non-preemptive priorities between customer classes.

Full work available at URL: https://arxiv.org/abs/1411.3176

Recommendations

• scientific article; zbMATH DE number 1783878
• On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
• AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
• \(M/M/m/k\) queue with preemptive resume and impatience of the prioritized customers
• scientific article; zbMATH DE number 6747326

zbMATH Keywords

matrix-analytic methodequilibrium distributionmulti-dimensional Markov processpreemptive priorities\(\mathrm{M}/\mathrm{M}/1\) queueing system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers
• Multi-server queueing systems with multiple priority classes
• On priority queues with impatient customers
• Optimal inventory modeling of systems. Multi-echelon techniques
• Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue
• On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers
• REDUCING COSTS OF SPARE PARTS SUPPLY SYSTEMS VIA STATIC PRIORITIES
• \(M/M/1\) queue with impatient customers of higher priority
• Computation of Steady-State Probabilities for M/M/1 Priority Queues
• Analysis of a non-preemptive priority multiserver queue
• Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
• Priority queues
• Waiting-Time Distribution of a Multi-Server, Priority Queuing System
• Priority Assignment in Waiting Line Problems
• Title not available (Why is that?)
• AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
• An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
• Multiprocessor systems with preemptive priorities
• On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
• A finite capacity multi-server multi-queueing priority model with non-renewal input
• Title not available (Why is that?)

Cited In (7)

• Double-sided matching queues: priority and impatient customers
• Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
• Time-dependent analysis of an \(\mathrm{M}/\mathrm{M}/c\) preemptive priority system with two priority classes
• Analysis of a two-class queueing system with service times dependent on the presence of a certain class
• Performance evaluation and analysis of a discrete queue system with multiple working vacations and non-preemptive priority
• Analysis of a two-class priority queue with correlated arrivals from another node
• Joint queue-lengths and sojourn-time distributions in a general preemptive feedback queue

This page was built for publication: Joint queue length distribution of multi-class, single-server queues with preemptive priorities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904963)