Modelling of computer and communication systems
Modelling of computer and communication systems
Performance of discrete-time queueing systems
Computers and Operations Research
Discrete-Time Models for Communication Systems Including ATM
Discrete-Time Models for Communication Systems Including ATM
Discrete-time multiserver queues with geometric service times
Computers and Operations Research
A class of multi-server queueing system with server failures
Computers and Industrial Engineering
International Journal of Systems Science
A note on the discretization of Little's result
Operations Research Letters
Effective bandwidth in high-speed digital networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We consider a discrete-time queueing model whereby the service capacity of the system, i.e., the number of work units that the system can perform per time slot, is variable from slot to slot. Specifically, we study the case where service capacities are independent from slot to slot and geometrically distributed. New customers enter the system according to a general independent arrival process. Service demands of the customers are i.i.d. and arbitrarily distributed. For this (non-classical) queueing model, we obtain explicit expressions for the probability generating functions (pgf's) of the unfinished work in the system and the queueing delay of an arbitrary customer. In case of geometric service demands, we also obtain the pgf of the number of customers in the system explicitly. By means of some numerical examples, we discuss the impact of the service process of the customers on the system behavior.