Daduna, Hans Busy periods for subnetworks in stochastic networks: mean value analysis. (English) Zbl 0647.60101 J. Assoc. Comput. Mach. 35, No. 3, 668-674 (1988). Busy period duration of order \(n\geq 1\) for a subnetwork is defined as the time between the instant a customer arrives at the subnetwork and finds n-1 other customers in it and the next time instant when by a departure from the subnetwork there remain fewer than n customers in it. The expectation b(n,I) of the busy period duration of order n for a subnetwork I is determined in closed as well as in open networks. It is shown that the well-known algorithms of performance analysis can be applied for an efficient evaluation of this important network characteristic. The given method is applicable for load-dependent service rates and in any product-form network in which multiple chains of customers, time- dependent nonexponential service time distributions, etc. occur. Reviewer: J.Tanko MSC: 60K25 Queueing theory (aspects of probability theory) 60K20 Applications of Markov renewal processes (reliability, queueing networks, etc.) 94C99 Circuits, networks Keywords:Busy period duration; subnetwork; open networks; network characteristic; load-dependent service rates; time-dependent nonexponential service time distributions PDFBibTeX XMLCite \textit{H. Daduna}, J. Assoc. Comput. Mach. 35, No. 3, 668--674 (1988; Zbl 0647.60101) Full Text: DOI