Network Reliability Evaluation and Analysis of Multistage Interconnection Networks
Deepak Kumar Panda1, Ranjan Kumar Dash2
1Deepak Kumar Panda, Research Scholar, SOA University, Bhubaneswar (Odisha), India.
2Ranjan Kumar Dash, Associate Professor, Department of Information Technology, College of Engineering & Technology, Bhubaneswar (Odisha), India.
Manuscript received on 29 May 2019 | Revised Manuscript received on 11 June 2019 | Manuscript Published on 22 June 2019 | PP: 485-489 | Volume-8 Issue-3S, February 2019 | Retrieval Number: C11010283S19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: This paper proposes a new graph theoretic method for calculating network reliability of multistage interconnection networks (MINs). The proposed method converts MIN into its equivalent reliability logic graph (RLG). A new algorithm is proposed to find all the minimal cut-sets of the RLG and then uses inclusion-exclusion principle to evaluate the network reliability of the MIN. The proposed method is well illustrated by taking Extra stage shuffle exchange network (ESEN) as an example network. A comparative analysis is made among the values of network reliability computed by the proposed method as well as by some existing analytical methods. This comparison ensures the proposed algorithms to be quite competent in estimating the reliability values of MINs. Network reliability of nine different types of MINs of greater importance have been evaluated under different conditions (time dependent and time independent)and compared on the same functional environment.
Keywords: Reliability, Multistage Interconnection Network(MIN), Reliability Logic Graph(RLG), Minimal Cut-Set (MCS).
Scope of the Article: Heterogeneous Wireless Networks