Multi-Domain Segment Routing Path Computation via SDN Controller

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In segment routing across multiple domains, existing path computation algorithms face complexity and inefficiency, especially when using anycast segment identifiers, leading to potential sub-optimal paths and increased calculation time in large networks.

Innovation Solution

A software-defined network (SDN) controller assigns segment identifiers to each domain and computes paths using a derived graph representation, reducing complexity and path size by advertising anycast domain segment identifiers through domain border routers, allowing for efficient routing across multiple domains.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional path computation algorithms are used in multi-domain segment routing, then routing accuracy can be maintained, but computation complexity and calculation time increase significantly

Engineering Contradiction:
Improverouting accuracyVSAvoidcomputation complexity
Core Design Contradiction:
Measurement precisionVSDevice complexity

Solution Approach 1:

The patent divides the multi-domain network into multiple individual domains, each with its own topology and segment identifiers. By segmenting the complex multi-domain routing problem into smaller single-domain problems, the computation complexity is reduced while maintaining routing accuracy through coordinated domain border routers

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Domain border routers act as intermediaries between adjacent domains, advertising anycast domain segment identifiers that simplify path computation. These intermediaries enable routers to compute paths without needing complete knowledge of the entire multi-domain topology, reducing computational burden

Inventive Principle:
Principle #24Intermediary (Mediator)

2Manufacturing precision

If detailed path information is maintained for all domains, then routing optimality can be achieved, but path representation size increases

Engineering Contradiction:
Improverouting optimalityVSAvoidpath representation size
Core Design Contradiction:
Manufacturing precisionVSQuantity of substance

Solution Approach 1:

Multiple domain border routers advertising the same domain are merged into a single anycast domain segment identifier. This consolidation reduces the number of path segments that need to be tracked and represented, decreasing path representation size while preserving routing optimality through the anycast mechanism

Inventive Principle:
Principle #5Merging (Combining)

3Adaptability or versatility

If anycast domain segment identifiers are advertised by all domain border routers, then routing flexibility and scalability improve, but information advertisement complexity increases

Engineering Contradiction:
Improverouting flexibilityVSAvoidinformation advertisement complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The anycast domain segment identifier serves multiple functions simultaneously: it enables flexible path computation, provides load balancing across domain border routers, and simplifies routing advertisements. This multi-functionality reduces the need for separate mechanisms, actually decreasing overall system complexity despite the enhanced capabilities

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

Data Source

PatentUS11483230B2Multiple domain segment routing path computation
Publication Date: 2022.10.25 CISCO TECHNOLOGY INC
  • US11483230B2 patent drawing
  • US11483230B2 patent drawing
  • US11483230B2 patent drawing

AI summary

Aspects described herein include a method for use with a software-defined network controller, as well as an associated computer program product and system. The method comprises assigning a segment identifier to an endpoint node within a destination domain of a plurality of domains. Adjacent domains of the plurality of domains are connected via a respective set of two or more domain border routers. The method further comprises assigning a respective segment identifier to each domain. Each domain border router advertises the segment identifiers of the respective two adjacent domains. The method further comprises, responsive to a request from a headend node within a source domain of the plurality of domains, computing a path from the headend node to the endpoint node. The path includes (i) the segment identifiers of any domains between the headend node and the endpoint node, and (ii) the segment identifier of the endpoint node.