Dynamic Server Mapping Function for Load Balancing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing server load balancing methods, such as hash-based schemes, fail to efficiently distribute client requests when the number of servers changes, leading to unnecessary remapping of client requests and increased bandwidth and computational resource consumption.
Innovation Solution
A method and system that uses a mapping function combining hashed unique client identifiers with state indicators for servers, allowing dynamic selection of active servers and maintaining consistency in request distribution across changing server states.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If hash-based load balancing schemes are used, then request distribution consistency is improved, but adaptability to server number changes deteriorates
Solution Approach 1:
The patent applies dynamics by making the load balancing mapping function adaptive to changing server configurations. The system dynamically updates the mapping function when servers are added or removed, allowing the hash-based consistency to work together with dynamic server population changes. This resolves the contradiction by enabling both request distribution consistency and adaptability to server number changes.
Solution Approach 2:
The patent changes the parameter of the mapping function based on server availability. When servers are added or removed, the mapping function parameters are updated to reflect the current server pool. This allows the system to maintain consistent request distribution while adapting to changing server numbers, resolving the technical contradiction between stability and adaptability.
2Adaptability or versatility
If dynamic server addition/removal is implemented, then system adaptability is improved, but unnecessary client remapping increases
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing mapping functions that account for different server configurations. When servers are added or removed, the system uses pre-computed mapping information to determine the new client-to-server assignments without requiring complete remapping of all clients. This reduces unnecessary client remapping while maintaining system adaptability.
Solution Approach 2:
The patent uses copying by creating a copy of the mapping function that reflects the current server configuration. Instead of completely remapping clients when servers change, the system copies the existing mapping function and adjusts it to accommodate the new server configuration, thereby reducing unnecessary client remapping operations while maintaining adaptability.
3Reliability
If complete client remapping occurs upon server failure, then server reliability is improved, but bandwidth consumption increases
Solution Approach 1:
The patent applies partial action by remapping only the necessary portion of clients when a server fails, rather than remapping all clients. The system calculates the minimal set of clients that need to be reassigned to accommodate the failed server, thereby reducing bandwidth consumption while maintaining server reliability. This resolves the contradiction between reliability and energy loss by avoiding excessive remapping actions.
Data Source
AI summary
According to embodiments described in the specification, a method, system and apparatus for connecting a plurality of client machines to a plurality of servers. Each of the servers has a unique server identifier. The method includes: receiving a request from one of the client machines; receiving a unique client identifier for the one of the client machines; selecting a unique server identifier from the plurality of unique server identifiers, based on a mapping function comprised of: the unique client identifier and a state indicator for each of the servers; and connecting the one of the client machines to one of the servers corresponding to the selected unique server identifier.