Fault-Tolerant General Benes Networks

被引:1
|
作者
Lin, Bey-Chi [1 ]
机构
[1] Natl Univ Tainan, Dept Appl Math, Tainan 70005, Taiwan
关键词
Fault tolerance; switching networks; Benes networks; Clos networks; non-contact fault; rearrangeable;
D O I
10.1109/TCOMM.2023.3309296
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Benes networks are well-known rearrangeable nonblocking (RNB) multistage networks. The so-called conventional Benes networks are based on 2 x 2 switches. In this paper, Benes network is a general term used to refer to an NxN n -nary Benes network. Such networks, denoted by B( n , t) , where N = n(t) and t >= 2 , are based on regular nxn switches, and are RNB as well. A Benes network is constructed recursively from a 3-stage Clos network. For an NxN RNB Clos network C( n , m , r) , where N=nr and m >= n , the maximum allowable number of non-contact faults in each single shell for realizing any permutation has been investigated in an earlier study, where shell k in a network consists of both the k th and the k th-to-last node stages. That study showed that, for a given integer N , an RNB C( n , n , r) network with larger nxn switches leads to tolerance of more non-contact faults in shell 1. In this paper, for an N x N B( n , t) network, we study the maximum allowable number, say f(k) , of non-contact faults for any permutation not only in each single shell k , but also in all shells simultaneously under the fault condition that at most f(k) non-contact faults are arbitrarily located in the switches in each shell k . We call the former the fault tolerance capability in a single shell, and the latter the fault tolerance capability of the network. We show that a larger switch size, i.e., n x n , in an N x N B( n , t) network leads to a higher fault tolerance capability of the network and a higher fault tolerance capability in each non-middle shell. An NxN Benes network B( n , t) considers only the value of N which is a power of n . To consider a flexible N with N = n(s)& sdot;q , where s >= 2 , 1 < q < n and q|n, which means that n is divisible by q, we propose in this paper an NxN RNB Benes-type network using regular nxn switches, which is called an extended Benes and denoted by B(n,s,q). Both Benes and extended Benes networks are based on regular switches, and they have better scalabilities than a Clos network. We define a network's fault tolerance rate as the ratioof the fault tolerance capability to the total crosspoints in the network. For given integersNandn, we derive that the fault tolerance capability and fault tolerance rate of an N x N Benes(or extended Benes) network are higher than or equal to those of an N x N RNB C(n,n,r)network, and the former out performs the latter in most cases.
引用
收藏
页码:6928 / 6938
页数:11
相关论文
共 50 条
  • [1] Using Benes Networks at Fault-tolerant and Deflection Routing based Network-on-Chips
    Runge, Armin
    Kolla, Reiner
    2016 TENTH IEEE/ACM INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP (NOCS), 2016,
  • [2] FAULT-TOLERANT FFT NETWORKS
    JOU, JY
    ABRAHAM, JA
    IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (05) : 548 - 561
  • [3] FAULT-TOLERANT ASYNCHRONOUS NETWORKS
    PRADHAN, DK
    REDDY, SM
    IEEE TRANSACTIONS ON COMPUTERS, 1973, C 22 (07) : 662 - 669
  • [4] ON FAULT-TOLERANT NETWORKS FOR SORTING
    YAO, AC
    YAO, FF
    SIAM JOURNAL ON COMPUTING, 1985, 14 (01) : 120 - 128
  • [5] Fault-Tolerant Rendezvous in Networks
    Chalopin, Jeremie
    Dieudonne, Yoann
    Labourel, Arnaud
    Pelc, Andrzej
    AUTOMATA, LANGUAGES, AND PROGRAMMING (ICALP 2014), PT II, 2014, 8573 : 411 - 422
  • [6] ON MINIMUM FAULT-TOLERANT NETWORKS
    UENO, S
    BAGCHI, A
    HAKIMI, SL
    SCHMEICHEL, EF
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1993, 6 (04) : 565 - 574
  • [7] Fault-Tolerant Spanners for General Graphs
    Chechik, S.
    Langberg, M.
    Peleg, D.
    Roditty, L.
    STOC'09: PROCEEDINGS OF THE 2009 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2009, : 435 - 444
  • [8] Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks
    Ho, Tung-Yang
    Lin, Cheng-Kuan
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2009, 25 (06) : 1855 - 1862
  • [9] Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
    Lin, Cheng-Kuan
    Ho, Tung-Yang
    Tan, Jimmy J. M.
    Hsu, Lih-Hsing
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2009, 86 (01) : 57 - 66
  • [10] A deterministic fault-tolerant connection-scheduling algorithm for dilated benes network
    Hwang, IS
    Tseng, WD
    Huang, IF
    PROCEEDINGS OF THE 7TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2003, : 1454 - 1461