A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method:GI/C-MSP(a,b)/1/∞

DOI10.1051/RO/2015035zbMath1356.60143DBLPjournals/rairo/ChaudhryBPG16OpenAlexW2403201640WikidataQ59323768 ScholiaQ59323768MaRDI QIDQ2826663

Mohan L. Chaudhry, Souvik Ghosh, António Pacheco, Abhijit Datta Banik

Publication date: 18 October 2016

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015035

zbMATH Keywords

general bulk service rulegeneral independent arrivalinfinite bufferbatch service queuecontinuous-time Markovian service process

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on discrete state spaces (60J27) Applications of continuous-time Markov processes on discrete state spaces (60J28)

Related Items (7)

Stationary analysis and optimal control under multiple working vacation policy in a \(\mathrm{GI/M}^{(a,b)}/1\) queue ⋮ Extended analysis and computationally efficient results for the GI/Ma,b/1 queueing system ⋮ 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 ⋮ A discrete-time \(GI^X/Geo/1\) queue with multiple working vacations under late and early arrival system ⋮ On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system ⋮ Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system ⋮ Analysis of a queueing model with batch Markovian arrival process and general distribution for group clearance

Uses Software

• QPACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A simple and complete computational analysis of MAP/R/1 queue using roots
• Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue
• Analyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queues
• Modelling and analysis of \(M/G^{a,b}/1/N\) queue -- A simple alternative approach
• Performance analysis of a batch service queue arising out of manufacturing system modelling
• On lattice reduction for polynomial matrices
• The stationary characteristics of the G/MSP/\(1/r\) queueing system
• On the finite-buffer bulk-service queue with general independent arrivals: \(GI/M^{[b}/1/N\)]
• Analysis of a finite MAP/\(G\)/1 queue with group services
• Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
• ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS
• Spectral expansion solution for a class of Markov models: application and comparison with the matrix-geometric method
• A Fast Newton's Iteration for M/G/1-Type and GI/M/1-Type Markov Chains
• 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
• Finite-Buffer Bulk Service Queue Under Markovian Service Process:GI/MSP^(a,b)/1/N
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
• A versatile Markovian point process
• Robustness of Rootfinding in Single-Server Queueing Models
• Moment formulas for the Markov renewal branching process
• Arrival and departure state distributions in the general bulk-service queue
• Some steady-state distributions for theMAP /SM /1 queue
• Characterizations of generalized hyperexponential distribution functions
• G/M^<a, b>/1 QUEUES WITH SERVER VACATIONS
• On the discrete‐time queue length distribution under markov‐dependent phases
• Analysis of the MAP/G\(^{a,b}\)/1/N queue

This page was built for publication: A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method:GI/C-MSP^(a,b)/1/∞