{"title":"一种新的容错网络架构:复合榕树网络","authors":"T. Feng, S. Seo","doi":"10.1109/FTDCS.1993.344159","DOIUrl":null,"url":null,"abstract":"A new fault-tolerant architecture in multistage interconnection networks, called the composite banyan network, is proposed. The network is constructed by superimposing the reverse banyan network onto the banyan network. Basic building blocks in the composite banyan network are 3/spl times/3 switching elements (SEs) with log/sub 2/N stages. The major advantage of the composite banyan network over the existing networks with 3/spl times/3 SEs is an efficient and fast control algorithm to set up a path between any source and destination pair. Instead of complex numerical calculations, the network can easily generate a primary routing tag and alternate tags through simple binary operations. It is shown that there exist at least two totally disjoint paths between any source and destination pair, which increases the degree of fault tolerance. In order to increase the possibility of some frequently used permutations, a modified network is also proposed.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A new fault-tolerant network architecture: a composite banyan network\",\"authors\":\"T. Feng, S. Seo\",\"doi\":\"10.1109/FTDCS.1993.344159\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new fault-tolerant architecture in multistage interconnection networks, called the composite banyan network, is proposed. The network is constructed by superimposing the reverse banyan network onto the banyan network. Basic building blocks in the composite banyan network are 3/spl times/3 switching elements (SEs) with log/sub 2/N stages. The major advantage of the composite banyan network over the existing networks with 3/spl times/3 SEs is an efficient and fast control algorithm to set up a path between any source and destination pair. Instead of complex numerical calculations, the network can easily generate a primary routing tag and alternate tags through simple binary operations. It is shown that there exist at least two totally disjoint paths between any source and destination pair, which increases the degree of fault tolerance. In order to increase the possibility of some frequently used permutations, a modified network is also proposed.<<ETX>>\",\"PeriodicalId\":251095,\"journal\":{\"name\":\"1993 4th Workshop on Future Trends of Distributed Computing Systems\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 4th Workshop on Future Trends of Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTDCS.1993.344159\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 4th Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1993.344159","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A new fault-tolerant network architecture: a composite banyan network
A new fault-tolerant architecture in multistage interconnection networks, called the composite banyan network, is proposed. The network is constructed by superimposing the reverse banyan network onto the banyan network. Basic building blocks in the composite banyan network are 3/spl times/3 switching elements (SEs) with log/sub 2/N stages. The major advantage of the composite banyan network over the existing networks with 3/spl times/3 SEs is an efficient and fast control algorithm to set up a path between any source and destination pair. Instead of complex numerical calculations, the network can easily generate a primary routing tag and alternate tags through simple binary operations. It is shown that there exist at least two totally disjoint paths between any source and destination pair, which increases the degree of fault tolerance. In order to increase the possibility of some frequently used permutations, a modified network is also proposed.<>