Realization probability in multi-class closed queueing networks
From MaRDI portal
performancesimulationmulti-class queueing networksPerturbation analysismean service timesrealization probabilitysample derivativesystem throughput
Deterministic network models in operations research (90B10) Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Sensitivity (robustness) (93B35) Sample path properties (60G17) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Recommendations
- Realization probability in closed Jackson queueing networks and its application
- Realization probabilities. The dynamics of queuing systems
- On the asymptotic behaviour of closed multiclass queueing networks
- Asymptotic analysis for closed multiclass queueing networks in critical usage
- Asymptotic analysis of multiple class queueing networks
- Asymptotic Approximations for a Queueing Network with Multiple Classes
- The static property of a perturbed multiclass closed queueing network and decomposition
- On a class of approximations for closed queueing networks
- Statistics of a Markov closed queueing network
Cites work
Cited in
(6)- The convergence property of sample derivatives in closed Jackson queueing networks
- Sensitivity calculation of the throughput of an FMS with rspect to the routing mix using perturbation analysis
- Realization probability and throughput sensitivity in a closed jackson network
- scientific article; zbMATH DE number 3876897 (Why is no real title available?)
- A Sample Performance Function of Closed Jackson Queueing Networks
- Realization probability in closed Jackson queueing networks and its application
This page was built for publication: Realization probability in multi-class closed queueing networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1111919)