A memory efficient algorithm for network reliability
MetadataShow full item record
We combine the Augmented Ordered Binary Decision Diagram (OBDD-A) with the use of boundary sets to create a method for computing the exact K-terminal or all-terminal reliability of an undirected network with failed edges and perfect vertices. We present the results of implementing this algorithm and show that the execution time is comparable with the state of the art and the space requirement is greatly reduced. Indeed the space remains constant when networks increase in size but maintain their structure and maximum boundary set size; with the same amount of memory used for computing a 312 and a 31000 grid network.
Showing items related by title, author, creator and subject.
Khanna, G.; Chaturvedi, S.; Soh, Sie Teng (2019)Opportunistic multihop networks with mobile relays recently have drawn much attention from researchers across the globe due to their wide applications in various challenging environments. However, because of their peculiar ...
Lin, GongQi; Soh, Sieteng; Chin, K. (2015)Current network infrastructures are over-provisioned to increase their resilience against resource failures. Such strategies exhibit poor energy efficiency during off-peak periods. In this respect, energy aware Traffic ...
Lin, Gongqi; Soh, Sieteng; Chin, K.; Lazarescu, Mihai (2013)Current network infrastructures are over-provisioned to increase their resilience against resource failures, e.g., bundled links and nodes, as well as congestion during peak hours. However such strategies waste resources ...