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
AbstractThis paper deals with G/G/c queuing system in steady state. We refine a diffusion approximat...
The time dependent M/G/k queue is studied with the aim of obtaining good numerical approximations an...
This article proposes an analysis of the results of the application of hyperexponential approximatio...
AbstractA number of existing results describe the numerical calculation of the steady-state distribu...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
An exact analysis of the MMPP/G/1/K queueing model is carried out, yielding the whole buffer occupan...
The paper is devoted on methods and algorithms for steady-state analysis of Markov chains. Basic, di...
Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are uppe...
AbstractWe study the strong stability of a G/M/1 queueing system after perturbation of the service t...
In this paper, we propose a method for calculating steady-state probabilities of the G/G/1/m and M/G...
Abstract. There have been some approximation analysis methods for a GI/G/1 queueing system. As one o...
We consider an M/PH/1 queue with balking based on the workload. An arriving customer joins the queue...
This thesis directly exploits the structure contained in the transition diagrams of Markovian queuei...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
AbstractThis paper deals with G/G/c queuing system in steady state. We refine a diffusion approximat...
The time dependent M/G/k queue is studied with the aim of obtaining good numerical approximations an...
This article proposes an analysis of the results of the application of hyperexponential approximatio...
AbstractA number of existing results describe the numerical calculation of the steady-state distribu...
We develop accurate approximations for the delay distribution of the MArP/G/1 queue that capture the...
An exact analysis of the MMPP/G/1/K queueing model is carried out, yielding the whole buffer occupan...
The paper is devoted on methods and algorithms for steady-state analysis of Markov chains. Basic, di...
Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are uppe...
AbstractWe study the strong stability of a G/M/1 queueing system after perturbation of the service t...
In this paper, we propose a method for calculating steady-state probabilities of the G/G/1/m and M/G...
Abstract. There have been some approximation analysis methods for a GI/G/1 queueing system. As one o...
We consider an M/PH/1 queue with balking based on the workload. An arriving customer joins the queue...
This thesis directly exploits the structure contained in the transition diagrams of Markovian queuei...
AbstractThe differential equations for transient state probabilities for Markovian processes are exa...
AbstractThis paper deals with G/G/c queuing system in steady state. We refine a diffusion approximat...
The time dependent M/G/k queue is studied with the aim of obtaining good numerical approximations an...
This article proposes an analysis of the results of the application of hyperexponential approximatio...