Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP/G/1/N With or Without Vacation(s)
From MaRDI portal
Publication:5739136
DOI10.1287/ijoc.2016.0720zbMath1364.90116OpenAlexW2565839211MaRDI QIDQ5739136
Mohan L. Chaudhry, Abhijit Datta 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
finite-buffer queuesingle serverbatch Markovian arrival processPareto service time distributionpartial batch rejection policysingle- and multiple-vacation policy
Related Items (6)
A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service ⋮ 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 ⋮ Fitting procedure for the two-state batch Markov modulated Poisson process ⋮ 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
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)
