loading page

BDD Efficiency: Survey of BDD Edge Ordering Algorithms in Network Reliability
  • Aakash Chauhan,
  • Gourav Verma
Aakash Chauhan
Graphic Era Deemed to be University

Corresponding Author:[email protected]

Author Profile
Gourav Verma
Graphic Era Deemed to be University
Author Profile

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.
29 Jan 2024Submitted to Internet Technology Letters
29 Jan 2024Assigned to Editor
29 Jan 2024Submission Checks Completed
29 Jan 2024Review(s) Completed, Editorial Evaluation Pending
30 Jan 2024Reviewer(s) Assigned