Today, network component failures caused by attacks(natural disasters or accidents) can knock out telecommunications services for hours, days, or even weeks, with serious repercussions for customers and network providers. And, the use of telecommunication networks for vital business communication transactions increases rapidly. Thus, survivability analysis is more important than even before.
In order to assess the survivability of a network, a pair of analysis techniques called the survivability matrix and survivability starplot are employed. These techniques can analyze the survivability of network systematically, provided that the exact value of survivability can be computed. For computing the survivability exactly, however, one has to compare the values of all possible cutsets, but this requires considerable computational endeavors.
This thesis first presents a method for computing the survivability of simple networks(tree or ring topology), and then expands it into the method for computing the survivability of general networks. This method decompose a graph having general structure into several unit graphs having a special structure(ring topology) by using the shrink technique, and compute the exact value of survivability. Additionally it can reduce the computational burdens. Illustrative examples are given also.