Link augmented binary (LAB)-tree: its structure, routing, and fault tolerance properties

A new augmented binary tree multiprocessor architecture, called LAB-tree is proposed. It has short and regular redundant links. These interconnections improve many properties of a full binary tree, such as increased fault tolerance, reduced traffic congestion, efficient routing of messages, etc. It is shown that there exist at least two node disjoint paths between every pair of nodes in the LAB-tree. Also, all non-faulty nodes remain connected even in the presence of one faulty node at each level of the tree. The LAB-tree supports a simple routing algorithm.< >