Generalization of Pratt's Formula for Dimensioning Circuit-Switched Networks

Abstract The mathematical programming foundation of Pratt's formula for dimensioning circuit-switched networks is presented. The optimality conditions for dimensioning networks are systematically derived and Pratt's formula is generalized in many ways. Two iterative-type network dimensioning algorithms based on the optimality conditions are presented and their effectiveness is shown by numerical examples.