An efficient optimal reconfiguration algorithm for FDDI-based networks

We study a new network architecture based on standard FDDI networks. This network, called FDDI-based reconfigurable network (FBRN), is constructed using multiple FDDI token rings and has the ability to reconfigure itself in the event of extensive damage to the network. Thus, an FBRN has the potential to provide high available bandwidth even in the presence of numerous faults. Realization of this potential depends crucially on a reconfiguration algorithm that guides the reconfiguration process. We design and analyze a reconfiguration algorithm for FBRNs. Our algorithm is optimal in the sense that it always produces a configuration that results in the maximum available bandwidth for a given fault pattern. This algorithm has a polynomial time complexity. We also show that the available bandwidth of an FBRN is dramatically improved with our reconfiguration algorithm