A dual form of Markov renewal equation and its application to asymptotic analysis of the single-server queue with a Markovian arrival strea
The Markovian Arrival Process (MAP) is a tractable, versatile class of Markov renewal processes whic...
The multi-server queueing system with a finite of an infinite buffer, with semi-Markovian input flo...
Classical queueing theory is often not suitable to model modern computer and communication systems, ...
This paper will be concerned with a two-phase queueing system consisting of two single servers in ta...
This work main objective is to present a process to compute the Markov renewal matrix R(t) for Marko...
This paper deals with an with the analysis of a two-phase queueing system with one server in each ph...
AbstractThis paper is concerned with single server queueing systems with renewal service process and...
[[abstract]]©1997 Springer Verlag-In this paper we analyze a discrete-time single server queue where...
Abstract The M/M/k/setup model, where there is a penalty for turning servers on, is common in data c...
We propose a new approach to the analysis of a discrete-time queueing system whose input is generate...
International audienceWe propose new easily computable bounds for different quantities which are sol...
An exponential martingale is associated with the Markov chain of the number of customers in the M/GI...
We consider asymptotic behaviors of the stationary tail probabilities in the dis-crete time GI=G=1 t...
A new approach is used to determine the transient probability functions of the classical queueing sy...
In this paper, we consider a discrete-time single-server queueing system with a generalized switched...
The Markovian Arrival Process (MAP) is a tractable, versatile class of Markov renewal processes whic...
The multi-server queueing system with a finite of an infinite buffer, with semi-Markovian input flo...
Classical queueing theory is often not suitable to model modern computer and communication systems, ...
This paper will be concerned with a two-phase queueing system consisting of two single servers in ta...
This work main objective is to present a process to compute the Markov renewal matrix R(t) for Marko...
This paper deals with an with the analysis of a two-phase queueing system with one server in each ph...
AbstractThis paper is concerned with single server queueing systems with renewal service process and...
[[abstract]]©1997 Springer Verlag-In this paper we analyze a discrete-time single server queue where...
Abstract The M/M/k/setup model, where there is a penalty for turning servers on, is common in data c...
We propose a new approach to the analysis of a discrete-time queueing system whose input is generate...
International audienceWe propose new easily computable bounds for different quantities which are sol...
An exponential martingale is associated with the Markov chain of the number of customers in the M/GI...
We consider asymptotic behaviors of the stationary tail probabilities in the dis-crete time GI=G=1 t...
A new approach is used to determine the transient probability functions of the classical queueing sy...
In this paper, we consider a discrete-time single-server queueing system with a generalized switched...
The Markovian Arrival Process (MAP) is a tractable, versatile class of Markov renewal processes whic...
The multi-server queueing system with a finite of an infinite buffer, with semi-Markovian input flo...
Classical queueing theory is often not suitable to model modern computer and communication systems, ...