Telecommunication networks often have structures that can be leveraged for efficient modeling, yet often are not; and these networks require analyses considering measures of performance beyond what most research enables. In this paper, we take advantage of that structure to show how we can make any path search algorithm more efficient, and apply those results in an extended measure of service and network performance which includes probabilistic measures including reliability, availability, and normalized performability. We further extend to a measure for comparison of networks which relates the correlation of connection points on the network, and show why the measure and comparison is widely useful. The work presented in this paper is easy to understand and apply to a broad range of Information and Communications Technology network design problems and approaches in use.
['Jason W. Rupe']
Network Nodal Independence, Hierarchical Path Search, and Model Reuse for Network Availability Computation