Single-moment analysis of unreliable trunk networks employing K-shortest-path routing

An extension to the MKV GOS method, which was originally limited to OOC-SF (originating office control with spill-forward) table-based routing, is described. This extension allows the analysis of networks employing two additional types of routing, K-shortest-disjoint-loopless-path and K-shortest-loopless path. The extended method is then demonstrated by comparing results for the two K-shortest-path routing types in terms of their overall network grade of service for an example network. In addition, the execution time of the method for a series of networks of increasing size is presented