Reliability Analysis of Tree Networks Applied to Balanced Content Replication

Mugurel Ionut Andreica (1) , Nicolae Tapus (1)

1 Parallel and Distributed Systems Laboratory [Bucarest]

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(V*k) algorithm solving the k-equitable coloring problem on trees with V vertices, based on a hierarchy of color relabeling permutations.

Mots clés: balanced content replication; fault tolerance; optimal linear time algorithm; reliability analysis; tree networks; tree topologies; unrestricted vertex multicut problem

Domaines: Algorithme et structure de données [cs.DS]; Calcul parallèle, distribué et partagé [cs.DC]

Mugurel Ionut Andreica, Nicolae Tapus. Reliability Analysis of Tree Networks Applied to Balanced Content Replication. IEEE International Conference on Automation, Quality and Testing, Robotics (THETA 16) (AQTR), May 2008, Cluj-Napoca, Romania. pp.79-84, ⟨10.1109/AQTR.2008.4588711⟩. ⟨hal-00793908⟩