论文部分内容阅读
本文讨论了RMISE β-网络和C_(1,t)~nβ-网络在正常和故障情况下的不同寻径算法。对RMISE β-网络,给出了它在正常状态下的两种寻径方式,最短路径寻径和最低复杂性寻径。还讨论了任意β-网络中出现≤K(K为容错参数)个β-元件故障时,在网络图中寻找一条欧拉循环以使网络中所有处理机全部连通以及确定其所有β-元件应置的状态的方法。
In this paper, the different routing algorithms of RMISE β-networks and C_ (1, t) ~ nβ-networks under normal and fault conditions are discussed. For RMISE β-network, two ways of path finding, shortest path finding and lowest complexity finding are given under the normal condition. It is also discussed that in the case of a β-element failure of ≤ K (K is a fault-tolerant parameter) in any β-network, look for an Euclidean cycle in the network diagram to allow all processors in the network to be fully connected and to determine all their β-elements Set the state of the method.