Asynchronous failure location algorithm for fiber-optic networks

Author

Abu-Amara, Marwan H.

Author_Institution

Bell-Northern Res. Inc., Richardson, TX, USA

fYear

1995

fDate

25-28 Oct 1995

Firstpage

690

Lastpage

693

Abstract

All current research on fiber-optic networks assume that the underlying fiber-optic network delivers the messages correctly to their intended destination. To satisfy the assumption of correct delivery of messages, we present an algorithm that locates possible stuck-at faults in the switching subsystems of the nodes of general asynchronous fiber-optic networks and provides the nodes of such a network with reliable paths for delivering messages sent between any two nodes. The algorithm has an O(n²E) message complexity and O(Elog₂n+mnlog₂n) bit storage complexity, where n, E, and m are the total number of nodes, the total number of edges, and the maximum degree of the network, respectively

Keywords

communication complexity; fault tolerant computing; optical fibre networks; asynchronous failure location algorithm; fiber-optic networks; message complexity; reliable paths; storage complexity; stuck-at faults; switching subsystems; Clocks; Communications technology; Computer networks; Distributed algorithms; Intrusion detection; Nominations and elections; Optical fiber communication; Optical fiber networks; Optical network units; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing, 1995. Proceedings. Seventh IEEE Symposium on

Conference_Location

San Antonio, TX

ISSN

1063-6374

Print_ISBN

0-81867195-5

Type

conf

DOI

10.1109/SPDP.1995.530749

Filename

530749