Optical Switching and Networking最新文献_第3页

Cost and power-consumption analysis for power profile monitoring with multiple monitors per link in optical networks 光网络中每链路多监测仪功率分布监测的成本和功耗分析

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-10-01 Epub Date: 2025-07-08 DOI: 10.1016/j.osn.2025.100813

Qiaolun Zhang , Patricia Layec , Alix May , Annalisa Morea , Aryanaz Attarpour , Massimo Tornatore

As deploying large amounts of monitoring equipment results in elevated cost and power consumption, novel low-cost monitoring methods are being continuously investigated. A new technique called Power Profile Monitoring (PPM) has recently gained traction thanks to its ability to monitor an entire lightpath using a single post-processing unit at the lightpath receiver. PPM does not require to deploy an individual monitor for each span, as in the traditional monitoring technique using Optical Time-Domain Reflectometer (OTDR). In this work, we aim to quantify the cost and power consumption of PPM (using OTDR as a baseline reference), as this analysis can provide guidelines for the implementation and deployment of PPM. First, we discuss how PPM and OTDR monitors are deployed, and we formally state a new Optimized Monitoring Placement (OMP) problem for PPM. Solving the OMP problem allows to identify the minimum number of PPM monitors that guarantees that all links in the networks are monitored by at least

n

PPM monitors (note that using

n > 1

allows for increased monitoring accuracy). We prove the NP-hardness of the OMP problem and formulate it using an Integer Linear Programming (ILP) model. Finally, we also devise a heuristic algorithm for the OMP problem to scale to larger topologies. Our numerical results, obtained on realistic topologies, suggest that the cost (and power) of one PPM module should be lower than 2.6 times that of one OTDR for nation-wide and 10.2 times for continental-wide topology.

由于部署大量的监测设备会导致成本和功耗的增加，新的低成本监测方法正在不断被研究。一种被称为功率剖面监测（PPM）的新技术最近获得了广泛的关注，因为它能够在光路接收器上使用一个单一的后处理单元来监测整个光路。PPM不需要为每个时间段部署单独的监视器，这与使用光学时域反射计（OTDR）的传统监视技术不同。在这项工作中，我们的目标是量化PPM的成本和功耗（使用OTDR作为基准参考），因为该分析可以为PPM的实现和部署提供指导。首先，我们讨论如何部署PPM和OTDR监视器，并正式陈述PPM的一个新的优化监视放置（OMP）问题。解决OMP问题可以确定PPM监视器的最小数量，以确保网络中的所有链路都由至少n个PPM监视器监视（注意，使用n>；1可以提高监视精度）。我们证明了OMP问题的np -硬度，并用整数线性规划（ILP）模型将其形式化。最后，我们还为OMP问题设计了一种启发式算法，以扩展到更大的拓扑结构。我们在实际拓扑结构上获得的数值结果表明，在全国范围内，一个PPM模块的成本（和功率）应低于一个OTDR的2.6倍，在整个大陆的拓扑结构中应低于10.2倍。

