A study of departure process on the open and nested population constrained tandem queueing network with constant service times

In this paper, we consider the departure process from the open and nested tandem queueing network with population constraint and constant service times. It is known that the queueing network can be transformed into a simple queueing network which can be easy to analyze. Using this simple queueing network, upper and lower bounds on the interdeparture time are obtained. We prove that the variance of the interdeparture time is bounded within these two bounds. Validation against simulation data is shown that how it works the variance of the interdeparture time within two bounds. These bounds can be applied to obtain the better variance of the interdeparture time using a suitable method.