Load Balancer Using Queued Packet Information
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current load balancing systems lack an efficient method to distribute client requests across multiple servers based on real-time queue information, leading to suboptimal resource utilization and potential bottlenecks.
Innovation Solution
A system and method that utilize queued packet information to select the target host with the lowest number of queued packets, ensuring that packets are sent to the host that can process them most efficiently, employing virtual network interface cards (VNICs) and virtual network stacks to manage network traffic and resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional load balancing methods are used without real-time queue information, then the system structure remains simple, but resource utilization becomes suboptimal and bottlenecks occur
Solution Approach 1:
The patent implements preliminary action by having target hosts continuously monitor and report their queue lengths to the load balancer before new packets arrive. This advance knowledge allows the load balancer to make informed routing decisions, preventing bottlenecks before they occur and optimizing resource utilization across the network.
Solution Approach 2:
The patent employs feedback mechanisms where target hosts continuously report their packet queue status back to the load balancer. This real-time feedback loop enables the load balancer to dynamically adjust packet routing based on current system state, improving resource utilization while maintaining manageable system complexity through automated control.
2Loss of time
If packets are distributed without considering target host queue status, then the load balancing logic is simple, but response time increases due to bottlenecks
Solution Approach 1:
The load balancer receives real-time feedback about queue lengths from target hosts and uses this information to dynamically select the target with the shortest queue for each incoming packet. This feedback-driven approach minimizes response time by avoiding bottlenecks while keeping the load balancing logic relatively simple through rule-based selection.
Solution Approach 2:
The patent implements dynamic load balancing where the routing decision changes based on real-time queue conditions rather than using static distribution rules. This dynamic adaptation allows the system to respond to changing traffic patterns and host capacities, reducing response time without requiring overly complex predetermined logic.
3Productivity
If real-time queue information is collected and used for packet routing, then resource utilization improves, but the amount of information to be managed increases
Solution Approach 1:
The patent extracts only the essential information needed for load balancing decisions - specifically, the queue length at each target host. By focusing on this single critical metric and ignoring other potentially useful but unnecessary data, the system achieves improved resource utilization while keeping information volume and management complexity minimal.
Solution Approach 2:
The load balancer collects queue information locally from each target host and uses this localized data to make routing decisions. This local quality approach allows the system to manage information efficiently by processing only relevant local queue states rather than gathering and managing comprehensive global system information.
Data Source
AI summary
A computer readable medium including instructions executable by a processor to perform a method, the method including obtaining a packet by a load balancer, obtaining queued packet information for a plurality of target hosts operatively connected to the load balancer, selecting the one of the plurality of target hosts using the queued packet information, and sending the packet to the selected target host using a first communication channel between the load balancer and the selected target host.