A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges

Wei Ding, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages98-112
Number of pages15
Volume6831 LNCS
DOIs
StatePublished - 2011
Event5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 - Zhangjiajie, China
Duration: Aug 4 2011Aug 6 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6831 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
CountryChina
CityZhangjiajie
Period8/4/118/6/11

Fingerprint

Dynamic programming
Parallel algorithms
Parallel Algorithms
Fast Algorithm
Telecommunication networks
Topology
Ring
Sparse Graphs
Graph in graph theory
Vertex of a graph
Communication Networks
Dynamic Programming
Tolerance
Maximise

Keywords

  • complementary dynamic programming
  • general ring-tree graph
  • Most reliable source
  • parallel algorithm

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ding, W., & Xue, G. (2011). A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6831 LNCS, pp. 98-112). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS). https://doi.org/10.1007/978-3-642-22616-8_9

A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges. / Ding, Wei; Xue, Guoliang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS 2011. p. 98-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ding, W & Xue, G 2011, A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6831 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6831 LNCS, pp. 98-112, 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011, Zhangjiajie, China, 8/4/11. https://doi.org/10.1007/978-3-642-22616-8_9
Ding W, Xue G. A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS. 2011. p. 98-112. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22616-8_9
Ding, Wei ; Xue, Guoliang. / A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS 2011. pp. 98-112 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{889f50ff34ae4ef8990fe1ada5fc2017,
title = "A fast parallel algorithm for finding a most reliable source on a general ring-tree graph with unreliable edges",
abstract = "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.",
keywords = "complementary dynamic programming, general ring-tree graph, Most reliable source, parallel algorithm",
author = "Wei Ding and Guoliang Xue",
year = "2011",
doi = "10.1007/978-3-642-22616-8_9",
language = "English (US)",
isbn = "9783642226151",
volume = "6831 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "98--112",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

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 - complementary dynamic programming

KW - general ring-tree graph

KW - Most reliable source

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

VL - 6831 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 98

EP - 112

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -