The Versatility of MMAP[K] and the MMAP[K]/G[K]/1 Queue

Authors:
Qi-Ming He
Affiliations:
Department of Industrial Engineering, DalTech, Dalhousie University, Halifax, NS, Canada B3J 2X4 Qi-Ming.He@dal.ca
Venue:
Queueing Systems: Theory and Applications
Year:
2001

Citing 6
Cited 6

From the matrix-geometric to the matrix-exponential

Queueing Systems: Theory and Applications
The Fourier-series method for inverting transforms of probability distributions

Queueing Systems: Theory and Applications - Numerical computations in queues
Queueing analysis of polling models: progress in 1990-1994

Frontiers in queueing
The MMAP[K]/PH[K]/1 queues with a last-come-first-served preemptive service discipline

Queueing Systems: Theory and Applications
The BMAP/G/1 QUEUE: A Tutorial

Performance Evaluation of Computer and Communication Systems, Joint Tutorial Papers of Performance '93 and Sigmetrics '93
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

Delay Distribution of (Im)Patient Customers in a Discrete Time D-MAP/PH/1 Queue with Age-Dependent Service Times

Queueing Systems: Theory and Applications
Age Process, Workload Process, Sojourn Times, and Waiting Times in a Discrete Time SM[K]/PH[K]/1/FCFS Queue

Queueing Systems: Theory and Applications
Multi-server retrial queue with negative customers and disasters

Queueing Systems: Theory and Applications
A traffic based decomposition of two-class queueing networks with priority service

Computer Networks: The International Journal of Computer and Telecommunications Networking
Multi-class Markovian arrival processes and their parameter fitting

Performance Evaluation
BMAP/G/1 queue with correlated arrivals of customers and disasters

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.