In partial fulfillment of the Requirements for the Degree of

Master of Science

will defend his thesis

Survival Probability Analysis

For forward loop backward hop (FLBH) double-loop ring networks, when nodes in the network break down, networks with an ability to communicate between every non-faulty node pair are very desirable. This paper introduces a new measure, Network Survivability, to evaluate the ability of the network’s communication. Network survivability is defined as a conditional probability that the current probability is based on the probability that at a previous time the network’s communications have not been disrupted. In previous works by other authors, the node failures may occur simultaneously. This paper considers that the node failures are in a sequence. Computer techniques based on backtracking and graph theory are used to create an event tree and examine the path of each node pair. In this paper, we only generate one major branch instead of a whole tree, which reduces the computation time by a factor of N (number of nodes in a network). Also we cut out dead branches, which may reduce the amount of computation too. From the event tree, the network survivability is calculated as nodes are broken one by one.

Date: Friday, November 17, 2000

Time: 2:00 PM

Place: 550-PGH

Faculty, students, and the general public are invited.

Thesis Advisor: Dr. Olin Johnson