The combinatorics of birth-death processes and applications to queues
From MaRDI portal
Publication:1383339
DOI10.1023/A:1019185225223zbMath0892.90071OpenAlexW1529856895MaRDI QIDQ1383339
Walter Böhm, A. C. Krinik, Sri Gopal Mohanty
Publication date: 13 April 1998
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019185225223
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (10)
An application of Riordan arrays to the transient analysis of \(M/M/1\) queues ⋮ Transient probabilities of a single server priority queueing system ⋮ On lattice path counting and the random product representation, with applications to the \(E_r/M/1\) queue and the \(M/E_r/1\) queue ⋮ Birth and Death (BDP) Process Models with Applications ⋮ Busy period analysis of queue: lattice path approach ⋮ On batch queueing systems: a combinatorial approach ⋮ Lattice path approach for busy period density of \(GIa/Gb/1\) queues using \(C_{2}\) Coxian distributions ⋮ Lattice path approaches for busy period density of \(GI^b/G/1\) queues using \(C_2\) Coxian distributions ⋮ A comparative analysis of the successive lumping and the lattice path counting algorithms ⋮ Dual processes to solve single server systems
This page was built for publication: The combinatorics of birth-death processes and applications to queues
