In this paper, we extend our previous work on the "sizing" of network throughput capability, subject ot constraints on blocking probability. We investigate an alternative form of the Qos constraint, which is based on the average blocking probability over all circuits rather than the maximum blocking probability over the individual circuits. We demonstrate that use of the P sub av criterion provides higher throughput andfaster and more-reliable ocnvergence than use ofthe P sub max crierion. Also, use of the P sub avcriterion can be sueful for proivding an "initial condition" for the solution of the P sub max problem.
展开▼
