Algorithmic analysis of the maximum level length in general-block two-dimensional Markov processes
From MaRDI portal
Recommendations
- Effective algorithm for computation of the stationary distribution of multi-dimensional level-dependent Markov chains with upper block-Hessenberg structure of the generator
- Algorithmic analysis of the maximum queue length in a busy period for the \(M/M/c\) retrial queue
- Analysis and computation of the stationary distribution in a special class of Markov chains of level-dependent \(\mathrm{M}/\mathrm{G}/1\)-type and its application to \(\mathrm{BMAP}/\mathrm{M}/\infty\) and \(\mathrm{BMAP}/\mathrm{M}/c+\mathrm{M}\) queues
- Computational analysis of the maximal queue length in the MAP/\(M\)/\(c\) retrial queue
- Algorithmic analysis of a multiserver Markovian queue with primary and secondary services
Cites work
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 194776 (Why is no real title available?)
- Algorithmic analysis of the MAP/PH/1 retrial queue
- Analysis of Markov multiserver retrial queues with negative arrivals
- Computational analysis of the maximal queue length in the MAP/\(M\)/\(c\) retrial queue
- Extreme values of birth and death processes and queues
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- New results on the single server queue with a batch markovian arrival process
- Performance analysis of fast reservation protocol in ATM networks with arbitrary topologies
- The Distribution of the Maximum Length of a Poisson Queue During a Busy Period
This page was built for publication: Algorithmic analysis of the maximum level length in general-block two-dimensional Markov processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q610064)