Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue

DOI10.1016/S0377-2217(98)00396-8MaRDI QIDQ1579504zbMATH OpenOpenAlexFDO

Authors Qi-Ming He

Publication date 2 July 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(98)00396-8

zbMATH Keywords

matrix analytic methodsquasi-birth-and-death Markov processqueuestree structure

Mathematics Subject Classification ID

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

Review text

For a multiserver queueing system with multiple types of customers and last-come-first-served non-preemptive service disciple, among other things, a formula and a computational algorithm for the stationary distribution of queue strings are given.

Recommendations

• The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline
• AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITYM/PH/1 QUEUE
• A many-server non-Markovian queue system under inhomogeneous input: Multiplicative stationary distributions of its states
• Stationary waiting time distribution in queues with phase type service and in quasi-birth-and-death processes
• Algorithms for the multi-server queue with phase type service

Cites work

• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• A logarithmic reduction algorithm for quasi-birth-death processes
• A note on two matrices occurring in the solution of quasi-birth-and-death processes
• A versatile Markovian point process
• scientific article; zbMATH DE number 994725 (Why is no real title available?)
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3656855 (Why is no real title available?)
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 19234 (Why is no real title available?)
• scientific article; zbMATH DE number 194776 (Why is no real title available?)
• Marked point processes as limits of Markovian arrival streams
• Markov chains with marked transitions
• Matrix product-form solutions for Markov chains with a tree structure
• New results on the single server queue with a batch markovian arrival process
• Queues with marked customers
• Random walks, capacity and percolation on trees
• Some properties of the rate perators in level dependent uasi-birth-and-death processes with countable number of phases
• 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
• The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority

Cited in

(9)

• Marked Markovian arrivals in a tandem G-network with blocking
• The \(MMAP[K]/PH[K]/1\) queues with a last-come-first-served preemptive service discipline
• Analysis of MAP(1), MAP(2)/ PH/ 1 non-preemptive priority queueing model under classical retrial policy with breakdown, repair, discouragement, single vacation, standby server, negative arrival and impatient customers
• A multiple warm standby system with operational and repair times following phase-type distributions
• Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue
• AMAP/G/1 Queue with an Underlying Birth–Death Process
• Computational analysis ofMMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline
• A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure
• Analysis of a multi-item queueing inventory system operating with an exchange facility

This page was built for publication: Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue

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