[[abstract]]©1997 Springer Verlag-In this paper we analyze a discrete-time single server queue where the service time equals one slot. The numbers of arrivals in each slot are assumed to be independent and identically distributed random variables. The service process is interrupted by a semi-Markov process, namely in certain states the server is available for service while the server is not available in other states. We analyze both the transient and steady-state models. We study the generating function of the joint probability of queue length, the state and the residual sojourn time of the semi-Markov process. We derive a system of Hilbert boundary value problems for the generating functions. The system of Hilbert boundary value problems i...
Summary (translated from the Russian): "We consider a single-server queueing system with a finite-ca...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus-tomer aban...
In this paper, we consider a discrete-time single-server queueing system with a generalized switched...
We investigate the transient and stationary queue length distributions of a class of service systems...
We consider an infinite-server queue, where the arrival and service rates are both governed by a sem...
We investigate the transient and stationary queue-length distributions of a class of service systems...
This paper deals with a multi-server, finite-capacity queuing system with recurrent input and no wai...
A semi-open queueing network having a finite number of nodes is considered. The nodes are modeled by...
We consider a queuing network with single-server nodes and heterogeneous customers. The number of cu...
International audienceWe consider a general $k$ dimensional discounted infinite server queues proces...
AbstractA general model for the single server semi-Markov queue is studied. Its solution is reduced ...
A general model for the single server semi-Markov queue is studied. Its solution is reduced to a mat...
This paper analyzes the performance of discrete-time multiserver queues, subjected to random server ...
In this paper we consider a single server queueing model with under general bulk service rule with i...
Summary (translated from the Russian): "We consider a single-server queueing system with a finite-ca...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus-tomer aban...
In this paper, we consider a discrete-time single-server queueing system with a generalized switched...
We investigate the transient and stationary queue length distributions of a class of service systems...
We consider an infinite-server queue, where the arrival and service rates are both governed by a sem...
We investigate the transient and stationary queue-length distributions of a class of service systems...
This paper deals with a multi-server, finite-capacity queuing system with recurrent input and no wai...
A semi-open queueing network having a finite number of nodes is considered. The nodes are modeled by...
We consider a queuing network with single-server nodes and heterogeneous customers. The number of cu...
International audienceWe consider a general $k$ dimensional discounted infinite server queues proces...
AbstractA general model for the single server semi-Markov queue is studied. Its solution is reduced ...
A general model for the single server semi-Markov queue is studied. Its solution is reduced to a mat...
This paper analyzes the performance of discrete-time multiserver queues, subjected to random server ...
In this paper we consider a single server queueing model with under general bulk service rule with i...
Summary (translated from the Russian): "We consider a single-server queueing system with a finite-ca...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We establish many-server heavy-traffic limits for G/M/n + M queueing models, allowing cus-tomer aban...