A linear time algorithm for computing the most reliable source on a tree with faulty vertices

Wei Ding, Guoliang Xue

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

Abstract

Given an unreliable communication network, we seek for determining a vertex from the network, the expected number of vertices which connects to is maximum. Such vertex is named the most reliable source (MRS) on the network. The communication failures may occur to links or vertices of the network. The case was generally studied, where no failure happens to each vertex and each link has an independent operational probability. Practically, failures frequently happen to the vertices, including the transmitting fault and receiving fault. Recently, another case is proposed, where each link is steady and each vertex has an independent transmitting probability and receiving probability, and an O(n2)time algorithm is presented for computing the MRS on such tree networks with n vertices. In this paper, we propose a faster algorithm for this case, whose time complexity is O(n).

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages14-23
Number of pages10
Volume5573 LNCS
DOIs
StatePublished - 2009
Event3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009 - Huangshan, China
Duration: Jun 10 2009Jun 12 2009

Publication series

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

Other

Other3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009
CountryChina
CityHuangshan
Period6/10/096/12/09

Fingerprint

Linear-time Algorithm
Computing
Vertex of a graph
Fault
Tree Networks
Telecommunication networks
Communication Networks
Fast Algorithm
Time Complexity
Communication

Keywords

  • Most reliable source
  • Receiving probability
  • Transmitting probability

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Ding, W., & Xue, G. (2009). A linear time algorithm for computing the most reliable source on a tree with faulty vertices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5573 LNCS, pp. 14-23). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5573 LNCS). https://doi.org/10.1007/978-3-642-02026-1_2

A linear time algorithm for computing the most reliable source on a tree with faulty vertices. / Ding, Wei; Xue, Guoliang.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5573 LNCS 2009. p. 14-23 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5573 LNCS).

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

Ding, W & Xue, G 2009, A linear time algorithm for computing the most reliable source on a tree with faulty vertices. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 5573 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5573 LNCS, pp. 14-23, 3rd International Conference on Combinatorial Optimization and Applications, COCOA 2009, Huangshan, China, 6/10/09. https://doi.org/10.1007/978-3-642-02026-1_2
Ding W, Xue G. A linear time algorithm for computing the most reliable source on a tree with faulty vertices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5573 LNCS. 2009. p. 14-23. (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-02026-1_2
Ding, Wei ; Xue, Guoliang. / A linear time algorithm for computing the most reliable source on a tree with faulty vertices. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5573 LNCS 2009. pp. 14-23 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{5db091c29d454b5088cd7987ad6b84b0,
title = "A linear time algorithm for computing the most reliable source on a tree with faulty vertices",
abstract = "Given an unreliable communication network, we seek for determining a vertex from the network, the expected number of vertices which connects to is maximum. Such vertex is named the most reliable source (MRS) on the network. The communication failures may occur to links or vertices of the network. The case was generally studied, where no failure happens to each vertex and each link has an independent operational probability. Practically, failures frequently happen to the vertices, including the transmitting fault and receiving fault. Recently, another case is proposed, where each link is steady and each vertex has an independent transmitting probability and receiving probability, and an O(n2)time algorithm is presented for computing the MRS on such tree networks with n vertices. In this paper, we propose a faster algorithm for this case, whose time complexity is O(n).",
keywords = "Most reliable source, Receiving probability, Transmitting probability",
author = "Wei Ding and Guoliang Xue",
year = "2009",
doi = "10.1007/978-3-642-02026-1_2",
language = "English (US)",
isbn = "3642020259",
volume = "5573 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "14--23",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A linear time algorithm for computing the most reliable source on a tree with faulty vertices

AU - Ding, Wei

AU - Xue, Guoliang

PY - 2009

Y1 - 2009

N2 - Given an unreliable communication network, we seek for determining a vertex from the network, the expected number of vertices which connects to is maximum. Such vertex is named the most reliable source (MRS) on the network. The communication failures may occur to links or vertices of the network. The case was generally studied, where no failure happens to each vertex and each link has an independent operational probability. Practically, failures frequently happen to the vertices, including the transmitting fault and receiving fault. Recently, another case is proposed, where each link is steady and each vertex has an independent transmitting probability and receiving probability, and an O(n2)time algorithm is presented for computing the MRS on such tree networks with n vertices. In this paper, we propose a faster algorithm for this case, whose time complexity is O(n).

AB - Given an unreliable communication network, we seek for determining a vertex from the network, the expected number of vertices which connects to is maximum. Such vertex is named the most reliable source (MRS) on the network. The communication failures may occur to links or vertices of the network. The case was generally studied, where no failure happens to each vertex and each link has an independent operational probability. Practically, failures frequently happen to the vertices, including the transmitting fault and receiving fault. Recently, another case is proposed, where each link is steady and each vertex has an independent transmitting probability and receiving probability, and an O(n2)time algorithm is presented for computing the MRS on such tree networks with n vertices. In this paper, we propose a faster algorithm for this case, whose time complexity is O(n).

KW - Most reliable source

KW - Receiving probability

KW - Transmitting probability

UR - http://www.scopus.com/inward/record.url?scp=70350650359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350650359&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02026-1_2

DO - 10.1007/978-3-642-02026-1_2

M3 - Conference contribution

AN - SCOPUS:70350650359

SN - 3642020259

SN - 9783642020254

VL - 5573 LNCS

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

SP - 14

EP - 23

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

ER -