By Topic

Reliability analysis of tree networks applied to balanced content replication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mugurel Ionut Andreica ; Polytechnic University of Bucharest, Romania ; Nicolae Tapus

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.

Published in:

Automation, Quality and Testing, Robotics, 2008. AQTR 2008. IEEE International Conference on  (Volume:1 )

Date of Conference:

22-25 May 2008