Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A data routing method, comprising: receiving, by a traffic classifier, a data packet of a first data flow; allocating, by the traffic classifier, a first data route identifier to the first data flow, wherein the first data route identifier is used to identify a service function chain of the first data flow and is used to identify the first data flow; adding, by the traffic classifier, the first data route identifier to the data packet; determining, by the traffic classifier, a second data route identifier of a second data flow, wherein the second data flow is a data flow in a direction opposite to the first data flow, and the second data route identifier is used to identify a service function chain of the second data flow and is used to identify the second data flow; and adding, by the traffic classifier, indication information to the data packet, wherein the indication information is used to indicate the second data route identifier; and sending, by the traffic classifier, the data packet to a service function forwarding device, wherein the determining, by the traffic classifier, a second data route identifier of a second data flow comprises: determining, by the traffic classifier, a second service function chain identifier of the second data flow, and allocating the second data route identifier to the second data flow according to the second service function chain identifier, wherein the second service function chain identifier is used to identify the service function chain of the second data flow; or determining, by the traffic classifier, the second data route identifier according to a correspondence between the second data flow and the second data route identifier, wherein the second data route identifier is allocated when the traffic classifier receives the second data flow.
This invention relates to data routing in network systems, specifically for managing bidirectional data flows through service function chains. The problem addressed is efficiently routing packets in both directions of a communication while ensuring proper service function processing. The method involves a traffic classifier that processes data packets of a first data flow. The classifier allocates a first data route identifier to the first data flow, which identifies both the service function chain and the flow itself. This identifier is added to the packet. The classifier also determines a second data route identifier for a second data flow in the opposite direction. This second identifier is either allocated based on a service function chain identifier for the second flow or retrieved from a pre-established correspondence between the second flow and its identifier. The classifier adds indication information to the packet to signal the second identifier and forwards the packet to a service function forwarding device. This approach ensures bidirectional flows are correctly processed through their respective service chains while maintaining flow identification and routing efficiency. The method simplifies management of reverse traffic by dynamically associating identifiers with flows based on service chain requirements or preconfigured mappings.
2. The method according to claim 1 , wherein the data packet comprises a first service function chain identifier of the first data flow, the first service function chain identifier is used to identify the service function chain of the first data flow, and the allocating, by the traffic classifier, a first data route identifier to the first data flow comprises: allocating, by the traffic classifier, the first data route identifier to the first data flow according to the first service function chain identifier.
This invention relates to network traffic management, specifically methods for classifying and routing data flows through service function chains in a network. The problem addressed is efficiently directing data packets through a sequence of service functions, such as firewalls, load balancers, or deep packet inspection systems, based on predefined service function chains. The method involves a traffic classifier that processes data packets from a first data flow. Each data packet includes a first service function chain identifier, which specifies the sequence of service functions the packet must traverse. The traffic classifier uses this identifier to allocate a first data route identifier to the data flow. This identifier determines the specific path the data flow will take through the network, ensuring packets follow the correct sequence of service functions as defined by the service function chain. The traffic classifier dynamically assigns the data route identifier based on the service function chain identifier, enabling flexible and scalable routing of data flows. This approach ensures that packets are processed in the correct order and by the appropriate service functions, improving network efficiency and security. The method supports dynamic updates to service function chains, allowing for real-time adjustments to network traffic management.
3. The method according to claim 1 , wherein the allocating, by the traffic classifier, a first data route identifier to the first data flow comprises: allocating, by the traffic classifier, the first data route identifier to the first data flow according to a correspondence between the first data flow and the first data route identifier, wherein the correspondence between the first data flow and the first data route identifier is sent by a control plane device to the traffic classifier.
In the field of network traffic management, this invention addresses the challenge of efficiently classifying and routing data flows in a network. The method involves a traffic classifier that assigns a data route identifier to a data flow based on a predefined correspondence between the data flow and the identifier. This correspondence is dynamically provided by a control plane device, which manages the routing decisions centrally. The traffic classifier uses this correspondence to determine the appropriate route for the data flow, ensuring optimized traffic distribution and reduced processing overhead. The control plane device maintains and updates the correspondence rules, allowing for flexible and scalable traffic management. This approach enhances network performance by enabling dynamic routing adjustments without requiring manual configuration changes. The system ensures that data flows are directed through the most efficient paths, improving latency and throughput while maintaining network reliability. The invention is particularly useful in high-traffic environments where real-time routing decisions are critical.
4. A data routing apparatus, comprising: a network interface configured to receive a data packet of a first data flow; and a processor configured to: allocate a first data route identifier to the first data flow, wherein the first data route identifier is used to identify a service function chain of the first data flow and is used to identify the first data flow; and add the first data route identifier to the data packet; determine a second data route identifier of a second data flow, wherein the second data flow is a data flow in a direction opposite to the first data flow, and the second data route identifier is used to identify a service function chain of the second data flow and is used to identify the second data flow; and add indication information to the data packet, wherein the indication information is used to indicate the second data route identifier, wherein the network interface is further configured to send the data packet to a service function forwarding device, wherein: the processor is configured to: determine a second service function chain identifier of the second data flow, and allocate the second data route identifier to the second data flow according to the second service function chain identifier, wherein the second service function chain identifier is used to identify the service function chain of the second data flow; or the processor is configured to determine the second data route identifier according to a correspondence between the second data flow and the second data route identifier, wherein the second data route identifier is allocated when the traffic classifier receives the second data flow.
The invention relates to data routing in network systems, specifically for managing bidirectional data flows through service function chains. The problem addressed is efficiently routing data packets in opposite directions while maintaining association with their respective service function chains. The apparatus includes a network interface to receive data packets and a processor to handle routing decisions. For a first data flow, the processor allocates a first data route identifier that uniquely identifies both the flow and its service function chain, then adds this identifier to the packet. For the opposite-direction second data flow, the processor determines a second data route identifier, which can be derived either by mapping the flow to a preallocated identifier or by generating it based on the second flow's service function chain identifier. The processor then adds indication information to the first packet to signal the second identifier. The packet is then forwarded to a service function forwarding device. This ensures bidirectional flows are correctly routed through their respective service function chains while maintaining flow identification. The solution improves network efficiency by dynamically associating flows with their service chains and enabling bidirectional routing without redundant processing.
5. The apparatus according to claim 4 , wherein the data packet comprises a first service function chain identifier of the first data flow, the first service function chain identifier is used to identify the service function chain of the first data flow, and the processor is configured to allocate the first data route identifier to the first data flow according to the first service function chain identifier.
This invention relates to network traffic management, specifically systems for processing data flows through service function chains (SFCs) in a network. The problem addressed is efficiently routing data packets through predefined sequences of service functions, such as firewalls, load balancers, or deep packet inspection systems, while ensuring proper identification and tracking of each data flow. The apparatus includes a processor and a memory storing instructions for managing data flows. A data packet belonging to a first data flow contains a first service function chain identifier (SFC ID) that specifies the required sequence of service functions for that flow. The processor uses this SFC ID to allocate a unique data route identifier (DRI) to the first data flow, enabling the network to correctly route the packet through the designated service functions in the specified order. This ensures that each data flow follows its intended SFC without manual configuration, improving scalability and reducing errors in service function chaining. The system may also handle multiple data flows, each with distinct SFC IDs and corresponding DRIs, allowing dynamic and flexible traffic management. The apparatus ensures that data packets are processed according to their assigned SFCs, enhancing network security, performance, and service delivery. The invention automates the routing process, reducing administrative overhead and improving efficiency in network service function deployment.
6. The apparatus according to claim 4 , wherein the processor is configured to allocate the first data route identifier to the first data flow according to a correspondence between the first data flow and the first data route identifier, wherein the correspondence between the first data flow and the first data route identifier is sent by a control plane device to the apparatus.
This invention relates to network routing systems, specifically improving data flow management in packet-switched networks. The problem addressed is efficiently assigning data route identifiers to data flows to optimize network performance and reduce processing overhead. Traditional systems often rely on static or inefficient dynamic routing, leading to suboptimal path selection and increased latency. The apparatus includes a processor that allocates a first data route identifier to a first data flow based on a predefined correspondence between the data flow and the identifier. This correspondence is dynamically provided by a control plane device, which centrally manages routing decisions. The control plane device determines the optimal route for each data flow and communicates the appropriate data route identifier to the apparatus. This ensures that data packets are forwarded along the most efficient paths, reducing congestion and improving throughput. The processor's allocation function is part of a broader system where the control plane device maintains real-time network state information, such as link availability, bandwidth, and latency. By dynamically updating the correspondence between data flows and route identifiers, the system adapts to changing network conditions, ensuring consistent performance. The apparatus may also handle multiple data flows simultaneously, each assigned a unique identifier to maintain separation and prioritization. This approach enhances scalability and flexibility in network routing, particularly in large-scale or dynamic environments where static configurations are impractical. The use of a centralized control plane simplifies management while improving efficiency in data forwarding decisions.
Unknown
May 19, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.