Bidirectional Path Computation With Automated Liveness Checking

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional path computation protocols lack automated mechanisms for computing both forward and reverse paths, leading to manual configuration errors and inefficiencies, especially across administrative boundaries, and do not provide automated liveness checking for computed paths.

Innovation Solution

A system and method for automatically computing forward and reverse paths between nodes in a network, incorporating an intent to check liveness using protocols like BFD and S-BFD, with data objects carrying PST TLV information to manage path types and liveness checking, and utilizing PCEP for coordination.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If manual path configuration is used for reverse paths, then path setup can be performed, but it is time consuming and prone to errors

Engineering Contradiction:
Improvepath configuration accuracyVSAvoidpath configuration time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system enables self-service by allowing the network infrastructure to automatically compute and configure reverse paths without human intervention. The PCE receives a forward path request and autonomously computes the corresponding reverse path, eliminating the need for manual configuration and reducing both time and error rates.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The invention applies preliminary action by computing the reverse path simultaneously with the forward path during the initial path setup phase. Instead of manually configuring the reverse path after the forward path is established, the system proactively computes both paths in advance, saving time and ensuring accuracy from the outset.

Inventive Principle:
Principle #10Preliminary action

2Ease of manufacture

If manual path configuration is used, then paths can be set up, but the process is complex and error-prone when crossing administrative boundaries

Engineering Contradiction:
Improvepath configuration simplicityVSAvoidpath computation system complexity
Core Design Contradiction:
Ease of manufactureVSDevice complexity

Solution Approach 1:

The PCE is designed as a universal computing entity that handles path computation for both forward and reverse directions across multiple administrative domains. This multi-functional approach simplifies the overall system by consolidating path computation capabilities in a single intelligent component that can manage complex cross-domain scenarios without requiring separate manual configuration processes.

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

3Productivity

If automated reverse path computation is implemented, then configuration time is reduced, but protocol complexity increases

Engineering Contradiction:
Improvepath computation efficiencyVSAvoidprotocol complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The invention merges the forward path and reverse path computation processes into a single unified operation. By combining these two separate configuration tasks into one automated workflow initiated by a forward path request, the system improves productivity while managing protocol complexity through consolidation rather than multiplication of procedures.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS12634222B2Computing forward and reverse paths and checking the liveness thereof
Publication Date: 2026.05.19 CIENA CORP
  • US12634222B2 patent drawing
  • US12634222B2 patent drawing
  • US12634222B2 patent drawing

AI summary

Systems and methods for computing forward and reverse paths and checking the liveness, keep-alive status, or continuity of the forward and reverse paths are provided. A method (90), according to one implementation, includes the step of creating (92) one or more messages related to a computation of a forward path from a head-end node (12, 32) to a tail-end node (14, 34) and a computation of a reverse path from the tail-end node (14, 34) to the head-end node (12, 32). The method (0) also includes the step of adding (94) a data object to the one or more messages, the data object including an intent to check the liveness of the forward path and reverse path.