TY - GEN
T1 - A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges
AU - Ding, Wei
AU - Xue, Guoliang
PY - 2011
Y1 - 2011
N2 - Given an unreliable communication network, we aim to find a most reliable source (MRS) on the network, which maximizes the expected number of nodes that are reachable from it. Although the problem of finding an MRS on general graphs is #P-hard, it is tractable in several types of sparse graphs. The ring-tree graph is such a kind of sparse graph that not only has the capability of failure tolerance but also holds an underlying tree topology which facilitates network administration. In this paper, we are concerned with unreliable general ring-tree graphs in which each edge has an independent operational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.
AB - Given an unreliable communication network, we aim to find a most reliable source (MRS) on the network, which maximizes the expected number of nodes that are reachable from it. Although the problem of finding an MRS on general graphs is #P-hard, it is tractable in several types of sparse graphs. The ring-tree graph is such a kind of sparse graph that not only has the capability of failure tolerance but also holds an underlying tree topology which facilitates network administration. In this paper, we are concerned with unreliable general ring-tree graphs in which each edge has an independent operational probability while all nodes are immune to failures. We first design a complementary dynamic programming algorithm and then develop a parallel algorithm based on the underlying tree for finding an MRS on the network.
KW - Most reliable source
KW - complementary dynamic programming
KW - general ring-tree graph
KW - parallel algorithm
UR - http://www.scopus.com/inward/record.url?scp=80051954604&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80051954604&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-22616-8_9
DO - 10.1007/978-3-642-22616-8_9
M3 - Conference contribution
AN - SCOPUS:80051954604
SN - 9783642226151
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 98
EP - 112
BT - Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Proceedings
T2 - 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
Y2 - 4 August 2011 through 6 August 2011
ER -