๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Discrete-time GeoX/G/1 queue with preemptive resume priority

โœ Scribed by Yutae Lee


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
389 KB
Volume
34
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis


This paper considers a CeoX/G/1 queue with preemptive resume priority. Service times of messages of each priority class are i.i.d, according to a general distribution function that may differ between two classes. The analysis is based on the generating function technique and the supplementary variable method. We derive the joint system occupancy distributions at various observation instant and provide the analysis of the system time and the busy period. (~) 2001 Elsevier Science Ltd. All rights reserved.


๐Ÿ“œ SIMILAR VOLUMES


Discrete-time GeoX/G/1 que with non-pree
โœ Yutae Lee; Young Hwa Kim; Jae Doo Huh ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 566 KB

This paper considers a discrete-time two-class queueing system with non-preemptive priority. Service times of messages of each priority class are i.i.d. according to a general discrete distribution function that may differ between two classes. Using the supplementary variable method and the generati

Discrete-time analysis of MAP/PH/1 multi
โœ Attahiru Sule Alfa; Bin Liu; Qi-Ming He ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 192 KB

## 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

Geo/G/1 discrete time retrial queue with
โœ Hui Li; Tao Yang ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 259 KB

This paper studies discrete time Geo/G/1 retrial queues with Bernoulli schedule in which the blocked customers either join the inยฎnite waiting space with probability a or leave the server and enter the retrial orbit with probability a 1 ร€ a). The customers in the retrial orbit will retry their servi