Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMas, C.-
dc.contributor.authorNguyen, H.-
dc.contributor.authorThiran, P.-
dc.contributor.editorSivalingam, K.-
dc.contributor.editorSubramaniam, S.-
dc.identifier.citationEmerging Optical Network Technologies: Architectures, Protocols and Performance, 2005 / Sivalingam, K., Subramaniam, S. (ed./s), pp.379-399-
dc.description.abstractFault identification and location in optical networks must cope with a multitude of factors: (i) the redundancy and the lack of coordination (internetworking) of the managements at the different layers (WDM, SDH/SONET, ATM, IP); (ii) the large number of alarms a single failure can trigger; (iii) the difficulty in detecting some failures and the resulting need to cope with missing or false alarms. This chapter first details the behavior of network components in transparent WDM networks when a failure occurs. Using this model, we then describe an efficient algorithm (Fault Location Algorithm, FLA) pointing out the element(s) which is (are) most likely to be the cause of the received alarms. Although the problem of multiple failure diagnosis is known to be NP-hard, the non-polynomial complexity of the algorithm is pushed ahead in a pre-computational phase, which can be done off-line, and not at the time of a failure. The diagnosis phase is therefore very rapid. We discuss the time and space complexity of the FLA.-
dc.description.statementofresponsibilityCarmen Mas, Hung X. Nguyen and Patrick Thiran-
dc.subjectWDM network components-
dc.subjectfailure model-
dc.subjectfailure management-
dc.titleFailure location in WDM networks-
dc.typeBook chapter-
dc.contributor.departmentTeletraffic Research Centre for Mathematical Modelling-
dc.publisher.placeNew York-
dc.identifier.orcidNguyen, H. [0000-0003-1028-920X]-
Appears in Collections:Aurora harvest
Mathematical Sciences publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.