Dynamic Path Computation for Telecommunications Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In telecommunications networks, when a service is requested for a future period, if no single path is available for the entire duration due to resource reservations by other services, users are informed that a path is not available, leading to service unavailability.

Innovation Solution

A method and apparatus for determining a plurality of paths, each available during a respective portion of the time period, ensuring at least one path is available for the service at any time, by utilizing a Path Computation Element (PCE) to compute and switch between multiple paths dynamically.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If a single path is reserved for the entire time period, then resource allocation is simple and management is easy, but service availability cannot be guaranteed when resources are reserved for other services

Engineering Contradiction:
Improveservice availabilityVSAvoidpath management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent segments the time period into multiple time segments and divides the service into multiple path segments, where each path segment serves a specific time segment. This allows the system to guarantee service availability by ensuring at least one path segment is available for each time segment, while avoiding the complexity of managing a single path for the entire period.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent implements dynamic path selection by determining multiple paths with different availability time periods and selecting appropriate paths based on current time and availability status. This dynamic approach ensures service continuity while allowing flexible resource allocation, resolving the contradiction between reliability and management complexity.

Inventive Principle:
Principle #15Dynamics

2Reliability

If multiple paths are determined for different time portions, then service continuity is guaranteed, but computational complexity and processing time increase

Engineering Contradiction:
Improveservice continuityVSAvoidpath computation time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent performs preliminary path computation by determining multiple paths and their availability time periods in advance, before service execution. This allows the system to have pre-computed path options ready, reducing real-time computation requirements and ensuring service continuity without excessive processing delays during actual service delivery.

Inventive Principle:
Principle #10Preliminary action

3Adaptability or versatility

If path availability is checked for the whole time period, then resource reservation is straightforward, but service scheduling flexibility is reduced when no single path is available

Engineering Contradiction:
Improveservice scheduling flexibilityVSAvoidpath availability management
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent applies local quality by determining path availability locally for each time segment rather than requiring a single path to be available for the entire time period. This allows different paths to have different availability characteristics for different time segments, providing scheduling flexibility while managing complexity through localized availability checks.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS11368406B2Methods and apparatus for path computation in a telecommunications network
Publication Date: 2022.06.21 WATER NOW INC
  • US11368406B2 patent drawing
  • US11368406B2 patent drawing
  • US11368406B2 patent drawing

AI summary

Apparatus and methods are provided for path computation for a service in a telecommunications network. In one aspect, a method comprises receiving a request to schedule the service utilizing the network in a time period determining that a path for the service is not available for the whole of the time period, and determining a plurality of paths for the service, each of the plurality of paths being available during a respective portion of the time period, such that at least one of the plurality of paths is available for the service at any time during the time period.