On A Class Of Interconnection Networks
Subhash C. Kak, A.K. Sood · 2005
Interconnection networks have extensive applications in switching and multiprocessor networks. This paper shows that nested tree designs of rearrangeable interconnection networks proposed by Joel are equivalent to the CS networks discussed in Opferman and Tsao-Wu. this paper presents a new design for a t-fault tolerant CS network. This design generally requires fewer elements then the design of Sowrirajan and Reddy. Ln addition,