Reliability modeling and performance of variable link-capacity networks

Kyandoghere, K.

doi:10.1109/24.690899

Cited by 4 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithms in [15] & [16] generate a set of composite paths (cp) from the pathset information of a network. The two algorithms also require a max-flow-min-cut algorithm [21] to compute the capacity flow for each generated cp [15], [16] to generate a set of minimal success composite paths. In general, the algorithms [15], [16] generate cp ( is the total number of failure simple paths of the network), and re- [19] quire all cuts information of the network to compute the capacity flow of each generated cp [15].…”

Section: ) Implementation and Time Complexitymentioning

confidence: 99%

“…Varshney, et al [12] generalize the method in [11] to a multistate graph. However, the procedures used to calculate the maximum flow in [11] & [12], in general, do not 0018-9529/$20.00 © 2005 IEEE produce correct results [15], [20], [21]. Schanzer [20] suggests two ways to correct the problems, while Kyandoghere [21] provides a correction of the procedure.…”

Section: Introductionmentioning

confidence: 99%

“…However, the procedures used to calculate the maximum flow in [11] & [12], in general, do not 0018-9529/$20.00 © 2005 IEEE produce correct results [15], [20], [21]. Schanzer [20] suggests two ways to correct the problems, while Kyandoghere [21] provides a correction of the procedure. Rueger [13], and Rai, et al [14] have proposed algorithms which obtain a symbolic CRR expression under a capacity constraint.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Soh

Rai

2005

IEEE Trans. Rel.

View full text Add to dashboard Cite

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.

show abstract