Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network

Cancela, Héctor; Khadiri, Mohamed El; Petingi, Louis

doi:10.1109/tr.2011.2170250

Cited by 21 publications

(18 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The above researches on network reliability do not restrict the length of the path. Petingi et al [26] proposed a polynomial-time algorithm for detecting and deleting irrelevant edges that make no difference to the source-to-terminal diameter constrained network reliability. They integrated this algorithm within an exact recursive factorization approach based upon Moskowitz's edge decomposition, conducted on different real-world topologies and confirmed a substantial computational gain.…”

Section: Background and Related Workmentioning

confidence: 99%

Survivability Analysis on a Cyber-Physical System

2017

View full text Add to dashboard Cite

A cyber-physical system (CPS) is composed of interdependent physical-resource and cyber-resource networks that are tightly coupled. The malfunction of nodes in a network may trigger failures to the other network and further cause cascading failures, which would potentially lead to the complete collapse of the entire system. The number and communication of operating nodes at stable state are closely related to the initial failure nodes and the topology of the network system. To address this issue, this paper studies the survivability of CPS in the presence of initial failure nodes, proposes (m, k)-survivability, which is defined as the probability that at least k nodes are still working in CPS after m nodes are attacked, and discusses the problem of cascading failure based on reliability (CFR). Further, we propose an algorithm to calculate (m, k)-survivability and find that the minimum survivability of system with regular allocation strategy decreases with k for a fixed m, and the proportion of initial failure node groups that cause the system to completely fragment increases with m. The simulation shows the properties and the result of CFR of the system with 12 nodes.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Survivability Analysis on a Cyber-Physical System

2017

View full text Add to dashboard Cite

show abstract

“…If we are given a graph, a terminal set (i.e., a node subset), and a positive integer d (called diameter), we want all pairs to be connected by d hops or less, in a hostile environment where link failures occur. We invite the reader to see [3] for a rich discussion on diameter-constrained reliability and its applications, ranging from FTTH to peer-to-peer networks and floodingbased systems.…”

Section: Motivationmentioning

confidence: 99%

Capacitated m Ring Star Problem under Diameter Constrained Reliability

Bayá

Mauttone

Robledo

et al. 2016

Electronic Notes in Discrete Mathematics

View full text Add to dashboard Cite

“…In Definition 3, the expected s,t-path is different from (1). For the expected path with diameter constraint can be rewritten as:…”

Section: The Expected Path For Diameter Constraintmentioning

confidence: 99%

“…Two terminals normally mean source node s, and target node t in V. Lecture [1] consider the model that nodes are perfect, but each edge of G is assigned an independent probability, and called the edge probability. The states of edges are supposed to be independent random variables with either operational state or failed state in network.…”

Section: Introductionmentioning

confidence: 99%

The expected path with diameter constraint in wireless sensor network

Wang

Shao

et al. 2015

2015 IEEE International Conference on Computer and Communications (ICCC)

View full text Add to dashboard Cite

In wireless sensor network, reliability is an important parameter for evaluating the network performance. Recently researches focus on the problem about reliability, message delay and lifetime. In this paper, we consider network reliability based on node imperfect, the expected message delay, and the expected path. Classical method is used to evaluate the network reliability based on an imperfect edge, but in most cases it encounter node-imperfect in wireless sensor network(WSN). We propose the expected path with diameter constraint, and re-evaluate the reliability based on node-imperfect. Next we reconsider an algorithm for detecting and deleting irrelevant nodes in the node-imperfect case for network reliability. Further we discuss the expected path function with the diameter constraint and some properties. Experiments show the efficiency of the proposed algorithm and effectiveness of the model.

show abstract

Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network

Cited by 21 publications

References 24 publications

Survivability Analysis on a Cyber-Physical System

Survivability Analysis on a Cyber-Physical System

Capacitated m Ring Star Problem under Diameter Constrained Reliability

The expected path with diameter constraint in wireless sensor network

Contact Info

Product

Resources

About