The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline
From MaRDI portal
Publication:1281690
DOI10.1023/A:1019140332008zbMath0916.90105MaRDI QIDQ1281690
Attahiru Sule Alfa, Qi-Ming He
Publication date: 6 July 1999
Published in: Queueing Systems (Search for Journal in Brave)
queueing theory; matrix analytic methods; LCFS; tree structure; quasi-birth-and-death Markov process
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
Related Items
Unnamed Item, A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure, Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams, On the link between Markovian trees and tree-structured Markov chains, Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue], Solving nonlinear matrix equations arising in tree-like stochastic processes., Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models, Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue], Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue]
