Computational analysis ofMMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(200008)47:5<399::AID-NAV3>3.0.CO;2-9" /><399::AID-NAV3>3.0.CO;2-9 10.1002/1520-6750(200008)47:5<399::AID-NAV3>3.0.CO;2-9zbMath0991.90039OpenAlexW2008396768MaRDI QIDQ4511445

Qi-Ming He, Attahiru Sule Alfa

Publication date: 30 October 2000

Full work available at URL: https://doi.org/10.1002/1520-6750(200008)47:5<399::aid-nav3>3.0.co;2-9

zbMATH Keywords

waiting timequeueing theorymatrix analytic methodsLCFStree structureFCFSQBD Markov processqueue string

Mathematics Subject Classification ID

Search theory (90B40) Queues and service in operations research (90B22)

Related Items (1)

Mathematical analysis of queue with phase service: an overview

Cites Work

• Unnamed Item
• The \(MMAP[K/PH[K]/1\) queues with a last-come-first-served preemptive service discipline]
• Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K/PH[K]/N/LCFS non-preemptive queue]
• Markov chains with marked transitions
• The quasi-birth-death type markov chain with a tree structure
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure

This page was built for publication: Computational analysis ofMMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline