Numerical Computation of Sojourn-Time Distributions in Queuing Networks
From MaRDI portal
Recommendations
Cited in
(20)- Means and variances of time averages in Markovian environments
- On queueing network models of flexible manufacturing systems
- Analysis of a three node queueing network
- Further remarks on queueing network theory
- Nonstationary queues with interrupted Poisson arrivals and unreliable/repairable servers
- Numerical computation of response time distributions using stochastic reward nets
- First passage times for Markov renewal processes and applications
- Measurement and optimization of responsiveness in supply chain networks with queueing structures
- scientific article; zbMATH DE number 994727 (Why is no real title available?)
- Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
- An approximation model for sojourn time distributions in acyclic multi-server queueing networks
- A Method for Approximating the Variance of the Sojourn Times in Star-Shaped Queueing Networks
- scientific article; zbMATH DE number 3905611 (Why is no real title available?)
- The exit time finite state projection scheme: bounding exit distributions and occupation measures of continuous-time Markov chains
- scientific article; zbMATH DE number 1424151 (Why is no real title available?)
- Four Canadian Contributions to Stochastic Modeling
- Algorithms for Markov stochastic models
- First passage times for multidimensional denumerable state Markov processes
- Mathematical theory of queueing networks
- A four-input three-stage queuing network approach to model an industrial system
This page was built for publication: Numerical Computation of Sojourn-Time Distributions in Queuing Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3765244)