首页 > 最新文献

Optical Switching and Networking最新文献

英文 中文
Network-state-dependent routing and route-dependent spectrum assignment for PRMLSA problem in all-optical elastic networks 全光弹性网络PRMLSA问题的网络状态相关路由和路由相关频谱分配
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-02-01 Epub Date: 2021-10-04 DOI: 10.1016/j.osn.2021.100646
V.A.C. Vale , R.C. Almeida Jr. , K.D.R. Assis

The advent of Elastic Optical Networks (EON) has led to significant improvements in optical network spectrum utilization when compared to Wavelength Division Multiplexing 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 power spectral density 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 blocking probability, which went from 0.016% to 0.031%, despite still being below conventional techniques, as the Constant Power Assignment strategy.

与波分复用光网络相比,弹性光网络(EON)的出现大大提高了光网络的频谱利用率。然而,EON带来了有待探索的挑战,特别是功率、路由、调制电平和频谱分配(PRMLSA)问题。本文旨在探讨解决PRMLSA问题的技术,提出了最短和最小分配(SLA)路径和基于路由的频谱分配(RBSA)两种策略,分别包括用于路由的链路功率谱密度动态检测和用于频谱分配的物理层因子(行进距离)。此外,提出了一种简化版的自适应功率分配(APA)[1]算法,其中为信号分配一个介于最小必要值和最大允许值之间的功率值。同时使用SLA和RBSA算法导致锁定率高达0.00132%,比最短路径和第一匹配算法的0.0164%低10倍以上。而在恒功率分配策略下,APA简化后的执行时间为原始版本的18.38%,但阻塞概率从0.016%增加到0.031%,尽管仍然低于传统技术。
{"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}
引用次数: 4
Novel evolutionary planning technique for flexible-grid transmission in optical networks 一种新的光网络柔性电网传输进化规划技术
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-02-01 Epub Date: 2021-09-22 DOI: 10.1016/j.osn.2021.100648
Matheus R. Sena , Pedro J. Freire , Leonardo D. Coelho , Alex F. Santos , Antonio Napoli , Raul C. Almeida Jr.

This paper proposes a novel joint resource allocation technique for flexible-grid systems by utilizing non-dominant sort genetic algorithm (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 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.

在多目标优化框架下,利用非优势排序遗传算法(NSGA-II),提出了一种柔性网格系统联合资源分配的新方法。它率先实施了一种进化机制,以优化资源,作为减轻物理层损伤的手段。本研究首先提出了一种建议,该建议在链路级场景的双目标Pareto分析下,研究带宽减少、最小信噪比(SNR)边际最大化以及信噪比边际之和的最小化/最大化。随后,该技术通过减少光连接的阻塞和频谱利用率,扩展了现有的网络规划供应策略。
{"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}
引用次数: 2
Channel power optimization in WDM systems using co-evolutionary genetic algorithm 基于协同进化遗传算法的波分复用系统信道功率优化
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-02-01 Epub Date: 2021-08-09 DOI: 10.1016/j.osn.2021.100637
Masoud Vejdannik, Ali Sadr

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 rather than convex optimization and linear programming techniques, applicable for both static and time-critical dynamic networking. The enhanced Gaussian noise 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 power allocation problem as a minimax optimization problem. To this end, a two-space genetic algorithm (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.

在这项工作中,我们提出了一种共同进化遗传(CEGA)算法来适应光发射功率,并在最大化最小信噪比的基础上优化信噪比(SNR)值。引入的协同进化算法比凸优化和线性规划技术具有更低的计算复杂度,适用于静态和时间关键型动态网络。利用增强高斯噪声非线性模型考虑物理层损伤,考虑部分频谱利用的网络。为了优化最小信噪比余量,我们将功率分配问题表述为极小极大优化问题。为此,提出了一种二维遗传算法(GA)来降低计算复杂度。结果表明,引入的协同进化算法在运行时间上优于常用的优化方法。结果表明,所提出的协同进化算法的计算复杂度明显低于凸进化和单空间进化方法几个数量级。此外,与平坦发射功率优化相比,最小信噪比边际提高了约2.4 dB。
{"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}
引用次数: 3
A novel channel-based model for the problem of routing, space, and spectrum assignment 一种新的基于信道的路由、空间和频谱分配问题模型
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-02-01 Epub Date: 2021-08-04 DOI: 10.1016/j.osn.2021.100636
Qian Wu, Jiading Wang, Maiko Shigeno

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 network architectures for network planning in the future. However, the resource allocation problem 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 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.

空分多路复用(SDM)被认为是满足爆炸性增长的互联网流量的最有前途的技术之一。SDM弹性光网络是未来网络规划的最新网络架构之一。然而,由于空间维度的扩大,这些网络中的资源分配问题变得更加复杂。本文针对SDM-EON中考虑空间信道变化的路由、空间和频谱分配问题,提出了一种基于信道的整数线性规划(ILP)模型。为了评估我们的模型,我们通过仿真实验与基于槽的模型[15]进行了比较。我们在性能评估中考虑了不同的空间切换粒度,因为它们会极大地改变分配的详细结果。数值结果表明,该模型在优化过程的计算时间上明显优于以往的基于槽的模型。
{"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}
引用次数: 5
Crosstalk-aware routing, spectrum, and core assignment based on AoD nodes in SDM-EONs with bidirectional multicore fibers 双向多芯光纤sdm - eon中基于AoD节点的串扰感知路由、频谱和核心分配
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2022-02-01 Epub Date: 2021-09-16 DOI: 10.1016/j.osn.2021.100647
Shan Yin, Yidong Chen, Sicong Ding, Zhidong Zhang, Shanguo Huang

Inter-core crosstalk 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 network bandwidth 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 core assignment 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. 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.

在多芯光纤空分复用弹性光网络(SDM-EON)中,芯间串扰会造成严重的信号损伤。为了减轻芯间串扰的影响,采用了双向MCF。SDM-EON极大地提高了网络带宽,是未来通信的主流趋势,但由于传统的硬连接节点结构,这种SDM-EON的总体成本会增加。SDM-EON中的按需架构节点(AoD)可以根据传入的服务动态选择模式,其成本比传统节点低。虽然双向多芯光纤可以减轻相邻芯间串扰的影响,但仍有必要制定适当的路由、频谱和芯分配策略来减少串扰的影响。此外,资源分配策略也会影响按需架构节点的类型。提出了一种双向多芯光纤多维光网络分类业务的芯选择方法。提出了适合该服务分类方案的按需架构节点。根据所提出的核心分类方法,提出了一种考虑频谱碎片和核心间串扰影响的路由和资源分配算法。最后的仿真结果证明了该算法有利于提高网络性能。
{"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}
引用次数: 7
Crafting optimal and resilient iBGP-IP/MPLS overlays for transit backbone networks 为传输骨干网制作最优和弹性的iBGP-IP/MPLS覆盖
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2021-11-01 Epub Date: 2021-07-13 DOI: 10.1016/j.osn.2021.100635
Cristina Mayr, Claudio Risso, Eduardo Grampín

The Internet is a collection of interconnected Autonomous Systems (ASes) that use the Border Gateway Protocol (BGP) to exchange reachability 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 (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 effort traffic 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 (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 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.

Internet是相互连接的自治系统(Autonomous system, as)的集合,这些自治系统使用边界网关协议BGP (Border Gateway Protocol)交换可达性信息。因此,BGP在域间范围内的稳定性和可扩展性一直是人们关注的问题,网络工程师们采用了多种技术来解决这些问题。BGP还可以在域内(内部BGP - iBGP)传播各自治系统内部的可达性信息,并与OSPF、is - is等内部网关协议(igp)共同建立路由表。路由反射是解决域内范围内BGP可扩展性的一种广泛采用的技术,在反射器和客户端(即未被选为反射器的路由器)之间选择哪些路由器起反射器作用,建立哪些BGP会话,建立iBGP会话的覆盖,被称为iBGP覆盖设计问题。最优iBGP覆盖的设计是一个NP-Hard问题,我们在之前的工作中提出了纯IP网络的解决方案(即尽最大努力流量转发)。然而,大多数互联网提供商通过将IP路由与MPLS(多协议标签交换)相结合来实现其骨干网,以实现qos感知的流量转发。MPLS转发融合了流量工程和更高效的故障转移机制;在这种流量转发模式下,流量工程标签交换路径(lsp,也称为MPLS隧道)的设计需要与上述iBGP覆盖设计相结合。本工作介绍了iBGP覆盖层和IP/MPLS基板的协调设计。我们的贡献是为IP/MPLS互联网骨干网提出了一种最优和弹性的拓扑设计,该拓扑设计利用流量工程的特点来优化需求,同时保证iBGP覆盖的最优性。我们提出了一个真实世界场景的完整解决方案,并研究了合成拓扑解决方案的可扩展性,取得了令人鼓舞的结果。
{"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}
引用次数: 4
Confidentiality meets protection in elastic optical networks 在弹性光网络中,保密性满足保护要求
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2021-11-01 Epub Date: 2021-03-09 DOI: 10.1016/j.osn.2021.100620
G. Savva, K. Manousakis, G. Ellinas

This work considers the joint problem of securing confidential demands against eavesdropping attacks and protecting the network against link failures in elastic optical networks (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 integer linear programming (ILP) and 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.

这项工作考虑了弹性光网络(EONs)中保护机密需求免受窃听攻击和保护网络免受链路故障的联合问题。网络编码通过物理层的异或操作将数据与网络中其他已建立的连接进行加密,从而为机密连接提供安全性。还计算备份路径,以保护机密连接的主路径,同时确保在主路径或XOR过程中涉及的任何路径上发生链路故障时,保留机密需求的安全级别。建立了一个现实的网络场景,其中考虑了四种不同类型的连接的保护和安全需求,同时使用新颖的整数线性规划(ILP)和启发式算法的组合来建立网络中的每种需求。根据频谱利用率、网络阻塞和提供的安全级别对所提出的算法进行了评估。从获得的结果可以明显看出,机密连接可以以安全的方式传输,而对于既需要安全和保护的类,在网络中任何单个链路故障的情况下,连接保持其所需的安全级别。
{"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}
引用次数: 14
Disaster resilience of optical networks: State of the art, challenges, and opportunities 光网络的灾难恢复能力:现状、挑战和机遇
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2021-11-01 Epub Date: 2021-03-26 DOI: 10.1016/j.osn.2021.100619
Jacek Rak , Rita Girão-Silva , Teresa Gomes , Georgios Ellinas , Burak Kantarci , Massimo Tornatore

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.

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.

几十年来,光网络以其高容量和长距离传输的特点,成为服务网络流量的主要通信技术,特别是在通信网的核心段和城域段。不幸的是,我们的社会经常经历这些关键基础设施的正常运作如何受到自然灾害、天气相关中断和恶意人类活动引发的大规模故障的严重阻碍。在这篇立场文件中,我们讨论了上述所有主要灾害事件对光网络的影响,并概述了最近提出的相关技术,以提高光网络对各种灾害事件的抗灾能力。我们首先介绍一些在灾难发生之前应用的前瞻性方法。然后,我们将重点转移到其他准备方法上,这些方法可以在发生即将到来的灾难的早期警报和灾难实际袭击网络之间的(通常很短的)时间范围内执行。最后,我们讨论了允许有效执行灾后恢复操作的反应性过程。本文提供的抗灾机制分析涵盖了有线和光无线通信基础设施,还包含了关于新兴技术(例如5G时代及以后的固定移动融合)在抗灾中的作用的明确评论。
{"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}
引用次数: 16
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets 通过增强不确定性集优化FSO网络对恶劣天气条件的弹性
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2021-11-01 Epub Date: 2021-05-19 DOI: 10.1016/j.osn.2021.100628
Ilya Kalesnikau , Marinela Shehaj , Dritan Nace , Michał Pióro

This work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry an acceptable level of the demanded traffic in all weather states that can be foreseen in network operation. Such a model can be achieved using robust optimization techniques, and for that it is important to find a tractable way of characterizing possible link (capacity) degradation states corresponding to weather conditions not known in advance. In the paper we show how the set of link degradation states may be represented mathematically in a compact and tractable way to be exploited in optimization. To solve this task we will make use of a generalization of a combinatorial problem of finding a minimum hitting set to deduce a compact set approximating a given set of link degradation states, (called uncertainty set). Finally, we provide a mathematical model with respect to a general form of uncertainty sets and illustrate the effectiveness of our model by means of a numerical study.

本文研究了由自由空间光学链路组成的无线网状网络(WMN)的尺寸划分问题。虽然FSO链路以较低的成本实现了宽带传输,但其缺点是对恶劣天气条件的敏感性,导致多链路上的传输退化。因此,设计这样的FSO网络需要一个优化模型,以找到最便宜的链路容量配置,能够在网络运行中可以预见的所有天气状态下承载可接受的所需流量水平。这样的模型可以使用鲁棒优化技术来实现,因此,找到一种易于处理的方法来表征与事先未知的天气条件相对应的可能的链路(容量)退化状态是很重要的。在本文中,我们展示了如何以一种紧凑和易于处理的方式在数学上表示链路退化状态集,以便在优化中利用。为了解决这个问题,我们将利用寻找最小命中集的组合问题的推广来推导出近似给定链路退化状态集的紧集(称为不确定性集)。最后,我们给出了不确定性集的一般形式的数学模型,并通过数值研究说明了该模型的有效性。
{"title":"Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets","authors":"Ilya Kalesnikau ,&nbsp;Marinela Shehaj ,&nbsp;Dritan Nace ,&nbsp;Michał Pióro","doi":"10.1016/j.osn.2021.100628","DOIUrl":"10.1016/j.osn.2021.100628","url":null,"abstract":"<div><p><span>This work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry an acceptable level of the demanded traffic in all weather states that can be foreseen in network operation. Such a model can be achieved using </span>robust optimization<span> techniques, and for that it is important to find a tractable way of characterizing possible link (capacity) degradation states corresponding to weather conditions not known in advance. In the paper we show how the set of link degradation states may be represented mathematically in a compact and tractable way to be exploited in optimization. To solve this task we will make use of a generalization of a combinatorial problem of finding a minimum hitting set to deduce a compact set approximating a given set of link degradation states, (called uncertainty set). Finally, we provide a mathematical model with respect to a general form of uncertainty sets and illustrate the effectiveness of our model by means of a numerical study.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100628"},"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.100628","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116680752","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}
引用次数: 1
On survivable energy-efficient and crosstalk-aware routing, spectrum and core allocation schemes for dynamic multiclass traffic in SDM-EONs sdm - eon中动态多类业务的可生存节能和串扰感知路由、频谱和核心分配方案
IF 2.2 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2021-11-01 Epub Date: 2021-06-09 DOI: 10.1016/j.osn.2021.100630
Smita Paira , Monish Chatterjee , Uma Bhattacharya

In this paper, we propose the design of a survivable energy-efficient and crosstalk-aware routing, spectrum, and core allocation (RSCA) scheme for online multiclass traffic in both spectral and temporal domains in SDM-EON. Multipath based protection scheme is applied to ensure survivability against single link failure. Advanced reservation (AR) connections being a part of multiclass traffic may withstand some delay in its service from its arrival. Six heuristic algorithms are developed by using three resource allocation schemes associated with both core-classified and non-core classified approaches which are presented in this paper. Extensive simulation experiments are conducted using three well-known network topologies and the performances of the heuristics are evaluated in terms of bandwidth blocking ratio, total energy consumption, and resource occupation rate versus traffic load as well as percentage of AR connections in multiclass traffic.

在本文中,我们提出了一种在SDM-EON的频谱和时域在线多类业务中可生存的节能和串扰感知路由、频谱和核心分配(RSCA)方案的设计。采用基于多路径的保护方案,保证单链路故障时的生存能力。提前预约(AR)连接作为多级别流量的一部分,可能会在到达后承受一定的服务延迟。利用核心分类和非核心分类方法相关联的三种资源分配方案,开发了六种启发式算法。使用三种知名的网络拓扑进行了大量的仿真实验,并根据带宽阻塞比、总能耗、资源占用率与流量负载以及多类流量中的AR连接百分比来评估启发式算法的性能。
{"title":"On survivable energy-efficient and crosstalk-aware routing, spectrum and core allocation schemes for dynamic multiclass traffic in SDM-EONs","authors":"Smita Paira ,&nbsp;Monish Chatterjee ,&nbsp;Uma Bhattacharya","doi":"10.1016/j.osn.2021.100630","DOIUrl":"10.1016/j.osn.2021.100630","url":null,"abstract":"<div><p><span><span>In this paper, we propose the design of a survivable energy-efficient and crosstalk-aware routing, spectrum, and core allocation (RSCA) scheme for online multiclass traffic in both spectral and temporal domains in SDM-EON. Multipath based protection scheme is applied to ensure survivability against single link failure. Advanced reservation (AR) connections being a part of multiclass traffic may withstand some delay in its service from its arrival. Six </span>heuristic algorithms are developed by using three </span>resource allocation schemes<span> associated with both core-classified and non-core classified approaches which are presented in this paper. Extensive simulation experiments are conducted using three well-known network topologies<span> and the performances of the heuristics are evaluated in terms of bandwidth blocking ratio, total energy consumption, and resource occupation rate versus traffic load as well as percentage of AR connections in multiclass traffic.</span></span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100630"},"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.100630","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116689027","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}
引用次数: 1
期刊
Optical Switching and Networking
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1