一种计算电信网络故障频率的有效分解算法

M. Hayashi, T. Abe
{"title":"一种计算电信网络故障频率的有效分解算法","authors":"M. Hayashi, T. Abe","doi":"10.1109/RAMS.2004.1285432","DOIUrl":null,"url":null,"abstract":"This paper proposes and efficient algorithm for computing the failure frequencies of telecommunications networks. The proposed method is based on a special modification that transforms the formula for computing the reliability into a formula that also gives the failure frequency. A number of algorithms have been produced, and the factoring algorithm has been shown to be the most efficient. This algorithm has not yet been transformed, because its graph operations contraction and deletion of a link produce complicated expressions in the failure-frequency case. A new matrix-style decomposition formula is derived in this paper, and allows us to transform the factoring algorithm into an algorithm that gives failure frequency as well as reliability. Some numerical examples show that this new algorithm simultaneously computes both measures with high efficiency.","PeriodicalId":270494,"journal":{"name":"Annual Symposium Reliability and Maintainability, 2004 - RAMS","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An efficient factoring algorithm for computing the failure-frequencies of telecommunications networks\",\"authors\":\"M. Hayashi, T. Abe\",\"doi\":\"10.1109/RAMS.2004.1285432\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes and efficient algorithm for computing the failure frequencies of telecommunications networks. The proposed method is based on a special modification that transforms the formula for computing the reliability into a formula that also gives the failure frequency. A number of algorithms have been produced, and the factoring algorithm has been shown to be the most efficient. This algorithm has not yet been transformed, because its graph operations contraction and deletion of a link produce complicated expressions in the failure-frequency case. A new matrix-style decomposition formula is derived in this paper, and allows us to transform the factoring algorithm into an algorithm that gives failure frequency as well as reliability. Some numerical examples show that this new algorithm simultaneously computes both measures with high efficiency.\",\"PeriodicalId\":270494,\"journal\":{\"name\":\"Annual Symposium Reliability and Maintainability, 2004 - RAMS\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annual Symposium Reliability and Maintainability, 2004 - RAMS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAMS.2004.1285432\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Symposium Reliability and Maintainability, 2004 - RAMS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAMS.2004.1285432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了一种计算电信网络故障频率的有效算法。该方法是基于一种特殊的修正,将计算可靠性的公式转化为同时给出故障频率的公式。已经产生了许多算法,而因数分解算法已被证明是最有效的。由于该算法的图运算在故障频次情况下,链路的收缩和删除会产生复杂的表达式,因此尚未对其进行变换。本文导出了一种新的矩阵式分解公式,使我们能够将分解算法转化为给出故障频率和可靠性的算法。数值算例表明,该算法能有效地同时计算两个度量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An efficient factoring algorithm for computing the failure-frequencies of telecommunications networks
This paper proposes and efficient algorithm for computing the failure frequencies of telecommunications networks. The proposed method is based on a special modification that transforms the formula for computing the reliability into a formula that also gives the failure frequency. A number of algorithms have been produced, and the factoring algorithm has been shown to be the most efficient. This algorithm has not yet been transformed, because its graph operations contraction and deletion of a link produce complicated expressions in the failure-frequency case. A new matrix-style decomposition formula is derived in this paper, and allows us to transform the factoring algorithm into an algorithm that gives failure frequency as well as reliability. Some numerical examples show that this new algorithm simultaneously computes both measures with high efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信