摘要
为了研究交换超立方体网络容错路由问题,引入了相邻结点集合类的概念,提出了相邻结点集的求解公式。对于满足任意子连通性条件的交换超立方体网络,给出了基于相邻结点集合类的自适应容错路由算法及算法的步长上界。仿真实验结果表明算法是有效的。
In order to deal with the problem of fault tolerant routing on exchanged hypercube,the concept of the neighbor sets of present node is defined.The formula on the solution of the sets of neighbor nodes is proposed.An adaptive fault tolerant routing algorithm is developed for the exchanged hypercube networks with arbitrary subcube-connected.The upper bound of the algorithm step is given.The simulation results show that the algorithm proposed in the paper is effective.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第32期24-28,共5页
Computer Engineering and Applications
基金
国家自然科学基金(No.61064002)
国家教育部新世纪优秀人才支持计划(No.NCET-06-0756)~~
关键词
交换超立方体网络
容错路由算法
局部连通性
exchanged hypercube networks; fault tolerant routing algorithm; local connectivity;