{"title":"Cost and power-consumption analysis for power profile monitoring with multiple monitors per link in optical networks","authors":"Qiaolun Zhang , Patricia Layec , Alix May , Annalisa Morea , Aryanaz Attarpour , Massimo Tornatore","doi":"10.1016/j.osn.2025.100813","DOIUrl":"10.1016/j.osn.2025.100813","url":null,"abstract":"<div><div>As deploying large amounts of monitoring equipment results in elevated cost and power consumption, novel low-cost monitoring methods are being continuously investigated. A new technique called <em>Power Profile Monitoring</em> (PPM) has recently gained traction thanks to its ability to monitor an entire lightpath using a single post-processing unit at the lightpath receiver. PPM does not require to deploy an individual monitor for each span, as in the traditional monitoring technique using <em>Optical Time-Domain Reflectometer</em> (OTDR). In this work, we aim to quantify the cost and power consumption of PPM (using OTDR as a baseline reference), as this analysis can provide guidelines for the implementation and deployment of PPM. First, we discuss how PPM and OTDR monitors are deployed, and we formally state a new Optimized Monitoring Placement (OMP) problem for PPM. Solving the OMP problem allows to identify the minimum number of PPM monitors that guarantees that all links in the networks are monitored by at least <span><math><mi>n</mi></math></span> PPM monitors (note that using <span><math><mrow><mi>n</mi><mo>></mo><mn>1</mn></mrow></math></span> allows for increased monitoring accuracy). We prove the NP-hardness of the OMP problem and formulate it using an Integer Linear Programming (ILP) model. Finally, we also devise a heuristic algorithm for the OMP problem to scale to larger topologies. Our numerical results, obtained on realistic topologies, suggest that the cost (and power) of one PPM module should be lower than 2.6 times that of one OTDR for nation-wide and 10.2 times for continental-wide topology.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"57 ","pages":"Article 100813"},"PeriodicalIF":1.9,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613301","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}

引用次数: 0

Resource allocation method for reliable transmission of requests based on shared backup path protection and fragmentation-aware in elastic optical networks 弹性光网络中基于共享备份路径保护和碎片感知的请求可靠传输资源分配方法

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-10-01 Epub Date: 2025-03-01 DOI: 10.1016/j.osn.2025.100802

Huanlin Liu , Xingji Huo , Yong Chen , Bo Liu , Runze Ge , Di Deng , Haonan Chen

Elastic optical networks can effectively adapt to complex and dynamic network conditions, improving spectrum resource utilization. However, if the link fails, it will cause significant data loss or interruption to the network operator. Therefore, we propose a reliable routing, modulation, and spectrum allocation (SBPP-FA-RRMSA) algorithm based on shared backup path protection (SBPP) and fragmentation-aware to guarantee reliable transmission of requests and solve spectrum fragmentation problem. In order to save resources, we adopt the SBPP method, we design the reliability of requests based on path failure probability, and also design a path cost function combined with the path resources to select the transmission path. Then, we propose a dynamic spectrum partitioning method to guarantee non-interference of the working resources and the backup resources. Finally, in terms of resource allocation, we design a path fragmentation ratio to allocate working resources, and a spectrum fitness function to allocate backup resources. Simulation results show that under the premise of considering link failures, the proposed SBPP-FA-RRMSA has lower bandwidth blocking probability and fragmentation ratio compared with the algorithms that do not consider the probability of failures, fragmentation, and shared backup path protection, and it also makes full use of the sharing of backup resources.

弹性光网络能够有效适应复杂动态的网络环境，提高频谱资源的利用率。但是，如果链路出现故障，将会对网络运营商造成严重的数据丢失或中断。为此，我们提出了一种基于共享备份路径保护（SBPP）和分片感知的可靠路由、调制和频谱分配（SBPP- fa - rrmsa）算法，以保证请求的可靠传输，解决频谱分片问题。为了节省资源，采用SBPP方法，基于路径失效概率设计请求的可靠性，并结合路径资源设计路径代价函数来选择传输路径。然后，我们提出了一种动态频谱划分方法，以保证工作资源和备份资源的不干扰。最后，在资源分配方面，我们设计了路径碎片比来分配工作资源，设计了频谱适应度函数来分配备份资源。仿真结果表明，在考虑链路故障的前提下，与不考虑故障概率、分片和共享备份路径保护的算法相比，所提出的SBPP-FA-RRMSA具有更低的带宽阻塞概率和分片率，并且充分利用了备份资源的共享性。

{"title":"Resource allocation method for reliable transmission of requests based on shared backup path protection and fragmentation-aware in elastic optical networks","authors":"Huanlin Liu , Xingji Huo , Yong Chen , Bo Liu , Runze Ge , Di Deng , Haonan Chen","doi":"10.1016/j.osn.2025.100802","DOIUrl":"10.1016/j.osn.2025.100802","url":null,"abstract":"<div><div>Elastic optical networks can effectively adapt to complex and dynamic network conditions, improving spectrum resource utilization. However, if the link fails, it will cause significant data loss or interruption to the network operator. Therefore, we propose a reliable routing, modulation, and spectrum allocation (SBPP-FA-RRMSA) algorithm based on shared backup path protection (SBPP) and fragmentation-aware to guarantee reliable transmission of requests and solve spectrum fragmentation problem. In order to save resources, we adopt the SBPP method, we design the reliability of requests based on path failure probability, and also design a path cost function combined with the path resources to select the transmission path. Then, we propose a dynamic spectrum partitioning method to guarantee non-interference of the working resources and the backup resources. Finally, in terms of resource allocation, we design a path fragmentation ratio to allocate working resources, and a spectrum fitness function to allocate backup resources. Simulation results show that under the premise of considering link failures, the proposed SBPP-FA-RRMSA has lower bandwidth blocking probability and fragmentation ratio compared with the algorithms that do not consider the probability of failures, fragmentation, and shared backup path protection, and it also makes full use of the sharing of backup resources.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"57 ","pages":"Article 100802"},"PeriodicalIF":1.9,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143609932","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}

引用次数: 0

A pre-forbidden spectrum strategy to conveniently consider crosstalk in SDM-EON 一种方便考虑SDM-EON串扰的预禁止频谱策略

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-03-01 Epub Date: 2025-02-22 DOI: 10.1016/j.osn.2025.100801

Junling Yuan , Zixuan Wu , Xiao Ma , Xuhong Li , Qikun Zhang

Inter-core crosstalk (XT) is a main disadvantage in space division multiplexing elastic optical network (SDM-EON). Two methods are commonly used to consider crosstalk, namely worst-case XT strategy and precise XT strategy. When assigning spectrum resources to a connection request, the former calculates the maximum possible crosstalk, and the latter calculates the precise crosstalk. The worst-case XT strategy costs less time but leads to a higher bandwidth blocking probability, while the precise XT strategy gets a lower bandwidth blocking probability yet spends more time. In this paper, we study crosstalk-aware spectrum assignment problem in SDM-EON and propose a pre-forbidden spectrum (PFS) strategy to consider crosstalk. In the proposed strategy, three spectrum segments in the central core and two fringe cores are pre-forbidden respectively, which reduces number of neighbors of the remainder spectrum segments. By using the PFS strategy, the maximum possible crosstalk decreases and then the maximum optional modulation level increases, which can reduce bandwidth blocking probability of connection requests. The proposed PFS strategy is compared with the worst-case XT and precise XT strategies. Simulation results show that, bandwidth blocking probability of the PFS strategy is much lower than the worst-case XT strategy and slightly higher than the precise one, while average running time of the PFS strategy is far less than the precise XT strategy and similar to the worst-case XT one. Hence, the PFS strategy has the benefits of both comparison strategies.

核间串扰（XT）是空分复用弹性光网络（SDM-EON）的主要缺点。通常有两种方法来考虑串扰，即最坏XT策略和精确XT策略。在分配频谱资源给连接请求时，前者计算最大可能串扰，后者计算精确串扰。最坏情况下的XT策略耗时更少，但带宽阻塞概率更高，而精确XT策略带宽阻塞概率更低，但耗时更长。本文研究了SDM-EON中串扰感知频谱分配问题，提出了一种考虑串扰的预禁止频谱（PFS）策略。在该策略中，分别对中心核心中的三个频谱段和两个边缘核心中的两个频谱段进行预禁，从而减少了剩余频谱段的邻居数量。通过采用PFS策略，减小最大可能串扰，提高最大可选调制电平，从而降低连接请求的带宽阻塞概率。将所提出的PFS策略与最坏XT和精确XT策略进行了比较。仿真结果表明，PFS策略的带宽阻塞概率远低于最坏情况下的XT策略，略高于最坏情况下的XT策略，而PFS策略的平均运行时间远小于最坏情况下的XT策略，与最坏情况下的XT策略相似。因此，PFS策略具有两种比较策略的优点。

{"title":"A pre-forbidden spectrum strategy to conveniently consider crosstalk in SDM-EON","authors":"Junling Yuan , Zixuan Wu , Xiao Ma , Xuhong Li , Qikun Zhang","doi":"10.1016/j.osn.2025.100801","DOIUrl":"10.1016/j.osn.2025.100801","url":null,"abstract":"<div><div>Inter-core crosstalk (XT) is a main disadvantage in space division multiplexing elastic optical network (SDM-EON). Two methods are commonly used to consider crosstalk, namely worst-case XT strategy and precise XT strategy. When assigning spectrum resources to a connection request, the former calculates the maximum possible crosstalk, and the latter calculates the precise crosstalk. The worst-case XT strategy costs less time but leads to a higher bandwidth blocking probability, while the precise XT strategy gets a lower bandwidth blocking probability yet spends more time. In this paper, we study crosstalk-aware spectrum assignment problem in SDM-EON and propose a pre-forbidden spectrum (PFS) strategy to consider crosstalk. In the proposed strategy, three spectrum segments in the central core and two fringe cores are pre-forbidden respectively, which reduces number of neighbors of the remainder spectrum segments. By using the PFS strategy, the maximum possible crosstalk decreases and then the maximum optional modulation level increases, which can reduce bandwidth blocking probability of connection requests. The proposed PFS strategy is compared with the worst-case XT and precise XT strategies. Simulation results show that, bandwidth blocking probability of the PFS strategy is much lower than the worst-case XT strategy and slightly higher than the precise one, while average running time of the PFS strategy is far less than the precise XT strategy and similar to the worst-case XT one. Hence, the PFS strategy has the benefits of both comparison strategies.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"56 ","pages":"Article 100801"},"PeriodicalIF":1.9,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143480373","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}

引用次数: 0

From design to recovery: Insights on resilient networks from RNDM 2023 从设计到恢复：RNDM 2023对弹性网络的见解

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-03-01 Epub Date: 2025-01-28 DOI: 10.1016/j.osn.2025.100800

Doğanalp Ergenç , Nurefşan Sertbaş Bülbül , Jacek Rak , Mathias Fischer , Andreas Kassler

引用次数: 0

NFV recovery strategies for critical services after massive failures in optical networks 光网络大规模故障后关键服务的 NFV 恢复策略

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-01-01 Epub Date: 2024-11-07 DOI: 10.1016/j.osn.2024.100790

Trond Vatten, Poul E. Heegaard, Yuming Jiang

Today, more critical services than ever rely on the communication infrastructure of 5G and beyond, demanding resilient recovery strategies when disasters occur. The inherent uncertainty of disasters makes post-disaster recovery a complex challenge. Today’s solutions focus on external infrastructure, such as alternative power supply or ad-hoc UAVs, to restore communication. However, the programmable nature introduced in 5G also allows us to migrate (relocate) Virtual Network Functions (VNFs) to restore communication more efficiently. In this paper, we develop an experimental framework to evaluate the performance of recovery strategies utilizing VNF migration in an optical network. We demonstrate that selecting the appropriate post-disaster recovery strategy can significantly accelerate the restoration of critical services by several hours in some disaster scenarios. Furthermore, we create ClusPRi, a modification of the virtual resource allocation algorithm ClusPR. ClusPRi prioritizes critical traffic when allocating resources in a post-disaster scenario. We show that adding routing priority to the resource allocation algorithm further accelerates the restoration of critical communication in a disaster scenario.

如今，比以往任何时候都更多的关键服务依赖于 5G 及更先进的通信基础设施，这就要求在灾难发生时制定弹性恢复策略。灾害固有的不确定性使得灾后恢复成为一项复杂的挑战。目前的解决方案主要依靠替代电源或临时无人机等外部基础设施来恢复通信。然而，5G 引入的可编程特性还允许我们迁移（重新定位）虚拟网络功能（VNF），从而更高效地恢复通信。在本文中，我们开发了一个实验框架，用于评估在光网络中利用 VNF 迁移的恢复策略的性能。我们证明，在某些灾难场景中，选择适当的灾后恢复策略可将关键服务的恢复速度显著加快数小时。此外，我们还创建了 ClusPRi，它是对虚拟资源分配算法 ClusPR 的修改。ClusPRi 在灾后场景中分配资源时会优先考虑关键流量。我们的研究表明，在资源分配算法中加入路由优先权可进一步加快灾难场景中关键通信的恢复速度。

{"title":"NFV recovery strategies for critical services after massive failures in optical networks","authors":"Trond Vatten, Poul E. Heegaard, Yuming Jiang","doi":"10.1016/j.osn.2024.100790","DOIUrl":"10.1016/j.osn.2024.100790","url":null,"abstract":"<div><div>Today, more critical services than ever rely on the communication infrastructure of 5G and beyond, demanding resilient recovery strategies when disasters occur. The inherent uncertainty of disasters makes post-disaster recovery a complex challenge. Today’s solutions focus on external infrastructure, such as alternative power supply or ad-hoc UAVs, to restore communication. However, the programmable nature introduced in 5G also allows us to migrate (relocate) Virtual Network Functions (VNFs) to restore communication more efficiently. In this paper, we develop an experimental framework to evaluate the performance of recovery strategies utilizing VNF migration in an optical network. We demonstrate that selecting the appropriate post-disaster recovery strategy can significantly accelerate the restoration of critical services by several hours in some disaster scenarios. Furthermore, we create <em>ClusPRi</em>, a modification of the virtual resource allocation algorithm <em>ClusPR</em>. ClusPRi prioritizes critical traffic when allocating resources in a post-disaster scenario. We show that adding routing priority to the resource allocation algorithm further accelerates the restoration of critical communication in a disaster scenario.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"55 ","pages":"Article 100790"},"PeriodicalIF":1.9,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142655426","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}

引用次数: 0

Self-adjusting resilient control plane for virtual software-defined optical networks 用于虚拟软件定义光网络的自调整弹性控制平面

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-01-01 Epub Date: 2024-11-08 DOI: 10.1016/j.osn.2024.100792

Ferenc Mogyorósi, Péter Babarczi, Alija Pašić

Optical networks must promptly respond to failures and efficiently handle dynamic traffic in order to fulfill their role as a critical infrastructure. Leveraging network softwarization and virtualization, virtual software-defined networks offer sufficient flexibility towards this goal by sharing the physical infrastructure among multiple tenants whose traffic must traverse the network hypervisor. In a resilient optical control plane each switch must be assigned to a primary and backup hypervisor instance through short control paths, which challenge will be addressed in this paper. First, we propose an intelligent greedy hypervisor placement heuristic which maximizes acceptance ratio for current, and preparedness for future requests. Secondly, we introduce a graph neural network model that can be seamlessly integrated with either our integer linear program or heuristic method to yield high-quality placements in significantly less time compared to our prior solutions. This enhancement renders our approach applicable to larger networks, significantly expanding its practical utility. Finally, we propose a self-adjusting hypervisor migration strategy, which continuously adapts the placement to the dynamically changing virtual network requests, thus, ensuring service continuity by avoiding frequent control plane reconfigurations. Through simulations we show that our hypervisor placement and migration strategies provide a balanced control load while they can handle a wide variety of changes.

光网络必须对故障做出及时响应，并有效处理动态流量，才能发挥其作为关键基础设施的作用。利用网络软化和虚拟化，虚拟软件定义网络通过在多个租户之间共享物理基础设施，为实现这一目标提供了足够的灵活性，而这些租户的流量必须穿越网络管理程序。在弹性光控制平面中，每个交换机都必须通过短控制路径分配给一个主管理程序实例和一个备份管理程序实例。首先，我们提出了一种智能贪婪管理程序放置启发式，它能最大限度地提高当前请求的接受率，并为未来请求做好准备。其次，我们引入了图神经网络模型，该模型可与我们的整数线性规划或启发式方法无缝集成，与我们之前的解决方案相比，能在更短的时间内实现高质量的放置。这一改进使我们的方法适用于更大的网络，大大扩展了其实用性。最后，我们提出了一种可自我调整的管理程序迁移策略，该策略可根据动态变化的虚拟网络请求持续调整位置，从而通过避免频繁的控制平面重新配置来确保服务的连续性。通过模拟，我们证明了我们的管理程序放置和迁移策略能够提供均衡的控制负载，同时能够处理各种变化。

{"title":"Self-adjusting resilient control plane for virtual software-defined optical networks","authors":"Ferenc Mogyorósi, Péter Babarczi, Alija Pašić","doi":"10.1016/j.osn.2024.100792","DOIUrl":"10.1016/j.osn.2024.100792","url":null,"abstract":"<div><div>Optical networks must promptly respond to failures and efficiently handle dynamic traffic in order to fulfill their role as a critical infrastructure. Leveraging network softwarization and virtualization, virtual software-defined networks offer sufficient flexibility towards this goal by sharing the physical infrastructure among multiple tenants whose traffic must traverse the network hypervisor. In a resilient optical control plane each switch must be assigned to a primary and backup hypervisor instance through short control paths, which challenge will be addressed in this paper. First, we propose an intelligent greedy hypervisor placement heuristic which maximizes acceptance ratio for current, and preparedness for future requests. Secondly, we introduce a graph neural network model that can be seamlessly integrated with either our integer linear program or heuristic method to yield high-quality placements in significantly less time compared to our prior solutions. This enhancement renders our approach applicable to larger networks, significantly expanding its practical utility. Finally, we propose a self-adjusting hypervisor migration strategy, which continuously adapts the placement to the dynamically changing virtual network requests, thus, ensuring service continuity by avoiding frequent control plane reconfigurations. Through simulations we show that our hypervisor placement and migration strategies provide a balanced control load while they can handle a wide variety of changes.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"55 ","pages":"Article 100792"},"PeriodicalIF":1.9,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142655455","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}

引用次数: 0

Modeling and upgrade of disaster-resilient interdependent networks using machine learning 利用机器学习对相互依存的抗灾网络进行建模和升级

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-01-01 Epub Date: 2024-11-09 DOI: 10.1016/j.osn.2024.100791

Ferenc Mogyorósi, Péter Revisnyei, Alija Pašić

Recent global emergencies emphasize the critical role of reliable communication networks. As dependence on critical infrastructures grows, the focus shifts from isolated failures to designing networks capable of withstanding disasters, taking into account their interdependence with infrastructures like the power grid. This paper investigates the problem of the disaster resilient upgrade of interdependent networks, focusing on enhancing network resilience during emergencies and ensuring a service-level agreement. We analyze how the interdependency between the networks affects the disaster resilience and propose heuristic methods for network operators to improve resilience against disasters. Furthermore, to address the challenge of hidden interdependencies, we present a novel approach using graph neural networks for predicting interdependency between networks based on historical data of failures. Using simulations with real networks and earthquake data, we demonstrate that limiting the number of interdependent edges per node significantly affects resilience. We show that if sufficient data is available graph neural networks can learn the connection between failures and interdependencies, and capable of predicting interdependencies. Additionally, we show that selecting appropriate upgrade methods can reduce network upgrade costs by up to 20%.

最近发生的全球紧急事件强调了可靠通信网络的关键作用。随着人们对关键基础设施的依赖程度不断增加，关注的重点也从孤立故障转向设计能够抵御灾害的网络，同时考虑到网络与电网等基础设施之间的相互依存关系。本文研究了相互依存网络的抗灾升级问题，重点是提高网络在紧急情况下的恢复能力并确保服务水平协议。我们分析了网络之间的相互依赖关系如何影响抗灾能力，并为网络运营商提出了启发式方法，以提高抗灾能力。此外，为了应对隐藏的相互依赖关系这一挑战，我们提出了一种基于故障历史数据的图神经网络预测网络间相互依赖关系的新方法。通过使用真实网络和地震数据进行模拟，我们证明了限制每个节点的相互依赖边的数量会显著影响抗灾能力。我们证明，如果有足够的数据，图神经网络可以学习故障和相互依赖之间的联系，并能够预测相互依赖关系。此外，我们还证明，选择适当的升级方法可以将网络升级成本最多降低 20%。

{"title":"Modeling and upgrade of disaster-resilient interdependent networks using machine learning","authors":"Ferenc Mogyorósi, Péter Revisnyei, Alija Pašić","doi":"10.1016/j.osn.2024.100791","DOIUrl":"10.1016/j.osn.2024.100791","url":null,"abstract":"<div><div>Recent global emergencies emphasize the critical role of reliable communication networks. As dependence on critical infrastructures grows, the focus shifts from isolated failures to designing networks capable of withstanding disasters, taking into account their interdependence with infrastructures like the power grid. This paper investigates the problem of the disaster resilient upgrade of interdependent networks, focusing on enhancing network resilience during emergencies and ensuring a service-level agreement. We analyze how the interdependency between the networks affects the disaster resilience and propose heuristic methods for network operators to improve resilience against disasters. Furthermore, to address the challenge of hidden interdependencies, we present a novel approach using graph neural networks for predicting interdependency between networks based on historical data of failures. Using simulations with real networks and earthquake data, we demonstrate that limiting the number of interdependent edges per node significantly affects resilience. We show that if sufficient data is available graph neural networks can learn the connection between failures and interdependencies, and capable of predicting interdependencies. Additionally, we show that selecting appropriate upgrade methods can reduce network upgrade costs by up to 20%.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"55 ","pages":"Article 100791"},"PeriodicalIF":1.9,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142655454","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}

引用次数: 0

Energy efficient resource aware protection with rapid failure recovery in cloud-ready elastic optical networks 云就绪弹性光网络中具有快速故障恢复的节能资源感知保护

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2025-01-01 Epub Date: 2024-12-19 DOI: 10.1016/j.osn.2024.100793

Sougata Das , Monish Chatterjee

In this paper, we address the problem of protection of Cloud-ready Elastic Optical Networks (C-EONs) from a single link failure (a fiber cut), the most common failure. Any protection scheme must be designed to ensure rapid failure recovery as data is lost continuously till the fault is identified and restored. Our protection scheme, crStreams (cloud-ready streams) overcomes the shortcomings of failure independent path protecting p-cycles (FIPP p-cycles) for C-EONs, guarantees rapid failure recovery, ensures service relocation and is also resource aware. Recently, due to rapid increase in data transmission rate, design of energy efficient schemes has attracted a lot of research attention. So, we propose four polynomial-time algorithms that efficiently employ crStreams for protection and further minimize energy consumption to the extent possible for dynamic requests. To the best of our knowledge, this paper is the first to propose algorithms for survivability of C-EONs, addressing the joint problem of minimizing energy consumption and resource utilization to the extent possible for dynamic requests while ensuring rapid failure recovery. Considering all conducted experiments, maximum improvement in energy consumption, resource sharing and bandwidth blocking ratio is 39.83 %, 44.44 % and 41.54 % respectively over the energy-greedy strategy.

在本文中，我们解决了保护云就绪弹性光网络（c - eon）免受单链路故障（光纤切割）的问题，这是最常见的故障。任何保护方案的设计都必须确保快速的故障恢复，因为数据会持续丢失，直到故障被识别和恢复。我们的保护方案crStreams（云就绪流）克服了c - eon的故障独立路径保护p周期（FIPP p周期）的缺点，保证了快速故障恢复，确保了服务重新定位，并且还具有资源感知。近年来，由于数据传输速率的迅速提高，节能方案的设计引起了人们的广泛关注。因此，我们提出了四种多项式时间算法，有效地利用crStreams进行保护，并进一步将动态请求的能耗降至最低。据我们所知，本文首次提出了c - eon的生存能力算法，解决了在确保快速故障恢复的同时尽可能减少动态请求的能源消耗和资源利用的联合问题。综合所进行的所有实验，与贪心策略相比，能耗、资源共享和带宽阻塞率的最大提升分别为39.83%、44.44%和41.54%。

{"title":"Energy efficient resource aware protection with rapid failure recovery in cloud-ready elastic optical networks","authors":"Sougata Das , Monish Chatterjee","doi":"10.1016/j.osn.2024.100793","DOIUrl":"10.1016/j.osn.2024.100793","url":null,"abstract":"<div><div>In this paper, we address the problem of protection of Cloud-ready Elastic Optical Networks (C-EONs) from a single link failure (a fiber cut), the most common failure. Any protection scheme must be designed to ensure rapid failure recovery as data is lost continuously till the fault is identified and restored. Our protection scheme, <em>crStreams</em> (cloud-ready streams) overcomes the shortcomings of failure independent path protecting p-cycles (FIPP p-cycles) for C-EONs, guarantees rapid failure recovery, ensures service relocation and is also resource aware. Recently, due to rapid increase in data transmission rate, design of energy efficient schemes has attracted a lot of research attention. So, we propose four polynomial-time algorithms that efficiently employ <em>crStreams</em> for protection and further minimize energy consumption to the extent possible for dynamic requests. To the best of our knowledge, this paper is the first to propose algorithms for survivability of C-EONs, addressing the joint problem of minimizing energy consumption and resource utilization to the extent possible for dynamic requests while ensuring rapid failure recovery. Considering all conducted experiments, maximum improvement in energy consumption, resource sharing and bandwidth blocking ratio is 39.83 %, 44.44 % and 41.54 % respectively over the energy-greedy strategy.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"55 ","pages":"Article 100793"},"PeriodicalIF":1.9,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142889436","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}

引用次数: 0

A distance adaptive dual-hop routing algorithm for underwater optical wireless networks 水下光无线网络的距离自适应双跳路由算法

IF 1.9 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2024-09-01 Epub Date: 2024-06-26 DOI: 10.1016/j.osn.2024.100782

Jing Ji, Yinkang Dai, Yang Qiu

Three main kinds of underwater wireless communication, which employ acoustic waves, radio frequency and optical waves, have attracted intensive research interests in recently years. Among them, the underwater optical wireless communication (UOWC) is characterized by high propagation speed and large transmission bandwidth. But, the optical waves in underwater environment are significantly affected by absorption and scattering effects, which limit their transmission range. In order to enhance the performance of UOWC, designing a transmission and energy efficiency routing algorithm has become a non-ignorable issue in UOWC. In this paper, a transmission distance adaptive dual-hop (TDAD) routing algorithm is proposed for underwater optical wireless networks (UOWNs) to improve their efficiency in packet-delivery and energy-consumption. Unlike the existing routing algorithms designed for UOWNs, which pre-set the transmission range of network nodes, the proposed TDAD algorithm adaptively selects the transmission range for each node according to the diversity of heterogeneous service requests and employs location and energy information in its dual-hop based routing procedure. Simulation results indicate that the proposed TDAD algorithm remarkably improves packet delivery rate with more balanced energy consumption when compared to the deviation angle-based single-hop (DAS) algorithm and the distributed sector-based (DS) routing algorithm.

近年来，采用声波、射频和光波的三大类水下无线通信引起了人们的浓厚研究兴趣。其中，水下光无线通信（UOWC）具有传播速度快、传输带宽大的特点。但是，光波在水下环境中会受到吸收和散射效应的严重影响，从而限制了其传输范围。为了提高 UOWC 的性能，设计一种传输和能效路由算法已成为 UOWC 不可忽视的问题。本文针对水下光无线网络（UOWN）提出了一种传输距离自适应双跳（TDAD）路由算法，以提高其数据包传输效率和能耗。与预先设定网络节点传输距离的现有 UOWNs 路由算法不同，所提出的 TDAD 算法根据异构服务请求的多样性自适应地选择每个节点的传输距离，并在其基于双跳的路由过程中采用位置和能量信息。仿真结果表明，与基于偏差角的单跳（DAS）算法和基于分布式扇区的路由（DS）算法相比，所提出的 TDAD 算法能显著提高数据包的传输速率，且能耗更加均衡。

{"title":"A distance adaptive dual-hop routing algorithm for underwater optical wireless networks","authors":"Jing Ji, Yinkang Dai, Yang Qiu","doi":"10.1016/j.osn.2024.100782","DOIUrl":"10.1016/j.osn.2024.100782","url":null,"abstract":"<div><p>Three main kinds of underwater wireless communication, which employ acoustic waves, radio frequency and optical waves, have attracted intensive research interests in recently years. Among them, the underwater optical wireless communication (UOWC) is characterized by high propagation speed and large transmission bandwidth. But, the optical waves in underwater environment are significantly affected by absorption and scattering effects, which limit their transmission range. In order to enhance the performance of UOWC, designing a transmission and energy efficiency routing algorithm has become a non-ignorable issue in UOWC. In this paper, a transmission distance adaptive dual-hop (TDAD) routing algorithm is proposed for underwater optical wireless networks (UOWNs) to improve their efficiency in packet-delivery and energy-consumption. Unlike the existing routing algorithms designed for UOWNs, which pre-set the transmission range of network nodes, the proposed TDAD algorithm adaptively selects the transmission range for each node according to the diversity of heterogeneous service requests and employs location and energy information in its dual-hop based routing procedure. Simulation results indicate that the proposed TDAD algorithm remarkably improves packet delivery rate with more balanced energy consumption when compared to the deviation angle-based single-hop (DAS) algorithm and the distributed sector-based (DS) routing algorithm.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"54 ","pages":"Article 100782"},"PeriodicalIF":1.9,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141461762","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}

引用次数: 0

Secured THz communication in photonic microcell networks based on spatial wave mixing of steered beams 基于转向光束空间波混合的光子微蜂窝网络中的安全太赫兹通信

IF 2.2 4区计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS

Optical Switching and Networking

Pub Date : 2024-09-01 Epub Date: 2024-06-07 DOI: 10.1016/j.osn.2024.100773

Ming Che , Hanwei Chen , Yuta Ueda , Kazutoshi Kato

Future 6G communication systems are envisioned to expand their carrier frequency to the THz region, where a broad unexplored region of spectrum is available. With this expansion, THz wireless communication has the potential to achieve ultra-high data transmission rates of up to 100 Gbit/s. However, as large amounts of data are transmitted in an open wireless environment, there are significant concerns regarding communication security due to the susceptibility to eavesdropping, interception, and jamming. In this work, we proposed a secure approach for THz wireless communication based on spatial wave mixing and flexible beam steering. To achieve this, two frequency-modulated THz waves, which are generated by photonic THz sources and carry encrypted information with true randomness, are mixed at a THz envelope detector with an exclusive-OR logic operation. We analyzed the possible spatial location for the THz detector to ensure a secure microcell network deployment. Our results demonstrate that the size of the decryptable region is directly dependent on the directivity and width of the emitted THz beam. To address this, we have developed an array antenna with integrated uni-traveling-carrier photodiodes (UTC-PDs), which is capable of generating THz waves while also improving the flexibility of beam pointing, allowing for greater control over the location and size of the decodable region. By controlling fiber-optic delay lines, we successfully demonstrated that the directional gain of a 200 GHz wave is increased by 8 dB through a 1 × 3 UTC-PD-integrated planar bowtie antenna (PBA) array, together with continuous beam steering from -20° to 10°. Additionally, using a 1 × 4 UTC-PD-integrated PBA array to emulate two encryption transmitters and a Femi-level managed barrier diode to detect spatially mixed THz waves, we successfully achieved a feasibility experiment for real-time 200 Mbit/s location-based decryption in the 200 GHz band. These results indicate that the proposed scheme is feasible for secured THz communication, and would be a powerful candidate to mitigate security risks in 6G microcell networks.

根据设想，未来的 6G 通信系统将把载波频率扩展到太赫兹区域，因为太赫兹区域的频谱尚未被开发。随着这一扩展，太赫兹无线通信有可能实现高达 100 Gbit/s 的超高数据传输速率。然而，由于大量数据是在开放的无线环境中传输的，容易受到窃听、拦截和干扰，因此通信安全问题备受关注。在这项工作中，我们提出了一种基于空间波混合和灵活波束转向的太赫兹无线通信安全方法。为了实现这一目标，两个由光子太赫兹源产生并携带真正随机性加密信息的频率调制太赫兹波在太赫兹包络探测器上通过排他-OR逻辑运算进行混合。我们分析了太赫兹探测器的可能空间位置，以确保微蜂窝网络部署的安全性。我们的结果表明，可解密区域的大小直接取决于发射太赫兹光束的方向性和宽度。为了解决这个问题，我们开发了一种集成了单程载波光电二极管（UTC-PD）的阵列天线，它既能产生太赫兹波，又能提高光束指向的灵活性，从而能够更好地控制可解密区域的位置和大小。通过控制光纤延迟线，我们成功地演示了通过 1 × 3 UTC-PD 集成平面弓形天线 (PBA) 阵列将 200 GHz 波的定向增益提高了 8 dB，并实现了 -20° 至 10° 的连续波束转向。此外，我们使用 1 × 4 UTC-PD 一体化 PBA 阵列模拟两个加密发射器，并使用一个 Femi-level 管理型势垒二极管检测空间混合太赫兹波，成功实现了 200 GHz 频段内基于位置的 200 Mbit/s 实时解密的可行性实验。这些结果表明，所提出的方案在太赫兹安全通信方面是可行的，将成为降低 6G 微蜂窝网络安全风险的有力候选方案。

{"title":"Secured THz communication in photonic microcell networks based on spatial wave mixing of steered beams","authors":"Ming Che , Hanwei Chen , Yuta Ueda , Kazutoshi Kato","doi":"10.1016/j.osn.2024.100773","DOIUrl":"https://doi.org/10.1016/j.osn.2024.100773","url":null,"abstract":"<div><p>Future 6G communication systems are envisioned to expand their carrier frequency to the THz region, where a broad unexplored region of spectrum is available. With this expansion, THz wireless communication has the potential to achieve ultra-high data transmission rates of up to 100Gbit/s. However, as large amounts of data are transmitted in an open wireless environment, there are significant concerns regarding communication security due to the susceptibility to eavesdropping, interception, and jamming. In this work, we proposed a secure approach for THz wireless communication based on spatial wave mixing and flexible beam steering. To achieve this, two frequency-modulated THz waves, which are generated by photonic THz sources and carry encrypted information with true randomness, are mixed at a THz envelope detector with an exclusive-OR logic operation. We analyzed the possible spatial location for the THz detector to ensure a secure microcell network deployment. Our results demonstrate that the size of the decryptable region is directly dependent on the directivity and width of the emitted THz beam. To address this, we have developed an array antenna with integrated uni-traveling-carrier photodiodes (UTC-PDs), which is capable of generating THz waves while also improving the flexibility of beam pointing, allowing for greater control over the location and size of the decodable region. By controlling fiber-optic delay lines, we successfully demonstrated that the directional gain of a 200GHz wave is increased by 8dB through a 1 × 3 UTC-PD-integrated planar bowtie antenna (PBA) array, together with continuous beam steering from -20° to 10°. Additionally, using a 1 × 4 UTC-PD-integrated PBA array to emulate two encryption transmitters and a Femi-level managed barrier diode to detect spatially mixed THz waves, we successfully achieved a feasibility experiment for real-time 200Mbit/s location-based decryption in the 200GHz band. These results indicate that the proposed scheme is feasible for secured THz communication, and would be a powerful candidate to mitigate security risks in 6G microcell networks.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"54 ","pages":"Article 100773"},"PeriodicalIF":2.2,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141322610","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}

引用次数: 0