Time-dependent analysis of an M/M/c preemptive priority system with two priority classes
From MaRDI portal
Publication:1688936
Abstract: We analyze the time-dependent behavior of an priority queue having two customer classes, class-dependent service rates, and preemptive priority between classes. More particularly, we develop a method that determines the Laplace transforms of the transition functions when the system is initially empty. The Laplace transforms corresponding to states with at least high-priority customers are expressed explicitly in terms of the Laplace transforms corresponding to states with at most high-priority customers. We then show how to compute the remaining Laplace transforms recursively, by making use of a variant of Ramaswami's formula from the theory of -type Markov processes. While the primary focus of our work is on deriving Laplace transforms of transition functions, analogous results can be derived for the stationary distribution: these results seem to yield the most explicit expressions known to date.
Recommendations
- M/M/c queue with two priority classes
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- The time-dependent problem for a queue with preemptive priorities
- On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers
- Interdeparture times from a queuing system with preemptive resume priority
Cites work
- M/M/c queue with two priority classes
- A Combinatorial Method in the Theory of Queues
- A comparative analysis of the successive lumping and the lattice path counting algorithms
- A new look at Markov processes of \(\mathrm{G}/\mathrm{M}/1\)-type
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- A unified framework for numerically inverting Laplace transforms
- An exact solution for the state probabilities of the multi-class, multi-server queue with preemptive priorities
- Clearing analysis on phases: exact limiting probabilities for skip-free, unidirectional, quasi-birth-death processes
- Computation of Steady-State Probabilities for M/M/1 Priority Queues
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- scientific article; zbMATH DE number 3493681 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Integer sequences from queueing theory
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Joint queue length distribution of multi-class, single-server queues with preemptive priorities
- Multi-server queueing systems with multiple priority classes
- Numerical Inversion of Laplace Transforms of Probability Distributions
- NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE
- On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
- Preemptive Resume Priority Queue
- Priority Assignment in Waiting Line Problems
- Priority queues
- Solving probability transform functional equations for numerical inversion
- Some new insights into Kolmogorov's criterion, with applications to hysteretic queues
- Transient Behavior of the M/G/1 Workload Process
- Waiting-Time Distribution of a Multi-Server, Priority Queuing System
- When are two Markov chains similar?
Cited in
(14)- Two-class priority queueing system with state-dependent arrivals
- A new look at a smart polling model
- On the two-class M/M/1 system under preemptive resume and impatience of the prioritized customers
- Double-sided matching queues: priority and impatient customers
- Unified and refined analysis of the response time and waiting time in the \(\mathrm{M}/\mathrm{M}/m\) FCFS preemptive-resume priority queue
- Analysis of \(M/M/1\) queueing system with two priority classes
- Analysis of a Markovian queue with customer interjections and finite buffer
- M/M/c queue with two priority classes
- Waiting Times in the Non-Preemptive Priority M/M/c Queue
- The time-dependent problem for a queue with preemptive priorities
- ON THE TIME-DEPENDENT BEHAVIOR OF A MARKOVIAN REENTRANT-LINE MODEL
- Low priority customer behavior analysis of an \(\mathrm{M}/\mathrm{G}/1\) model with no preemptive priority
- On the time-dependent behavior of preemptive single-server queueing systems with Poisson arrivals
- Transient analysis of the M/M/K/ +M queue
This page was built for publication: Time-dependent analysis of an \(\mathrm{M}/\mathrm{M}/c\) preemptive priority system with two priority classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688936)
