We present the analysis of a non-classical discrete-time queueing model where customers demand variable amounts of work from a server that is able to perform this work at a varying rate. The service demands of the customers are integer numbers of work units. They are assumed to be independent and identically distributed (i.i.d.). The service capacities, i.e., the numbers of work units that the server can process in the consecutive slots, are also assumed to be i.i.d. and have a rational probability generating function (pgf). Finally, the numbers of customer arrivals in each slot are i.i.d. as well. We analyze this model analytically using contour integration. Our main result is an expression for the pgf of the customer delay in steady state...
In this paper, we analyse the delay of a random customer in a two-class batch-service queueing model...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
We consider a single-server discrete-time queueing system with N sources, where each source is model...
We present the analysis of a non-classical discrete-time queueing model where customers demand varia...
In this paper, we analyze a non-classical discrete-time queueing model where customers demand variab...
In this paper, we study a non-classical discrete-time queueing model with variable service demands a...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We present the study of a non-classical discrete-time queueing model in which the customers each req...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We present the study of a non-classical discrete-time queuing system in which the customers each req...
We consider a discrete-time queueing model whereby the service capacity of the system, i.e., the num...
In this work we look at the delay analysis of a customer in a discrete-time queueing system with one...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...
In this work we look at the delay analysis of a customer in a discrete-time queueing system with one...
This paper analyzes the performance of discrete-time multiserver queues, subjected to random server ...
In this paper, we analyse the delay of a random customer in a two-class batch-service queueing model...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
We consider a single-server discrete-time queueing system with N sources, where each source is model...
We present the analysis of a non-classical discrete-time queueing model where customers demand varia...
In this paper, we analyze a non-classical discrete-time queueing model where customers demand variab...
In this paper, we study a non-classical discrete-time queueing model with variable service demands a...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We present the study of a non-classical discrete-time queueing model in which the customers each req...
This paper analyzes a single-server discrete-time queueing model with general independent arrivals, ...
We present the study of a non-classical discrete-time queuing system in which the customers each req...
We consider a discrete-time queueing model whereby the service capacity of the system, i.e., the num...
In this work we look at the delay analysis of a customer in a discrete-time queueing system with one...
In discrete-time queueing theory, the service process is traditionally modeled using the notion of s...
In this work we look at the delay analysis of a customer in a discrete-time queueing system with one...
This paper analyzes the performance of discrete-time multiserver queues, subjected to random server ...
In this paper, we analyse the delay of a random customer in a two-class batch-service queueing model...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
We consider a single-server discrete-time queueing system with N sources, where each source is model...