Load Balancing Apparatus Historical Association Packet Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing load balancing methods in cloud computing platforms, such as round robin scheduling, fail to meet the communication requirements of delay-sensitive services like multi-person network conferences or games, leading to increased communication delay and complexity.
Innovation Solution
A packet processing method where a load balancing apparatus selects a service instance based on historical association information to process data packets, considering load thresholds and preset scheduling policies, ensuring efficient resource allocation and reduced communication delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If round robin scheduling policy is used, then load balancing is achieved, but communication requirement of specific service cannot be met
Solution Approach 1:
The patent applies local quality by differentiating scheduling policies for different service types. Delay-sensitive services receive dedicated scheduling treatment while other services use standard load balancing, allowing each service to receive appropriate quality of service without compromising overall system load distribution.
Solution Approach 2:
The patent segments services into delay-sensitive and non-delay-sensitive categories, applying different scheduling strategies to each segment. This segmentation allows the system to prioritize critical services while maintaining efficient load balancing for other services.
2Adaptability or versatility
If random scheduling policy is used, then service scalability is maintained, but service communication delay increases
Solution Approach 1:
The patent implements dynamic scheduling by adjusting scheduling policies based on service characteristics and current system state. The load balancing device dynamically selects between different scheduling policies (round robin, least connections, weighted) depending on whether the service is delay-sensitive or not, and on the current load conditions of service instances.
Solution Approach 2:
The patent uses feedback mechanisms where the load balancing device monitors service instance performance and communication requirements, then adjusts scheduling decisions accordingly. The device receives service type information and uses this feedback to select appropriate scheduling policies, creating a closed-loop control system that optimizes both scalability and response time.
3Productivity
If multiple service instances are selected, then load distribution is improved, but service communication complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-establishing service instance sets for delay-sensitive services before actual service requests arrive. The load balancing device pre-selects and binds service instances to specific services based on their delay-sensitive characteristics, so when requests arrive, the routing decision is already determined, reducing communication complexity while maintaining load distribution.
Data Source
AI summary
A packet processing method includes: receiving, by a load balancing apparatus, a data packet sent by a UE; when the data packet includes historical association information, selecting, by the load balancing apparatus based on the historical association information, a service instance used to process the data packet; and sending, by the load balancing apparatus, the data packet to the selected service instance.