Euler Path Server String for Uniform Load Distribution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing load balancing methods, such as Consistent Hashing, fail to completely uniform load distribution between servers, leading to potential large load deviations and increased memory usage, which can result in higher procurement costs and inefficient system construction.
Innovation Solution
A load balancing method that generates a server permutation combination, creates a permutation connection graph, extracts an Euler closed path, and forms a server string to distribute load evenly across servers with low memory usage, ensuring no load deviation between servers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If Consistent Hashing method is applied to load balancing, then load distribution is improved, but load uniformity is not completely achieved and large load deviation may occur
Solution Approach 1:
The patent divides the load distribution problem into two independent parts: (1) determining the distribution order of servers using Euler closed path extraction from permutation connection graphs, and (2) determining the distribution destination using consistent hashing. This segmentation allows each part to optimize independently, achieving both uniform load distribution and efficient implementation.
Solution Approach 2:
The patent pre-calculates and stores server permutation combinations and their corresponding Euler closed paths before actual load distribution occurs. By preparing the permutation connection graph and extracting Euler closed paths in advance, the system achieves uniform load distribution without real-time computational overhead, resolving the contradiction between distribution quality and implementation efficiency.
2Manufacturing precision
If slot group correspondence is suppressed to reduce load deviation, then load uniformity is improved, but memory usage increases
Solution Approach 1:
The patent extracts only the essential information needed for load distribution - the Euler closed path sequence of servers - and discards redundant slot group correspondence data. By taking out only the necessary server permutation sequence from the permutation connection graph, the system achieves uniform load distribution with minimal memory consumption, avoiding the need to store complete slot group mappings.
3Adaptability or versatility
If server resources are increased or decreased, then system adaptability is improved, but data movement increases network load
Solution Approach 1:
The patent implements a dynamic server permutation combination generation mechanism that automatically adapts to changes in server resources. When servers are added or removed, the system regenerates the permutation connection graph and extracts new Euler closed paths, dynamically updating the load distribution sequence without requiring data migration. This dynamic adaptation maintains load uniformity while avoiding network bandwidth consumption associated with data movement.
Data Source
AI summary
A server string management device (100) execute, a server string generation step S11 of generating a server permutation combination indicating a combination of servers in a predetermined constraint for a load balancing server, a permutation connection graph generation step S12 of generating a permutation connection graph in which the generated server permutation combination is connected as a node, a connection closed path extraction step S13 of extracting an Euler closed path passing through all the edges once with drawing a edge which passes a path connecting each node on the generated permutation connection graph, and a server string extraction step S14 of generating a server string in which servers at predetermined positions corresponding to each node are arranged along the generated Euler closed path.