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

DOI10.1016/j.cor.2021.105564OpenAlexW3203248446MaRDI QIDQ2669671

Sabine Wittevrongel, Herwig Bruneel, Mohan L. Chaudhry, Abhijit Datta Banik

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105564

zbMATH Keywords

rootsmulti-serverrenewal inputbatch Markovian arrival processbatch arrival queuedeterministic service timeinfinite-buffer

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

An extended queueing model for vehicles at signalized intersections considering the platoon correlated arrivals

Uses Software

• MCQueue
• QROOT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
• Nonidentifiability of the two-state BMAP
• Calculation of delay characteristics for multiserver queues with constant service times
• Steady state solution of the \(E^ k/D/r\) queueing model
• Analysis of discrete-time multiserver queueing models with constant service times
• On lattice reduction for polynomial matrices
• A complete and simple solution for a discrete-time multi-server queue with bulk arrivals and deterministic service times.
• A simple solution for the M/D/c waiting time distribution
• Decomposition of an M/D/rk queue with FIFO into kE//k/D/r queues with FIFO
• 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 \)]
• 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/∞
• Computing the Distribution for the Number of Renewals with Bulk Arrivals
• Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots
• STATIONARY WAITING TIME DISTRIBUTION IN A GI/E_k/m QUEUE
• New results on the single server queue with a batch markovian arrival process
• The queue GI/H_m/s in continuous time
• Regenerative Analysis and Steady State Distributions for Markov Chains
• Nonlinear Matrix Equations in Applied Probability—Solution Techniques and Open Problems
• A stable recursion for the steady state vector in markov chains of m/g/1 type
• Computational analysis of single-server bulk-service queues, M/G^Y/ 1
• A versatile Markovian point process
• The N/G/1 queue and its detailed analysis
• Robustness of Rootfinding in Single-Server Queueing Models
• Numerical Issues in Computing Steady-State Queueing-Time Distributions of Single-Server Bulk-Service Queues: M/Gb/1 and M/Gd/1
• Moment formulas for the Markov renewal branching process
• Some steady-state distributions for theMAP /SM /1 queue
• Algorithmic analysis of the BMAP/D/k system in discrete time
• A simple approach to the map/d/s queue
• Spectral analysis of M/G/1 and G/M/1 type Markov chains
• THE M^X/D/c BATCH ARRIVAL QUEUE

This page was built for publication: 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