Journal of Applied Mathematics and Stochastic Analysis 
Volume 4 (1991), Issue 2, Pages 111-116
doi:10.1155/S1048953391000072

On network flow equations and splitting formulas for Sojourn times in queueing networks

Hans Daduna

Institut füt Mathematische Stochastik, Universität Hamburg, Bundesstraße 55, Hamburg 13 D-2000, Germany

Received 1 April 1990; Revised 1 January 1991

Abstract

LEMOINE's network flow equations are generalized to the case of multiserver networks. These equations provide a basis for recursive evaluation of residual conditional sojourn time moments.