Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
IEEE Transactions on Computers - The MIT Press scientific computation series
The B-Network: A Multistage Interconnection Network with Backward Links
IEEE Transactions on Computers
Destination Tag Routing Techniques Based on a State Model for the IADM Network
IEEE Transactions on Computers
Creating Disjoint Paths in Gamma Interconnection Networks
IEEE Transactions on Computers
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
IEEE Transactions on Computers
The Extra Stage Cube: A Fault-Tolerant Interconnection Network for Supersystems
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Routing Schemes for the Augmented Data Manipulator Network in an MIMD System
IEEE Transactions on Computers
A Class of Redundant Path Multistage Interconnection Networks
IEEE Transactions on Computers
| Hi-index | 0.24 |
The composite Banyan network orginally proposed earlier^1 can be constructed by adopting the characteristics of both the Banyan and the reverse Banyan networks. It has many interesting properties, such as a regular structure, tag-routing scheme, easy manipulation of alternate tags, etc. However, when n(=log"2N) is even (where N is the number of terminals), the links between the two centre stages are duplicated. This is not desirable from the standpoint of switch faults. To overcome this problem we propose a modification of the original network. The modification scheme has been simplified to maintain most of the novel characteristics of the composite Banyan network. We show that the modified network has more internal paths between some source and destination pairs than the original network. These internal paths help to improve the network's terminal reliability. Using simulation, we verify that the modified network enhances terminal reliability.