Distance-adaptive, Low CAPEX Cost <inline-formula> <tex-math notation="LaTeX">$p$</tex-math> </inline-formula>-Cycle Design Without Candidate Cycle Enumeration in Mixed-Line-Rate Optical Networks

Abstract

Even though elastic optical networks (EONs) are promising to provision increasingly dynamic and heterogeneous traffic, the requirements on bandwidth-variable optical devices bring upgrading challenges in current wavelength-division multiplexing (WDM) optical networks. Mixed-line-rate (MLR) optical networks offer a transitional solution that allows several coexisting line rates (e.g., $10/40/100$ Gb/s). In this paper, we investigate distance-adaptive preconfigured-cycle ( $p$ -Cycle) protection scheme in MLR optical networks. Path-length-limited $p$ -cycles are designed to be assigned line rate depending on the length of each protection path. Instead of conventional candidate cycle enumeration, a mixed integer linear programming (MILP) model is formulated to directly generate the optimal $p$ -cycles with the minimum capital expenditures (CAPEX) cost. We also develop two algorithms to make the proposed MILP model scalable. Simulation results indicate that the algorithms are time efficient for solving the MILP-based $p$ -cycle design. We further compare our $p$ -cycle design method with other schemes, and demonstrate that our method largely reduces the CAPEX cost for more than $40\%$ , mainly in transponder cost. To the best of our knowledge, this is the first time that distance-adaptive $p$ -cycle design without candidate cycle enumeration is proposed for MLR optical networks.