An Efficient Method based on Self-Generating Disjoint Minimal Cut-Sets for Evaluating Reliability Measures of Interconnection Networks
The reliability evaluation of interconnection networks is an important issue in their quality management. Some important reliability measures are network reliability or g-terminal reliability, terminal reliability or 2-terminal reliability and k-terminal reliability. This paper concentrates on evalu...
Gespeichert in:
Veröffentlicht in: | International journal of performability engineering 2014-05, Vol.10 (3), p.303-303 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The reliability evaluation of interconnection networks is an important issue in their quality management. Some important reliability measures are network reliability or g-terminal reliability, terminal reliability or 2-terminal reliability and k-terminal reliability. This paper concentrates on evaluating these three different reliability measures of interconnection networks. In this context a new method based on self generating disjoint minimal cut-set is proposed for evaluating the reliability of the interconnection networks. As, the minimal cut-sets thus generated are self-disjoint and non-redundant; it saves the overhead due to disjointing process and eliminates the duplicates. The method is well supported by an efficient algorithm for calculating the different reliability measures of interconnection networks. The proposed method as well as the algorithm is illustrated with a suitable example. The proposed method is compared against some existing methods in order to ensure its simplicity and efficiency in computing the reliability of interconnection networks. Further to show the generality of the proposed method the reliability of some regular interconnection networks are evaluated by using the proposed method. [PUBLICATION ABSTRACT] |
---|---|
ISSN: | 0973-1318 |