Dr Ankur Singhal, Dr Anil Garg, Dr Ajay Jangra, Dr Poonam Rani, Dr Priyanka Jangra, Dr Deepti Chaudhary
{"title":"Locusts Spiral Navigation Algorithm Enabled High-Speed Data Communication Network for Free Space Optics","authors":"Dr Ankur Singhal, Dr Anil Garg, Dr Ajay Jangra, Dr Poonam Rani, Dr Priyanka Jangra, Dr Deepti Chaudhary","doi":"10.1016/j.osn.2025.100815","DOIUrl":"https://doi.org/10.1016/j.osn.2025.100815","url":null,"abstract":"Over the past two decades, the proliferation of data communication devices has significantly expanded to raise the standard of living for the majority of people. However, the integration of multiple devices into a limited space requires significant bandwidth capacity when building densely connected networks. In addition, conventional systems increase synchronization errors and high operational expenditures. Therefore, to mitigate the limitations this research offers a Locusts Spiral Navigation Algorithm enabled Orthogonal Frequency-Division Multiplexing for high-speed data communication network in free space optics (LSN-OFDM-FSO). The proposed model utilizing the LSN algorithm effectively selects the best phasor weight factors with minimal Peak Average Power Ratio (PAPR) value. Moreover, the combination of Wavelength Division Multiplexing and Mach–Zehnder Modulator systems ensure high-speed connectivity with maximum transmission capacity. When compared with other existing modulation methods, the LSN-OFDM-FSO offers less Bit Error Rate <ce:math altimg=\"si1.svg\"></ce:math> for a Free space optics length of 6 km. Additionally, the proposed model has less penalty total power of -966.674 dB, and total power of -33.2618 dBm. On the other hand, in terms of energy analysis, for 64 OLTs, the proposed model consumes a total energy of 9.29, and the ONU consumes less energy of 77.04. Moreover, the proposed system is well-suitable for high-speed data communication networks, with minimum information loss and delay.","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"23 1","pages":""},"PeriodicalIF":2.2,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144613300","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"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-07-08","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}
Shahram Dehdashti , Janis Nötzel , Peter van Loock
{"title":"Quantum capacity of a deformed bosonic dephasing channel","authors":"Shahram Dehdashti , Janis Nötzel , Peter van Loock","doi":"10.1016/j.osn.2025.100814","DOIUrl":"10.1016/j.osn.2025.100814","url":null,"abstract":"<div><div>In this paper, using the notion of nonlinear coherent states, we define a deformed bosonic dephasing channel modeling the impact of a Kerr medium on a quantum state, as it occurs, for instance, in quantum communication based on optical fibers. We show that, in certain regimes, the Kerr nonlinearity is able to compensate the dephasing. In addition, our studies reveal that the quantum capacity of the deformed bosonic dephasing channel can be greater than that of the undeformed, standard bosonic dephasing channel for certain nonlinearity parameters.</div></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"57 ","pages":"Article 100814"},"PeriodicalIF":1.9,"publicationDate":"2025-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144572669","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"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}
{"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}
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}
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}
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}
{"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}