Identifiability of the MAP₂/G/1 queueing system
From MaRDI portal
Publication:458957
Recommendations
- Nonidentifiability of the two-state Markovian arrival process
- Nonidentifiability of the two-state BMAP
- New results about weakly equivalent \(\mathrm{MAP}_2\) and \(\mathrm{MAP}_3\) processes
- Bayesian analysis of the stationary MAP\(_2\)
- Analysis of MAP\(_2/G_2/1/r \) queueing system with nonpreemptive priority and state-dependent services
Cites work
- scientific article; zbMATH DE number 2087799 (Why is no real title available?)
- scientific article; zbMATH DE number 1867250 (Why is no real title available?)
- scientific article; zbMATH DE number 1867261 (Why is no real title available?)
- PH-Invariant Polytopes and Coxian Representations of Phase Type Distributions
- A Markovian canonical form of second-order matrix-exponential processes
- A \(MAP/G/1\) queue with negative customers
- A single-server queue with server vacations and a class of non-renewal arrival processes
- A tandem queue with blocking and Markovian arrival process
- A versatile Markovian point process
- An Exact Gibbs Sampler for the Markov-Modulated Poisson Process
- An algorithm for computing minimal Coxian representations
- Coxian representations of generalized Erlang distributions
- Departure processes of BMAP/G/1 queues
- Finite capacity vacation models with non-renewal input
- Hidden Markov processes
- New results on the single server queue with a batch markovian arrival process
- Nonidentifiability of the two-state Markovian arrival process
- Numerical Inversion of Laplace Transforms of Probability Distributions
- On identifiability and order of continuous-time aggregated Markov chains, Markov-modulated Poisson processes, and phase-type distributions
- On non-uniqueness of representations of phase-type distributions
- Reliability of a system under two types of failures using a Markovian arrival process
- Repairable models with operating and repair times governed by phase type distributions
- Tail probabilities of low-priority waiting times and queue lengths in MAP/GI/1 queues
- The N/G/1 queue and its detailed analysis
- The n/g/l finite capacity queue
Cited in
(3)
This page was built for publication: Identifiability of the \(\mathrm{MAP}_2/\mathrm{G}/1\) queueing system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458957)