Heterogeneous Multi-Domain Path Computation via ERO Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current path computation methods in multi-domain networks are limited by the need for homogeneous domain characteristics, leading to potential path invalidation and increased latency due to resource allocation delays, especially when dealing with heterogeneous domains using different addressing schemes and protocols.

Innovation Solution

The method involves using a Path Computation Element (PCE) to request and receive an Explicit Route Object (ERO) with unparsed domain-specific path segments, treating them as single, non-parsed objects, and temporarily reserving resources to establish paths across heterogeneous domains, allowing domains with different addressing schemes to participate in path computation without requiring interpretation of each other's formats.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If topology abstraction is used to compute paths across multiple domains, then scalability of the routing protocol is improved, but loss of accuracy in path computation occurs

Engineering Contradiction:
Improverouting protocol scalabilityVSAvoidpath computation accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The patent divides the multi-domain path computation into segments, with each domain maintaining its own topology information locally. The path is computed by chaining together domain-specific path segments rather than using a single abstracted view. This segmentation allows each domain to contribute accurate local path information while maintaining overall scalability.

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If a separate PCE is used for each domain with a higher-level PCE coordinating them, then path accuracy across domains is improved, but device complexity increases

Engineering Contradiction:
Improvecross-domain path accuracyVSAvoidPCE system complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent introduces an Explicit Route Object (ERO) as an intermediary data structure that carries domain-specific path segment information between PCEs. The ERO allows each PCE to contribute its local path segment without requiring complex coordination protocols, simplifying the overall system while maintaining accuracy.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Reliability

If the Explicit Route Object is designed to hold route hops with consistent addressing schemes, then loop detection capability is improved, but adaptability to heterogeneous domains with different addressing schemes deteriorates

Engineering Contradiction:
Improveloop detection capabilityVSAvoidheterogeneous domain compatibility
Core Design Contradiction:
ReliabilityVSAdaptability or versatility

Solution Approach 1:

The patent allows different segments of the ERO to have different addressing schemes appropriate to each domain. Each domain-specific path segment maintains its local addressing format, enabling loop detection within that domain while allowing heterogeneous domains to be chained together. The system accepts that addressing formats vary by domain but maintains reliability through domain-local validation.

Inventive Principle:
Principle #3Local quality

4Speed

If resources are allocated along the returned ERO path, then connection setup speed is improved, but the likelihood of path invalidation due to resource allocation to other connections increases

Engineering Contradiction:
Improveconnection setup speedVSAvoidpath validity
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent performs preliminary resource reservation along the computed path before final connection establishment. By reserving resources in advance based on the computed ERO path, the system ensures path validity while maintaining setup speed. The preliminary action of resource reservation prevents subsequent path invalidation while the connection is being established.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS8531969B2Path computation systems and methods for heterogeneous multi-domain networks
Publication Date: 2013.09.10 CIENA CORP
  • US8531969B2 patent drawing
  • US8531969B2 patent drawing
  • US8531969B2 patent drawing

AI summary

The present disclosure provides path computation systems and methods operating over heterogeneous multi-domain networks. Specifically, path computation systems and methods utilize PCE mechanisms with additional functionality enabling heterogeneous domain characteristics. In an exemplary embodiment, a network includes a plurality of domains with each domain having a PCE implemented either as a separate server-based application or resident application in a network node. Different methods may be utilized for determining what PCE to access for information. Instead of a list of nodes and links given in a common format, each PCE can compute a path within its domain using a node and link address/identification format of its own, without having to ensure that it can be interpreted by nodes in other domains. This path segment can be further distinguished by a path identifier that verifies that it is created for a particular domain, and avoiding misinterpretation.