A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree

Wei Ding, Guoliang Xue

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

1 Scopus citations

Abstract

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).

Original languageEnglish (US)
Title of host publicationCombinatorial Optimization and Applications - 4th International Conference, COCOA 2010, Proceedings
Pages268-280
Number of pages13
EditionPART 2
DOIs
StatePublished - Dec 1 2010
Event4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010 - Kailua-Kona, HI, United States
Duration: Dec 18 2010Dec 20 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume6509 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2010
CountryUnited States
CityKailua-Kona, HI
Period12/18/1012/20/10

Keywords

  • Divide-and-Conquer algorithm
  • Most reliable source
  • ring-tree
  • underlying topology

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A divide-and-conquer algorithm for computing a most reliable source on an unreliable ring-embedded tree'. Together they form a unique fingerprint.

Cite this