Analysis of a Discrete-Time Queue with Geometrically Distributed Service Capacities
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.
KeywordsDiscrete-time queueing model Variable service capacity Analytic study Closed-form results
Unable to display preview. Download preview PDF.
- 13.Jin, X., Min, G., Velentzas, S.R.: An analytical queuing model for long range dependent arrivals and variable service capacity. In: Proceedings of IEEE International Conference on Communications (ICC 2008), Beijing, pp. 230–234 (May 2008)Google Scholar
- 16.Mitrani, I.: Modelling of Computer and Communication Systems. Cambridge University Press, Cambridge (1987)Google Scholar
- 17.Takagi, H.: Queueing Analysis, A Foundation of Performance Evaluation. Discrete-time systems, vol. 3. North-Holland, Amsterdam (1993)Google Scholar