基于比较模型的交换超立方(t,k)-诊断度研究

摘要

The problem of fault diagnosis has been discussed widely, and the diagnosability of many well-known interconnection networks has been explored.(t,k)-diagnosis, which is one of the most important system-level diagnosis strategies, requires at least k fault processors identified in each iterate provided there are at most t fault processors, where t≥k.To improve the diagnosability of the exchanged hypercube networks, this paper presented a (t,k)-diagnosis algorithm under the comparison model, according to the characteristics of connected graph for the exchanged hypercube, and computed the connected edges and nodes of quantitative relationship.It shows that the exchanged hypercube networks is (t,k)-diagnosable.Finally, the result shows that the diagnosability of the exchanged hypercube networks, which is bigger that its ordinary diagnosability s+1.%故障诊断问题已经被广泛讨论,许多互连网络的诊断度已被深入研究.(t,k)-诊断为最重要的系统级故障诊断策略之一,在故障节点不大于t的前提条件下,每次迭代均可以识别最少故障节点个数为k.针对如何提高交换超立方网络的诊断度问题,进行了一个基于比较模型的(t,k)-诊断算法研究,根据连通图的特性对交换超立方网络进行连通分子的划分,并计算交换超立方连通图中连接边与节点间的量化关系,从而证明了交换超立方网络是(t,k)-可诊断的.最终表明,该算法下的诊断度,优于其传统精确诊断s+1.