Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues

DOI10.1155/2019/6480139zbMath1437.90046OpenAlexW2971459170MaRDI QIDQ2175386

Mohan L. Chaudhry, James J. Kim, Abhijit Datta Banik

Publication date: 29 April 2020

Published in: Journal of Probability and Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/6480139

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Uses Software

• QROOT

Cites Work

• 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
• A comparative numerical study of the spectral theory approach of Nishimura and the roots method based on the analysis of \(\mathrm{BDMMAP}/\mathrm{G}/1\) queue
• A note on some relations in the queue \(GI^ X/M/c\)
• Delay and partial system contents for a discrete-time G-D-c queue
• Analyzing the discrete-time \(G^{(G)}/Geo/1\) queue using complex contour integration
• Queue-length and waiting-time distributions of discrete-time \(\text{GI}^X/\text{Geom}/1\) queueing systems with early and late arrivals
• Discrete-time multiserver queues with geometric service times.
• Analytically simple and computationally efficient solution to $\mathrm{GI}^{\mathrm{X}}/\mathrm{Geom}/1$ queues involving heavy-tailed distributions
• Applying formal methods: testing, performance, and M/E-commerce. FORTE 2004 workshops the FormEMC, EPEW, ITM, Toledo, Spain, October 1--2, 2004. Proceedings
• Analytic computation schemes for the discrete-time bulk service queue
• Computing Loss Probabilities in Discrete-Time Queues
• Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis
• Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GI^X/Geom/m
• Robustness of Rootfinding in Single-Server Queueing Models
• The GI/Geom/N Queue In Discrete Time
• Discrete-time heavy-tailed chains, and their properties in modeling network traffic
• Performance analysis of the discrete-time GI/Geom/1/N queue

This page was built for publication: Analytically simple and computationally efficient results for the \(GI^X/ Geo /c\) queues