PCE Discovery via Data Plane Metrics

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods for path computation in communication networks require static configuration or complex PCE discovery protocols, limiting flexibility and scalability, especially in multi-domain networks, as they do not allow for dynamic adjustment to changes in PCE locations or efficient load balancing across multiple PCEs.

Innovation Solution

The system identifies border nodes between domains and deploys path computation elements (PCEs) at these nodes, allowing for dynamic selection based on load balancing criteria without the need for static configuration or advertisement, using existing data plane topology and metrics for control plane PCE selection.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If static configuration is used for PCE selection, then network management is simplified, but flexibility and load balancing capability are reduced

Engineering Contradiction:
Improvenetwork managementVSAvoidflexibility
Core Design Contradiction:
Ease of operationVSAdaptability or versatility

Solution Approach 1:

The system enables source nodes to autonomously discover and select PCEs using data plane routing information without requiring manual configuration or complex discovery protocols. The source node independently determines PCE locations by analyzing existing data plane path information, eliminating the need for centralized management while maintaining simplicity.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The invention repurposes existing data plane routing information and path computation request routing mechanisms to simultaneously serve control plane PCE discovery and selection functions. The same data plane infrastructure that handles traffic routing is also used to convey PCE location information, eliminating the need for separate discovery protocols.

Inventive Principle:
Principle #6Universality (Multi-functionality)

2Adaptability or versatility

If PCE discovery by advertisement is used, then dynamic PCE selection is enabled, but control plane overhead and system complexity increase

Engineering Contradiction:
Improvedynamic selectionVSAvoidcontrol plane overhead
Core Design Contradiction:
Adaptability or versatilityVSLoss of energy

Solution Approach 1:

The system uses existing data plane routing information and path computation request routing mechanisms to simultaneously serve control plane PCE discovery and selection functions. The same data plane infrastructure that handles traffic routing is also used to convey PCE location information, eliminating the need for separate discovery protocols.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The invention extracts PCE location information from existing data plane routing paths without requiring additional advertisement messages. By analyzing the existing data plane topology and routing information already present in the network, the system retrieves PCE locations without adding separate discovery overhead.

Inventive Principle:
Principle #2Taking out (Extraction)

3Adaptability or versatility

If PCE discovery protocol is implemented, then PCE locations are discovered dynamically, but additional control plane traffic and complexity are introduced

Engineering Contradiction:
Improvedynamic discoveryVSAvoidsoftware complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The system uses existing data plane routing information and path computation request routing mechanisms to simultaneously serve control plane PCE discovery and selection functions. The same data plane infrastructure that handles traffic routing is also used to convey PCE location information, eliminating the need for separate discovery protocols.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The system enables source nodes to autonomously discover and select PCEs using data plane routing information without requiring manual configuration or complex discovery protocols. The source node independently determines PCE locations by analyzing existing data plane path information, eliminating the need for centralized management while maintaining simplicity.

Inventive Principle:
Principle #25Self-service

4Ease of operation

If source node manually selects PCE, then selection control is maintained, but load balancing across multiple PCEs is limited

Engineering Contradiction:
Improveselection controlVSAvoidload balancing efficiency
Core Design Contradiction:
Ease of operationVSProductivity

Solution Approach 1:

The system implements load balancing by having source nodes select PCEs based on real-time criteria such as minimum cost path computation. The source node evaluates multiple PCEs and selects the one that provides the optimal path, dynamically adjusting selection based on network conditions and PCE workload implications.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The invention changes the selection parameter from static manual choice to dynamic cost-based selection. Source nodes compute the cost to reach different PCEs and select the PCE with the minimum cost, enabling automatic load balancing across multiple PCEs based on current network topology and conditions.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS9071532B2Method for discovery and load balancing of path computation elements based on transport plane link metrics
Publication Date: 2015.06.30 CIENA CORP
  • US9071532B2 patent drawing
  • US9071532B2 patent drawing
  • US9071532B2 patent drawing

AI summary

A method and system for path computation in a communications network having multiple domains are disclosed. According to one aspect, a method of path computation across multiple domains includes identifying a plurality of border nodes at borders of a plurality of domains, each domain having at least one border node. The method includes providing a path computation element at each of the plurality of border nodes of the domains of the network. The locations of the path computation elements are known to be at the border nodes prior to determining a path in response to a path computation request.