Conjectured Upper Bounds on Transient Mean Total Waiting Times in Queuing Networks

Abstract

In this paper, we give conjectured upper bounds on transient total mean waiting times for jobs in initially idle single source open Jackson networks. If true, these upper bounds provide lower bounds on the time required for the transient mean to approach its steady-state value. We compute the bounds by a weighted sum of transient means from a network de- composition, and we graphically display bound performance for five and fifty node networks.