By Topic

An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Soh, S. ; Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia ; Rai, S.

This paper presents an efficient cutset approach to compute the reliability of a large communication network having heterogeneous link capacities. The reliability measure has been defined as capacity related reliability (CRR). The proposed method, subset cut technique (SCT), requires the cutset information of the network. For each minimal cut Ci, and a given minimum bandwidth requirement Wmin, the method enumerates all nonredundant subset cut (SC), where each SC relates link capacities & minimum bandwidth requirements. Note that if all links in an SC fail, the capacity of the induced cut Ci will be less than Wmin. Given the failure probability of each link, and the nonredundant SC, any Boolean technique for generating mutually disjoint terms can be utilized to obtain a capacity related unreliability (CRU) of the network. Thus, the CRU for an (s,t) node pair is the probability that the network has a capacity of less than Wmin for the given node pair. Note that CRR=1-CRU. Two SCT algorithms are proposed: Algorithm-1, and Algorithm-2; and the suitability of using either algorithm is also discussed. Examples are given to illustrate the techniques. The time complexity, and the proof of correctness for the proposed algorithms are also included. It is shown empirically that the time complexity of generating the nonredundant SC of a network is polynomial in the order of the number of cuts of the network. The proposed SCT algorithms have been implemented in C. We have utilized the SCT to generate the CRR of some large communication networks with various Wmin values.

Published in:

Reliability, IEEE Transactions on  (Volume:54 ,  Issue: 1 )