Estimation of point-to-point traffic demand in the public switched telephone network

The authors present an algorithm for estimating the point-to-point (P-P) traffic demand in the local exchange area of the public switched telephone network. This algorithm can be applied to networks with a sequential, dynamic routing scheme where the routing decisions are updated periodically with period ΔT. The underlying network can be hierarchical or nonhierarchical, and ΔT can range from months to seconds. It is shown that the estimation of P-P traffic demand based on available network measurements (i.e., trunk group measurements and office totals) is equivalent to the solution of a set of linear equations. Moreover, the accuracy of the algorithm is in proportion to the network connectivity