Algorithmic analysis of the maximum level length in general-block two-dimensional Markov processes
From MaRDI portal
Publication:610064
DOI10.1155/MPE/2006/53570zbMath1200.60079OpenAlexW1971130554MaRDI QIDQ610064
Srinivas R. Chakravarthy, Jesus R. Artalejo
Publication date: 1 December 2010
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/mpe/2006/53570
Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25) Numerical analysis or methods applied to Markov chains (65C40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Computational analysis of the maximal queue length in the MAP/\(M\)/\(c\) retrial queue
- Algorithmic analysis of the MAP/PH/1 retrial queue
- Extreme values of birth and death processes and queues
- Performance analysis of fast reservation protocol in ATM networks with arbitrary topologies
- New results on the single server queue with a batch markovian arrival process
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- The Distribution of the Maximum Length of a Poisson Queue During a Busy Period
- Analysis of Markov multiserver retrial queues with negative arrivals
This page was built for publication: Algorithmic analysis of the maximum level length in general-block two-dimensional Markov processes