Discrete-time GeoX/G/1 que with non-preemptive priority☆

Abstract 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 generating function technique, we derive the joint system occupancy distribution at an arbitrary slot, and also compute the probability distributions for the system time and the busy period.

[1]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[2]  Tetsuya Takine,et al.  Analysis of a Nonpreemptive Priority Queue with SPP Arrivals of High Class , 1995, Perform. Evaluation.

[3]  Yutae Lee,et al.  Priority queueing system with fixed-length packet-train arrivals , 1998 .

[4]  Moshe Sidi Two competing discrete-time queues with priority , 1988, Queueing Syst. Theory Appl..

[5]  Tetsuya Takine,et al.  An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classes , 1994, IEEE Trans. Commun..

[6]  Yutae Lee Discrete-time GeoX/G/1 queue with preemptive resume priority , 2001 .

[7]  Yutae Lee Performance analysis for ATM network with both SVC and PVC connections , 2000 .

[8]  Nicolas D. Georganas,et al.  Priority performance of ATM packet switches , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[9]  Herwig Bruneel,et al.  HOL priority in an ATM output queueing switch , 1999 .

[10]  Herwig Bruneel,et al.  Discrete-time models for communication systems including ATM , 1992 .

[11]  Yutae Lee,et al.  Geox1, Geox2/D/c HOL Priority Queueing System with Random Order Selection within Each Priority Class , 1998 .

[12]  David A. Stanford,et al.  Interdeparture-Time Distributions in the Nonpreemptive Priority \Sigma M_i/G_i/1 Queue , 1991, Perform. Evaluation.

[13]  Herwig Bruneel,et al.  Discrete-Time Multiserver Queues with Priorities , 1998, Perform. Evaluation.