A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes

DOI10.1080/15326349208807224zbMath0751.60092OpenAlexW2022348810MaRDI QIDQ4012375

Naoki Makimoto, Masaaki Kijima

Publication date: 27 September 1992

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349208807224

zbMATH Keywords

phase-type distributionsquasi-birth-death processescharacteristics in queueing systemsstate-dependent services

Mathematics Subject Classification ID

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

Related Items (12)

A unified algorithm for computing the stationary queue length distributions in \(M(k)/G/1/N\) and \(GI/M(k)/1/N\) queues ⋮ Computational analysis of M(n)/G/1/N queues with setup time ⋮ Analysis and computational algorithm for queues with state-dependent vacations. I: \newline \(G/M(n)/1/K\) ⋮ Analysis and computational algorithm for queues with state-dependent vacations. II: \newline \(M(n)/G/1/K\) ⋮ Analysis of the discrete-time \(GI/\text{Geom}(n)/1/N\) queue ⋮ \(M(n)/G/1/N\) queues with generalized vacations ⋮ ON the GI/M(n)/1/K queue-an alternative approach ⋮ A recursive algorithm for state dependent \(GI/M/1/N\) queue with Bernoulli-schedule vacation ⋮ Analysis of \(GI/M(n)/1/N\) queue with state-dependent multiple working vacations ⋮ Computation of the quasi-stationary distributions in \(M(n)/GI/1/K\) and \(GI/M(n)/1/K\) queues ⋮ Analysis of \(GI^{X}/ M(n)// N\) systems with stochastic customer acceptance policy ⋮ A recursive method for the \(N\) policy \(G/M/1\) queueing system with finite capacity

This page was built for publication: A unified approach to gi/m(n)/l/k and m(n)/g/1/k queues via finite quasi-birth-death processes