Tuple-Based Stateful Explicit Paths for Reliable IP Routing

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing communication technologies in IP networks lack efficient methods to support stateful explicit paths, which are crucial for ensuring reliable and resource-efficient packet routing, particularly in scenarios requiring strict Quality of Service (QoS) or Service Level Agreements (SLAs).

Innovation Solution

Implementing a system where packets are routed along a path identified by a unique tuple including the first and second IP addresses and a path identifier, with state information mapping the tuple to the next hop, allowing nodes to maintain and manage path states for resource reservation and error handling.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If stateful explicit paths are implemented with state information mapping tuples to next hops, then packet delivery reliability is improved, but device complexity increases

Engineering Contradiction:
Improvepacket delivery reliabilityVSAvoidnode state management complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The path identification is segmented into tuples containing source IP address, destination IP address, and path identifier. This segmentation allows nodes to manage state information in a structured manner, mapping each tuple to its corresponding next hop, thereby improving reliability without overwhelming complexity

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

State information is pre-established at nodes through path setup messages that define the complete path before packet transmission. This preliminary action ensures that when packets arrive, the next hop is already determined, improving delivery reliability while keeping runtime complexity low

Inventive Principle:
Principle #10Preliminary action

2Reliability

If path states are dynamically managed for resource reservation, then Quality of Service is improved, but loss of time increases

Engineering Contradiction:
ImproveQuality of ServiceVSAvoidpath setup time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

Resource reservation and path state management are performed in advance through path setup messages exchanged between nodes before actual packet transmission. This ensures QoS requirements are met while minimizing time loss during data packet forwarding, as the path is pre-established

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The path setup and resource reservation processes are extracted as separate preliminary operations from the main packet forwarding path. This allows QoS to be configured independently without impacting real-time packet transmission performance

Inventive Principle:
Principle #2Taking out (Extraction)

3Measurement precision

If unique path identifiers are assigned to paths, then path identification precision is improved, but loss of information increases

Engineering Contradiction:
Improvepath identification precisionVSAvoidpacket header overhead
Core Design Contradiction:
Measurement precisionVSLoss of information

Solution Approach 1:

The path identifier is nested within a tuple structure that also includes source and destination IP addresses. This nested organization allows precise path identification while efficiently packaging the information, minimizing the overall header overhead compared to separate fields

Inventive Principle:
Principle #7Nested doll (Nesting)

Data Source

PatentUS12418479B2Supporting stateful explicit paths
Publication Date: 2025.09.16 NOKIA SOLUTIONS & NETWORKS OY
  • US12418479B2 patent drawing
  • US12418479B2 patent drawing
  • US12418479B2 patent drawing

AI summary

Various example embodiments for supporting stateful explicit paths are presented herein. Various example embodiments for supporting stateful explicit paths may be configured to support communication of a packet along a path in an Internet Protocol (IP) network from a first node to a second node, wherein the path includes a set of hops, wherein the packet includes a tuple configured to identify the path, wherein the tuple includes a first IP address of the first node, a second IP address of the second node, and a path identifier of the path, wherein the path identifier of the path is a unique identifier assigned to the path, wherein the communication of the packet along the path from the first node to the second node is supported based on state information configured to map the tuple to a next hop in the set of hops of the path.