Algorithm for sequential generation of states in failure-prone communication network

An algorithm is presented for sequentially generating the most probable states, in order of decreasing probability, in a failure-prone network, given the failure probability of the components. The developed algorithm is compared with others, regarding its efficiency and memory requirement. Reference is made to a study of the reliability-grade of service of circuit-switched digital urban networks with alternative routing. It is shown that the proposed algorithm is significantly more efficient than other approaches that could be applied to this particular type of problem