The basic concepts of perturbation analysis of queueing networks with general service time distributions

Perturbation analysis of closed queuing networks with nonexponential service time distributions is considered. Perturbation analysis formulas using realization probabilities are extended to these networks. A perturbation generation function, which generalizes the perturbation generation rule, is defined; equations for realization probability and formulas for sensitivity of the system throughput with respect to service time distribution parameters are obtained. The results justify the application of perturbation analysis algorithms to networks with general service time distributions