Leveraging genetic algorithm to address multi-failure localization in optical networks

IF 1.9 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
Masoud Vejdannik, Ali Sadr
{"title":"Leveraging genetic algorithm to address multi-failure localization in optical networks","authors":"Masoud Vejdannik,&nbsp;Ali Sadr","doi":"10.1016/j.osn.2022.100706","DOIUrl":null,"url":null,"abstract":"<div><p><span>Fault management has long been an indispensable component for controlling and managing telecommunication networks<span>. To prevent huge data losses, it is necessary to develop a fast and efficient fault localization<span> mechanism. In this work, we study the problem of multi-failure localization in transparent optical networks<span>. In this context, a correlation-based approach is introduced to exploit the quality of transmission of acquired lightpaths to localize the faulty links. The proposed search-based framework can be implemented by leveraging any search algorithm. One may utilize the </span></span></span></span>exhaustive search<span><span> method to localize faulty links more accurately, but at the cost of taking more time. On the other hand, one may utilize intelligent search methods with the aim of reducing the required time for localization at the expense of accuracy. However, we propose to use both of the search approaches together. In this way, faulty links are first localized by the intelligent search methods to reroute and restore the failed traffic as fast as possible to prevent further loss of data. To this aim, a genetic algorithm (GA) is proposed to search among the suspected links. Subsequently, exhaustive search method can be utilized to localize failures more accurately without time constraint and then send technicians to the right site to recover the faulty links. The obtained results reveal that the proposed GA approach achieves overall high </span>localization accuracy (98.6%–100%) that is insignificantly affected as the traffic load decreases. Dual and triple-failure incidents are localized within 42–80 ms and 596–2180 ms, respectively. It is shown that the mean time required for localizing failures using the GA search algorithm is significantly lower than exhaustive search approach by several orders of magnitude. Hence, the proposed GA-based fault localization algorithm can reduce the average time required to restore the traffic in case of failures, applicable for the restoration applications.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"47 ","pages":"Article 100706"},"PeriodicalIF":1.9000,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Optical Switching and Networking","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S157342772200042X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Fault management has long been an indispensable component for controlling and managing telecommunication networks. To prevent huge data losses, it is necessary to develop a fast and efficient fault localization mechanism. In this work, we study the problem of multi-failure localization in transparent optical networks. In this context, a correlation-based approach is introduced to exploit the quality of transmission of acquired lightpaths to localize the faulty links. The proposed search-based framework can be implemented by leveraging any search algorithm. One may utilize the exhaustive search method to localize faulty links more accurately, but at the cost of taking more time. On the other hand, one may utilize intelligent search methods with the aim of reducing the required time for localization at the expense of accuracy. However, we propose to use both of the search approaches together. In this way, faulty links are first localized by the intelligent search methods to reroute and restore the failed traffic as fast as possible to prevent further loss of data. To this aim, a genetic algorithm (GA) is proposed to search among the suspected links. Subsequently, exhaustive search method can be utilized to localize failures more accurately without time constraint and then send technicians to the right site to recover the faulty links. The obtained results reveal that the proposed GA approach achieves overall high localization accuracy (98.6%–100%) that is insignificantly affected as the traffic load decreases. Dual and triple-failure incidents are localized within 42–80 ms and 596–2180 ms, respectively. It is shown that the mean time required for localizing failures using the GA search algorithm is significantly lower than exhaustive search approach by several orders of magnitude. Hence, the proposed GA-based fault localization algorithm can reduce the average time required to restore the traffic in case of failures, applicable for the restoration applications.

利用遗传算法解决光网络多故障定位问题
长期以来,故障管理一直是控制和管理电信网络不可或缺的组成部分。为了防止巨大的数据丢失,有必要开发一种快速高效的故障定位机制。在这项工作中,我们研究了透明光网络中的多故障定位问题。在这种情况下,引入了一种基于相关性的方法来利用所获取的光路的传输质量来定位故障链路。所提出的基于搜索的框架可以通过利用任何搜索算法来实现。可以利用穷举搜索方法来更准确地定位故障链路,但代价是花费更多时间。另一方面,可以利用智能搜索方法,目的是以牺牲准确性为代价来减少定位所需的时间。然而,我们建议同时使用这两种搜索方法。通过这种方式,故障链路首先通过智能搜索方法进行定位,以尽快重新路由和恢复故障流量,防止数据进一步丢失。为此,提出了一种遗传算法来搜索可疑链接。随后,可以利用穷举搜索方法在没有时间限制的情况下更准确地定位故障,然后派遣技术人员到正确的地点恢复故障链路。所获得的结果表明,所提出的遗传算法实现了总体较高的定位精度(98.6%–100%),但随着流量负载的降低,定位精度不会受到显著影响。双重和三重故障事件分别位于42–80 ms和596–2180 ms内。结果表明,使用GA搜索算法定位故障所需的平均时间显著低于穷举搜索方法几个数量级。因此,所提出的基于遗传算法的故障定位算法可以减少故障情况下恢复业务所需的平均时间,适用于恢复应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Optical Switching and Networking
Optical Switching and Networking COMPUTER SCIENCE, INFORMATION SYSTEMS-OPTICS
CiteScore
5.20
自引率
18.20%
发文量
29
审稿时长
77 days
期刊介绍: Optical Switching and Networking (OSN) is an archival journal aiming to provide complete coverage of all topics of interest to those involved in the optical and high-speed opto-electronic networking areas. The editorial board is committed to providing detailed, constructive feedback to submitted papers, as well as a fast turn-around time. Optical Switching and Networking considers high-quality, original, and unpublished contributions addressing all aspects of optical and opto-electronic networks. Specific areas of interest include, but are not limited to: • Optical and Opto-Electronic Backbone, Metropolitan and Local Area Networks • Optical Data Center Networks • Elastic optical networks • Green Optical Networks • Software Defined Optical Networks • Novel Multi-layer Architectures and Protocols (Ethernet, Internet, Physical Layer) • Optical Networks for Interet of Things (IOT) • Home Networks, In-Vehicle Networks, and Other Short-Reach Networks • Optical Access Networks • Optical Data Center Interconnection Systems • Optical OFDM and coherent optical network systems • Free Space Optics (FSO) networks • Hybrid Fiber - Wireless Networks • Optical Satellite Networks • Visible Light Communication Networks • Optical Storage Networks • Optical Network Security • Optical Network Resiliance and Reliability • Control Plane Issues and Signaling Protocols • Optical Quality of Service (OQoS) and Impairment Monitoring • Optical Layer Anycast, Broadcast and Multicast • Optical Network Applications, Testbeds and Experimental Networks • Optical Network for Science and High Performance Computing Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信