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-120028391MaRDI QIDQ4451556zbMATHFDO

Authors Benny Van Houdt, Chris Blondia

Publication date 26 February 2004

Published in Stochastic Models (Search for Journal in Brave)

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)

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

Cites work

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

Cited in

(12)

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

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)