Segment Routing Forwarding Adjacencies for Faster Path Setup

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing packet forwarding mechanisms, such as MPLS and IP routing, face inefficiencies due to complex decision-making processes that can limit network performance, particularly in networks employing LDP and SR nodes.

Innovation Solution

Implement segment routing (SR) to utilize SR forwarding tables and segment IDs for packet forwarding, eliminating the need for LDP in the control plane and enabling faster, simpler forwarding engines by making decisions based on segment IDs rather than LDP distributed labels.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If MPLS with LDP is used for packet forwarding, then packet forwarding can be achieved through label distribution, but the decision-making process becomes complex and limits network performance

Engineering Contradiction:
Improvepacket forwarding speedVSAvoidforwarding decision complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent segments the forwarding decision process by introducing segment IDs that represent specific path segments or hops. Instead of complex LDP label distribution and decision-making, each node forwards packets based on simple segment ID matching. The segment ID acts as a segmented identifier that guides packets through predetermined path segments, simplifying the forwarding decision at each node while maintaining controlled path routing.

Inventive Principle:
Principle #1Segmentation

2Speed

If LDP distributed labels are used for forwarding decisions, then packet forwarding can be achieved, but the forwarding engine complexity increases and speed decreases

Engineering Contradiction:
Improveforwarding decision speedVSAvoidforwarding engine complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The patent extracts the complex LDP label distribution mechanism from the forwarding decision process. Instead of relying on LDP-distributed labels that require complex matching and decision logic, the invention uses simplified segment IDs that are locally significant and can be directly matched against forwarding tables. This extraction of the label distribution complexity allows for faster, simpler forwarding engines that only need to perform segment ID lookup and forwarding.

Inventive Principle:
Principle #2Taking out (Extraction)

3Productivity

If segment routing is implemented to simplify forwarding decisions, then forwarding speed improves, but compatibility with existing LDP-based networks may be compromised

Engineering Contradiction:
Improveforwarding throughputVSAvoidnetwork protocol compatibility
Core Design Contradiction:
ProductivityVSAdaptability or versatility

Solution Approach 1:

The patent implements segment routing with multi-functionality to ensure compatibility across different network domains. Segment IDs are designed to be universally applicable, allowing them to work in both SR-enabled domains and traditional LDP domains. The segment ID can represent various routing objectives (shortest path, explicit paths, policy-based routing) and can be translated or mapped when crossing domain boundaries, maintaining adaptability while enabling simplified forwarding within SR domains.

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

Data Source

PatentUS12598136B2Segment routing: PCE driven dynamic setup of forwarding adjacencies and explicit path
Publication Date: 2026.04.07 CISCO TECHNOLOGY INC
  • US12598136B2 patent drawing
  • US12598136B2 patent drawing
  • US12598136B2 patent drawing

AI summary

An apparatus and method for path creation element driven dynamic setup of forwarding adjacencies and explicit path. In one embodiment of the method, a node receives an instruction to create a tunnel between the node and another node. The node creates or initiates the creation of the tunnel in response to receiving the instruction, wherein the tunnel comprises a plurality of nodes in data communication between the node and the other node. The node maps a first identifier (ID) to information relating to the tunnel. The node advertises the first ID to other nodes in a network of nodes.