Decentralized cluster load balancing method, system, mobile terminal and storage medium
A cluster load balancing and decentralization technology, applied in the field of information processing, can solve problems such as load balancing efficiency limitations and mobile terminal performance bottlenecks, and achieve the effects of preventing load balancing efficiency from being limited, improving load balancing efficiency, and ensuring processing efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0052] Seefigure 1 It is a flowchart for decentralized cluster load balancing methods provided by the first embodiment of the present invention, including steps:
[0053] Step S10, build a cluster environment, and build a hash ring in the cluster environment;
[0054] Among them, there are multiple service nodes on the hash ring, and each service node corresponds to a server. The hash ring maintains the routing table of each service node. Each service node contains node addresses, node identifications , Corresponding front -drive nodes, corresponding successor nodes, and routing tables.
[0055] Specifically, when the hash ring is established in this step, it mainly includes:
[0056] (1) Create the first node and take the first link to generate the hash ring;
[0057] (2) Create other nodes and join the hash ring one by one. At the specified node n 0 Add new node n k Essence The joining process is to use the existing node N 0 The routing table is a new node n k Find a successor N...
Embodiment 2
[0066] See figure 2 It is a flowchart for decentralized cluster load balancing methods provided by the second embodiment of the present invention, including steps:
[0067] Step S11, build a cluster environment, and build a hash ring in the cluster environment;
[0068] Among them, there are multiple service nodes on the hash ring, and each service node corresponds to a server;
[0069] Step S21, initialize the routing table of each service node on the hash ring;
[0070] Among them, the initialization design of the route table is performed to achieve the effect of updating the front -drive nodes and successor nodes corresponding to each service node;
[0071] Step S31, obtain the system and hardware information of each service node corresponding to each service node, and calculate the load index according to the system and hardware information;
[0072] Among them, the calculation formula used by calculating the load index based on the system and the hardware information calculat...
Embodiment 3
[0110] See Figure 4 It is the structural schematic diagram of the decentralized cluster load balancing system 100 provided by the third embodiment of the present invention, including: environmental construction module 10, initialization module 11, load comparative module 12, and request distribution module 13, of which:
[0111] Environmental Construction Module 10 is used to build a cluster environment and build a hash ring in the cluster environment. There are multiple service nodes on the hash ring. Each service node corresponds to one server;
[0112] Initialization module 11 is used to initialize the routing table of each service node on the hash ring.
[0113] Among them, the initialization module 11 is also used to update the front -drive nodes and successor nodes corresponding to each service node corresponding to each service node.
[0114] The load comparative module 12 is used to continuously obtain the load status of each service node according to the preset interval, ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com