A reliability-based framework for multi-path routing analysis in mobile ad-hoc networks
International Journal of Communication Networks and Distributed Systems
Situation monitoring and analysis of security risk for networked services
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
RDFS update: from theory to practice
ESWC'11 Proceedings of the 8th extended semantic web conference on The semanic web: research and applications - Volume Part II
| Hi-index | 0.00 |
One of the key tasks in network reliability evaluationis to enumerate all the paths or minimal cutsets of anetwork. Then the reliability can be calculated from thedisjoint form of these terms. Enumerating all theminimal cutsets may be a feasible way to evaluate thereliability of a network if the number of paths is toohuge to enumerate practically. One example of this kindof networks is the 2x100 lattice network. Manyalgorithms have been proposed to enumerate theminimal cutsets of a graph. Most of them requireadvanced mathematics or can only be applied to eitherone of the two broad categories, directed and undirectedgraphs. This paper presents a simple and systematicrecursive algorithm that guarantees the generatedcutsets are minimal and the same logic can be applied toboth directed and undirected graphs with ease. Thisalgorithm is so simple to implement and efficient that itcan also be used to check the correctness of the cutsetsgenerated by other algorithms. This algorithm can alsobe combined with OBDD (Ordered binary decisiondiagram) to calculate the reliability of a network.Experimental results show that: (1) the running time ofenumerating all cutsets versus the graph density islinear for a given number of nodes and (2) it takes 96.71seconds to evaluate the network reliability of a 2x100lattice network which has 299paths.