The Factorization of Queueing Equations and Their Interpretation
From MaRDI portal
Recommendations
- On the distribution of the number of calls in the \(D_\eta/D_{\xi}^{k}/1\) queueing system
- A polynomial factorization approach for the discrete time \(\text{GI}^X/ \text{G}/1/K\) queue
- scientific article; zbMATH DE number 1424147
- On differential equations arising in the theory of processor sharing queues
- An algorithmic approach for a special class of Markov chains
Cited in
(10)- Numerical solution for the departure process from the GI/G/1 queue
- Using state reduction for computing steady state vectors in Markov chains of \(M/G/1\) type
- Optimizing steady state Markov chains by state reduction
- Computational analysis of steady-state probabilities of \(M/G^{a,b}/1\) and related nonbulk queues
- On the distribution of the number of calls in the \(D_\eta/D_{\xi}^{k}/1\) queueing system
- Numerical computation of mean passage times and absorption probabilities in Markov and Semi-Markov models
- Multiple roots in some equations of queueing theory
- A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails
- A polynomial factorization approach for the discrete time \(\text{GI}^X/ \text{G}/1/K\) queue
- Duality properties of a one-dimensional random walk and a new computational algorithm
This page was built for publication: The Factorization of Queueing Equations and Their Interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3684962)
