Fault Tolerant Scheduling Algorithm for Diagnosing Crosstalk Faults in Dilated Re-arrangeable Network

碩士 === 元智大學 === 資訊工程學系 === 90 === Photonic switching networks providing high-speed transmission to avoid the repeated optical-to-electronic (O/E) and electronic-to-optical (E/O) signal conversions in high-speed communications has become a tendency to the future network. The electro-opti...

Full description

Bibliographic Details
Main Authors: Shih-Chao Chang, 張世昭
Other Authors: I-Shyan Hwang
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/87004560440829344504
Description
Summary:碩士 === 元智大學 === 資訊工程學系 === 90 === Photonic switching networks providing high-speed transmission to avoid the repeated optical-to-electronic (O/E) and electronic-to-optical (E/O) signal conversions in high-speed communications has become a tendency to the future network. The electro-optical coupler[1]、[2] is a common switching elements in Dilated Optical Multistage Interconnection Networks (DOMINs). Optical crosstalk is a problem commonly found in DOMINs. Because of the undesirable coupling within optical switch, a portion of energy of input signal might be transmitted to the undesired output terminal in the switch. Previous works [3]、[4]、[5]、[6] have devised fault diagnosis algorithm for both dilated blocking network and dilated rearrangeable network. The method based on Tabular Methodology is able to find out the optimal fault cluster for fault detection and location in the dilated blocking network. In the paper, we adopt the same method to find out the optimal fault clusters in the Dilated Benes Network (DBN) that belongs to dilated rearrangeable network. By means of the faulty switch information and the proposed Path Generation Algorithm, Fault-free Path Generation Algorithm and Scheduling Algorithm, we can resolve the scheduling problem for establishing connections in the DBN. Our method can reduce the routing number to find out the proper routing paths for connections, speed up the establishment of connections, and reach a balance between hardware cost and transmission efficiency [7]. Finally, we use the Markov model to analyze system reliability of the traditional scheduling algorithm and the proposed scheduling algorithm. The experiment results show that our method is efficient to establish connections and to achieve fault tolerance to raise the system reliability by multiple rounds.