Efficient computational analysis of stationary probabilities for the queueing system BMAP/G/1/N with or without vacation(s)
DOI10.1287/IJOC.2016.0720zbMATH Open1364.90116OpenAlexW2565839211MaRDI QIDQ5739136FDOQ5739136
Authors: M. L. Chaudhry, A. D. Banik
Publication date: 2 June 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2016.0720
Recommendations
- Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) 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
batch Markovian arrival processfinite-buffer queuesingle serverPareto service time distributionpartial batch rejection policysingle- and multiple-vacation policy
Cited In (7)
- Per-flow structure of losses in a finite-buffer queue
- Title not available (Why is that?)
- 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
- Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline
- On the distribution of the number of consecutively lost customers in the \textit{BMAP}/\textit{PH}/1/\textit{N} system
- Findings about the BMMPP for modeling dependent and simultaneous data in reliability and queueing systems
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)