Abstract
This article studies the cross-layer network planning that tries to combine flexible Ethernet (FlexE) and elastic optical networks (EONs), for FlexE-over-EONs. We focus our investigation on the most challenging setting, i.e., the FlexE-over-EONs based on the FlexE-aware architecture, and consider both single-hop and multi-hop scenarios for the cross-layer planning. For the single-hop scenario, we assume that all the client flows are routed over end-to-end lightpaths in the EON. We formulate a mixed integer linear programming (MILP) model for this problem, transform it into the class constrained bin packing problem (CCBP), and leverage the primal-dual interior-point (PDIP) method to propose a polynomial-time approximation algorithm for it. Then, for the multi-hop scenario, we use a more realistic assumption that each client flow can be routed over multiple lightpaths in the EON. We show that after solving the virtual topology design, the cross-layer planning in this scenario can be transformed into that in the single-hop scenario. Therefore, an integer linear programming (ILP) model is formulated to tackle the virtual topology design, and we design a polynomial-time approximation algorithm for it by modifying the well-known branch-and-bond method. To evaluate the performance of our two-step method for the multi-hop scenario, we also propose a heuristic algorithm. Extensive simulations verify that regarding large-scale cross-layer planning for FlexE-over-EONs, our approximation algorithms are significantly more time-efficient than the ILP/MILP models, and their solutions have bounded gaps to the optimal ones and are much better than those of the heuristic.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Network and Service Management
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.