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
From MaRDI portal
Publication:2669671
Recommendations
- scientific article; zbMATH DE number 98645
- Exact computational analysis of waiting-time distributions of single- server bulk-arrival queues: \(M^ X/G/1\)
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- scientific article; zbMATH DE number 2166616
- Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues
Cites work
- A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
- A first course in stochastic models.
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- 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
- A versatile Markovian point process
- Algorithmic analysis of the BMAP/D/k system in discrete time
- Analysis of discrete-time multiserver queueing models with constant service times
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- Calculation of delay characteristics for multiserver queues with constant service times
- Computational analysis of single-server bulk-service queues, M/GY/ 1
- Computing the distribution for the number of renewals with bulk arrivals
- Decomposition of an M/D/rk queue with FIFO into kE//k/D/r queues with FIFO
- Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots
- scientific article; zbMATH DE number 4018069 (Why is no real title available?)
- scientific article; zbMATH DE number 3168165 (Why is no real title available?)
- scientific article; zbMATH DE number 4090540 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 98645 (Why is no real title available?)
- scientific article; zbMATH DE number 194776 (Why is no real title available?)
- scientific article; zbMATH DE number 3892339 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- Linear independence of root equations for M/G/1 type Markov chains
- Moment formulas for the Markov renewal branching process
- New results on the single server queue with a batch markovian arrival process
- Nonidentifiability of the two-state BMAP
- Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
- Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1
- On lattice reduction for polynomial matrices
- Regenerative Analysis and Steady State Distributions for Markov Chains
- Robustness of Rootfinding in Single-Server Queueing Models
- Some steady-state distributions for theMAP /SM /1 queue
- Spectral analysis of M/G/1 and G/M/1 type Markov chains
- STATIONARY WAITING TIME DISTRIBUTION IN A GI/E_k/m QUEUE
- Steady state solution of the \(E^ k/D/r\) queueing model
- THE MX/D/c BATCH ARRIVAL QUEUE
- The N/G/1 queue and its detailed analysis
- The queue GI/Hm/s in continuous time
Cited in
(6)- Analytically explicit results for the GI/C-MSP/1/ queueing system using roots
- Computational Results of Multiserver Bulk-Arrival Queues with Constant Service Time MX/D/c
- Computational procedures for a class of GI/D/\(k\) systems in discrete time
- An extended queueing model for vehicles at signalized intersections considering the platoon correlated arrivals
- Computational procedure for system length and waiting-time distribution in an m^x/D/c/N queue
- Overlap times in the G/G/1 queue via Laplace transforms
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669671)
