Practical approximations for finite-buffer queueing models with batch arrivals
From MaRDI portal
For the \(G^ X/G/1/N\) queue (with general batch size distribution) two rejection strategies are considered: If a whole batch cannot completely enter the buffer it is either rejected totally or the buffer is filled and the residual batch is lost. Using exact solutions for special cases of the model, approximations for rejection probabilities and waiting time quantities are proposed.
Recommendations
- On the finite-buffer bulk-arrival GI^X/E_k/1/N queueing system.
- THE M^X/G/1 QUEUE WITH FINITE WAITING ROOM
- Simple Approximations for the Batch-Arrival Mx/G/1 Queue
- Analysis of finite-buffer multi-server queues with group arrivals: GI\(^{X}\)/M/\(c\)/N
- Performance analysis of a \(GI^{[X]}/Geo/m/N\) queue with partial- and total-batch rejection
Cites work
Cited in
(19)- A simple heuristic for buffer design in finite-capacity queues
- An approximate solution and error bound for a discrete time queue with simultaneous servicing
- The unobserved waiting customer approximation
- Analysis of finite-buffer state-dependent bulk queues
- Performance analysis of a \(GI^{[X]}/Geo/m/N\) queue with partial- and total-batch rejection
- On the finite-buffer bulk-arrival GI^X/E_k/1/N queueing system.
- Queueing-model based analysis of assembly lines with finite buffers and general service times
- Finite-buffer queues with workload-dependent service and arrival rates
- Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
- LOSS PROBABILITIES FOR THE MX/GY/1/K+B BULK QUEUE
- THE M^X/G/1 QUEUE WITH FINITE WAITING ROOM
- The Effect of Routing and Buffer Sharing on the Behavior of a Finite Queue with Batch Poisson Inputs and Synchronous Servers
- Numerical analysis of queues with batch arrivals
- The queue GeoX/G/1/N+1 revisited
- A Note on Bounds and Error Bounds for Nonexponential Batch Arrival Systems
- A LCFS finite buffer model with batch input and non-exponential services
- Smoothed perturbation analysis for queues with finite buffers
- Computational procedure for system length and waiting-time distribution in an m^x/D/c/N queue
- On the loss process in a batch arrival queue
This page was built for publication: Practical approximations for finite-buffer queueing models with batch arrivals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1120200)