The Waiting Time Distribution of a TypekCustomer in a Discrete-Time MMAP[K]/PH[K]/c (c = 1, 2) Queue Using QBDs

DOI10.1081/STM-120028391zbMATH Open1054.60098MaRDI QIDQ4451556FDOQ4451556

Authors: Benny Van Houdt, Chris Blondia 

Publication date: 26 February 2004

Published in: Stochastic Models (Search for Journal in Brave)

Recommendations

• The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue
• Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
• Waiting time distribution of the \(MAP/D/k\) system in discrete time -- a more efficient algorithm.
• Calculation of the steady state waiting time distribution in GI/PH/\(c\) and MAP/PH/\(c\) queues
• Delay distribution of (im)patient customers in a discrete time D-MAP/PH/1 queue with age-dependent service times

zbMATH Keywords

Markovian arrival processwaiting timeQBDmultiple customer types

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Markov chains with marked transitions
• Queues with marked customers
• Queue length distribution in a FIFO single-server queue with multiple arrival streams having different service time distributions
• The workload in theMAP/G/1 queue with state-dependent services:its application to a queue with preemptive resume priority
• The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue
• The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue

Cited In (12)

• Fitting correlated arrival and service times and related queueing performance
• Workload Process, Waiting Times, and Sojourn Times in a Discrete TimeMMAP[K]/SM[K]/1/FCFS Queue
• The versatility of MMAP[K] and the MMAP[K]/G[K]/1 queue
• Calculation of the steady state waiting time distribution in GI/PH/\(c\) and MAP/PH/\(c\) queues
• Age process, workload process, sojourn times, and waiting times in a discrete time SM[K]/PH[K]/1/FCFS queue
• A batch arrival $M^X/M/c$ queue with impatient customers
• Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: age process, sojourn times, and queue lengths
• The delay distribution of a type k customer in a first-come-first-served MMAP[K]/PH[K]/1 queue
• Response Time Distribution in a D-MAP/PH/1 Queue with General Customer Impatience
• Waiting time distribution of the \(MAP/D/k\) system in discrete time -- a more efficient algorithm.
• Analysis of the adaptive \(MMAP[K]/PH[K]/1\) queue: a multi-type queue with adaptive arrivals and general impatience
• Computational analysis ofMMAP[K]/PH[K]/1 queues with a mixed FCFS and LCFS service discipline

This page was built for publication: The Waiting Time Distribution of a TypekCustomer in a Discrete-Time MMAP[K]/PH[K]/c (c = 1, 2) Queue Using QBDs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4451556)