Please choose your delivery country and your customer group
The reliability of KYKLOS, a multipletree based interconnection network is studied. The first part of this paper considers reliability as the ability of the network to withstand switch node failures and yet retain at leat a single binary tree. Single tree and multiple tree networks are then compared on the basis of probability of failure, Mission Time (MT) and Mean Time of Failure (MTTF). We next consider failure as an event such that all processors are not in the same component when one or more nodes fil. Specifically, the Double Binary Tree (DBT) is considered. Two versions of the DBT are then compared on the basis of ability to retain processor connectivity despite up to two switch node failures. A routing strategy is defined and sensitivity of the network to failures within a given level are in investigated.