Network Reliability Analysis Based on ADD under Capacity and Delay Constraints

Evaluating the reliability of weighted networks is an NP-hard problem. In this paper, a symbolic algorithm evaluating the reliability of network under capacity and delay constraints is proposed. First, the weighted network is converted to a symbolic algebraic decision diagrams (ADD) by encoding the...

Full description

Saved in:
Bibliographic Details
Main Authors: Li, Fengying, Liu, Huihui, Jiang, Weiqiang, Dong, Rongsheng
Format: Conference Proceeding
Language:English
Subjects:
algebraic decision diagram
capacity
delay
Delays
Handheld computers
Reactive power
Reliability
Search problems
Weighted network
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Evaluating the reliability of weighted networks is an NP-hard problem. In this paper, a symbolic algorithm evaluating the reliability of network under capacity and delay constraints is proposed. First, the weighted network is converted to a symbolic algebraic decision diagrams (ADD) by encoding the vertices of the network, and the variable ordering are computed by breadth-first search and priority function in order to reduce the size of ADD. Then, edges in minimal paths (MPs) which does not meet the constraint formula of quickest path problem are not visited, leading to a low complexity of the network traversal. Finally, ADD constructed by two custom operators is traversed to compute the network reliability. The computational performance of the proposed algorithm is illustrated through some experimentation with different weighted networks.
ISSN:2573-3311
DOI:10.1109/ICACI.2019.8778617