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

Resilience analysis of quantum network against targeted attacks: Recovery via rerouting and purification 量子网络对目标攻击的弹性分析：通过重路由和净化恢复

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

Optical Switching and Networking

Pub Date : 2025-04-25 DOI: 10.1016/j.osn.2025.100810

Hilal Sultan Duranoglu Tunc , Abebu Ademe Bayleyegn , Joachim Notcker , Riccardo Bassoli , Frank H.P. Fitzek

Quantum networks are essential for secure quantum communication and distributed quantum computing. However, their performance is highly vulnerable to targeted attacks that disrupt entanglement distribution, leading to significant network degradation. To address this challenge, we propose two heuristic routing algorithms Quantum Entanglement Distribution Algorithm 1 (QEDA1) and Quantum Entanglement Distribution Algorithm 2 (QEDA2) that minimize loss of fidelity by reducing the number of intermediate nodes while optimizing entanglement swapping and purification strategies. In QEDA1 we only applied purification as a recovery mechanism, while in QEDA2 we utilized a purification-rerouting approach. Furthermore, unlike previous studies, which relied primarily on idealized or small-scale topologies, we evaluated our approach on a real-world network topology (Surfnet), analyzing throughput variations under both normal conditions and targeted attacks. Furthermore, we compare the performance of the algorithm in memory-assisted and memoryless quantum networks, demonstrating the impact of quantum memory on network resilience. In addition, we introduce an attack model based on centrality-driven node failures and propose a recovery mechanism that integrates rerouting and entanglement purification to mitigate the effects of targeted attacks. Our results indicate that QEDA2 is more effective in mitigating the effect of attacks on throughput. Moreover, our findings highlight the trade-offs between network robustness, resource allocation, and fidelity constraints, providing valuable insights for the design of resilient large-scale quantum networks.

量子网络对于安全量子通信和分布式量子计算至关重要。然而，它们的性能非常容易受到破坏纠缠分布的目标攻击，从而导致严重的网络退化。为了解决这一挑战，我们提出了两种启发路由算法量子纠缠分布算法1 （QEDA1）和量子纠缠分布算法2 (QEDA2)，它们通过减少中间节点的数量来最小化保真度损失，同时优化纠缠交换和净化策略。在QEDA1中，我们只将纯化作为一种恢复机制，而在QEDA2中，我们使用了纯化-重路由方法。此外，与之前主要依赖于理想化或小规模拓扑的研究不同，我们在现实世界的网络拓扑（Surfnet）上评估了我们的方法，分析了正常条件下和目标攻击下的吞吐量变化。此外，我们比较了该算法在记忆辅助和无记忆量子网络中的性能，展示了量子记忆对网络弹性的影响。此外，我们引入了一种基于中心性驱动节点故障的攻击模型，并提出了一种集成了重路由和纠缠净化的恢复机制，以减轻目标攻击的影响。我们的结果表明，QEDA2在减轻攻击对吞吐量的影响方面更有效。此外，我们的研究结果强调了网络鲁棒性、资源分配和保真度约束之间的权衡，为弹性大规模量子网络的设计提供了有价值的见解。

