On maximizing tree reliability based on minimum diameter spanning tree

For communications networks, reliability is a crucial problem to provide stable services. Hence, this paper defines Maximum Availability Tree (MAT) problem that aims at composing the most reliable tree network in terms of terminal reliability. Our work indicates that MAT problem is converted to Minimum Diameter Spanning Tree (MDST) problem by modeling a network with a probabilistic graph whose edges are assigned probability indicating operability of corresponding communications links. The simulation results demonstrate that MAT improves reliability of communications between any pair of nodes in an obtained network.