Hop-Aware Segment Identifiers for BGP VPN Option B Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current techniques for providing seamless segment routing paths fail to adhere to end-to-end constraints such as latency, delay variation, bandwidth, and network device inclusion/exclusion, leading to delayed traffic transmission and resource consumption.
Innovation Solution
Implementing segment identifiers (SIDs) that support end-to-end segment routing with color extended community and BGP VPN option B, allowing network devices to selectively modify advertisements based on hop distance and generate appropriate SIDs, ensuring adherence to end-to-end constraints.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If current techniques for providing seamless segment routing paths are used, then routing flexibility is improved, but end-to-end constraints such as latency, delay variation, bandwidth, and network device inclusion/exclusion are not adhered to, leading to delayed traffic transmission and resource consumption
Solution Approach 1:
The patent applies preliminary action by pre-calculating and pre-establishing segment routing paths that satisfy end-to-end constraints before traffic transmission occurs. The system determines valid segment routing paths in advance, storing them for later use, thereby avoiding real-time path computation delays and ensuring constraint compliance from the outset.
Solution Approach 2:
The patent applies segmentation by dividing the end-to-end routing path into multiple segments, each represented by a segment identifier (SID). These segments can be independently selected and combined to form complete paths that satisfy specific constraints. The segmentation allows flexible recombination of path segments while maintaining end-to-end constraint adherence.
2Adaptability or versatility
If current techniques for providing seamless segment routing paths are used, then routing flexibility is improved, but computing and networking resources are consumed due to delayed traffic transmission
Solution Approach 1:
The patent reduces computing resource consumption by performing path validation and segment selection in advance, before traffic arrives. The system pre-computes which segment combinations satisfy end-to-end constraints, storing these pre-validated paths for rapid deployment when traffic needs to be routed, thereby avoiding expensive real-time computations.
Solution Approach 2:
By segmenting the routing path into pre-defined SIDs, the system enables efficient path construction through simple segment combination rather than complex end-to-end path optimization. This segmentation reduces the computational complexity of finding valid paths while maintaining routing flexibility.
3Reliability
If segment identifiers are selectively modified based on hop distance, then adherence to end-to-end constraints is improved, but device complexity increases
Solution Approach 1:
The patent applies local quality by making the SID modification behavior dependent on the local condition of hop distance. Network devices selectively apply different SID types (one-hop vs. multi-hop) based on their specific situation - whether the next hop is one hop or multiple hops away. This localized adaptation ensures constraint adherence while keeping the complexity manageable through context-dependent simplification.
Data Source
AI summary
A first network device may receive an advertisement that includes a prefix for a second network device, wherein the advertisement is destined for a third network device. The first network device may determine, based on a network topology, whether a next hop is one hop away or multiple hops away. The first network device may selectively modify the advertisement to include a first segment identifier, based on the next hop being one hop away and to generate a first modified advertisement, or may modify the advertisement to include a second segment identifier, based on the next hop being multiple hops away and to generate a second modified advertisement. The first network device may forward the first modified advertisement or the second modified advertisement toward the third network device.