Distributions of the interdeparture times in FCFS and nonpreemptive priority MMAP[2]/G[2]/1 queues

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.