A note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X]}/ \text{C-MSP} / 1\) queueing system
From MaRDI portal
Publication:1733133
DOI10.1155/2018/7462439zbMath1431.60111OpenAlexW2889233420MaRDI QIDQ1733133
James J. Kim, Abhijit Datta Banik, Mohan L. Chaudhry
Publication date: 21 March 2019
Published in: Journal of Probability and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/7462439
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new method for finding the characteristic roots of \(E_{n }/E_{m }/1\) queues
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)]
- Sojourn-time distribution of the \(G I/M S P/1\) queueing system
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
- Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots
- A single-server queue with server vacations and a class of non-renewal arrival processes
- A versatile Markovian point process
- The N/G/1 queue and its detailed analysis
This page was built for publication: A note on the waiting-time distribution in an infinite-buffer \(\text{GI}^{[X]}/ \text{C-MSP} / 1\) queueing system
