Algorithmic analysis of the BMAP/D/k system in discrete time
From MaRDI portal
Publication:4454116
Recommendations
- The queue length distribution for multiserver discrete time queues with batch markovian arrivals
- Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time
- Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: \(D-MAP/D/k\) system
- scientific article; zbMATH DE number 1782584
- Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
Cites work
- A discrete single server queue with Markovian arrivals and phase type group services
- A simple approach to the map/d/s queue
- A simple solution for the M/D/c waiting time distribution
- A stable recursion for the steady state vector in markov chains of m/g/1 type
- Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
- Analysis of discrete-time multiserver queueing models with constant service times
- Decomposition of an M/D/rk queue with FIFO into kE//k/D/r queues with FIFO
- scientific article; zbMATH DE number 444952 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 502870 (Why is no real title available?)
- scientific article; zbMATH DE number 194776 (Why is no real title available?)
- scientific article; zbMATH DE number 805121 (Why is no real title available?)
- scientific article; zbMATH DE number 956796 (Why is no real title available?)
- Introduction to Matrix Analytic Methods in Stochastic Modeling
- Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems
- Non-Skip-Free M/G/1 and G/M/1 Type Markov Chains
- Performance of discrete-time queueing systems
- Waiting time distribution of the MAP/D/k system in discrete time -- a more efficient algorithm.
- Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: \(D-MAP/D/k\) system
Cited in
(21)- Waiting time distribution of the MAP/D/k system in discrete time -- a more efficient algorithm.
- 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
- Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: \(D-MAP/D/k\) system
- Discrete time queues and matrix-analytic methods. (With comments and rejoinder)
- Computational algorithm for an analysis of a single-line queueing system with arrived alternating Poisson flow
- Waiting-time analysis of D-BMAP/G/1 queueing system
- 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
- A recent progress in algorithmic analysis of FIFO queues with Markovian arrival streams
- Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time
- The queue length distribution for multiserver discrete time queues with batch markovian arrivals
- An analytical method for the calculation of the number of units at the arrival instant in a discrete time G/G/1-queueing system with batch arrivals
- scientific article; zbMATH DE number 1523216 (Why is no real title available?)
- Waiting time, busy periods and output models of a server analyzed via Wiener–Hopf factorization
- Development and justification of the Power-series algorithm forBMAP-Systems
- ALGORITHMIC COMPUTATION OF THE TRANSIENT QUEUE LENGTH DISTRIBUTION IN THE BMAP/D/c QUEUE
- Computational and Information Science
- Algorithmic Analysis of the Sparre Andersen Model in Discrete Time
- Computational procedures for a class of GI/D/\(k\) systems in discrete time
- The finite capacity multi-server queue with inhomogeneous arrival rate and discrete service time distribution - and its application to continuous service time problems
- On servers in series with losses in discrete time
This page was built for publication: Algorithmic analysis of the BMAP/D/k system in discrete time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4454116)
