BDD efficiency: Survey of BDD edge ordering algorithms in network reliability

Aakash Chauhan, Gourav Verma
{"title":"BDD efficiency: Survey of BDD edge ordering algorithms in network reliability","authors":"Aakash Chauhan, Gourav Verma","doi":"10.1002/itl2.525","DOIUrl":null,"url":null,"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.","PeriodicalId":509592,"journal":{"name":"Internet Technology Letters","volume":"149 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Internet Technology Letters","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/itl2.525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.
BDD 效率:网络可靠性中的 BDD 边排序算法调查
网络可靠性分析对于确保网络和通信应用中高效、无差错的通信至关重要。二元判定图(BDD)已成为分析和优化复杂网络基础设施的有力工具。本研究论文的目的是利用 BDD 对网络可靠性的边缘排序算法进行比较分析,旨在评估和比较现有算法,为选择合适的边缘排序算法以提高网络可靠性提供有价值的见解。本文的结论是,在所选算法中,斯诺克的表现更胜一筹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信