Reliability analysis of tree networks applied to balanced content replication

The fault tolerance of the communication topology of a distributed system is a very important feature which needs to be analyzed carefully. In this paper we propose a new reliability metric for tree topologies, based on the unrestricted vertex multicut problem on trees, for which we present the first optimal linear time algorithm. We present evaluation results of the reliability metric on tree networks used for balanced content replication. For this problem, we also developed a new O(nmiddotk) algorithm solving the k-equitable coloring problem on trees, based on a hierarchy of color relabeling permutations.