Exact perturbation analysis technique and optimal buffer storage design for tandem queueing networks

In this paper, we suggest the exact perturbation analysis(Exact_PA) technique with respect to the buffer storage in tandem queueing networks, through which the optimal buffer storage design problem is considered. The discrete event dynamic equations for the departure time of a customer are presented together with the basic properties of Full Out(FO) and No Input(NI) with respect to the buffer storage. The new perturbation rules with respect to the buffer storage are suggested, from which the exact perturbed path can be obtained. The optimal buffer storage problem is presented by introducing a performance measure consisting of the throughput and the buffer storage cost. An optimization algorithm maximizing this performance measure is derived by using the Exact_PA technique. The proposed perturbation analysis technique and the optimization algorithm are validated by numerical examples.