A Cutsets-Based Unified Framework to Evaluate Network Reliability Measures

An Efficient Reliability Evaluation Approach for Networks with Simultaneous Multiple‐Node‐Pair Flow Requirements

“…Node‐sets are enumerated using the existing algorithm with the allowance that while enumerating the NSs, disconnectivity with any node(s) of the network can also be considered and is relieved from the assumption as quoted ‘ Assign node numbers sequentially, and assume the highest node number N is the source node with node 1 as the sink node. ’ (step #1 of Mishra and Chaturvedi). The assumption in step #1 of Mishra and Chaturvedi does not hold good in this case as in a network with multiple sources and multiple destinations; it is not feasible to assign highest node number to the source(s).…”

“…’ (step #1 of Mishra and Chaturvedi). The assumption in step #1 of Mishra and Chaturvedi does not hold good in this case as in a network with multiple sources and multiple destinations; it is not feasible to assign highest node number to the source(s). Moreover, each NS enumerated is checked for validation using adjacency matrix and included in the NS list only if it is valid.…”

“…Moreover, each NS enumerated is checked for validation using adjacency matrix and included in the NS list only if it is valid. This makes the proposed approach more simpler and efficient and is a modification to the algorithm proposed in a previous study, where all the NSs are first enumerated and then checked for validation depending upon the reliability measure being assessed, making the approach less efficient. Because NSs are enumerated considering only connectivity as the success criteria in the proposed approach, W req is initialized to ‘0’ at the onset of the process.…”

“…Failing to find a set of benchmark instances in literature, on which to perform the comparison, various problems are formulated as requirements across different node‐pairs for different complex networks (Figures 6‐9). The network in Figure is taken from Soh and Rai; the network in Figure is taken from Mishra and Chaturvedi; and the networks in Figures and is taken from Kansal and Devi. Different requirements for each network have been considered for MNPCRR evaluation.…”

On computing the reliability of opportunistic multihop networks with Mobile relays

“…Among these, we can extract possibilities based on some criterion (delay, throughput, flow requirements etc) to find a deterministic or probabilistic network performance measures. Other than the method of network decomposition, the minimal path set and/or minimal cut set concepts have extensively been used to evaluate the reliability of many systems such as communication networks, power systems network, multiphase systems, multistate systems, and flow networks etc. If we do not set any performance constraint such as delay requirement or flow requirement, then the minimal path sets can be used to determine the probabilistic connectivity of the network.…”