Add to ORKGA numerical method to approximate first passage times distributions in direct Markov processes will be presented. It is useful to compute sojourn times in queue systems, namely in Jackson queuing networks. Using this method (Kiessler et al., 1988) achieved to clear a problem that arises in the Jackson three node acyclic networks sojourn times
Markov Fluid Queues (MFQs) are the continuous counterparts of quasi birth–death processes, where inf...
AbstractWe consider a stationary continuous time process with a finite or countable state space, whi...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
A numerical method to approximate first passage times distributions in direct Markov processes will...
Jackson queuing networks have a lot of practical applications, mainly in the modelling of computati...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
International audienceIn this paper, we provide a methodology for computing the probability distribu...
AbstractWe derive simple criteria to ensure the finiteness of the mean first-passage times into semi...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
In this thesis, the problem of computing the cumulative distribution function (cdf) of the random ti...
Fast response times and the satisfaction of response time quantile targets are important performance...
In this paper, we provide a methodology for computing the probability distribution of sojourn times...
Jackson queuing networks have a lot of practical applications, mainly in services and technologic de...
We consider a polling system of N queues Q1,…,QN, cyclically visited by a single server. Customers a...
This paper considers the sojourn time distribution in a processor-sharing queue with a Markovian arr...
Markov Fluid Queues (MFQs) are the continuous counterparts of quasi birth–death processes, where inf...
AbstractWe consider a stationary continuous time process with a finite or countable state space, whi...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...
A numerical method to approximate first passage times distributions in direct Markov processes will...
Jackson queuing networks have a lot of practical applications, mainly in the modelling of computati...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
International audienceIn this paper, we provide a methodology for computing the probability distribu...
AbstractWe derive simple criteria to ensure the finiteness of the mean first-passage times into semi...
The distribution of the “mixing time” or the “time to stationarity” in a discrete time irreducible M...
In this thesis, the problem of computing the cumulative distribution function (cdf) of the random ti...
Fast response times and the satisfaction of response time quantile targets are important performance...
In this paper, we provide a methodology for computing the probability distribution of sojourn times...
Jackson queuing networks have a lot of practical applications, mainly in services and technologic de...
We consider a polling system of N queues Q1,…,QN, cyclically visited by a single server. Customers a...
This paper considers the sojourn time distribution in a processor-sharing queue with a Markovian arr...
Markov Fluid Queues (MFQs) are the continuous counterparts of quasi birth–death processes, where inf...
AbstractWe consider a stationary continuous time process with a finite or countable state space, whi...
In this paper, the aim is to study similarities and differences between a continuous-time Markov cha...