Suspect fault screening assisted graph aggregation network for intra-/inter-node failure localization in ROADM-based optical networks |
|
Author: | Wang, Ruikun1; Zhang, Jiawei1; Yan, Shuangyi2; |
Organizations: |
1State Key Lab of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications (BUPT), Beijing, China 2High Performance Networks Group, Smart Internet Lab, University of Bristol, Bristol, UK 3Centre for Wireless Communications, University of Oulu, Oulu, Finland |
Format: | article |
Version: | accepted version |
Access: | open |
Online Access: | PDF Full Text (PDF, 1.5 MB) |
Persistent link: | http://urn.fi/urn:nbn:fi-fe202301306514 |
Language: | English |
Published: |
,
2022
|
Publish Date: | 2023-01-30 |
Description: |
AbstractWe propose a suspect fault screening assisted graph aggregation network for intra-/inter-node failure localization in ROADM-based optical networks, which is validated in both simulated topology and testbed. Results show that it achieves satisfactory accuracy under different percentage of OPMs and the number of service requests. see all
|
ISBN: | 978-1-957171-15-9 |
ISBN Print: | 978-1-6654-7557-0 |
Pages: | 1 - 4 |
Host publication: |
2022 European Conference on Optical Communication (ECOC) |
Conference: |
European Conference on Optical Communication |
Type of Publication: |
A4 Article in conference proceedings |
Field of Science: |
213 Electronic, automation and communications engineering, electronics |
Subjects: | |
Funding: |
This work was supported by the National Nature Science Foundation of China Projects (No. 61971055), and the BUPT Innovation and Entrepreneurship Support Programs (2022-YC-T006, 2022-YC-A004). |
Copyright information: |
© 2022 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |