TY - GEN
T1 - A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree
AU - Ding, Wei
AU - Xue, Guoliang
PY - 2010
Y1 - 2010
N2 - Given an unreliable communication network, we seek a most reliable source (MRS) of the network, which maximizes the expected number of nodes that are reachable from it. The problem of computing an MRS in general graphs is #P-hard. However, this problem in tree networks has been solved in a linear time. A tree network has a weakness of low capability of failure tolerance. Embedding rings into it by adding some additional certain edges to it can enhance its failure tolerance, resulting in another class of sparse networks, called the ring-tree networks. This class of network also has an underlying tree-like topology, leading to its advantage of being easily administrated. This paper concerns with an important case whose underlying topology is a strip graph, called λ-rings network, and focuses on an unreliable λ-rings network where each link has an independent operational probability while all nodes are immune to failures. We apply the Divide-and-Conquer approach to design a fast algorithm for computing its an MRS, and employ a binary division tree (BDT) to analyze its time complexity to be O(||λ||22+⌈ log|λ|⌉·||λ||1).
AB - Given an unreliable communication network, we seek a most reliable source (MRS) of the network, which maximizes the expected number of nodes that are reachable from it. The problem of computing an MRS in general graphs is #P-hard. However, this problem in tree networks has been solved in a linear time. A tree network has a weakness of low capability of failure tolerance. Embedding rings into it by adding some additional certain edges to it can enhance its failure tolerance, resulting in another class of sparse networks, called the ring-tree networks. This class of network also has an underlying tree-like topology, leading to its advantage of being easily administrated. This paper concerns with an important case whose underlying topology is a strip graph, called λ-rings network, and focuses on an unreliable λ-rings network where each link has an independent operational probability while all nodes are immune to failures. We apply the Divide-and-Conquer approach to design a fast algorithm for computing its an MRS, and employ a binary division tree (BDT) to analyze its time complexity to be O(||λ||22+⌈ log|λ|⌉·||λ||1).
KW - Divide-and-Conquer algorithm
KW - Most reliable source
KW - ring-tree
KW - underlying topology
UR - http://www.scopus.com/inward/record.url?scp=78650851225&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78650851225&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-17461-2_22
DO - 10.1007/978-3-642-17461-2_22
M3 - Conference contribution
AN - SCOPUS:78650851225
SN - 3642174604
SN - 9783642174605
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 268
EP - 280
BT - Combinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings
T2 - 4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010
Y2 - 18 December 2010 through 20 December 2010
ER -