AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
From MaRDI portal
Publication:4794299
Recommendations
Cites work
- Computation of Steady-State Probabilities for M/M/1 Priority Queues
- Computational probability
- scientific article; zbMATH DE number 1132980 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Operator-geometric stationary distributions for markov chains, with application to queueing models
- Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death processes
- The probabilistic significance of the rate matrix in matrix-geometric invariant vectors
Cited in
(30)- Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue
- Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: age process, sojourn times, and queue lengths
- An eigenvalue approach to analyzing a finite source priority queueing model
- A queueing system with probabilistic joining strategy for priority customers
- Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue
- Exact tail asymptotics in a priority queue -- characterizations of the preemptive model
- Exact tail asymptotics for a discrete-time preemptive priority queue
- A preemptive priority queue with balking
- A matrix-analytic solution for the DBMAP/PH/ 1 priority queue
- Explicit solution for M/M/1 preemptive priority queue
- Analysis of a MAP/PH/1 queue with discretionary priority based on service stages
- Analysis of a nonpreemptive priority queue with SPP arrivals of high class
- Analysis of mean values of a multi-server model with non-preemptive priorities and non-renewal input
- Efficient analysis of the MMAP[\(K\)]/PH[\(K\)]/1 priority queue
- A Nonpreemptive Priority System with Fuzzy Parameters
- scientific article; zbMATH DE number 123379 (Why is no real title available?)
- Computing Steady-State Probabilities of a Nonpreemptive Priority Multiserver Queue
- scientific article; zbMATH DE number 1132980 (Why is no real title available?)
- Discrete‐time analysis of MAP/PH/1 multiclass general preemptive priority queue
- Analysis of a priority queue with phase-type service and failures
- Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes
- A NONPREEMPTIVE PRIORITY MAP/G/1 QUEUE WITH TWO CLASSES OF CUSTOMERS
- The high priority customers' probability generating function of the queue length stationary distribution in the non-preemptive priority model
- Tri-Layered QBD Processes with Boundary Assistance for Service Resources
- Analytic approach to the non-pre-emptive Markovian priority queue
- Exact tail asymptotics in a priority queue -- characterizations of the non-preemptive model
- Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue
- Explicit results for the distributions of queue lengths for a non-preemptive two-level priority queue
- Joint queue length distribution of multi-class, single-server queues with preemptive priorities
- A tandem network with MAP inputs
This page was built for publication: AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4794299)
