Interconnection Network Reliability Evaluation. Neeraj Kumar Goyal
Чтение книги онлайн.

Читать онлайн книгу Interconnection Network Reliability Evaluation - Neeraj Kumar Goyal страница 8

Название: Interconnection Network Reliability Evaluation

Автор: Neeraj Kumar Goyal

Издательство: John Wiley & Sons Limited

Жанр: Программы

Серия:

isbn: 9781119620594

isbn:

СКАЧАТЬ related reliability (CRR). It is defined as the probability that required amount of flow is transferred from source node s to terminal node t. Evaluation of above network reliability measures (indices) has attracted a lot of attention from researchers and many approaches have been developed so far. Next section presents a brief summary of these approaches.

      Misra and Rao [4] developed signal flow graphs: a development recognized as a significant step forward in the evaluation of network reliability. After this, a number of algorithms, techniques and approaches have been suggested in the literature. In fact, today, the use of graph theory has become inseparable from network reliability evaluation. Available literature on reliability evaluation of communication networks, considering only connectivity as performance criterion, can broadly be classified into two paradigms, viz.:

      Path sets or Cut sets approaches (POC) paradigm:

      These use pathsets or cutsets as the starting point for TPR problems, spanning trees for ATR problems and k-trees (k-minimal cutsets) for KTR problems. In this book, the terms path sets and trees are represented by a single term path sets as approaches used for generating them are similar. From the context, whether it is pathset or spanning tree or k-tree can easily be understood. For example, when the context is TPR problem then it is pathset, when context is ATR it is spanning tree and when the context is KTR it is k-tree.

      Reliability evaluation is generally achieved by enumerating pathsets or cutsets of the network. A pathset is defined to be a set of minimal paths connecting source and destination node. A path is set of components whose functioning ensures that the system functions. A cutset is defined to be a set of minimal cuts that disconnects the source and destination nodes. A cut is a set of components whose failure will result in system failure. A minimal path/minimal cut is a path/cut such that no proper subset of minimal path or minimal cut is a minimal path/minimal cut. In other words, if any element is removed from the set (minimal path/minimal cut) then it no longer remains a path or cut.

      Main objective of this book is to design new fault tolerant Interconnection network layouts capable of path redundancy among dynamic failures. New INs designs have been proposed and their observed results are found promising when compared with some of the earlier networks.

      A summary of problem wise contributions is discussed next:

      1 INs Topology Review (Chapter 2)Presents an extensive survey of the existing INs topological hardware aspects based on its unexplored Taxonomy of INs performance metrics. In this chapter detailed literature review on interconnection networks has been performed, and an exhaustive taxonomy has been proposed based on the literature review. The chapter also presents advantages and disadvantages of interconnection networks along with a summary of topological characteristics and fault tolerance information of the surveyed interconnection networks in the form of Table.

      2 MIN Reliability Evaluation Techniques Review (Chapter 3)Presents an overall view of the different reliability measures and their importance in evaluating the reliability can be reviewed with examples. A comprehensive review of the various approaches present for evaluation of different reliability measures is also presented. Based on the literature survey a few shortcomings are identified.

      3 Terminal Reliability Analysis of Existing MIN Layouts (Chapter 4)Networks such as telecommunication, transportation, power systems, integrated circuitry and computer communication systems are large and it becomes imperative for economic reasons and safety that these have high reliability. Reliability evaluation of such complex systems has not yet been perfected and there is a lot more that needs to be done. System reliability can be measured in terms of various paradigms such as two terminal, all-terminal and broadcast reliabilities.In this chapter, terminal reliability values of various recent and industrial used MINs topologies are evaluated and compared using existing simple and efficient path-set enumeration method. Path set and cut set techniques are the most widely used techniques for terminal pair reliability evaluation of communication networks as these techniques give a compact reliability expression in sum of disjoint product (SDP) form.These techniques first enumerate minimal path (or cut) set for the network and then evaluate reliability (or unreliability) expressions in the SDP form. Since enumeration of cut set also requires knowledge of basic paths of the network, the path set enumeration becomes a necessity for these techniques. Available disjoint and redundant paths of various existing MINs are evaluated by a simple and efficient path-set enumeration method based on hybrid multi-variable inversion (MVI) algorithm, which gives accurate reliability values. Present reliability evaluation paves the way of research focus on developing higher disjoint, reliable and highly fault-tolerant MINs than the existing topologies.

      4 Comprehensive MIN Reliability Paradigms Evaluation (Chapter 5)This chapter has attempted to evaluate comprehensive reliability paradigms of various recent MINs topologies available from literature using path tracing algorithm. With increasing number of input and output nodes in supercomputer environment reliability evaluation of multi-cast nodes is mandatory. In other words, a network has to transmit a signal or commodity between different pairs of nodes of a network simultaneously. Communication between multiple-sources multiple-destinations offers several advantages like increased performance, improved reliability and decreased costs through resource sharing.So we have extended the traditional reliability evaluation to include a new reliability measure as multisource multi-terminal reliability (MSMT). This chapter also evaluate MIN traditional reliability parameters (Two/broadcast/all terminal reliability) using conceptually simple and computationally efficient path tracing algorithm.

      5 Dynamic Tolerant and Reliable Four Disjoint MIN Layouts (Chapter 6)This chapter proposes two new fault tolerant and highly reliable multistage interconnection network layouts. Proposed 4-disjoint paths multistage interconnection networks (4DMINs) provide four disjoint paths between any source and destination node pair and provide dynamic rerouting between intermediate stages. Minimal paths of these 4DMIN have been evaluated and MINs performance evaluation has been done by calculating terminal reliability at assumed different switch reliabilities using existing approaches of sum of disjoint products method.Then a new layout design of fault tolerant reliable interconnection networks (RINs) is proposed. Proposed INs designed with highly adaptive reliable multipath dynamic routing behavior and fault tolerant capability in all the stages with suitable routing techniques. Proposed design can withstand dynamic switch failures in all the stages and provide more redundant paths to tackle such with higher reliability. They provide higher reliability and outperform other MINs.