Publication Type : Journal Article
Publisher : Wiley
Url : https://doi.org/10.22541/au.170999570.04216064/v1
Campus : Faridabad
Year : 2024
Abstract : Network reliability analysis is vital for ensuring efficient and error-free communication within networking and communication applications. Binary Decision Diagrams (BDDs) have emerged as a powerful tool for analyzing and optimizing complex network infrastructures. The objective of this research paper is to conduct a comparative analysis of edge-ordering algorithms for network reliability using BDDs the study aims to evaluate and compare existing algorithms, providing valuable insights for selecting suitable edge-ordering algorithms that enhance network reliability. The paper concludes that snooker is outperforming among selected algorithms.
Cite this Research Publication : Aakash Chauhan, Gourav Verma, BDD Efficiency: Survey of BDD Edge Ordering Algorithms in Network Reliability, null, Wiley, 2024, https://doi.org/10.22541/au.170999570.04216064/v1