Optimization method and system for minimizing network energy consumption based on traffic grooming

Patent metadata

Field	Value
Publication number	US-12289208-B2
Application number	US-202117802193-A
Country	US
Kind code	B2
Filing date	Aug 23, 2021
Priority date	Aug 16, 2021
Publication date	Apr 29, 2025
Grant date	Apr 29, 2025

Abstract

The present invention provides an optimization method and system for minimizing network energy consumption based on traffic grooming. The method includes: generating a set of service requests in an elastic optical network, and calculating a reachable node set of shortest paths from source to destination nodes for each service request; establishing a virtual reachable path in the reachable node set of shortest paths; and establishing a target function of an integer linear programming model of the minimizing network energy consumption, 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, where if all 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. The present invention helps to improve the energy efficiency of service requests.

First claim

What is claimed is:

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.

2. The optimization method for minimizing network energy consumption based on traffic grooming according to claim 1 , wherein when the virtual reachable path is established between the source node and the destination node, a distance between any two nodes on a working path does not exceed a maximum transmission distance of light.

3. The optimization method for minimizing network energy consumption based on traffic grooming according to claim 1 , wherein energy consumers in the elastic optical network comprise an IP router port, an optical transponder, and an optical regenerator.

4. The optimization method for minimizing network energy consumption based on traffic grooming according to claim 1 , wherein the target function comprises calculating a quantity of optical channels in the network and total energy consumption corresponding to IP router ports and optical transponders and calculating a quantity of optical regenerators configured in the network and total energy consumption corresponding to the optical regenerators.

5. The optimization method for minimizing network energy consumption based on traffic grooming according to claim 1 , wherein the bandwidth capacity constraint of the single spectrum slot is Σ (s,d)∈CR Σ k∈K X l,w (s,d),k ≤C×Y w l ∀l∈L, w∈W, wherein CR represents the group of service request sets, K represents a set of calculated k shortest paths, C is a bandwidth capacity of each spectrum slot, L and W respectively represent an optical fiber link set in the optical network and a spectrum slot set on each link, X l,w (s,d),k is a variable, and if a service request (s, d) occupies a spectrum slot w on a link l in a k th shortest path, a value of the variable is an amount of occupied bandwidth resources, or otherwise the value is 0.

6. The optimization method for minimizing network energy consumption based on traffic grooming according to claim 1 , wherein the path selection uniqueness constraint is Σ k∈K K k (s,d) =1∀(s,d)∈CR, wherein K k (s,d) is a binary variable, and if a service request (s, d) uses a k th shortest path to complete service transmission, a value of the variable is 1, or otherwise the value is 0.

7. The optimization method for minimizing network energy consumption based on traffic grooming according to claim 1 , wherein the spectrum allocation constraint condition is:
Σ w∈W X l,w (s,d),k =B sd ×K k (s,d) ∀l∈X k (s,d) ,( s,d )∈ CR,k∈K,

X l i ,w (s,d),k =X l j ,w (s,d),k ∀l i ,l j ∈X k (s,d) ,l i ≠l j ,K k (s,d) =1, w∈W ,( s,d )∈ CR,k∈K,

wherein B sd represents a bandwidth requirement of the service, X k (s,d) represents a set of link occupation status of a service request (s, d) on a k th shortest path and represents a variable, and if the service request (s, d) occupies a spectrum slot w on a link l i (l j ) in the k th shortest path, a value of the variable is an amount of occupied bandwidth resources, or otherwise the value is 0.

8. The optimization method for minimizing network energy consumption based on traffic grooming according to claim 1 , wherein the optical regenerator quantity constraint is:

Z
i

<

M
⁢

∀

i
∈
N

;

∑

j
=
1

|
N
|

⁢

x

k
,
s
,
j

(

s
,
d

)

-

∑

j
=
1

|
N
|

⁢

x

k
,
j
,
s

(

s
,
d

)

=

K
k

(

s
,
d

)

⁢

∀

(

s
,
d

Assignees

• Univ Soochow

Inventors

• Chen Bowen
• Jiang Yunfei
• Chen Qi
• Ma Weike
• Liu Ling
• Shen Gangxiang
• Gao Mingyi
• Xiang Lian
• Chen Hong

Classifications

• H04L45/122 Primary

  by minimising distances, e.g. by selecting a route with minimum of number of hops · CPC title

• H04L41/5051

  Service on demand, e.g. definition and deployment of services in real time · CPC title

• H04L41/0833 Primary

  for reduction of network energy consumption · CPC title

• H04B10/27

  Arrangements for networking · CPC title

• H04L45/12

  Shortest path evaluation · CPC title