星載Clos網(wǎng)絡(luò)的全分布式容錯調(diào)度算法
doi: 10.11999/JEIT150944
-
2.
(清華大學(xué)電子工程系 北京 100084) ②(清華大學(xué)宇航中心 北京 100084) ③(清華大學(xué)深圳研究生院 深圳 518055) ④(北京航天飛行控制中心 北京 100094)
國家自然科學(xué)基金(91338108, 91438206),中國電子科技集團校企合作基金(空間互聯(lián)網(wǎng)關(guān)鍵技術(shù))
Fully Distributed Fault Tolerant Scheduling for Onboard Clos-network Switching
-
2.
(Department of Electronic Engineering, Tsinghua University, Beijing 100084, China)
The National Natural Science Foundation of China (91338108, 91438206), China Electronics Technology Group School-Enterprise Cooperation Foundation (Key Technology of Space Internet)
-
摘要: 針對星載交換結(jié)構(gòu)受空間輻射影響造成的可靠性嚴(yán)重下降問題,該文提出了一種支持全分布式調(diào)度的三級Clos網(wǎng)絡(luò)及其全分布式容錯(Fully Distributed Fault Tolerant, FDFT)調(diào)度算法,以提高星載交換結(jié)構(gòu)在交叉點故障下的容錯能力。該Clos網(wǎng)絡(luò)的中間級和輸出級采用聯(lián)合輸入交叉點隊列,以支持Clos網(wǎng)絡(luò)和交換單元內(nèi)部的全分布式調(diào)度。FDFT采用一種分布式故障檢測算法獲得交叉點故障信息?;趯徊纥c故障影響范圍的分析,F(xiàn)DFT在輸入級采用一種容錯信元分發(fā)算法,實現(xiàn)無故障路徑的負(fù)載均衡。理論分析證明,當(dāng)任一輸入/輸出級交換單元故障個數(shù)不超過(m-n)或所有中間級交換單元故障個數(shù)不超過(m-n)時,其中m, n分別為輸入級交換單元輸入、輸出端口數(shù),F(xiàn)DFT能夠達到100%吞吐率。仿真結(jié)果進一步驗證,故障隨機發(fā)生情況下,F(xiàn)DFT能夠抵抗比故障任意發(fā)生情況下更多的故障,且在不同的業(yè)務(wù)場景下具有良好的吞吐率和時延性能。
-
關(guān)鍵詞:
- 星載交換 /
- Clos網(wǎng)絡(luò) /
- 全分布式 /
- 容錯調(diào)度 /
- 負(fù)載均衡
Abstract: For an onboard switching, serious decline in the reliability is induced by the harsh space radiation environment. In this paper, a 3-stage Clos-network supporting fully distributed scheduling and a Fully Distributed Fault Tolerant (FDFT) scheduling algorithm are proposed to improve fault-tolerant ability of an onboard switching. Combined input and output queued architecture is employed in the central and output stages of the proposed Clos-network to support fully distributed scheduling in both the network and switching elements. In FDFT, a distributed fault detection algorithm is employed to obtain the crosspoint fault information. Based on the analysis of the influence of the faults, a fault-tolerant cell dispatching algorithm is proposed in the input stage which achieves load-balancing to fault-free paths. Theoretical analysis demonstrates that 100% throughput is achieved when no more than(m-n) crosspoint faults occur in any input/output module or in all central modules, where m and n are the number of inputs and outputs of input module, respectively. Furthermore, simulation results indicate that, in the case of faults occurring randomly, FDFT tolerates much more faults, and exhibits a good performance in terms of throughput and average cell delay under different traffic scenarios.-
Key words:
- Onboard switching /
- Clos-network /
- Fully distributed /
- Fault-tolerant scheduling /
- Load balancing
-
BOTTA A and PESCAPE A. On the performance of new generation satellite broadband internet services[J]. IEEE Communications Magazine, 2014, 52(6): 202-209. doi: 10.1109/MCOM.2014.6829965. JAFF E, PILLAI P, and HU Y. IP multicast receiver mobility support using PMIPv6 in a global satellite network[J]. IEEE Communications Magazine, 2015, 53(3): 30-37. doi: 10.1109/ MCOM.2015.7060479. COURVILLE N, BISCHI H, and ZENG J. Critical issues of onboard switching in DVB-S/RCS broadband satellite networks[J]. IEEE Wireless Communications, 2005, 12(5): 28-36. doi: 10.1109/MWC.2005.1522101. SIEGLE F, VLADIMIROVA T, ILSTAD J, et al. Mitigation of radiation effects in SRAM-based FPGAs for space applications[J]. ACM Computing Surveys, 2015, 47(2): 37:1-37:34. doi: 10.1145/2671181. 張茂森, 邱智亮, 高雅, 等. 星上Clos 交換網(wǎng)絡(luò)的分治調(diào)度算法[J]. 電子與信息學(xué)報, 2012, 34(11): 2734-2740. doi: 10.3724/SP.J.1146.2012.00553. ZHANG M, QIU Z, GAO Y, et al. Divide-and-conquer dispatching scheme for satellite clos-network switches[J]. Journal of Electronics Information Technology, 2012, 34(11): 2734-2740. doi: 10.3724/SP.J.1146.2012.00553. KAO Y H and CHAO H J. Design of a bufferless photonic clos network-on-chip architecture[J]. IEEE Transactions on Computers, 2014, 63(3): 764-776. doi: 10.1109/TC.2012.250. YANG Y and WANG J. A fault-tolerant rearrangeable permutation network[J]. IEEE Transactions on Computer, 2004, 53(4): 414-426. doi: 10.1109/TC.2004.1268399. GAO Y, QIU Z, ZHANG M, et al. Distributed weight matching dispatching scheme in MSM clos-network packet switches[J]. IEEE Communications Letters, 2013, 17(3): 580-583. doi: 10.1109/LCOMM.2013.012213.122552. 高雅, 邱智亮, 張茂森, 等. 基于幀填補的MMM Clos 網(wǎng)絡(luò)按序分組交換算法[J]. 電子與信息學(xué)報, 2012, 34(11): 2715-2720. doi: 10.3724/SP.J.1146.2012.00617. GAO Y, QIU Z, ZHANG M, et al. Padded-frame based in-sequence dispatching scheme for memory-memory-memory (MMM) clos-network[J]. Journal of Electronics Information Technology, 2012, 34(11): 2715-2720. doi: 10. 3724/SP.J.1146.2012.00617. 楊君剛, 劉增基, 雒曉卓. 一種新型的三級Clos網(wǎng)絡(luò)分布式容錯調(diào)度機制[J]. 解放軍理工大學(xué)學(xué)報: 自然科學(xué)版, 2011, 12(3): 217-222. YANG J, LIU Z, and LUO X. New distributed fault tolerance scheduling algorithm in three-stage clos network[J]. Journal of PLA University of Science and Technology (Natural Science Edition), 2011, 12(3): 217-222. LI X, ZHOU Z, and HAMDI M. Space-memory-memory architecture for clos-network packet switches[C]. Proceedings of IEEE International Conference on Communications, Seoul, 2005, (2): 1031-1035. doi: 10.1109/ICC.2005.1494505. YU H, RUEPP S, and BERGER M S. Out-of-sequence prevention for multicast input-queuing space-memory- memory clos-network[J]. IEEE Communications Letters, 2011, 15(7): 761-763. doi: 10.1109/LCOMM.2011.051011. 102535. KLEBAN J and SUSZYNSKA U. Static dispatching with internal backpressure scheme for SMM clos-network switches [C]. Proceedings of IEEE Symposium on Computers and Communications, Madeira, 2013: 654-658. doi: 10.1109/ ISCC.2013.6755022. ZHANG M, QIU Z, and GAO Y. Space-memory-memory clos-network switches with in-sequence service[J]. IET Communications, 2014, 8(16): 2825-2833. doi: 10.1049/iet- com.2013.0844. ROJAS-CESSA R, OKI E, JING Z, et al. CIXB-1: combined input-one-cell-crosspoint buffered switch[C]. Proceedings of IEEE Workshop on High Performance Switching and Routing, Dallas, 2001: 324-329. doi: 10.1109/HPSR.2001.923655. MCKEOWN N. The iSLIP scheduling algorithm for input- queued switches[J]. IEEE/ACM Transactions on Networking, 1999, 7(2): 188-201. doi: 10.1109/90.769767. -
計量
- 文章訪問數(shù): 1599
- HTML全文瀏覽量: 144
- PDF下載量: 416
- 被引次數(shù): 0