Atomic Function Forwarding for Dynamic SFC Traffic Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network messages and flow processing mechanisms are not applicable to computing networks due to the dynamic nature of computing power service functions, which are highly granular and correspond to multiple atomic function instances, unlike traditional layer-2 and layer-3 networks.
Innovation Solution
The method involves abstracting atomic functions into identifiers and using a forwarding table to determine corresponding instances, supporting dynamic multi-instance processing by routing service traffic based on service path identifiers and indexes, and maintaining a mapping relationship between atomic function identifiers and instances.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If service functions are bound to network L2/L3 addresses in traditional networks, then message and flow processing mechanisms work effectively, but the mechanism becomes incompatible with computing networks where service functions are highly dynamic and correspond to multiple atomic function instances
Solution Approach 1:
The patent segments service functions into atomic function instances, where each atomic function represents a minimal executable unit. This segmentation allows the service function to be divided into multiple independent instances that can be dynamically instantiated and managed, resolving the contradiction between adaptability to computing networks and management complexity by providing a granular, standardized unit of deployment
Solution Approach 2:
The patent creates a universal atomic function instance that can serve multiple purposes across different service function chains. The same atomic function instance can be invoked by multiple SFCs, and the SFC forwarding table maintains universal mapping relationships between service function identifiers and atomic function instances, enabling one instance to fulfill multiple roles and reducing overall system complexity while improving adaptability
2Productivity
If service traffic is routed to a currently optimal computing power node, then resource utilization is improved, but routing decision-making becomes more complex due to distributed computing power resources
Solution Approach 1:
The patent introduces the SFC forwarding table as an intermediary between service traffic and atomic function instances. The forwarding table pre-establishes mapping relationships between service function identifiers and atomic function instances, acting as a mediator that simplifies routing decisions. Instead of complex real-time optimization, the system uses the forwarding table to guide traffic to appropriate instances, balancing resource utilization with decision-making simplicity
Solution Approach 2:
The patent performs preliminary action by pre-establishing mapping relationships in the SFC forwarding table before service traffic arrives. The network function virtualization orchestrator pre-configures the forwarding tables with optimal routing information, so that when service traffic needs to be routed, the decision-making process is simplified to a table lookup rather than complex real-time optimization, maintaining high resource utilization while reducing operational complexity
3Adaptability or versatility
If service functions are highly dynamic and correspond to multiple atomic function instances, then flexibility and scalability are improved, but the binding to network addresses becomes invalid and processing mechanisms fail
Solution Approach 1:
The patent uses copying by creating multiple atomic function instances that are copies of the same service function logic. Instead of binding a single service function to a network address, the system creates interchangeable instances that can be deployed across different nodes. The SFC forwarding table maintains mappings to these instances, allowing the processing mechanism to remain reliable by redirecting traffic to valid instances even as the original bindings become invalid due to dynamics
Solution Approach 2:
The patent embraces dynamics by allowing atomic function instances to be dynamically instantiated, deployed, and terminated based on service requirements. The SFC forwarding table is dynamically updated to reflect changes in instance availability and status. This dynamic approach maintains reliability by ensuring that the forwarding table always contains valid, current mappings between service functions and available instances, even as the underlying infrastructure changes
Data Source
AI summary
Provided are a service traffic processing method and apparatus. The method includes: receiving service traffic of a service function chain (SFC) computing network; determining an atomic function identifier of the service traffic; determining, according to a pre-stored SFC forwarding table, a first atomic function instance corresponding to the atomic function identifier, wherein the SFC forwarding table comprises a mapping relationship between an atomic function identifier and a plurality of equivalent atomic function instances; and forwarding the service traffic to the first atomic function instance, wherein the first atomic function instance is used for processing the service traffic.