INCORPORATING DEPENDENT NODE DAMAGE IN DETERMINISTIC CONNECTIVITY ANALYSIS AND SYNTHESIS OF NETWORKS

Survivability of a node vulnerable network is often assessed in terms of the (node) connectivity of the graph that represents the logical topology of the network. When the damage causing events have widespread impact then, owing to the physical layout of the network facilities, each event can destroy several nodes. As a survivability measure, we define the generalized connectivity as the minimum number of events required to disconnect the network. To model the possible effects of damage causing events, we introduce the notion of a dependence graph on the nodes of the network and a set of admissible cliques in this graph. Nodes that are nonadjacent in the dependence graph are independent, i. e. , they cannot be damaged by the same event, and each event destroys an admissible clique of nodes. We present techniques for calculating or bounding the generalized connectivity of given network graphs, and for synthesizing minimum link networks with prescribed generalized connectivity.