AbstractA number of existing results describe the numerical calculation of the steady-state distribution of an M/G/1/ type Markov process. However, these numerical methods have difficulties when the forward transition structure has a long tail asymptotic. This paper proposes a numerical approximation that can account for the polynomial decay of the steady-state distribution over several orders of magnitude, where the other known methods fail. An important advantage of the proposed approximation is that it uses numerically stable techniques
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
We consider the well-studied MMPP/PH/1 queue and illustrate a method to find an almost equivalent mo...
This paper presents a novel methodology for approximating the queue length (thenumber of customers i...
AbstractA number of existing results describe the numerical calculation of the steady-state distribu...
Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are uppe...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
AbstractA probability density {pk} on the positive integers is of phase type, if it is the probabili...
The general area of research of this dissertation concerns large systems wit...
The paper is devoted on methods and algorithms for steady-state analysis of Markov chains. Basic, di...
International audienceWe propose a simple approximation to assess the steady-stateprobabilities of t...
This thesis directly exploits the structure contained in the transition diagrams of Markovian queuei...
In this paper, we present an algorithmic approach to find the stationary probability distribution of...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
We consider the well-studied MMPP/PH/1 queue and illustrate a method to find an almost equivalent mo...
This paper presents a novel methodology for approximating the queue length (thenumber of customers i...
AbstractA number of existing results describe the numerical calculation of the steady-state distribu...
Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are uppe...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
AbstractA probability density {pk} on the positive integers is of phase type, if it is the probabili...
The general area of research of this dissertation concerns large systems wit...
The paper is devoted on methods and algorithms for steady-state analysis of Markov chains. Basic, di...
International audienceWe propose a simple approximation to assess the steady-stateprobabilities of t...
This thesis directly exploits the structure contained in the transition diagrams of Markovian queuei...
In this paper, we present an algorithmic approach to find the stationary probability distribution of...
AbstractMaier, R.S., Phase-type distributions and the structure of finite Markov chains, Journal of ...
We consider the well-studied MMPP/PH/1 queue and illustrate a method to find an almost equivalent mo...
This paper presents a novel methodology for approximating the queue length (thenumber of customers i...