Generalized folding-algorithm for sojourn time analysis of finite qbd processes and its queueing applications

DOI10.1080/15326349608807397zbMath0864.60074OpenAlexW1992945214MaRDI QIDQ4895654

San-qi Li, Hong-Dah Sheng

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

zbMATH Keywords

sojourn timetransient analysisquasi-birth-death processMarkov chain reduction

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (3)

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 ⋮ A successive censoring algorithm for a system of connected LDQBD-processes

This page was built for publication: Generalized folding-algorithm for sojourn time analysis of finite qbd processes and its queueing applications