Efficient computational analysis of stationary probabilities for the queueing system BMAP/G/1/N with or without vacation(s)
From MaRDI portal
Publication:5739136
Recommendations
- Efficient computational analysis of non-exhaustive service vacation queues: BMAP/R/1/N() under gated-limited discipline
- BMAP/G/1/N queue with vacations and limited service discipline
- Analyzing discrete-time \(\text{D}\)-\(\text{BMAP}/G/1/N\) queue with single and multiple vacations
- Analysis of \(BMAP/R/1\) queues under gated-limited service with the Server's single vacation policy
- On the batch arrival batch service queue with finite buffer under server's vacation: \(MX/GY/1/N\) queue
Cited in
(7)- Fitting procedure for the two-state batch Markov modulated Poisson process
- A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service
- scientific article; zbMATH DE number 1834030 (Why is no real title available?)
- Findings about the BMMPP for modeling dependent and simultaneous data in reliability and queueing systems
- Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline
- Per-flow structure of losses in a finite-buffer queue
- On the distribution of the number of consecutively lost customers in the \textit{BMAP}/\textit{PH}/1/\textit{N} system
This page was built for publication: Efficient computational analysis of stationary probabilities for the queueing system \(BMAP/G/1/N\) with or without vacation(s)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5739136)
