Optical Switching and Networking最新文献

{"title":"A deep neural network with a fuzzy multi-objective optimization model for fault analysis in an elastic optical network","authors":"André Luiz Ferraz Lourenço,&nbsp;Amílcar Careli César","doi":"10.1016/j.osn.2021.100644","DOIUrl":"10.1016/j.osn.2021.100644","url":null,"abstract":"<div><p><span><span>The elastic optical network (EON) is the most attractive architecture for the next generation of optical networks. Dealing with high bit-rate traffic, EON faces the challenge of ensuring </span>survivability to operate with stringent </span>Service Level Agreements<span>. This article proposes a Deep Neural Network<span><span> model with a multi-objective Fuzzy Inference System (FIS) to solve the Routing and Spectrum Assignment problem with Shared Backup Path Protection. The algorithm aims to optimize the trade-off between </span>blocking probability<span> (BP) and fault restoration ratio (FRR). It uses a new spectrum-fragmentation metric to improve the FRR of affected connections. The FIS adds features of load balancing and alignment of allocation path solutions. We use figures of merit as BP of connection requests, FRR, spectrum utilization ratio, and connection downtime to evaluate the algorithm performance. The proposed algorithm organizes traffic in a less fragmented way, efficiently uses routing and protection resources, and performs well compared to similar algorithms related in the literature.</span></span></span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"43 ","pages":"Article 100644"},"PeriodicalIF":2.2,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100644","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131712951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient dynamic routing in Spectrally-Spatially Flexible Optical Networks based on traffic categorization and supervised learning methods","authors":"Róża Goścień,&nbsp;Paweł Ksieniewicz","doi":"10.1016/j.osn.2021.100650","DOIUrl":"10.1016/j.osn.2021.100650","url":null,"abstract":"<div><p>In this paper, we focus on the efficient dynamic routing in <span><em>Spectrally-Spatially Flexible </em><em>Optical Networks</em></span> (<span>ss-fon</span>) realized using <em>Single-Mode Fiber Bundles</em> (<span>smfb</span>s). We study two scenarios – unprotected network (<span>np</span>) and network protected by dedicated path protection (<span>dpp</span>) against a single link failure. For these configurations, we propose a dedicated optimization approach (<em>Enhanced Adaptive Spectral-Spatial Allocation</em> – <span>e-assa</span>), which makes use of the traffic categorization and application of different allocation strategies for different traffic categories. To select beneficial categorization rules, we employ <em>supervised learning</em><span> paradigm. We show that the selection of a beneficial regression algorithm to support network optimization cannot be performed based only on standard metrics like r2 but some additional measures/experiments are necessary. Then, we carry out extensive numerical experiments in order to tune the approach and to evaluate its efficiency based on the comparison with reference methods. The results prove high efficiency of the proposed optimization framework, which provides low blocking probability and significantly shorter processing time compared to the best of reference methods.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"43 ","pages":"Article 100650"},"PeriodicalIF":2.2,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123419388","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Network-state-dependent routing and route-dependent spectrum assignment for PRMLSA problem in all-optical elastic networks","authors":"V.A.C. Vale ,&nbsp;R.C. Almeida Jr. ,&nbsp;K.D.R. Assis","doi":"10.1016/j.osn.2021.100646","DOIUrl":"10.1016/j.osn.2021.100646","url":null,"abstract":"<div><p><span><span>The advent of Elastic Optical Networks<span> (EON) has led to significant improvements in optical network spectrum utilization when compared to Wavelength Division Multiplexing<span> Optical Networks. However, the EON brought challenges to be explored, notably the Power, Routing, Modulation Level and Spectrum Assignment (PRMLSA) problem. This article aims to explore techniques for the PRMLSA problem, being developed two strategies named Shortest and Least Allocated (SLA) Path and Route-Based Spectrum Assignment (RBSA), which, respectively, include the link </span></span></span>power spectral density<span> inspection dynamic for routing and a physical layer factor (distance traveled) for Spectrum Assignment. Furthermore, a simplified version of the Adaptive Power Assignment (APA) [1] algorithm is presented, in which a power value between the minimum necessary and the maximum allowed is assigned to the signal. The simultaneous use of the SLA and RBSA algorithms resulted in locks of up to 0.00132%, being more than 10 times lower than the 0.0164% of the Shortest-Path and First-Fit algorithms. While the simplification of the APA resulted in 18.38% of the execution time of its respective original version, but with an increase in the </span></span>blocking probability, which went from 0.016% to 0.031%, despite still being below conventional techniques, as the Constant Power Assignment strategy.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"43 ","pages":"Article 100646"},"PeriodicalIF":2.2,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127671730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Novel evolutionary planning technique for flexible-grid transmission in optical networks","authors":"Matheus R. Sena ,&nbsp;Pedro J. Freire ,&nbsp;Leonardo D. Coelho ,&nbsp;Alex F. Santos ,&nbsp;Antonio Napoli ,&nbsp;Raul C. Almeida Jr.","doi":"10.1016/j.osn.2021.100648","DOIUrl":"10.1016/j.osn.2021.100648","url":null,"abstract":"<div><p><span><span>This paper proposes a novel joint resource allocation technique for flexible-grid systems by utilizing non-dominant sort </span>genetic algorithm<span> (NSGA-II) in a multi-objective optimization framework. It pioneers the implementation of an evolutionary mechanism to optimize resources as means of mitigation of physical layer impairments. This investigation initially introduces a proposal in which bandwidth reduction, maximization of the minimum signal-to-noise ratio (SNR) margin, and minimization/maximization of the sum of SNR margins are studied under dual-objective </span></span>Pareto analysis in the link-level scenario. Later, the technique extends existing provisioning strategies for network planning by targeting the reduction of blocking and spectral utilization of optical connections.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"43 ","pages":"Article 100648"},"PeriodicalIF":2.2,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131618966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Channel power optimization in WDM systems using co-evolutionary genetic algorithm","authors":"Masoud Vejdannik,&nbsp;Ali Sadr","doi":"10.1016/j.osn.2021.100637","DOIUrl":"10.1016/j.osn.2021.100637","url":null,"abstract":"<div><p>In this work, we present a co-evolutionary genetic (CEGA) algorithm to adapt the optical launch powers and optimize the signal-to-noise ratio (SNR) values based on maximizing the minimum SNR margin. The introduced co-evolutionary algorithm provides lower computational complexity<span><span> rather than convex optimization<span><span> and linear programming techniques, applicable for both static and time-critical dynamic networking. The enhanced Gaussian noise<span> nonlinear model is exploited to take the physical-layer impairments into account, considering networks with partial spectrum utilization. To optimize the minimum SNR margin, we formulate the </span></span>power allocation<span> problem as a minimax optimization problem. To this end, a two-space </span></span></span>genetic algorithm<span> (GA) is proposed to reduce the computational complexity. The obtained results demonstrate that the introduced co-evolutionary algorithm outperforms the common optimization methods in terms of run time. It is shown that the computational complexity of proposed co-evolutionary algorithm is significantly lower than convex and single-space evolutionary approaches by several orders of magnitude. Moreover, the minimum SNR margin is improved by about 2.4 dB compared to a flat launch power optimization.</span></span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"43 ","pages":"Article 100637"},"PeriodicalIF":2.2,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100637","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134445685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel channel-based model for the problem of routing, space, and spectrum assignment","authors":"Qian Wu,&nbsp;Jiading Wang,&nbsp;Maiko Shigeno","doi":"10.1016/j.osn.2021.100636","DOIUrl":"10.1016/j.osn.2021.100636","url":null,"abstract":"<div><p><span>Space-division multiplexing (SDM) is regarded as one of the most promising technologies to satisfy the explosively growing internet traffic. Elastic optical networks with SDM is one of the newest </span>network architectures<span> for network planning in the future. However, the resource allocation problem<span><span> in these networks becomes more complicated due to the expansion of spatial dimensions. In this paper, we propose a novel channel-based integer linear programming (ILP) model for the problem of routing, space, and spectrum assignment (RSSA) in consideration of space lane change in SDM-EON. To evaluate our model, we make a comparison with the slot-based model [15] via simulation experiments. Different spatial switching </span>granularities are considered in our performance evaluation because they will greatly change the detailed results of allocation. By the numerical results, we find that our novel model has an overwhelming advantage over the previous slot-based one in computing time for the optimization process.</span></span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"43 ","pages":"Article 100636"},"PeriodicalIF":2.2,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129220814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Crosstalk-aware routing, spectrum, and core assignment based on AoD nodes in SDM-EONs with bidirectional multicore fibers","authors":"Shan Yin,&nbsp;Yidong Chen,&nbsp;Sicong Ding,&nbsp;Zhidong Zhang,&nbsp;Shanguo Huang","doi":"10.1016/j.osn.2021.100647","DOIUrl":"10.1016/j.osn.2021.100647","url":null,"abstract":"<div><p><span><span>Inter-core crosstalk<span> causes severe signal impairment in Space Division Multiplexing Elastic Optical Networks (SDM-EON) with multi-core fibre (MCF). In order to mitigate the influence of crosstalk between cores, bidirectional MCF is used. SDM-EON has dramatically increased the </span></span>network bandwidth<span> and is the mainstream trend of future communications, but the overall cost of such an SDM-EON will increase with traditional hard-connected node structures. On-demand architecture node (AoD) in SDM-EON can dynamically select modes based on incoming services with less cost than traditional node. Although bidirectional multi-core optical fibres can mitigate the impact of crosstalk between adjacent cores, it is still necessary to develop appropriate routing, spectrum, and </span></span>core assignment<span> strategies to reduce the impact of crosstalk. In addition, the resource allocation strategy will affect the type of on-demand architecture node. This paper develops a core selection method for classified services on a multi-dimensional optical network with bidirectional multi-core fibres. It also proposes an on-demand architecture node suitable for this services classification scheme<span>. According to the proposed core classification method, a routing and resource allocation algorithm that considers the impact of spectrum fragmentation and crosstalk between cores is proposed. The final simulation results prove that the algorithm is beneficial to improve network performance.</span></span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"43 ","pages":"Article 100647"},"PeriodicalIF":2.2,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132166029","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Crafting optimal and resilient iBGP-IP/MPLS overlays for transit backbone networks","authors":"Cristina Mayr,&nbsp;Claudio Risso,&nbsp;Eduardo Grampín","doi":"10.1016/j.osn.2021.100635","DOIUrl":"https://doi.org/10.1016/j.osn.2021.100635","url":null,"abstract":"<div><p><span>The Internet is a collection of interconnected Autonomous Systems (ASes) that use the Border Gateway Protocol (BGP) to exchange </span>reachability<span><span> information. In this regard, BGP stability and scalability in the inter-domain scope have been matters of major concern for many years, and network engineers have been applying several techniques to cope with these issues. BGP is also used intra-domain (internal BGP - iBGP), to disseminate reachability information inside each AS, and works together with the Interior Gateway Protocols<span> (IGPs) such as OSPF or IS-IS, to build routing tables. Route reflection is a widely adopted technique to tackle BGP scalability in the intra-domain scope, and choosing which routers will play the reflector role and which BGP sessions will be established among reflectors and clients (i.e. the routers which are not elected as reflectors), building an overlay of iBGP sessions, is known as the iBGP overlay design problem. The design of an optimal iBGP overlay is known to be a NP-Hard problem, and we proposed solutions for pure IP networks (i.e. best </span></span>effort traffic<span> forwarding) in our previous work. However, most Internet providers implement their backbones by combining IP routing with MPLS (Multiprotocol Label Switching) for QoS-aware traffic forwarding. MPLS forwarding incorporates traffic engineering and more efficient failover mechanisms; under this traffic forwarding paradigm, the design of traffic-engineered Label Switched Paths<span><span> (LSPs, also referred as MPLS tunnels) shall be combined with the aforementioned iBGP overlay design. The present work introduces a coordinated design of both the iBGP overlay and the IP/MPLS substrates. Our contribution is the proposal of an optimal and resilient topology design for an IP/MPLS Internet backbone, which takes advantage of traffic engineering features to optimize the demands, while guaranteeing iBGP overlay </span>optimality. We present a complete solution for a real world scenario, and we study the scalability of the solution for synthetic topologies, achieving encouraging results.</span></span></span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100635"},"PeriodicalIF":2.2,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100635","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91593729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Confidentiality meets protection in elastic optical networks","authors":"G. Savva,&nbsp;K. Manousakis,&nbsp;G. Ellinas","doi":"10.1016/j.osn.2021.100620","DOIUrl":"10.1016/j.osn.2021.100620","url":null,"abstract":"<div><p><span><span><span>This work considers the joint problem of securing confidential demands against </span>eavesdropping attacks and protecting the network against link failures in elastic </span>optical networks<span><span> (EONs). Network coding is used to provide security for confidential connections by encrypting the data through XOR operations at the physical layer with other established connections in the network. Backup paths are also computed for protecting the primary path of the confidential connections, while ensuring that the level of security for the confidential demands is preserved in case of a link failure on the primary path or on any of the paths involved in the XOR process. A realistic network scenario is modeled, where four different classes of connections are considered with respect to their protection and security requirements, while a combination of novel </span>integer linear programming (ILP) and </span></span>heuristic algorithms are used to establish each class of demands in the network. The proposed algorithms are evaluated in terms of spectrum utilization, network blocking, and level of security provided. From the results obtained it is evident that confidential connections can be transmitted in a secure manner, while for the classes that require both security and protection, the connections retain their required level of security in the event of any single link failure in the network.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100620"},"PeriodicalIF":2.2,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100620","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123560536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Disaster resilience of optical networks: State of the art, challenges, and opportunities","authors":"Jacek Rak ,&nbsp;Rita Girão-Silva ,&nbsp;Teresa Gomes ,&nbsp;Georgios Ellinas ,&nbsp;Burak Kantarci ,&nbsp;Massimo Tornatore","doi":"10.1016/j.osn.2021.100619","DOIUrl":"10.1016/j.osn.2021.100619","url":null,"abstract":"<div><p>For several decades, optical networks, due to their high capacity and long-distance transmission range, have been used as the major communication technology to serve network traffic, especially in the core and metro segments of communication networks. Unfortunately, our society has often experienced how the correct functioning of these critical infrastructures can be substantially hindered by massive failures triggered by natural disasters, weather-related disruptions and malicious human activities.</p><p>In this position paper, we discuss the impact on optical networks of all major classes of disaster events mentioned above, and we overview recent relevant techniques that have been proposed to increase the disaster resilience of optical networks against the various classes of disaster events. We start by presenting some proactive methods to be applied before the occurrence of a disaster. Then we move our focus also on other preparedness methods that can be executed in the (typically short) time frame between the occurrence of an early alert of an incoming disaster and the time a disaster actually hits the network. Finally, we discuss reactive procedures that allow performing post-disaster recovery operations effectively. The analysis of disaster resilience mechanisms provided in this paper covers both wired and optical wireless communication infrastructures and also contains explicit remarks covering the role of emerging technologies (e.g., fixed-mobile convergence in the 5G era and beyond) in disaster resilience.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100619"},"PeriodicalIF":2.2,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100619","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129469555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}