Generalized folding-algorithm for sojourn time analysis of finite qbd processes and its queueing applications
From MaRDI portal
Publication:4895654
DOI10.1080/15326349608807397zbMath0864.60074MaRDI QIDQ4895654
Publication date: 3 December 1996
Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15326349608807397
60K25: Queueing theory (aspects of probability theory)
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60J80: Branching processes (Galton-Watson, birth-and-death, etc.)
Related Items
A successive censoring algorithm for a system of connected LDQBD-processes, An auxiliary server threshold queueing model and its application to the operational characteristics of web server system, SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING