Realization probability in multi-class closed queueing networks

DOI10.1016/0377-2217(88)90132-4zbMath0658.90038OpenAlexW1973826663MaRDI QIDQ1111919

Xi-Ren Cao

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90132-4

zbMATH Keywords

performancesimulationmulti-class queueing networksPerturbation analysismean service timesrealization probabilitysample derivativesystem throughput

Mathematics Subject Classification ID

Sensitivity (robustness) (93B35) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Deterministic network models in operations research (90B10) Sample path properties (60G17) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Sensitivity calculation of the throughput of an FMS with rspect to the routing mix using perturbation analysis

Cites Work

• Perturbation analysis and optimization of queueing networks
• Realization probability in closed Jackson queueing networks and its application
• First-order perturbation analysis of a simple multi-class finite source queue
• Unnamed Item

This page was built for publication: Realization probability in multi-class closed queueing networks