An Efficient Cutset Approach for Evaluating Communication-Network Reliability With Heterogeneous Link-Capacities

Abstract

Abstract-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 , and a given minimum bandwidth requirement , 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 will be less than . 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 node pair is the probability that the network has a capacity of less than for the given node pair. Note that . 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 values.Index Terms-Capacity related reliability, communication network, cutset, network flow, network reliability, sum of subsets, terminal reliability.

Vehicle path reconstruction using automatic vehicle identification data: An integrated particle filter and path flow estimator

“…Links with large volumes frequently reflect those which are more likely to be chosen by vehicles. Based on the link capacity reliability in graph theory (Bondy and Murty, 1976;Soh and Rai, 2005), the path attraction model is expressed as follows:…”

Energy-aware traffic engineering with reliability constraint

“…For this case, when some link fails, a demand that requires larger bandwidth may be routed in smaller packets. Alternatively, one may consider using a TR measure that considers bandwidth requirement b d ; for example, the capacity related reliability (CRR) of [21] gives the probability that there is one or more paths with total bandwidth at least b d for a given s d and t d . For CRR, the system must have a means to route b d via one or more operational paths at the same time.…”

“…For CRR, the system must have a means to route b d via one or more operational paths at the same time. Note that computing CRR is computationally more complex as compared to TR [21]. In this paper, we consider TR with no bandwidth guarantee, and use CAREL [20] to compute TR d for each demand d 2 D. Each TR d is computed in two steps.…”

“…A solution to R-EAR problem considers two parameters: powered-on cables and reliability (TR or RR). The authors of [6] state that minimizing powered-on cables with bandwidth constraint is NP-hard, while the authors of [21] state that computing reliability with bandwidth constraint is NP-hard. Thus, solving R-EAR is expected to be even more challenging.…”

Design and simulation of a data transmission network for industrial control system subject to reliability improvement

“…TS are the groups of edges that form a path between (s) and (t). If there are (i) tie sets between s and t, then the reliability expression ܴ ௦௧ is given by the expansion of [12]:…”