US 12,289,208 B2
Optimization method and system for minimizing network energy consumption based on traffic grooming
Bowen Chen, Suzhou (CN); Yunfei Jiang, Suzhou (CN); Qi Chen, Suzhou (CN); Weike Ma, Suzhou (CN); Ling Liu, Suzhou (CN); Gangxiang Shen, Suzhou (CN); Mingyi Gao, Suzhou (CN); Lian Xiang, Suzhou (CN); and Hong Chen, Suzhou (CN)
Assigned to SOOCHOW UNIVERSITY, Suzhou (CN)
Appl. No. 17/802,193
Filed by SOOCHOW UNIVERSITY, Suzhou (CN)
PCT Filed Aug. 23, 2021, PCT No. PCT/CN2021/113992
§ 371(c)(1), (2) Date Aug. 25, 2022,
PCT Pub. No. WO2023/019604, PCT Pub. Date Feb. 23, 2023.
Claims priority of application No. 202110938102.8 (CN), filed on Aug. 16, 2021.
Prior Publication US 2023/0308352 A1, Sep. 28, 2023
Int. Cl. H04L 41/0833 (2022.01); H04L 45/122 (2022.01)
CPC H04L 41/0833 (2013.01) [H04L 45/122 (2013.01)] 10 Claims
OG exemplary drawing
 
1. An optimization method for minimizing network energy consumption based on traffic grooming, comprising steps of:
step S1: generating a group of service request sets in an elastic optical network, and calculating a reachable node set in a plurality of shortest paths according to a source node and a destination node of each service request;
step S2: establishing a virtual reachable path between a source node and a destination node in the reachable node set in the plurality of shortest paths; and
step S3: establishing a target function of an integer linear programming model of the minimizing network energy consumption based on the virtual reachable path, and sequentially determining whether a bandwidth capacity constraint of a single spectrum slot, a path uniqueness constraint, a spectrum allocation constraint, and an optical regenerator quantity constraint are satisfied in a process of allocating a resource to each service request, wherein if all the constraints are satisfied, the service request is successfully established, or if any of the constraints is not satisfied, the service request fails to be established.