Segment Routing Path Lists for Forked and Loop Data Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data forwarding technologies in future networks, such as those based on multicast distribution tree (MDT), require frequent configuration and updates at each node, leading to weak performance and limited scalability, and do not support loop transmission necessary for data processing.
Innovation Solution
The method involves generating module block information (MBI) and fork indications (FIs) by a control plane function, arranging them into an ordered list based on module involvement, and sending this list to service controllers for SR-based data forwarding and processing, enabling flexible and dynamic data forwarding and processing configurations without pre-configuration.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multicast distribution tree (MDT) is used for data forwarding, then data can be distributed to multiple paths, but frequent configuration and updates are required at each node leading to weak performance
Solution Approach 1:
The patent segments the data forwarding path into discrete segments with segment identifiers (SIDs). Each segment represents a specific network element or link, allowing the path to be divided into manageable parts. This segmentation enables flexible data forwarding without requiring frequent reconfiguration at each node, as segments can be independently managed and assembled.
Solution Approach 2:
The patent implements preliminary action by pre-establishing segment routing policies and path information in the control plane. The ordered list of segments and their corresponding SIDs is prepared in advance, allowing data planes to forward packets efficiently without real-time configuration updates. This pre-configuration approach maintains adaptability while improving forwarding performance.
2Reliability
If existing data forwarding technologies are used, then loop-free transmission is maintained, but loop transmission capability is lost which is needed for data processing
Solution Approach 1:
The patent introduces dynamic path selection through segment routing, where the data path can be dynamically adjusted based on processing requirements. The ordered list of segments allows the network to dynamically switch between different paths, including loops, when data processing operations require them. This dynamic capability maintains transmission reliability while enabling flexible data processing configurations.
3Adaptability or versatility
If frequent configuration updates are performed at each node, then data forwarding can adapt to network changes, but network performance deteriorates due to overhead
Solution Approach 1:
The patent extracts the configuration management function from the data plane and places it in the control plane. The control plane generates and manages the ordered list of segments and their SIDs, while the data plane simply forwards packets based on the segment list. This extraction eliminates the need for frequent configuration updates at data plane nodes, reducing overhead while maintaining network adaptability through control plane policies.
4Device complexity
If traditional data forwarding methods are used, then simple forwarding is maintained, but scalability for data processing configurations is limited
Solution Approach 1:
The patent implements universality by designing a segment routing framework that can handle multiple functions through a single mechanism. The same ordered list of segments with SIDs supports both simple data forwarding and complex data processing configurations, including forked paths and multiple data planes. This multi-functional approach enables scalable processing configurations without increasing forwarding complexity.
Data Source
AI summary
The disclosure provides for systems and methods for SR-based data forwarding and data processing. According to an aspect a method is provided. The method includes generating a plurality of module block information (MBI) and one or more fork indications (FIs). Each MBI corresponds to a module of a plurality of modules involved in a mission. Each FI indicates a forked module of the plurality of modules, where each forked module splits a data path into multiple forked paths. The method may further include arranging the plurality of MBIs and the one or more FIs into an ordered list based on an order of involvement of the plurality of modules in the mission. The method may further include sending to one or more service controllers, the ordered list.