Computational analysis ofMMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline
From MaRDI portal
Publication:4511445
DOI<399::AID-NAV3>3.0.CO;2-9 10.1002/1520-6750(200008)47:5<399::AID-NAV3>3.0.CO;2-9zbMath0991.90039MaRDI 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
waiting time; queueing theory; matrix analytic methods; LCFS; tree structure; FCFS; QBD Markov process; queue string
Related Items
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