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-8zbMath0964.60083OpenAlexW2084502319MaRDI QIDQ1579504

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

queuesmatrix analytic methodstree 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 (6)

A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure ⋮ Computational analysis ofMMAP[K/PH[K]/1 queues with a mixed FCFS and LCFS service discipline] ⋮ Marked Markovian arrivals in a tandem G-network with blocking ⋮ 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] ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks, capacity and percolation on trees
• The \(MMAP[K/PH[K]/1\) queues with a last-come-first-served preemptive service discipline]
• Markov chains with marked transitions
• New results on the single server queue with a batch markovian arrival process
• A note on two matrices occurring in the solution of quasi-birth-and-death processes
• A versatile Markovian point process
• The quasi-birth-death type markov chain with a tree structure
• A logarithmic reduction algorithm for quasi-birth-death processes
• The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority
• Matrix product-form solutions for Markov chains with a tree structure
• A generalization of the matrix M/G/l paradigm for Markov chains with a tree structure
• Some properties of the rate perators in level dependent uasi-birth-and-death processes with countable number of phases
• Queues with marked customers
• Marked point processes as limits of Markovian arrival streams

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