Transient Queueing Analysis

The exact distribution of the nth customer's sojourn time in an M/M/s queue with k customers initially present is derived. Algorithms for computing the covariance between sojourn times for an M/M/1 queue with k customers present at time 0 are also developed. Maple computer code is developed for practical application of transient queue analysis for many system measures of performance without regard to traffic intensity (i.e., the system may be unstable with traffic intensity greater than 1).