超立方体网络中基于LIP的广播容错路由算法  

A BROADCAST FAULT TOLERANT ROUTING ALGORITHM BASED ON LIP IN HYPERCUBE

作　　者：张玫[1] 

机构地区：[1]山东师范大学信息科学与工程学院,济南250014

出　　处：《山东师范大学学报（自然科学版）》2008年第3期28-30,共3页Journal of Shandong Normal University(Natural Science)

基　　金：山东省教育厅科技计划资助项目(J05G01)

摘　　要：论文给出超立方体网络中的LIP容错模型,基于该模型提出三个重要的性质定理,并给出超立方体网络中基于该模型的广播容错路由算法.该算法能容许大量的错误节点,且算法所需时间步仅与LIP节点数有关而与故障节点数无关,因此具有较大的优越性.A fault tolerant model in hypercube---the longest induced path （LIP for short） --is given. And based on LIP, three important rules and a broadcast fault tolerant routing algorithm in hypercube are proposed. The algorithm can hold many faulty nodes and the time steps the algorithm needs have something to do with the nodes of LIP while have nothing to do with the number of faulty nodes. So to some extent the algorithm has many advantages.

关 键 词：超立方体网络 最长导出路 广播容错路由算法 

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