Optical Switching and Networking最新文献

{"title":"Experimental validation of an SDN residential network management proposal over a GPON testbed","authors":"Noemi Merayo,&nbsp;David de Pintos,&nbsp;Juan C. Aguado,&nbsp;Ignacio de Miguel,&nbsp;Ramón J. Durán,&nbsp;Patricia Fernández,&nbsp;Rubén M. Lorenzo,&nbsp;Evaristo J. Abril","doi":"10.1016/j.osn.2021.100631","DOIUrl":"10.1016/j.osn.2021.100631","url":null,"abstract":"<div><p>We propose, and experimentally demonstrate, an SDN (Software Defined Networking) new management solution for legacy GPONs (Gigabit Passive Optical Networks), which allows users to dynamically control their residential networks by means of a management application. In this way, users can customize the allocation of resources (and set constraints, if desired) to connected devices in their residential network, fast and efficiently. This real-time customization enables new business models for network operators and service providers. As a proof of concept and to validate the management solution, we demonstrate, in a testbed environment, the operation of a dynamic network scenario where an operator has a business model in which users have a contracted basic bandwidth, but they are allowed to increase it temporarily when using highly demanding services.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100631"},"PeriodicalIF":2.2,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100631","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131193193","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":"Cascading-failure-resilient interconnection for interdependent power grid - Optical network","authors":"M. Farhan Habib ,&nbsp;Francesco Musumeci ,&nbsp;Massimo Tornatore ,&nbsp;Biswanath Mukherjee","doi":"10.1016/j.osn.2021.100632","DOIUrl":"https://doi.org/10.1016/j.osn.2021.100632","url":null,"abstract":"<div><p><span>The interdependence between communication networks, e.g., an optical backbone network<span><span>, and power grids is a critical issue to take into account when designing and operating both systems. In fact, failures in one network may cause further failures in the other network and vice versa. This is because nodes in power grids (i.e., power generators, loads or interchange nodes) are controlled and managed by telecommunication equipment, which, in turn, rely on the electricity grid for their power supply. Therefore, failures occurring on a limited portion of one network can cascade multiple times between these two networks, and a robust “interdependency network” (i.e., consisting of the interconnections between nodes in the two networks) is needed. This paper investigates the problem of designing a resilient interconnection against interdependent cascading-failures in interdependent power grid - optical networks. We formalize, using an Integer </span>Linear Program, the new problem of </span></span><em>Power Grid - Optical Network Interconnection</em> (<em>PGON-I</em><span><span>), which consists in designing an interconnection between the power grid and the optical network that is resilient to cascading failures, i.e., avoids/reduces cascade. For this problem, we derive analytically upper and lower bounds on the number of interconnection links which ensure resilience against cascading failures initiated from a single node-failure. Starting from the analytical model, we develop a </span>heuristic algorithm to solve large instances of the problem. Our results show that the higher the difference between the number of nodes in the two networks, the more interconnection links are needed to ensure resilience against failures cascade.</span></p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100632"},"PeriodicalIF":2.2,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91593731","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":"RMSA algorithms resilient to multiple node failures in dynamic EONs","authors":"Fábio Barbosa ,&nbsp;Amaro de Sousa ,&nbsp;Agostinho Agra ,&nbsp;Krzysztof Walkowiak ,&nbsp;Róża Goścień","doi":"10.1016/j.osn.2021.100633","DOIUrl":"https://doi.org/10.1016/j.osn.2021.100633","url":null,"abstract":"<div><p>In Elastic Optical Networks (EONs), the way different service demands are supported in the network is ruled by the Routing, Modulation and Spectrum Assignment (RMSA) algorithm, which decides how the spectrum resources of the optical network are assigned to each service demand. In a dynamic EON, demand requests arrive randomly one at a time and the accepted demands last in the network for a random time duration. So, one important goal of the RMSA algorithm is the efficient use of the spectrum resources to maximize the acceptance probability of future demand requests. On the other hand, multiple failure events are becoming a concern to network operators as such events are becoming more frequent in time. In this work, we consider the case of multiple node failure events caused by malicious attacks against network nodes. In order to obtain RMSA algorithms resilient to such events, a path disaster availability metric was recently proposed which takes into account the probability of each path not being disrupted by an attack. This metric was proposed in the offline variant of the RMSA problem where all demands are assumed to be known at the beginning. Here, we exploit the use of the path disaster availability metric in the RMSA of dynamic EONs. In particular, we propose RMSA algorithms combining the path disaster availability metric with spectrum usage metrics in a dynamic way based on the network load level. The aim is that the efficient use of the resources is relaxed for improved resilience to multiple node failures when the EON is lightly loaded, while it becomes the most important goal when the EON becomes heavily loaded. We present simulation results considering a mix of unicast and anycast services in 3 well-known topologies. The results show that the RMSA algorithms combining the path disaster availability metric with spectrum usage metrics are the best trade-off between spectrum usage efficiency and resilience to multiple node failures.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100633"},"PeriodicalIF":2.2,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100633","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91593730","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":"Improving efficiency of network resources in elastic optical transport network by using in-network cache functions","authors":"Takashi Miyamura ,&nbsp;Akira Misawa","doi":"10.1016/j.osn.2021.100629","DOIUrl":"10.1016/j.osn.2021.100629","url":null,"abstract":"<div><p>We developed a network architecture called information-centric elastic optical transport network (i-CEON) that enables efficient content delivery. Increasing the volume of video traffic consumes network resources, so it is necessary to establish optical transport network architectures suitable for content delivery. For this purpose, we extend existing information-centric networking to be applicable to elastic optical networks. The main focus of this paper is presenting the method in i-CEON of optimizing optical-path routing by effectively using an in-network cache function to efficiently accommodate content traffic. This reduces redundant use of network resources. We formulate the joint optimization problem of elastic optical-path routing and content-replication placement as a mixed integer linear programming problem and also develop a heuristic algorithm. We conducted intensive numerical experiments to demonstrate the effectiveness of our method and confirmed that it reduced network cost by 21% and server load by 32%.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"42 ","pages":"Article 100629"},"PeriodicalIF":2.2,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100629","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131209896","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":"Security and privacy-awareness in a software-defined fog computing network for the Internet of Things","authors":"Abdulrahman Alamer","doi":"10.1016/j.osn.2021.100616","DOIUrl":"10.1016/j.osn.2021.100616","url":null,"abstract":"<div><p>Issues of high energy costs and a time delay factor currently pose a considerable challenge to the success of the Internet of Things (IoT). Accordingly, fog computing (fog-C) has been introduced as a new paradigm to address both the high bandwidth cost and time delay issues that can result from transmitting sensing data all the way to centralized cloud servers. In addition, the optical fog-C network has been introduced to improve packet transmission among a group of connected fog nodes to support services to the end-user, with a minimum time delay. However, since network traffic management issues, such as building a network topology for supporting network traffic rules, have not been systematically recognized in optical or wireless fog-C, the fog-C network system itself is still not sufficiently dynamic to completely address these energy costs and latency issues. Thus, many studies have been suggested to integrate a software defined network (SDN) into the fog-C network system to present a software defined fog-C (SDFC) network architecture in order to eliminate the aforementioned issues associated with IoT applications. However, integrating the SDN with the fog-C system may generally result in introducing specific security and privacy challenges to the fog-C network topology system due to its distinctive features. This paper will review the overall promising advantages of SDFC networks, with a consideration of security and privacy threats associated with the fog-C network topology as well as possible solutions.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"41 ","pages":"Article 100616"},"PeriodicalIF":2.2,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100616","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120935436","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":"Topological approach to measure the recoverability of optical networks","authors":"Peng Sun,&nbsp;Zhidong He,&nbsp;Robert E. Kooij,&nbsp;Piet Van Mieghem","doi":"10.1016/j.osn.2021.100617","DOIUrl":"10.1016/j.osn.2021.100617","url":null,"abstract":"<div><p>Optical networks are vulnerable to failures due to targeted attacks or large-scale disasters. The recoverability of optical networks refers to the ability of an optical network to return to a desired performance level after suffering topological perturbations such as link failures. This paper proposes a general topological approach and recoverability indicators to measure the network recoverability for optical networks for two recovery scenarios: 1) only the links which are damaged in the failure process can be recovered and 2) links can be established between any pair of nodes that have no link between them after the failure process. We use the robustness envelopes of realizations and the histograms of two recoverability indicators to illustrate the impact of the random failure and recovery processes on the network performance. By applying the average two-terminal reliability and the network efficiency as robustness metrics, we employ the proposed approach to assess 20 real-world optical networks. Numerical results validate that the network recoverability is coupled to the network topology, the robustness metric and the recovery strategy. We further show that a greedy recovery strategy could provide a near-optimal recovery performance for the robustness metrics. We investigate the sensitivity of network recoverability and find that the sensitivity of the recoverability indicators varies according to different robustness metrics and scenarios. We also find that assortativity has the strongest correlation with both recoverability indicators.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"41 ","pages":"Article 100617"},"PeriodicalIF":2.2,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100617","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125884224","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":"Optimization algorithms for the proactive configuration of elastic optical networks under jamming attacks and demand uncertainty","authors":"K. Manousakis ,&nbsp;T. Panayiotou ,&nbsp;P. Kolios ,&nbsp;I. Tomkos ,&nbsp;G. Ellinas","doi":"10.1016/j.osn.2021.100618","DOIUrl":"10.1016/j.osn.2021.100618","url":null,"abstract":"<div><p>This work presents optimization algorithms on attack-aware routing and spectrum allocation (Aa-RSA) in conjunction with spectrum selective switch (SSS) placement, taking into account variations in traffic demands. The objectives of the algorithms are to minimize the required number of SSSs, as well as the number of lightpath re-allocations between different demand scenarios, taking into account the crosstalk interactions that could potentially be utilized during a jamming attack to facilitate the spread of the attack to additional lightpaths throughout the network. To solve the offline network design problem, first the proposed Aa-RSA algorithm is modeled as a mathematical formulation that jointly considers all the design parameters. Then, integer linear program (ILP)-based decomposition techniques and graph-based heuristics are also proposed to address large-sized networks. Additionally, it is shown through a dynamic time-varying Aa-RSA scenario, that the offline pre-calculated network configurations are a good fit for the traffic demand variations, eliminating the computational time required in the path computation element (PCE) for dynamically reconfiguring the network. The benefits of each of the proposed algorithms with respect to the network's operating and capital expenditures (measured in terms of performance metrics such as the number of SSSs deployed, the spectrum utilization, and the number of re-allocations) are reported and validated through extensive simulation results.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"41 ","pages":"Article 100618"},"PeriodicalIF":2.2,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100618","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121100387","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":"Ethernet fronthaul transport of an upper-physical layer functional split using time-aware shaping","authors":"Mohamad Kenan Al-Hares,&nbsp;Philippos Assimakopoulos,&nbsp;Nathan J. Gomes","doi":"10.1016/j.osn.2021.100605","DOIUrl":"10.1016/j.osn.2021.100605","url":null,"abstract":"<div><p>An Upper Physical layer functional Split (UPS) for an Ethernet fronthaul network is modelled, and the frame delay and Frame Delay Variation (FDV) limitations are investigated. The results show that contention in Ethernet switch ports can cause an increase in the delay and FDV beyond proposed specifications for the UPS and other time-sensitive traffic types such as I/Q-type traffic. Time Aware Shaping (TAS) can significantly reduce or even remove FDV for UPS traffic and I/Q-type traffic, but it is shown that TAS design aspects have to carefully consider the transmission pattern of the contending traffic in the Ethernet fronthaul network switches. Taking into account the transmission pattern of the UPS traffic, different time allocations within TAS window sections are proposed in conjunction with both receiver and transmitterside buffering. Further, it is proven that using TAS with higher link rates for example, 10 Gbps link rates or beyond makes it possible to transport the UPS and time sensitive traffic within its specification over fronthaul fiber spans, more than 10 km length, and/or more hops as TAS can potentially eliminate any increase in the FDV of the UPS traffic.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"41 ","pages":"Article 100605"},"PeriodicalIF":2.2,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100605","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121878941","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 Survey of Reconfigurable Optical Networks","authors":"Matthew Nance Hall ,&nbsp;Klaus-Tycho Foerster ,&nbsp;Stefan Schmid ,&nbsp;Ramakrishnan Durairajan","doi":"10.1016/j.osn.2021.100621","DOIUrl":"10.1016/j.osn.2021.100621","url":null,"abstract":"<div><p>Reconfigurable optical networks have emerged as a promising technology to efficiently serve the fast-growing traffic produced by the digital society. This paper provides a survey of the field. We first review enabling optical hardware technologies in general and then consider technologies that are specific to data center networks and wide-area networks in more detail. We further provide an overview of the cost models used in the literature as well as the algorithmic problems introduced by these technologies, their first solutions, and discuss systems and implementation aspects. We conclude with a discussion of open challenges.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"41 ","pages":"Article 100621"},"PeriodicalIF":2.2,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100621","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128284092","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":"Multi-path provisioning in elastic optical network with dynamic on-request optimal defragmentation strategy","authors":"Ujjwal,&nbsp;Jaisingh Thangaraj,&nbsp;Rajnish kumar","doi":"10.1016/j.osn.2021.100607","DOIUrl":"10.1016/j.osn.2021.100607","url":null,"abstract":"<div><p>Elastic Optical Networks (EONs) are extensively accepted promising solution for future ultra-high-speed optical transmission, due to their capability of efficient and flexible assignment of immense optical bandwidth to the heterogeneous traffic demand. However, it undergoes through an aggravated form of the spectrum fragmentation problem due to the heterogeneous bandwidth requirements, spectrum continuity and contiguity constraints. Several techniques have been presented in the literature to get the optimal solution of this problem while multi-path provisioning comes out to be very compelling among them. Although, it creates further challenges due to high hardware requirement and more spectrum consumption due to guard-bands. In this paper, we propose a novel scheme, called optimal spectrum defragmentation (DF) strategy with split spectrum approach (OSDSSA), to tackle this limitation of multi-path provisioning by utilizing minimum number of spectral paths, which improves the scalability, reduces the extra spectrum consumption by guard-bands and avoids the exhaustion of transponders at nodes. The proposed scheme initially serves a connection request using k-shortest routing paths and first-fit spectrum allocation policy in a best possible way. In case, if a connection request cannot be served then the proposed mechanism proceeds with the triggering of Process Defragmentation on the link disjoint shortest paths followed by splitting of traffic demand on corresponding link-disjoint paths. The Process Defragmentation is triggered on the active connections at the immediate right and left of the largest continuous available spectrum block on the link-disjoint shortest paths sequentially until the requested amount of frequency slots (FSs) are achieved. In this work, reconfiguration includes spectrum re-tuning without changing the routing paths, thereby reducing the unnecessary service disruption, DF complexity and cost, leading to improvement in quality of service (QoS) of the network. The performance of the proposed scheme has been assessed through simulation results where single path and multi-path provisioning algorithms have been considered as benchmarks. Through our proposed scheme bandwidth blocking performance, spectrum utilization ratio, and degree of fragmentation have also been improved significantly.</p></div>","PeriodicalId":54674,"journal":{"name":"Optical Switching and Networking","volume":"41 ","pages":"Article 100607"},"PeriodicalIF":2.2,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.osn.2021.100607","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131441110","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}