The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue (Q5948158): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:45, 5 March 2024

scientific article; zbMATH DE number 1667913
Language Label Description Also known as
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
    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
    0 references
    0 references
    0 references
    0 references
    single served queue
    0 references
    multiple types of customers
    0 references
    Markov arrival process
    0 references
    Laplace-Stieltjes transforms
    0 references