首页> 外文会议>Annual Reliability and Maintainability Symposium >An efficient factoring algorithm for computing the failure-frequencies of telecommunications networks
【24h】

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.
机译:本文提出了高效计算电信网络故障频率的算法。所提出的方法基于特殊修改,该特殊修改将用于计算可靠性的公式转换为还给出故障频率的公式。已经产生了许多算法,并显示了分解算法是最有效的。该算法尚未转换,因为它的图表操作收缩和删除链接在故障频率情况下产生复杂的表达式。本文派生了新的矩阵式分解公式,并允许我们将要分解算法转换为使故障频率的算法以及可靠性。一些数值示例表明,该新算法同时以高效率计算的两项测量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号