AN IMPROVED ALGORITHM FOR K-TERMINAL PROBABILISTIC NETWORK RELIABILITY ANALYSIS

  • S. Chatterjee Department of Applied Mathematics Indian Institute of Technology (Indian School of Mines), Dhanbad Jharkhand, INDIA
  • Gajendra K. Vishwakarma Department of Applied Mathematics Indian Institute of Technology (Indian School of Mines), Dhanbad Jharkhand, INDIA
  • Venkata Ramana B Department of Applied Mathematics Indian Institute of Technology (Indian School of Mines), Dhanbad Jharkhand, INDIA
  • Aman Verma Department of Applied Mathematics Indian Institute of Technology (Indian School of Mines), Dhanbad Jharkhand, INDIA
Keywords: Minimal Path Set, Binary Decision Diagram, Ordered Binary Decision Diagram, Reduced Ordered Binary Decision Diagram, Variable Ordering Heuristics, Breadth First Search Traversal

Abstract

An optimal variable ordering technique for Reduced Ordered Binary Decision Diagram (ROBDD) has been proposed to solve the network reliability analysis problem for complex communication networks. Several approaches have been proposed in the literature using the static and dynamic variable ordering techniques to solve the terminal network reliability problems. In this paper, the Minimal path set enumeration of the networks using Breadth first search traversal and ROBDD based Sift-reordering technique on manipulating the reliability evaluation is presented. The experimental results are compared with the previous approaches in computational time and number of ROBDD nodes to evaluate the K-terminal network reliability analysis.

 

Downloads

Download data is not yet available.
Published
2017-02-28
Section
Articles