Waiting time distribution of the \(MAP/D/k\) system in discrete time -- a more efficient algorithm.
From MaRDI portal
Publication:1413912
DOI10.1016/S0167-6377(03)00003-8zbMath1088.90007MaRDI QIDQ1413912
Publication date: 17 November 2003
Published in: Operations Research Letters (Search for Journal in Brave)
Discrete timeMarkovianWaiting timeMatrix-analytic methodarrival processDeterministic serviceMultiserver
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
Computational procedures for a class of GI/D/\(k\) systems in discrete time ⋮ A note on the distributional Little's law for discrete-time queues with D-MAP arrivals and its application ⋮ Algorithmic analysis of the BMAP/D/k system in discrete time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple solution for the M/D/c waiting time distribution
- Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: \(D-MAP/D/k\) system
- A discrete single server queue with Markovian arrivals and phase type group services
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
- Waiting Time Distribution Of A Fifo/Lifo Geo/D/1 Queue
This page was built for publication: Waiting time distribution of the \(MAP/D/k\) system in discrete time -- a more efficient algorithm.