Optical Switching and Networking最新文献

Revolutionizing optical networks: The integration and impact of large language models 革命性的光网络：大型语言模型的集成和影响

IF 1.9 4区计算机科学

Optical Switching and Networking Pub Date : 2025-06-24 DOI: 10.1016/j.osn.2025.100812

Sergio Cruzes

{"title":"Revolutionizing optical networks: The integration and impact of large language models","authors":"Sergio Cruzes","doi":"10.1016/j.osn.2025.100812","DOIUrl":"10.1016/j.osn.2025.100812","url":null,"abstract":"<div><div>The increasing complexity and scale of optical networks demand advanced automation frameworks capable of adapting to dynamic service requirements, physical-layer impairments, and multi-vendor environments. Traditional solutions—based on static rule sets or narrowly scoped machine learning models—struggle to manage real-time performance, heterogeneous data, and domain-specific variability. Large Language Models (LLMs), built on transformer architectures, offer a paradigm shift by enabling context-aware reasoning, multi-task generalization, and natural language interpretation. These models can automate configuration generation, fault diagnosis, alarm correlation, and routing and spectrum assignment (RSA), while enhancing Quality of Transmission (QoT) estimation and scenario modeling.</div><div>This article provides a comprehensive survey of current automation approaches in optical networks, including software-defined networking (SDN), intent-based networking (IBN), machine learning (ML)-based orchestration, and cognitive control architectures. Special attention is given to emerging paradigms that integrate LLMs for intent interpretation, fault analysis, configuration generation, and reasoning.</div><div>Building on these foundations, we propose a hybrid framework that integrates LLMs with Digital Twin (DT) technologies to enable closed-loop control, predictive optimization, and explainable, intent-driven decision-making. Telemetry streams feed both DT simulations and LLM-based reasoning agents, supporting proactive reconfiguration and fault mitigation. To address LLM limitations—such as hallucinations and inference latency —the framework incorporates prompt engineering, retrieval-augmented generation (RAG), domain-specific fine-tuning, and simulation-based validation.</div><div>The proposed architecture paves the way for resilient, autonomous, and sustainable optical networks that can self-optimize and adapt in real time.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"57 ","pages":"Article 100812"},"PeriodicalIF":1.9,"publicationDate":"2025-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144490868","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

Quantum-secure protocols for privacy preserving location based services 用于保护隐私的基于位置服务的量子安全协议

IF 1.9 4区计算机科学

Optical Switching and Networking Pub Date : 2025-06-01 DOI: 10.1016/j.osn.2025.100811

Sushmita Sarkar , Tapaswini Mohanty , Vikas Srivastava , Debasish Roy , Sumit Kumar Debnath , Sihem Mesnager , Sourav Mukhopadhyay

{"title":"Quantum-secure protocols for privacy preserving location based services","authors":"Sushmita Sarkar , Tapaswini Mohanty , Vikas Srivastava , Debasish Roy , Sumit Kumar Debnath , Sihem Mesnager , Sourav Mukhopadhyay","doi":"10.1016/j.osn.2025.100811","DOIUrl":"10.1016/j.osn.2025.100811","url":null,"abstract":"<div><div>Location Based Service (LBS) uses users’ geographic location to provide relevant and personalized services. However, privacy concerns arise for both users and service providers. Users wish to receive necessary information based on location-related queries without revealing the content of their queries to preserve privacy. At the same time, the location server must protect its valuable data from unauthorized access, as this data is a critical asset. In this manuscript, we address this problem and provide a solution to it by utilizing an oblivious transfer (OT) protocol. We propose a <span><math><mi>k</mi></math></span>-out-of-<span><math><mi>n</mi></math></span> quantum oblivious transfer protocol (namely <span>GqOT</span>) as a solution to the above-mentioned problem. We describe the problem and the application of our proposed <span>GqOT</span> to solve the privacy preserving issues of users and service providers during LBS. The solution is practical and efficient as the source of quantum states for <span>GqOT</span> is single photons. Consequently, simple projective measurements are required to measure the quantum states. Moreover, <span>GqOT</span> also provides long-term security, ensuring a significant solution to the problem LBS addresses.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"57 ","pages":"Article 100811"},"PeriodicalIF":1.9,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144221811","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

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

IF 1.9 4区计算机科学

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

{"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区计算机科学

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

{"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区计算机科学

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

{"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区计算机科学

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区计算机科学

Optical Switching and Networking Pub Date : 2025-01-01 DOI: 10.1016/j.osn.2024.100793

Sougata Das , Monish Chatterjee

{"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区计算机科学

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ć

{"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区计算机科学

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ć

{"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区计算机科学

Optical Switching and Networking Pub Date : 2024-11-07 DOI: 10.1016/j.osn.2024.100790

Trond Vatten, Poul E. Heegaard, Yuming Jiang

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