容错Clos网络的拓扑和路由方案

Xinming Duan, Dakun Zhang, Xuemei Sun
{"title":"容错Clos网络的拓扑和路由方案","authors":"Xinming Duan, Dakun Zhang, Xuemei Sun","doi":"10.1109/NSWCTC.2009.362","DOIUrl":null,"url":null,"abstract":"In this paper, a new fault-tolerant Clos network is presented by adding extra switches and redirecting boxes in ordinary Clos network. The extra switches and redirecting boxes can improve the run time of the routing algorithm significantly when the Clos network displays few or no faults. The paper also presents a fault-tolerant routing algorithm for fault-tolerant Clos network. This algorithm employs a minimum distribution priority scheme handling Clos specification matrix column by column and completely achieves rearrangeable non-blocking routing. The fault-tolerant routing algorithm can reach a low time complexity O(N3/2) even in the worst case. Thus, the presented fault-tolerant Clos network and its routing algorithm are readily applicable to more Reliable Clos network.","PeriodicalId":433291,"journal":{"name":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Topology and Routing Schemes for Fault-Tolerant Clos Network\",\"authors\":\"Xinming Duan, Dakun Zhang, Xuemei Sun\",\"doi\":\"10.1109/NSWCTC.2009.362\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new fault-tolerant Clos network is presented by adding extra switches and redirecting boxes in ordinary Clos network. The extra switches and redirecting boxes can improve the run time of the routing algorithm significantly when the Clos network displays few or no faults. The paper also presents a fault-tolerant routing algorithm for fault-tolerant Clos network. This algorithm employs a minimum distribution priority scheme handling Clos specification matrix column by column and completely achieves rearrangeable non-blocking routing. The fault-tolerant routing algorithm can reach a low time complexity O(N3/2) even in the worst case. Thus, the presented fault-tolerant Clos network and its routing algorithm are readily applicable to more Reliable Clos network.\",\"PeriodicalId\":433291,\"journal\":{\"name\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NSWCTC.2009.362\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Networks Security, Wireless Communications and Trusted Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NSWCTC.2009.362","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文通过在普通Clos网络中增加额外的交换机和重定向盒,提出了一种新的容错Clos网络。当Clos网络出现很少或没有故障时,额外的交换机和重定向盒可以显著提高路由算法的运行时间。本文还提出了一种容错Clos网络的容错路由算法。该算法采用最小分布优先级方案逐列处理Clos规范矩阵,完全实现了可重排的无阻塞路由。容错路由算法即使在最坏的情况下也能达到较低的时间复杂度O(N3/2)。因此,本文提出的容错Clos网络及其路由算法可以应用于更可靠的Clos网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Topology and Routing Schemes for Fault-Tolerant Clos Network
In this paper, a new fault-tolerant Clos network is presented by adding extra switches and redirecting boxes in ordinary Clos network. The extra switches and redirecting boxes can improve the run time of the routing algorithm significantly when the Clos network displays few or no faults. The paper also presents a fault-tolerant routing algorithm for fault-tolerant Clos network. This algorithm employs a minimum distribution priority scheme handling Clos specification matrix column by column and completely achieves rearrangeable non-blocking routing. The fault-tolerant routing algorithm can reach a low time complexity O(N3/2) even in the worst case. Thus, the presented fault-tolerant Clos network and its routing algorithm are readily applicable to more Reliable Clos network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信