Auxiliary graph-based energy-efficient routing resource allocation algorithm in space division multiplexing elastic optical networks

Abstract

Space division multiplexing elastic optical networks (SDM-EONs) are considered as a efficient solution for increasing the link’s capacity. However, the SDM-EONs brought challenges to be explored, notably the routing, core and spectrum assignment (RCSA) problem. For the real network, another important issue should be considered is the problem of energy consumption. The auxiliary graph (AG) can abstract node devices into elements in it and support various routing policies for different purposes by adjusting the weights of AG edges. Therefore, this paper proposes an auxiliary graph-based energy efficient routing resource allocation algorithm (AG-EERRA) to jointly optimize the energy consumption and RCSA. Each node of the auxiliary graph is abstracted from the devices of physical node. The intra edge weights of nodes set the function associated with the energy consumption model. The inter edge weights of node are composed link length, free frequency slots, modulation efficiency and the value of core crosstalk innovatively. Meanwhile, the impact of inter-core crosstalk on request is reduced by crosstalk avoidance strategy and crosstalk aware strategy. In the proposed auxiliary graph, the shortest weight path is selected to transmit requests that can reduce network energy consumption and blocking probability. Under the high-load network, request splitting is performed for the requests that cannot successfully find a route to improve energy efficiency. Simulation results show that the proposed algorithm can improve the network energy efficiency while reducing request blocking probability compared to comparison algorithms.