Service Node Load Balancing via Time-Dependent Flow Entries
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication technologies lack an efficient and flexible method for implementing service node load balancing, leading to inefficiencies in routing service flows across multiple service nodes with varying loads over time.
Innovation Solution
A route determining method that receives flow entries with load proportions and effective time periods for service nodes, allowing for timely adjustments in routing policies by determining service nodes based on packet timestamps and load balancing factors, enabling flexible and efficient load balancing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If a new flow entry is generated when service node load status changes, then routing policy adjustment timeliness is improved, but system complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-defining multiple flow entries with different effective time periods and load proportions before actual packet forwarding. When load status changes, the system activates a pre-configured flow entry rather than creating a new one, achieving timely routing policy adjustment while avoiding the complexity of dynamic flow entry generation and management.
2Productivity
If flow entries are generated for service types rather than individual flows, then system overhead is reduced, but routing flexibility decreases
Solution Approach 1:
The patent applies dynamics by making flow entries time-dependent with different effective time periods and load proportions. A single service type can have multiple flow entries that become active at different times based on load conditions, achieving both reduced overhead (grouping by service type) and maintained flexibility (time-based activation of different routing policies).
Solution Approach 2:
The patent changes the parameter of flow entry activation from static (individual flow-based) to dynamic (time-period and load-proportion-based). By parameterizing flow entries with effective time periods and load proportions, the system reduces overhead by grouping packets of the same service type while maintaining flexibility through parameter-driven selection of appropriate flow entries.
3Adaptability or versatility
If multiple flow entries with different effective time periods are maintained, then load balancing flexibility is improved, but flow entry management complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-configuring multiple flow entries with different effective time periods and load proportions for the same service type. This allows the system to maintain high load balancing flexibility through pre-planned scenarios while reducing management complexity by avoiding runtime creation and modification of flow entries.
Solution Approach 2:
The patent applies self-service by enabling flow entries to automatically become active or inactive based on their effective time periods and load proportions without requiring manual intervention. The system self-manages the complexity of multiple flow entries through automated selection based on packet timestamps and predefined criteria.
Data Source
Figure 1
Figure 2A
Figure 2B~3
AI summary
The present invention discloses a route determining method, and a corresponding apparatus and system, so as to resolve a prior-art problem that it is difficult to implement service node load balancing efficiently and flexibly. The method includes: receiving a first flow entry, where the first flow entry includes a first route mapping relationship of a packet of a first type of service flow and a first load proportion of each service node; receiving a second flow entry, where the second flow entry includes a second route mapping relationship of the first type of service flow, a second load proportion of each service node, and a start time of the second flow entry; receiving a first packet of a first service flow; determining, according to a service chain identifier included in the first packet, that the first service flow is a first type of service flow; determining whether a time corresponding to a timestamp precedes the start time of the second flow entry; and if the time corresponding to the timestamp precedes the start time of the second flow entry, determining, according to the first flow entry, a service node for receiving the first packet; or if the time corresponding to the timestamp does not precede the start time of the second flow entry, determining, according to the second flow entry, a service node for receiving the first packet.