Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline
From MaRDI portal
Publication:2307283
DOI10.1016/j.apm.2018.11.040zbMath1481.90127OpenAlexW2902460898MaRDI QIDQ2307283
Souvik Ghosh, Abhijit Datta Banik
Publication date: 27 March 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2018.11.040
batch Markovian arrival processfinite- and infinite-buffer queuegated-limited servicepartial batch acceptance strategyvacation(s)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (5)
A detailed note on the finite-buffer queueing system with correlated batch-arrivals and batch-size-/phase-dependent bulk-service ⋮ A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches ⋮ Improving efficiency of service systems by performing a part of the service without the customer's presence ⋮ On the distribution of the number of consecutively lost customers in the \textit{BMAP}/\textit{PH}/1/\textit{N} system ⋮ Analysis of BMAP∕R∕1 Queues Under Gated-Limited Service with the Server’s Single Vacation Policy
Cites Work
- Unnamed Item
- \(M/D^{[y}/1\) periodically gated vacation model and its application to IEEE 802.16 network]
- Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time
- Analysis of a finite-buffer bulk-service queue under Markovian arrival process with batch-size-dependent service
- Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue
- Unified analysis of \(BMAP/G/1\) cyclic polling models
- 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
- Queueing systems with vacations - a survey
- Discrete time analysis of MAP/PH/1 vacation queue with gated time-limited service
- Spectral expansion solution for some finite capacity queues
- Linear independence of root equations for \(M/G/1\) type Markov chains
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)]
- Vacation queueing models. Theory and applications
- New results on the single server queue with a batch markovian arrival process
- Analysis of BMAP/G/1 Vacation Model of Non-M/G/1-Type
- Regenerative Analysis and Steady State Distributions for Markov Chains
- A versatile Markovian point process
- The N/G/1 queue and its detailed analysis
- Characterizations of generalized hyperexponential distribution functions
- A Block-GTH Algorithm for Finding the Stationary Vector of a Markov Chain
- Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP/G/1/N With or Without Vacation(s)
This page was built for publication: Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline
