Packet Optical Transport Network Grooming for Power Consumption

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Traditional network routing algorithms, such as the shortest path algorithm, do not consider power consumption, leading to suboptimal energy usage in packet optical transport networks, which is detrimental to energy saving goals.

Innovation Solution

A grooming method for packet optical transport networks that converts wavelength links into virtual links, using power consumption as a weight in path planning to minimize energy usage, optimizing the routing of services by sorting and arranging services based on capacity and priority, and calculating weights for physical links to reflect the power consumption of transmitters, amplifiers, and receivers.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Length of moving object

If the shortest path algorithm is used for routing selection, then the distance and length between nodes are minimized, but the power consumption is not considered and may not be minimum

Engineering Contradiction:
Improvepath lengthVSAvoidpower consumption
Core Design Contradiction:
Length of moving objectVSUse of energy by moving object

Solution Approach 1:

The patent changes the routing parameter from distance-based weight to power consumption-based weight. The weight of each link is calculated based on the power consumption of transmitters, amplifiers, and receivers, allowing the routing algorithm to select paths that minimize energy usage rather than just physical distance.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent introduces virtual links as an intermediary concept between physical wavelength links and routing decisions. By converting physical links into virtual links with calculated power consumption weights, the system mediates between the physical network infrastructure and the routing algorithm, enabling energy-aware path selection.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Use of energy by moving object

If wavelength links are converted into virtual links with power consumption weights, then energy-aware routing is achieved, but the complexity of path planning increases

Engineering Contradiction:
Improvepower consumption optimizationVSAvoidpath planning complexity
Core Design Contradiction:
Use of energy by moving objectVSDevice complexity

Solution Approach 1:

The patent performs preliminary actions by pre-calculating the power consumption weights for all links in the network before routing decisions are made. The weight calculation considering transmitters, amplifiers, and receivers is done in advance, so that when routing occurs, the algorithm only needs to use these pre-computed weights without performing complex real-time calculations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent creates a virtual copy of the physical network topology where each physical wavelength link is represented as a virtual link with associated power consumption weight. This virtual model allows routing algorithms to operate on simplified data structures rather than complex physical network details, reducing computational complexity while maintaining accuracy.

Inventive Principle:
Principle #26Copying

Data Source

PatentEP3038302B1Grooming method and device for packet optical transport network
Publication Date: 2020.02.12 ZTE CORP
  • EP3038302B1 patent drawingFigure 1
  • EP3038302B1 patent drawingFigure 2
  • EP3038302B1 patent drawingFigure 3

AI summary

A grooming method and apparatus for a packet optical transport network are disclosed. The method includes: according to an arrangement order of various services, planning a path from a service source node to a service target node in an ith service in a topology set graph; when the path includes a wavelength link in a physical link, removing the wavelength link, and establishing a virtual link between a link source node and a link target node of the removed wavelength link; updating capacities of various links in the path; calculating a weight of a newly established virtual link, and adding the newly established virtual link and the corresponding weight to the topology set graph; and planning a path from a service source node to a service target node in an i+1th service in the topology set graph, until all services are finished.