A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
From MaRDI portal
Publication:2014665
DOI10.1007/s10479-015-2026-yzbMath1369.90039OpenAlexW2205749379WikidataQ59323783 ScholiaQ59323783MaRDI QIDQ2014665
António Pacheco, Mohan L. Chaudhry, Abhijit Datta 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
rootsqueuebatch arrivalgeneral independent arrivalcontinuous time Markovian service process (C-MSP)infinite-bufferlog-normal-Pareto-inter-batch arrival distributionWeibull-
Related Items
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 ⋮ Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline ⋮ Analysis of G-queue with pseudo-fault and multiple working vacations ⋮ A note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X}/ \text{C-MSP} / 1\) queueing system] ⋮ Modelling and analysis of \(GI/BMSP/1\) queueing system ⋮ A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)] ⋮ Analyzing discrete-time \(GI^{[X}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization] ⋮ Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline ⋮ On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
- A simple and complete computational analysis of MAP/R/1 queue using roots
- 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\)
- Stationary distribution of a finite queue with recurrent input and Markov service
- On the role of Rouché's theorem in queueing analysis
- The stationary characteristics of the G/MSP/\(1/r\) queueing system
- Equilibrium probability calculations for a discrete-time bulk queue model
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)]
- On the application of Rouché's theorem in queueing theory
- On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- Analyzing the finite buffer batch arrival queue under Markovian service process: \(\mathrm{GI}^X /\mathrm{MSP}/1/\mathrm{N}\)
- An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
- ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS
- New results on the single server queue with a batch markovian arrival process
- A single-server queue with server vacations and a class of non-renewal arrival processes
- Robustness of Rootfinding in Single-Server Queueing Models
- Supplementary variable method applied to the MAP/G/1 queueing system
- Some steady-state distributions for theMAP /SM /1 queue
- AG/SM/1queue with vacations depending on service times
- MAP/G/1 QUEUES UNDER N-POLICY WITH AND WITHOUT VACATIONS
- The BMAP/GI/1 queue with server set-up times and server vacations
- On the discrete‐time queue length distribution under markov‐dependent phases
- Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process
