학술논문

On the Cross-Layer Network Planning for Flexible Ethernet Over Elastic Optical Networks
Document Type
Periodical
Source
IEEE Transactions on Network and Service Management IEEE Trans. Netw. Serv. Manage. Network and Service Management, IEEE Transactions on. 18(3):3691-3705 Sep, 2021
Subject
Communication, Networking and Broadcast Technologies
Computing and Processing
Planning
Approximation algorithms
Topology
Optical fiber networks
IEEE 802.3 Standard
EPON
Optical packet switching
Flexible Ethernet (FlexE)
elastic optical networks (EONs)
approximation algorithms
traffic grooming
Language
ISSN
1932-4537
2373-7379
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.