Ruijie Zhu

Multi-dimensional resource virtualization in spectral and spatial domains for inter-datacenter optical networks

This paper proposes multi-dimensional resource mapping algorithms for inter-datacenter optical networks. Simulation results show that these proposed mapping algorithms can achieve better performance in blocking probability and revenue-to-cost ratio than the baseline algorithm.

Multi-core virtual concatenation scheme considering inter-core crosstalk in spatial division multiplexing enabled elastic optical networks

Spatial division multiplexing enabled elastic optical networks (SDM-EONs) are the potential implementation form of future optical transport networks, because it can curve the physical limitation of achievable transmission capacity in single-mode fiber and single-core fiber. However, spectrum fragmentation issue becomes more serious in SDM-EONs compared with simple elastic optical networks (EONs) with single mode fiber or single core fiber. In this paper, multi-core virtual concatenation (MCVC) scheme is first proposed considering inter-core crosstalk to solve the spectrum fragmentation issue in SDM-EONs. Simulation results show that the proposed MCVC scheme can achieve better performance compared with the baseline scheme, i.e., single-core virtual concatenation (SCVC) scheme, in terms of blocking probability and spectrum utilization.

Crosstalk-aware provisioning strategy with Dedicated Path Protection for elastic multi-core fiber networks

Space division multiplexing (SDM) over multi-core fiber (MCF) is advocated as a promising technology to overcome the capacity limit of the current single-core optical networks. Network survivability has become a more important concern to guarantee the QoS of more plentiful network traffics. In this paper, we have an investigation about dedicated path protection with considering inter-core crosstalk (XT) in elastic MCF networks. To minimize the influence of XT and blocking probability, a novel crosstalk-aware provisioning strategy with dedicated path protection (CaP) is proposed. Simulation results show that the proposed CAP strategy can perform better than the crosstalk unaware provisioning strategy (CuP), such as modified First-Fit (FF) strategy, in terms of blocking probability, and resource utilization.

Crosstalk-aware routing, spectrum, and core assignment in space-division multiplexing optical networks with multicore fibers

Abstract. The transmission capacity of existing optical fiber will reach its physical limitation due to increasing network bandwidth. Recently, space-division multiplexing (SDM) technology has been proposed to increase the fiber transmission capacity. Multicore fiber (MCF) is a strong candidate for SDM transmission, but the intercore crosstalk will be a critical issue with MCF transmission. We make a specific analysis of transmission crosstalk in elastic optical networks. Then, the concept of spare spectrum availability is introduced to accommodate connection requests. Based on it, two different crosstalk-aware routing, spectrum, and core assignment algorithms are presented at different network states. Simulation results show that our proposed scheme improves the spectrum resource utilization and reduces blocking, with a cost of additional algorithm complexity and set-up delay.

Static Routing and Spectrum Assignment for Deadline-Driven Bulk-Data Transfer in Elastic Optical Networks

Inter-datacenter services such as data replication and virtual machine migration contribute significantly to the underlying network traffic. These bulk-data transfer services can tolerate certain delay if the completion time is guaranteed with a pre-defined deadline. In this paper, we propose joint frequency- and time-domain optimization algorithms of static routing and spectrum assignment (RSA) for these deadline-driven bulk-data transfer requests in elastic optical networks. We formulate the problem as an integer linear program (ILP) and then propose six scheduling schemes, which combine three request ordering strategies with two RSA algorithms. Simulation results show that compared with ILP, our schemes can achieve the same performance in terms of spectrum utilization with efficient time complexity. Furthermore, based on the numerical results and computational efficiency, we provide a guideline on choosing scheduling schemes.

Multi-dimensional resource assignment in spatial division multiplexing enabled elastic optical networks with multi-core fibers

In this paper, the problem of routing, core, and spectrum assignment (RCSA) for advance reservation (AR) and immediate reservation (IR) requests is studied in spatial division multiplexing enabled elastic optical networks (SDM-EONs) with multi-core fibers (MCFs). As lightpaths are set up and torn down, fragmentations may occur in both spectrum and time dimensions in SDM-EONs. To measure these fragmentations, we design a metric, named multi-dimensional resource compactness (MRC). Based on MRC, two RCSA algorithms are proposed, first-fit resource assignment algorithm based on MRC (FF-MRC) and random-fit resource assignment algorithm based on MRC (RF-MRC). Simulation results show that both FF-MRC and RF-MRC can achieve beer performance than the baseline algorithm in terms of blocking probability and spectrum utilization, with FF-MRC providing the best performance.

Survivable Bulk Data-Flow Transfer Strategies in Elastic Optical Inter-Datacenter Networks

In this paper, we study the survivable routing, modulation, and spectrum assignment (S-RMSA) problem for bulk data- flow transfer in elastic optical networks. We design a two- dimensional resource model for specifying resource state information that spans both the spectrum and time dimensions, and we develop a dynamic heuristic RMSA algorithm, Max Resource Utilization (MRU), to efficiently transfer data-flows while meeting deadline constraints and surviving single link failures. Furthermore, we provide a protection resource optimization strategy to progressively release the scheduled protection resources so as to increase spectrum utilization. We examine the performance of our proposed algorithm, and numerical results show that our proposed heuristic algorithm can reduce blocking probability and obtain high spectrum utilization while minimizing fragmentation.

2D Fragmentation-aware Virtual Optical Network Embedding (VONE) in Elastic Optical Networks

We proposed two virtual optical network embedding (VONE) algorithms in elastic optical networks, considering time and spectrum fragmentations. Simulation results show that they perform better than the baseline algorithm in blocking probability and spectrum utilization.