The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline

DOI10.1023/A:1019140332008zbMath0916.90105OpenAlexW137672360MaRDI QIDQ1281690

Attahiru Sule Alfa, Qi-Ming He

Publication date: 6 July 1999

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

Full work available at URL: https://doi.org/10.1023/a:1019140332008

zbMATH Keywords

queueing theorymatrix analytic methodsLCFStree structurequasi-birth-and-death Markov process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (12)

Solving nonlinear matrix equations arising in tree-like stochastic processes. ⋮ Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue] ⋮ A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure ⋮ On preemptive-repeat LIFO queues ⋮ Analysis of a last come first served queueing system with customer abandonment ⋮ Optimization of traffic control in \(MMAP[2/PH[2]/S\) priority queueing model with \(PH\) retrial times and the preemptive repeat policy] ⋮ Classification of Markov processes of M/G/1 type with a tree structure and its applications to queueing models ⋮ Computational analysis ofMMAP[K/PH[K]/1 queues with a mixed FCFS and LCFS service discipline] ⋮ 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] ⋮ Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue]

This page was built for publication: The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline