This paper considers a discrete-time bulk-service queueing system with variable capacity, ΓΏnite waiting space and independent Bernoulli arrival process: Geo=G Y =1=N + B. Both the analytic and computational aspects of the distributions of the number of customers in the queue at post-departure, rando
Algorithmic analysis of the discrete time GIX/GY/1 queueing system
β Scribed by Attahiru S. Alfa; Qi-Ming He
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 850 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0166-5316
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We use the matrixβgeometric method to study the __MAP/PH/__1 general preemptive priority queue with a multiple class of jobs. A procedure for obtaining the block matrices representing the transition matrix __P__ is presented. We show that the special upper triangular structure of the ma
We consider a discrete-time Geol, Geo2/G/1 retrial queue with two types of calls. When arriving calls are blocked due to the server being busy, Type I calls are queued in the priority queue with infinite capacity whereas, Type II calls enter the retrial group in order to try service again after a r