The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue (Q5948158)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1667913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue |
scientific article; zbMATH DE number 1667913 |
Statements
The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue (English)
0 references
31 October 2001
0 references
It is considered a single served queueing system with multiple type of customers. FCFS service discipline is supposed. The Markov arrival process with marked arrivals (MMAP[K]) is used to model point processes corresponding to the above system. A number of examples show the applicability of MMAP[K] in queueing system analysis. The virtual and actual waiting time distributions are shown to be different for individual types of customers. Therefore, an analysis of waiting time distribution is given for each type of customers. In steady-state situation the actual waiting time distribution is described explicitly on the base of the Laplace-Stieltjes transforms.
0 references
single served queue
0 references
multiple types of customers
0 references
Markov arrival process
0 references
Laplace-Stieltjes transforms
0 references
0.8417545557022095
0 references
0.8404127359390259
0 references
0.8366552591323853
0 references
0.8261665105819702
0 references
