Probabilities for Queueing Systems with Embedded Markov Chains
From MaRDI portal
Recommendations
- A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES
- Determining the steady-state probabilities of an embedded Markov chain in a retrial queuing system with a flow of demands of different types
- scientific article; zbMATH DE number 4169798
- A Simple Formula for the Transient State Probabilities of an M/M/1/∞Queue
- scientific article; zbMATH DE number 956821
Cites work
Cited in
(10)- Statistics of a Markov closed queueing network
- Determining the steady-state probabilities of an embedded Markov chain in a retrial queuing system with a flow of demands of different types
- Analysis of \(\text{GI}/\text{M}/s/c\) queues using uniformisation
- A two-point Markov chain boundary-value problem
- Probability distribution of testing time of the software based on Markov chains
- Perturbation theory for Markov reward processes with applications to queueing systems
- scientific article; zbMATH DE number 624793 (Why is no real title available?)
- scientific article; zbMATH DE number 1535821 (Why is no real title available?)
- A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES
- scientific article; zbMATH DE number 956821 (Why is no real title available?)
This page was built for publication: Probabilities for Queueing Systems with Embedded Markov Chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506299)