Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14279/11022
DC FieldValueLanguage
dc.contributor.authorPanayiotou, Tania-
dc.contributor.authorChatzis, Sotirios P.-
dc.contributor.authorEllinas, Georgios-
dc.date.accessioned2018-05-04T11:56:20Z-
dc.date.available2018-05-04T11:56:20Z-
dc.date.issued2018-03-
dc.identifier.citationJournal of Optical Communications and Networking, 2018, vol. 10, no. 3, pp. 162-173en_US
dc.identifier.issn15365379-
dc.identifier.urihttps://hdl.handle.net/20.500.14279/11022-
dc.description.abstractIn this work we consider the problem of fault localization in transparent optical networks. We attempt to localize single-link failures by utilizing statistical machine learning techniques trained on data that describe the network state upon current and past failure incidents. In particular, a Gaussian process classifier is trained on historical data extracted from the examined network, with the goal of modeling and predicting the failure probability of each link therein. To limit the set of suspect links for every failure incident, the proposed approach is complemented by the utilization of a graph-based correlation heuristic. The proposed approach is tested on a number of datasets generated for an orthogonal frequency-division multiplexing-based optical network, and demonstrates that the approach achieves a high localization accuracy (91%-99%) that is insignificantly affected as the size of the historical dataset is reduced. The approach is also compared to a conventional fault localization method that is based on the utilization of monitoring information. It is shown that the conventional method significantly increases the network cost, as measured by the number of monitoring nodes required to achieve the same accuracy as that achieved by the proposed approach. The proposed scheme can be used by service providers to reduce the network cost related to the fault localization procedure. As the approach is generic and does not depend on specific network technologies, it can be applied to different network types, e.g., fixed-grid or space-division multiplexing elastic optical networks.en_US
dc.formatpdfen_US
dc.language.isoenen_US
dc.relation.ispartofJournal of Optical Communications and Networkingen_US
dc.rights© Optical Society of Americaen_US
dc.subjectFailure localizationen_US
dc.subjectFlex-grid optical networksen_US
dc.subjectGaussian process classifieren_US
dc.subjectStatistical machine learningen_US
dc.subjectTransparent optical networksen_US
dc.titleLeveraging Statistical Machine Learning to Address Failure Localization in Optical Networksen_US
dc.typeArticleen_US
dc.collaborationUniversity of Cyprusen_US
dc.collaborationCyprus University of Technologyen_US
dc.subject.categoryElectrical Engineering - Electronic Engineering - Information Engineeringen_US
dc.journalsSubscriptionen_US
dc.countryCyprusen_US
dc.subject.fieldEngineering and Technologyen_US
dc.publicationPeer Revieweden_US
dc.identifier.doi10.1364/JOCN.10.000162en_US
dc.relation.issue3en_US
dc.relation.volume10en_US
cut.common.academicyear2017-2018en_US
dc.identifier.spage162en_US
dc.identifier.epage173en_US
item.fulltextNo Fulltext-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_6501-
item.openairetypearticle-
item.languageiso639-1en-
crisitem.journal.journalissn1943-0639-
crisitem.journal.publisherOptical Society of America-
crisitem.author.deptDepartment of Electrical Engineering, Computer Engineering and Informatics-
crisitem.author.facultyFaculty of Engineering and Technology-
crisitem.author.orcid0000-0002-4956-4013-
crisitem.author.parentorgFaculty of Engineering and Technology-
Appears in Collections:Άρθρα/Articles
CORE Recommender
Show simple item record

SCOPUSTM   
Citations

59
checked on Nov 9, 2023

WEB OF SCIENCETM
Citations

43
Last Week
0
Last month
2
checked on Jul 7, 2023

Page view(s) 20

422
Last Week
2
Last month
13
checked on May 10, 2024

Google ScholarTM

Check

Altmetric


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