Optical Switching and Networking最新文献

{"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 ,&nbsp;Xingji Huo ,&nbsp;Yong Chen ,&nbsp;Bo Liu ,&nbsp;Runze Ge ,&nbsp;Di Deng ,&nbsp;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}

{"title":"A pre-forbidden spectrum strategy to conveniently consider crosstalk in SDM-EON","authors":"Junling Yuan ,&nbsp;Zixuan Wu ,&nbsp;Xiao Ma ,&nbsp;Xuhong Li ,&nbsp;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":"From design to recovery: Insights on resilient networks from RNDM 2023","authors":"Doğanalp Ergenç ,&nbsp;Nurefşan Sertbaş Bülbül ,&nbsp;Jacek Rak ,&nbsp;Mathias Fischer ,&nbsp;Andreas Kassler","doi":"10.1016/j.osn.2025.100800","DOIUrl":"10.1016/j.osn.2025.100800","url":null,"abstract":"","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"56 ","pages":"Article 100800"},"PeriodicalIF":1.9,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143259524","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 ,&nbsp;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}

{"title":"Modeling and upgrade of disaster-resilient interdependent networks using machine learning","authors":"Ferenc Mogyorósi,&nbsp;Péter Revisnyei,&nbsp;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}

{"title":"Self-adjusting resilient control plane for virtual software-defined optical networks","authors":"Ferenc Mogyorósi,&nbsp;Péter Babarczi,&nbsp;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}

{"title":"NFV recovery strategies for critical services after massive failures in optical networks","authors":"Trond Vatten,&nbsp;Poul E. Heegaard,&nbsp;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}

{"title":"An architecture to improve performance of software-defined optical networks","authors":"Srija Chakraborty,&nbsp;Ashok Kumar Turuk,&nbsp;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}

{"title":"A distance adaptive dual-hop routing algorithm for underwater optical wireless networks","authors":"Jing Ji,&nbsp;Yinkang Dai,&nbsp;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}

{"title":"Secured THz communication in photonic microcell networks based on spatial wave mixing of steered beams","authors":"Ming Che ,&nbsp;Hanwei Chen ,&nbsp;Yuta Ueda ,&nbsp;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 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.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"54 ","pages":"Article 100773"},"PeriodicalIF":2.2,"publicationDate":"2024-06-07","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}