Distributions of the Interdeparture Times in FCFS and Nonpreemptive Priority MMAP [2]/G [2]/1 Queues

Abstract This paper deals with single server queueing systems with two classes of customers and a correlated arrival process. The focus is on the interdeparture times of each class of customer. A uniform approach is introduced to find the Laplace–Stieltjes transforms of interdeparture times for queueing systems with equal priority and nonpreemptive priority, respectively. Algorithms can be developed for computing the variances of interdeparture times. The methodology developed in this paper can be used to analyze queueing systems with correlated input processes with special arrival patterns.

[1]  Wolfgang Fischer,et al.  The interdeparture-time distribution for each class in the ∑iMi/Gi/1 queue , 1989, Queueing Syst. Theory Appl..

[2]  Qi-Ming He,et al.  Queues with marked customers , 1996, Advances in Applied Probability.

[3]  Philippe Nain,et al.  Interdeparture times from a queuing system with preemptive resume priority , 1984, Perform. Evaluation.

[4]  F. R. Gantmakher.  The Theory of Matrices , 1984 .

[5]  Tetsuya Takine,et al.  The workload in the MAP/G/1 queue with state-dependent services: its application to a queue with preemptive resume priority , 1994 .

[6]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[7]  滝根 哲哉.  A Nonpreemptive Priority MAP/G/1 Queue with Two Classes of Customers , 1997 .

[8]  D. Daley,et al.  Queueing output processes , 1976, Advances in Applied Probability.

[9]  Peter Lancaster,et al.  The theory of matrices , 1969 .

[10]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[11]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

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

[13]  Ward Whitt,et al.  A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues , 1988 .

[14]  Hiroshi Saito.  The Departure Process of an N/G/1 Queue , 1990, Perform. Evaluation.

[15]  David A. Stanford,et al.  Characterising interdeparture times for bursty input streams in the queue with pooled renewal arrivals , 1991 .

[16]  M. Neuts.  A Versatile Markovian Point Process , 1979 .

[17]  Marcel F. Neuts.  The Fundamental Period of the Queue with Markov-Modulated Arrivals , 1989 .

[18]  L. Mirsky,et al.  The Theory of Matrices , 1961, The Mathematical Gazette.

[19]  Marcel F. Neuts,et al.  Markov chains with marked transitions , 1998 .