The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue
From MaRDI portal
Publication:5948158
DOI10.1023/A:1010995827792zbMath0982.60094OpenAlexW2165044626MaRDI QIDQ5948158
Publication date: 31 October 2001
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1010995827792
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov renewal processes, semi-Markov processes (60K15)
Related Items
Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K/SM[K]/1/FCFS Queue] ⋮ Commuting Matrices in the Queue Length and Sojourn Time Analysis of MAP/MAP/1 Queues ⋮ Multi-server retrial queue with negative customers and disasters ⋮ Compact Markov-modulated models for multiclass trace fitting ⋮ Analysis of a continuous time SM[K/PH[K]/1/FCFS queue: age process, sojourn times, and queue lengths] ⋮ BMAP/G/1 queue with correlated arrivals of customers and disasters. ⋮ On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts ⋮ Matrix Product-Form Solutions for LCFs Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams ⋮ A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE ⋮ The Waiting Time Distribution of a TypekCustomer in a Discrete-Time MMAP[K/PH[K]/c (c = 1, 2) Queue Using QBDs] ⋮ Marked Markovian arrivals in a tandem G-network with blocking ⋮ Age process, workload process, sojourn times, and waiting times in a discrete time SM[K/PH[K]/1/FCFS queue]
