超立方体互连网络自适应简捷盲寻径搜索算法  

Adaptive Blindness Routing Algorithms for Interconnection Networks in Hypercube

作　　者：林柏钢[1] 

机构地区：[1]福州大学计算机系,福建福州350002

出　　处：《小型微型计算机系统》2005年第9期1556-1559,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60172017)资助.

摘　　要：根据n-cube超立方体互连网络的并行特点,分析了任意当前结点相邻集合类的求解方法,并给出一种自适应优化盲寻径搜索算法.即通过任一当前结点的Hamming距离相邻测度,寻找从任一始发结点到目标结点的所有可能的自适应盲寻径优化算法.This paper based on parallel trait in n-cube hypercube networks, the solution method of the neighbor sets for any present node is analyzed, and an adaptive blindness routing algorithm in optimization is given. Namely, the adaptive algorithm for blindness routing of the optimization is through measure of Hamming distance for any present node, and find out all possible path from a source node to the target node.

关 键 词：n-cube互连网络 可选相邻集合类 Hamming距离测度 自适应盲寻径搜索算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]