A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: GI^[X]/C- MSP /1/
From MaRDI portal
Publication:2014665
DOI10.1007/S10479-015-2026-YzbMATH Open1369.90039DBLPjournals/anor/ChaudhryBP17OpenAlexW2205749379WikidataQ59323783 ScholiaQ59323783MaRDI QIDQ2014665FDOQ2014665
A. Pacheco, M. L. Chaudhry, A. D. Banik
Publication date: 25 August 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-2026-y
Recommendations
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process
- Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
- A note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X]}/ \text{C-MSP} / 1\) queueing system
rootsqueuebatch arrivalgeneral independent arrivalcontinuous time Markovian service process (C-MSP)infinite-bufferlog-normal-Pareto-inter-batch arrival distributionWeibull-
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analytically explicit results for the GI/C-MSP/1/\(\infty \) queueing system using roots
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
- Robustness of Rootfinding in Single-Server Queueing Models
- Title not available (Why is that?)
- New results on the single server queue with a batch markovian arrival process
- On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts
- A single-server queue with server vacations and a class of non-renewal arrival processes
- Markov-modulated processes and semigenerative phenomena
- A simple and complete computational analysis of MAP/R/1 queue using roots
- The stationary characteristics of the G/MSP/\(1/r\) queueing system
- On the application of Rouché's theorem in queueing theory
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process
- Stationary distribution of a finite queue with recurrent input and Markov service
- An algorithm to compute the waiting time distribution for the \(M/G/1\) queue
- The BMAP/GI/1 queue with server set-up times and server vacations
- Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
- Some steady-state distributions for theMAP /SM /1 queue
- Equilibrium probability calculations for a discrete-time bulk queue model
- On the role of Rouché's theorem in queueing analysis
- Supplementary variable method applied to the MAP/G/1 queueing system
- MAP/G/1 QUEUES UNDER N-POLICY WITH AND WITHOUT VACATIONS
- Consecutive customer losses in oscillating \(GI^X/M//n\) systems with state dependent services rates
- Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\)
- Title not available (Why is that?)
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- AG/SM/1queue with vacations depending on service times
- On the discrete‐time queue length distribution under markov‐dependent phases
Cited In (9)
- A note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X]}/ \text{C-MSP} / 1\) queueing system
- Analysis of G-queue with pseudo-fault and multiple working vacations
- Modelling and analysis of \(GI/BMSP/1\) queueing system
- On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system
- Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline
- A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
- Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
Uses Software
This page was built for publication: A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014665)
