Terminal pair reliability of tree-type computer communication networks
Ou Yang · 2002
An analysis is presented for computing the terminal pair reliabilities of the two-centered tree (2CT), the X-tree (XT), and the ring-tree (RT). A building block is identified in the 2CT, from which a decomposition algorithm is formulated. Another building block is identified for the XT and RT from which a truss-transformation method and a computational algorithm are obtained. By comparison, it is shown that an XT is a good candidate for applications such as high bandwidth networks with high link reliability.>