Analytic and computational analysis of the discrete-time GI/D-MSP/1 queue using roots
From MaRDI portal
(Redirected from Publication:337445)
Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
Recommendations
- Analytically explicit results for the GI/C-MSP/1/\(\infty \) queueing system using roots
- Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers
- scientific article; zbMATH DE number 98645
- Alternative Numerical Solutions of Stationary Queueing-Time Distributions in Discrete-Time Queues: GI/G/1
- A simple and complete computational analysis of MAP/R/1 queue using roots
Cites work
- scientific article; zbMATH DE number 3522951 (Why is no real title available?)
- scientific article; zbMATH DE number 3532286 (Why is no real title available?)
- scientific article; zbMATH DE number 3892339 (Why is no real title available?)
- A first course in stochastic models.
- A simple eigenvalue method for low-order D-BMAP/G/1 queues
- Analysis of \(GI^{X}/ M(n)// N\) systems with stochastic customer acceptance policy
- Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers
- Analytic computation schemes for the discrete-time bulk service queue
- Analytically explicit results for the GI/C-MSP/1/\(\infty \) queueing system using roots
- Analyzing \(GI/E_ r/1\) queues
- Imbedded Markov chain analysis of single server bulk queues
- Loss pattern of \(\mathrm{DBMAP}/\mathrm{DMSP}/1/K\) queue and its application in wireless local communications
- Matrix-geometric invariant measures for G/M/l type Markov chains
- Robustness of Rootfinding in Single-Server Queueing Models
- Spectral analysis of M/G/1 and G/M/1 type Markov chains
- Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations
Cited in
(15)- On exact computational analysis of distributions of numbers in systems for \(M/G/1/N+1\) and \(GI/M/1/N+1\) queues using roots
- Two approximations of renewal function for any arbitrary lifetime distribution
- Analytically explicit results for the GI/C-MSP/1/\(\infty \) queueing system using roots
- Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers
- Analyzing discrete-time \(GI^{[X]}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- scientific article; zbMATH DE number 98645 (Why is no real title available?)
- Modelling and analysis of \(GI/BMSP/1\) 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
- 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\)
- A simple and complete computational analysis of MAP/R/1 queue using roots
- Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- Robustness of Rootfinding in Single-Server Queueing Models
This page was built for publication: Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337445)
