Algorithmic analysis of the BMAP/D/k system in discrete time
From MaRDI portal
Publication:4454116
DOI10.1239/aap/1067436338zbMath1044.60087MaRDI QIDQ4454116
Publication date: 7 March 2004
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1067436338
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
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, Self-stabilizing balls and bins in batches. The power of leaky bins, A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues
Cites Work
- Analysis of discrete-time multiserver queueing models with constant service times
- Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems
- Waiting time distribution of the \(MAP/D/k\) system in discrete time -- a more efficient algorithm.
- A simple solution for the M/D/c waiting time distribution
- Decomposition of an M/D/rk queue with FIFO into kE//k/D/r queues with FIFO
- 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
- Performance of discrete-time queueing systems
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
- Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
- A simple approach to the map/d/s queue
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item