| Torus网络中容错路由算法的设计与概率分析 |
| |
| 引用本文： | 李银,梁家荣,徐霜,肖杰.Torus网络中容错路由算法的设计与概率分析[J].计算机工程与应用,2009,45(14):103-106. |
| |
| 作者姓名： | 李银 梁家荣 徐霜 肖杰 |
| |
| 作者单位： | 广西大学,计算机与电子信息学院,南宁,530004 |
| |
| 基金项目： | 国家自然科学基金，国家教育部新世纪人才支持计划，广西研究生教育创新计划 |
| |
| 摘 要： | 基于k-Torus子网的概念提出了一个简单的Torus网络容错路由算法。假设结点出错相互独立,计算出路由算法成功路由的概率。对于几十万个结点以上的Torus网络,提出的路由算法构造通路的概率可达99%,且所提出的路由算法具有线性的特点。
|
| 关 键 词： | Torus网络 容错路由算法 连通性 概率分析 |
| 收稿时间： | 2008-3-12 |
| 修稿时间： | 2008-5-15
|
Design of fault tolerant routing algorithm and probabilistic analysis on Torus networks |
| |
| LI Yin,LIANG Jia-rong,XU Shuang,XIAO Jie.Design of fault tolerant routing algorithm and probabilistic analysis on Torus networks[J].Computer Engineering and Applications,2009,45(14):103-106. |
| |
| Authors: | LI Yin LIANG Jia-rong XU Shuang XIAO Jie |
| |
| Affiliation: | LI Yin,LIANG Jia-rong,XU Shuang,XIAO Jie College of Computer,Electronics , Information,Guangxi University,Nanning 530004,China |
| |
| Abstract: | In the paper,a simple fault-tolerant routing algorithm is presented based on the concept of k-subtorus.Under the assump- tion that each node has an independent failure probability,it is able to compute the probability of the fault-free routing path which found by the routing algorithm.For the Torus network which has more than hundreds of thousands nodes,it is at least 99% the probability that a fault-free routing path can be found by the routing algorithm presented in the paper,which runs in linear time. |
| |
| Keywords: | Torus networks fault tolerant routing algorithm connectivity probabilistic analysis |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
