Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
From MaRDI portal
Publication:337445
DOI10.1016/j.cor.2014.10.017zbMath1348.90205OpenAlexW1992672503WikidataQ59323786 ScholiaQ59323786MaRDI QIDQ337445
U. C. Gupta, Mohan L. Chaudhry, António Pacheco, Sujit Kumar Samanta
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.10.017
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Performance analysis of a \(GI/D\)-\(MSP/1/\infty\) queueing system under different service phase initiations ⋮ Analysis of the sojourn time distribution for \(M/GL/1\) queue with bulk-service of exactly size \(L\) ⋮ 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] ⋮ Queue-length, waiting-time and service batch size analysis for the discrete-time \(GI/D-MSP^{\text{(a,b)}}/1/\infty\) queueing system ⋮ Two approximations of renewal function for any arbitrary lifetime distribution
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations
- Loss pattern of \(\mathrm{DBMAP}/\mathrm{DMSP}/1/K\) queue and its application in wireless local communications
- Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers
- Analyzing \(GI/E_ r/1\) queues
- Analysis of \(GI^{X}/ M(n)// N\) systems with stochastic customer acceptance policy
- A simple eigenvalue method for low-order D-BMAP/G/1 queues
- Analytic computation schemes for the discrete-time bulk service queue
- ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS
- Robustness of Rootfinding in Single-Server Queueing Models
- Matrix-geometric invariant measures for G/M/l type Markov chains
- Spectral analysis of M/G/1 and G/M/1 type Markov chains
- Imbedded Markov chain analysis of single server bulk queues