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

DOI10.1002/1520-6750(200008)47:5%3C399::AID-NAV3%3E3.0.CO;2-9MaRDI QIDQ4511445zbMATH OpenOpenAlexFDO

Authors 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%3C399::aid-nav3%3E3.0.co;2-9

zbMATH Keywords

FCFSLCFSmatrix analytic methodsQBD Markov processqueue stringqueueing theorytree structurewaiting time

Mathematics Subject Classification ID

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

Recommendations

• The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline
• scientific article; zbMATH DE number 2158949
• Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
• The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue
• The Waiting Time Distribution of a TypekCustomer in a Discrete-Time MMAP[K]/PH[K]/c (c = 1, 2) Queue Using QBDs

Cites work

• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• Markov chains with marked transitions
• Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue
• The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline
• The quasi-birth-death type markov chain with a tree structure

Cited in

(3)

• Mathematical analysis of queue with phase service: an overview
• scientific article; zbMATH DE number 2158949 (Why is no real title available?)
• Analysis of a queueing system with mixed service discipline

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511445)