【摘要】 解决通信网络"归一化容量加权可靠性指标"全代数化计算的最关键问题,是寻找能够算出网络节点之间全部路由的代数化路由算法。提出一种网络路由新算法,是按照逻辑代数运算规则,以关联矩阵降阶变换方式计算,对于有m个节点的网络,只需m-2次距阵降阶变换运算,就能够算得网络两节点间全部路由,且不会出现闭环路由问题,完全符合通信传输规则。基于该路由算法研究出通信网络"归一化容量加权可靠性指标"的全代数化算法,由于新算法所有环节均实现了代数化运算,所以易于编写计算机程序,可以很方便地计算出大型通信网络的可靠性指标,解决了大型通信网络可靠性分析困难的问题。通过算例对新算法的各计算过程进行了详细说明,验证了其正确性。更多还原

【Abstract】 The key technique to achieve algebra calculation of normalized capacity weighted reliability index for telecommunication network is finding out an algebra algorithm which can calculate all routes among network nodes. A new network routing algorithm is proposed, which follows calculation rues of logic algebra and calculates routes with depression of order transformation of incidence martrix. For network with m nodes, m-2 times depression of order transformation operations can get all routes between two nodes. Furthermore, it accords with the communication transmission rules and avoids the close loop routes. The algebra calculation of normalized capacity weghted reliability for telecommunication network is researched based on this routing algorithm. All the calculation procedures are algebraic, so this algorithm is easy to program and convenient to calculate reliability index of huge telecommunication network. The algorithm overcomes the difficulties in analyzing reliability of huge telecommunication network. The calculation procedure of the algorithm is shown through examples in details and its correctness is validated.更多还原