Title
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.
Year
DOI
Venue
1999
10.1016/S0166-5316(99)00039-5
Perform. Eval.
Keywords
Field
DocType
matrix analytic methods,interdeparture time,departure process,nonpreemptive priority,queueing theory,laplace stieltjes transform,matrix analytic method
mmap,Arrival process,Computer science,Queue,Real-time computing,Queueing theory,Layered queueing network,Distributed computing
Journal
Volume
Issue
ISSN
38
2
Performance Evaluation
Citations 
PageRank 
References 
4
0.47
3
Authors
2
Name
Order
Citations
PageRank
Qi-Ming He123034.21
David A. Stanford29516.03