Recently, perturbation analysis was proposed for computational efficiency in a simulation approach to dynamic systems. But, studies were restricted in the tandem or classical queueing network.
In this study, the basic principles of the perturbation analysis are introduced and application of this idea is attempted to analyze the sample path of the token ring network with single buffer.
It is argued that the propagation rule of perturbation in the sample path of the token ring network is not identical to that of a classical queueing network. The tableau of event sequences is drawn and the appropriate propagation rule and the corresponding algorithm are suggested for the infinitesimal and finite perturbation, respectively.
