Paper Info
Title
The Versatility of MMAP[K] and the MMAP[K]/[K]/1 Queue
Abstract
This paper studies a single server queueing system with multiple types of customers. The first part of the paper discusses some modeling issues associated with the Markov arrival processes with marked arrivals (MMAP[K], where K is an integer representing the number of types of customers). The usefulness of MMAP[K] in modeling point processes is shown by a number of interesting examples. The second part of the paper studies a single server queueing system with an MMAP[K] as its input process. The busy period, virtual waiting time, and actual waiting times are studied. The focus is on the actual waiting times of individual types of customers. Explicit formulas are obtained for the Laplace–Stieltjes transforms of these actual waiting times.
Year
DOI
Venue
2001
https://doi.org/10.1023/A:1010995827792
Queueing Systems - Theory and Applications
Keywords
Field
DocType
queueing system,waiting time,multiple types of customer,point process,matrix analytic methods
Integer,mmap,Mathematical optimization,Markov process,Laplace transform,Queue,Markov chain,Point process,Algorithm,Theoretical computer science,Stieltjes transformation,Mathematics
Journal
Volume
Issue
ISSN
38
4
0257-0130
Citations 
PageRank 
References 
9
1.22
6
Authors
1
Name
Order
Citations
PageRank
Qi-Ming He123034.21