{"title":"Resilience analysis of quantum network against targeted attacks: Recovery via rerouting and purification","authors":"Hilal Sultan Duranoglu Tunc , Abebu Ademe Bayleyegn , Joachim Notcker , Riccardo Bassoli , Frank H.P. Fitzek","doi":"10.1016/j.osn.2025.100810","DOIUrl":"10.1016/j.osn.2025.100810","url":null,"abstract":"<div><div>Quantum networks are essential for secure quantum communication and distributed quantum computing. However, their performance is highly vulnerable to targeted attacks that disrupt entanglement distribution, leading to significant network degradation. To address this challenge, we propose two heuristic routing algorithms Quantum Entanglement Distribution Algorithm 1 (QEDA1) and Quantum Entanglement Distribution Algorithm 2 (QEDA2) that minimize loss of fidelity by reducing the number of intermediate nodes while optimizing entanglement swapping and purification strategies. In QEDA1 we only applied purification as a recovery mechanism, while in QEDA2 we utilized a purification-rerouting approach. Furthermore, unlike previous studies, which relied primarily on idealized or small-scale topologies, we evaluated our approach on a real-world network topology (Surfnet), analyzing throughput variations under both normal conditions and targeted attacks. Furthermore, we compare the performance of the algorithm in memory-assisted and memoryless quantum networks, demonstrating the impact of quantum memory on network resilience. In addition, we introduce an attack model based on centrality-driven node failures and propose a recovery mechanism that integrates rerouting and entanglement purification to mitigate the effects of targeted attacks. Our results indicate that QEDA2 is more effective in mitigating the effect of attacks on throughput. Moreover, our findings highlight the trade-offs between network robustness, resource allocation, and fidelity constraints, providing valuable insights for the design of resilient large-scale quantum networks.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"57 ","pages":"Article 100810"},"PeriodicalIF":1.9,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143882244","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-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-03-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-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-02-22","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-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

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 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

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 : 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":"2024-11-09","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

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 : 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":"2024-11-08","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

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 : 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":"2024-11-07","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

An architecture to improve performance of software-defined optical networks 提高软件定义光网络性能的架构

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

Optical Switching and Networking

Pub Date : 2024-07-01 DOI: 10.1016/j.osn.2024.100783

Srija Chakraborty, Ashok Kumar Turuk, Bibhudatta Sahoo

The software-defined optical network (SDON) is a revolutionary approach in the field of optical networks. The separation of the control plane and data plane in software-defined networking (SDN) provides enhanced security and simplified network administration. Nevertheless, performance and control plane scalability are significant issues in SDN. SDN performance can be evaluated using parameters such as burst loss, delay, channel occupancy, packet loss, throughput, and average response time. The number of messages exchanged between the data plane and the control plane is used as a metric to determine controller scalability. As the network load increases, the controller experiences a higher flow of messages. It causes delay and burst loss in transmitting the burst. Occasionally, bursts exceed the capacity of the fixed-sized burstifier and are discarded because it takes a long time to identify a suitable route for the burst. Hence, it is essential to minimize the volume of messages exchanged between the control plane and the data plane to improve performance and controller scalability. In this paper, we propose a scalable SDN optical network architecture that minimizes the number of messages exchanged between the data plane and the control plane. We proposed mechanisms like channel reservation, transmission cycles, and guard time between cycles to enhance both the speed and the quality of burst transmission. Prior to transmission, resources or channels are allocated to bursts to minimize the possibility of burst collision and loss. The data plane comprises an optical burst switching (OBS) network, and the flow table entries are periodically updated to minimize inter-plane communication. We perform simulations to evaluate and compare the performance of the proposed architecture with the existing state-of-the-art architecture reported in the literature. The proposed architecture performs better than the existing state-of-the-art in terms of metrics including burst loss, delay, channel occupancy, packet loss, throughput, average response time, and reduction in the number of messages exchanged between the data plane and the control plane. Experimental results indicate a 41% reduction in mean burst loss probability and a 40.5% reduction in mean burst sending delay compared to existing architectures. Additionally, 42.1% fewer messages are exchanged between the control plane and the data plane compared to the number of exchanged messages in existing architectures.

软件定义光网络（SDON）是光网络领域的一种革命性方法。软件定义网络（SDN）中控制平面和数据平面的分离增强了安全性并简化了网络管理。然而，性能和控制平面的可扩展性是 SDN 的重要问题。SDN 性能可通过突发丢失、延迟、信道占用、数据包丢失、吞吐量和平均响应时间等参数进行评估。数据平面和控制平面之间交换的信息数量被用作确定控制器可扩展性的指标。随着网络负载的增加，控制器的报文流量也会增加。这会导致突发传输延迟和突发丢失。偶尔，突发会超出固定大小突发器的容量，并被丢弃，因为要花很长时间才能为突发找到合适的路由。因此，必须尽量减少控制平面和数据平面之间的信息交换量，以提高性能和控制器的可扩展性。在本文中，我们提出了一种可扩展的 SDN 光网络架构，它能最大限度地减少数据平面和控制平面之间的信息交换量。我们提出了信道预留、传输周期和周期之间的保护时间等机制，以提高突发传输的速度和质量。在传输之前，为突发分配资源或信道，以尽量减少突发碰撞和丢失的可能性。数据平面由光突发交换（OBS）网络组成，流量表条目定期更新，以尽量减少平面间通信。我们进行了仿真，以评估和比较拟议架构与文献中报道的现有最先进架构的性能。在突发丢失、延迟、信道占用、数据包丢失、吞吐量、平均响应时间以及减少数据平面和控制平面之间的信息交换数量等指标方面，拟议架构的性能都优于现有的先进架构。实验结果表明，与现有架构相比，平均突发丢失概率降低了 41%，平均突发发送延迟降低了 40.5%。此外，与现有架构中交换的信息数量相比，控制平面和数据平面之间交换的信息数量减少了 42.1%。

{"title":"An architecture to improve performance of software-defined optical networks","authors":"Srija Chakraborty, Ashok Kumar Turuk, Bibhudatta Sahoo","doi":"10.1016/j.osn.2024.100783","DOIUrl":"https://doi.org/10.1016/j.osn.2024.100783","url":null,"abstract":"<div><p>The software-defined optical network (SDON) is a revolutionary approach in the field of optical networks. The separation of the control plane and data plane in software-defined networking (SDN) provides enhanced security and simplified network administration. Nevertheless, performance and control plane scalability are significant issues in SDN. SDN performance can be evaluated using parameters such as burst loss, delay, channel occupancy, packet loss, throughput, and average response time. The number of messages exchanged between the data plane and the control plane is used as a metric to determine controller scalability. As the network load increases, the controller experiences a higher flow of messages. It causes delay and burst loss in transmitting the burst. Occasionally, bursts exceed the capacity of the fixed-sized burstifier and are discarded because it takes a long time to identify a suitable route for the burst. Hence, it is essential to minimize the volume of messages exchanged between the control plane and the data plane to improve performance and controller scalability. In this paper, we propose a scalable SDN optical network architecture that minimizes the number of messages exchanged between the data plane and the control plane. We proposed mechanisms like channel reservation, transmission cycles, and guard time between cycles to enhance both the speed and the quality of burst transmission. Prior to transmission, resources or channels are allocated to bursts to minimize the possibility of burst collision and loss. The data plane comprises an optical burst switching (OBS) network, and the flow table entries are periodically updated to minimize inter-plane communication. We perform simulations to evaluate and compare the performance of the proposed architecture with the existing state-of-the-art architecture reported in the literature. The proposed architecture performs better than the existing state-of-the-art in terms of metrics including burst loss, delay, channel occupancy, packet loss, throughput, average response time, and reduction in the number of messages exchanged between the data plane and the control plane. Experimental results indicate a 41% reduction in mean burst loss probability and a 40.5% reduction in mean burst sending delay compared to existing architectures. Additionally, 42.1% fewer messages are exchanged between the control plane and the data plane compared to the number of exchanged messages in existing architectures.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"54 ","pages":"Article 100783"},"PeriodicalIF":1.9,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141539461","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-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-06-26","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