Date of Award

1999

Degree Type

Thesis

Degree Name

M.Sc.

Department

Computer Science

First Advisor

Bandyopadhyay, S.

Keywords

Computer Science.

Rights

CC BY-NC-ND 4.0

Abstract

In this thesis, we have proposed and simulated two fault-tolerant schemes using the De Bruijn graph as a network physical topology where we treat some special nodes as spare resources. In our first scheme, we have attempted to design an all-optical single-hop fault-tolerant network. However, when we tested this scheme by randomly generating faults, it could not provide alternate paths in the presence of faults in most cases. Our second scheme, a hybrid system of single-hop and multihop system can successfully manage multiple faults almost in all cases. However, the disadvantage of our second scheme is that our network is no longer an all-optical network, and its throughput is lower because of electrical buffering at some intermediate points. Another disadvantage of this scheme is that the system can result in intolerable restoration delay for some communications due to the high demand on certain links since there is no upper limit on the number of communications through any edge. We have tried to distribute the communications through different links as uniformly as possible to improve this delay. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1999 .M35. Source: Masters Abstracts International, Volume: 39-02, page: 0529. Adviser: Subir Bandyopadhyay. Thesis (M.Sc.)--University of Windsor (Canada), 1999.

Share

COinS