局部扭曲立方体多播容错路由算法  

A Multicast Routing Algorithm on Locally Twisted Cubes

作　　者：成勋[1] 孙宁[2] 林玮[1] 

机构地区：[1]武汉数字工程研究所 [2]92232部队6室

出　　处：《舰船电子工程》2009年第5期77-80,共4页Ship Electronic Engineering

摘　　要：通过对经典最短路算法的研究,提出一种基于最短路权矩阵法的改进算法。实验结果表明,与权矩阵法相比,改进算法能提高计算效率、增强寻路直观性;特别是当网络中大量节点为目的节点时,该算法更为简捷、有效。According to the research of the conventional algorithms about the shortest path problem, an improved algorithm based on the weight matrix method for the shortest path is presented. Simulation results show that this algorithm can improve efficiency and find the shortest path in the network more directly, compared with the weight matrix method for the problem. Especially when a lot of nodes in the network become the destinations, this algorithm is a more forthright and effective method to find the shortest path from a source node to other destinations.

关 键 词：局部扭曲立方体 路由 容错路由 多播 

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