Busy periods for subnetworks in stochastic networks: Mean value analysis

Abstract

The busy period of order n for a subnetwork, which for large n describes heavy traffic periods of that subnetwork, is described for queuing networks. The mean duration of such busy periods and efficient algorithms for computing these quantities are determined. © 1988, ACM. All rights reserved.