CN115150399A - Load balancing method, load balancing device, processing system and storage medium - Google Patents
Load balancing method, load balancing device, processing system and storage medium Download PDFInfo
- Publication number
- CN115150399A CN115150399A CN202210884361.1A CN202210884361A CN115150399A CN 115150399 A CN115150399 A CN 115150399A CN 202210884361 A CN202210884361 A CN 202210884361A CN 115150399 A CN115150399 A CN 115150399A
- Authority
- CN
- China
- Prior art keywords
- member server
- load balancing
- weight value
- access request
- node information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 238000004590 computer program Methods 0.000 claims description 16
- 238000012806 monitoring device Methods 0.000 claims description 9
- 230000008569 process Effects 0.000 claims description 7
- 230000004044 response Effects 0.000 description 5
- 238000001514 detection method Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
- H04L67/1004—Server selection for load balancing
- H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
Abstract
The application provides a load balancing method, which comprises the following steps: acquiring a weight value of each member server according to current node information of each member server, wherein the node information comprises the current service connection number of each member server; and distributing the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server. The application also provides a load balancing device, a processing system and a storage medium. The load balancing method, the load balancing device, the processing system and the storage medium can dynamically distribute the access request according to the current node information, so that the network throughput rate is improved.
Description
Technical Field
The present application relates to the field of information processing technologies, and in particular, to a load balancing method, a load balancing apparatus, a processing system, and a storage medium.
Background
With the development of network technology and the rise of people's level, the network access demand is explosively increased.
In order to achieve load balancing of network traffic and avoid occurrence of network congestion, task allocation is usually performed in a random or sequential polling manner in the prior art, but an existing allocation method cannot allocate an access request according to current node information and cannot meet increasing network access requirements.
The foregoing description is provided for general background information and is not admitted to be prior art.
Disclosure of Invention
In view of the foregoing technical problems, the present application provides a load balancing method, a load balancing apparatus, a processing system, and a storage medium, which can dynamically allocate an access request according to current node information, thereby improving network throughput.
To solve the above technical problem, the present application provides a load balancing method, including: acquiring a weight value of each member server according to current node information of each member server, wherein the node information comprises the current service connection number of each member server; and distributing the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server.
In one embodiment, the step of obtaining the weight value of each member server according to the current node information of each member server includes: and when the current service connection number of the first member server is zero, setting the weight value of the first member server to be zero.
In one embodiment, the step of obtaining the weight value of each member server according to the current node information of each member server includes: and confirming the weight value of each member server according to the difference value between the current service connection number of each member server and the total average value of the current service connection.
In one embodiment, the step of obtaining the weight value of each member server according to the current node information of each member server includes: and dividing the service connection sum of all the member servers by the number of all the member services to obtain the current service connection total average value.
In an embodiment, the step of assigning the access request to the corresponding member server according to the load traffic corresponding to the access request and the weight value of each member server includes: and sequentially distributing the access requests to the corresponding member servers according to the weight values.
In one embodiment, the step of assigning the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server includes: and updating the weight value of each member server in real time according to the current node information of each member server.
The present application further provides a load balancing apparatus, which includes: a memory and a processor; the memory is used for storing a computer program; the processor, when being configured to execute the computer program, implements the load balancing method described above.
The application also provides a processing system, which comprises a task monitoring device, at least one load balancing device and at least one member server; the task monitoring device is used for acquiring the current node information of each member server, wherein the node information comprises the current service connection number of each member server; the at least one load balancing device is used for acquiring the weight value of each member server according to the current node information of each member server and distributing the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server; the at least one member server is configured to process the assigned access request.
In one embodiment, the processing system comprises a plurality of load balancing devices and a plurality of member servers.
The present application also provides a readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the load balancing method described above.
As described above, the load balancing method of the present application includes: acquiring a weight value of each member server according to current node information of each member server, wherein the node information comprises the current service connection number of each member server; and distributing the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server. Therefore, the load balancing method can dynamically distribute the access requests according to the current node information, and therefore the network throughput rate is improved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and, together with the description, serve to explain the principles of the application. In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings needed to be used in the description of the embodiments will be briefly described below, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive exercise.
Fig. 1 is a flowchart illustrating a load balancing method according to a first embodiment.
Fig. 2 is a schematic structural diagram of a load balancing apparatus according to the first embodiment.
Fig. 3 is a schematic configuration diagram of a processing system shown according to the first embodiment.
The implementation, functional features and advantages of the object of the present application will be further explained with reference to the embodiments, and with reference to the accompanying drawings. With the above figures, there are shown specific embodiments of the present application, which will be described in more detail below. These drawings and written description are not intended to limit the scope of the inventive concepts in any manner, but rather to illustrate the inventive concepts to those skilled in the art by reference to specific embodiments.
Detailed Description
Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. The following description refers to the accompanying drawings in which the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the application, as detailed in the appended claims.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the recitation of a claim "comprising a" 8230a "\8230means" does not exclude the presence of additional identical elements in the process, method, article or apparatus in which the element is incorporated, and further, similarly named components, features, elements in different embodiments of the application may have the same meaning or may have different meanings, the specific meaning of which should be determined by its interpretation in the specific embodiment or by further combination with the context of the specific embodiment.
It should be understood that although the terms first, second, third, etc. may be used herein to describe various information, such information should not be limited to these terms. These terms are only used to distinguish one type of information from another. For example, first information may also be referred to as second information, and similarly, second information may also be referred to as first information, without departing from the scope herein. The word "if" as used herein may be interpreted as "at" \8230; "or" when 8230; \8230; "or" in response to a determination ", depending on the context. Also, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context indicates otherwise. It will be further understood that the terms "comprises," "comprising," "includes" and/or "including," when used in this specification, specify the presence of stated features, steps, operations, elements, components, items, species, and/or groups, but do not preclude the presence, or addition of one or more other features, steps, operations, elements, components, species, and/or groups thereof. The terms "or," "and/or," "including at least one of the following," and the like, as used herein, are to be construed as inclusive or mean any one or any combination. For example, "includes at least one of: A. b, C "means" any of the following: a; b; c; a and B; a and C; b and C; a and B and C ", by way of further example," a, B or C "or" a, B and/or C "means" any of the following: a; b; c; a and B; a and C; b and C; a and B and C'. An exception to this definition will occur only when a combination of elements, functions, steps or operations are inherently mutually exclusive in some way.
It should be understood that, although the steps in the flowcharts in the embodiments of the present application are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and may be performed in other orders unless explicitly stated herein. Moreover, at least some of the steps in the figures may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, in different orders, and may be performed alternately or at least partially with respect to other steps or sub-steps of other steps.
The words "if", as used herein may be interpreted as "at \8230; \8230whenor" when 8230; \8230when or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.
It should be noted that, step numbers such as S10 and S20 are used herein for the purpose of more clearly and briefly describing corresponding contents, and do not constitute a substantial limitation on the sequence, and those skilled in the art may perform S20 first and then S10 in the specific implementation, but these should be within the protection scope of the present application.
It should be understood that the specific embodiments described herein are merely illustrative of and not restrictive on the broad application.
In the following description, suffixes such as "module", "component", or "unit" used to denote elements are used only for the convenience of description of the present application, and have no specific meaning in themselves. Thus, "module", "component" or "unit" may be used mixedly.
First embodiment
A first embodiment of the present application provides a load balancing method, including the following steps:
step S10: acquiring a weight value of each member server according to current node information of each member server, wherein the node information comprises the current service connection number of each member server;
in an embodiment, step S10 may include, but is not limited to: when the current service connection number of the first member server is zero, the weight value of the first member server is set to be zero, so that the member server with the fault is automatically shielded by setting the weight of the fault server to be zero, the access request can be distributed to the member server which normally operates, and the network throughput rate is further improved.
In an embodiment, step S10 may include, but is not limited to: and confirming the weight value of each member server according to the difference value between the current service connection number of each member server and the total average value of the current service connection. In other embodiments, the node information may also include, but is not limited to, other resource index data information such as a CPU and a memory, and the weight value of each member server is calculated according to the other resource index data information such as the CPU and the memory and the current service connection number.
In one embodiment, the smaller the difference between the current number of service connections and the total average of the current service connections, the greater the corresponding weight. In one embodiment, if the difference between the current service connection count of the second member server and the current service connection total average value is greater than or equal to a first threshold (e.g., 800), the weight of the second member server may be set to a first preset weight value (e.g., 20). If the difference between the current service connection number of the second member server and the current service connection total average value is greater than or equal to a second threshold (e.g., 500) and less than the first threshold, the weight of the second member server may be set to a second preset weight value (e.g., 60). If the difference between the current number of service connections of the second member server and the current total average of service connections is greater than or equal to a third threshold (e.g., 200) and less than a second threshold, the weight of the second member server may be set to a third preset weight value (e.g., 90). If the difference between the current service connection number of the second member server and the current service connection total average value is smaller than a third threshold (e.g., 200), the weight of the second member server may be set to a fourth preset weight value (e.g., 100), where the first preset weight value is smaller than the second preset weight value, the second preset weight value is smaller than the third preset weight value, and the third preset weight value is smaller than the fourth preset weight value.
In one embodiment, the total number of service connections for all member servers may be divided by the number of all member services to obtain a current total average of service connections.
Step S20: and distributing the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server.
In one embodiment, the access requests are sequentially distributed to the corresponding member servers according to the weight values. Specifically, for example, sixty percent of tasks of the access request are assigned to the member servers having sixty weight, and forty percent of tasks of the access request are assigned to the member servers having forty weight.
In one embodiment, the member servers with higher weight values distribute more tasks.
In one embodiment, the load balancing method further includes: and updating the weight value of each member server in real time or at regular time according to the current node information of each member server.
Second embodiment
A second embodiment of the present application provides a load balancing apparatus, including: a memory 101 and a processor 102; the memory 101 is used for storing computer programs. The processor 102, when executing the computer program, implements the load balancing method described above.
Third embodiment
The present application also provides a processing system, which includes a task listening device 10, at least one load balancing device 20 (only 2 are shown in the figure, but the present application is not limited thereto), and at least one member server 30 (only 3 are shown in the figure, but the present application is not limited thereto).
The task monitoring device 10 is configured to obtain current node information of each member server, where the node information includes a current service connection number of each member server. The at least one load balancing device 20 is configured to obtain a weight value of each member server according to current node information of each member server, and distribute an access request to a corresponding member server 30 according to a load flow corresponding to the access request and the weight value of each member server. At least one member server 30 is used to process the assigned access request.
In one embodiment, when the current number of service connections of the first member server is zero, the load balancing apparatus 20 sets the weight value of the first member server to zero, so as to automatically shield the failed member server by setting the weight of the failed member server to zero, thereby distributing the access request to the normally operating member servers, and further improving the network throughput.
In one embodiment, the load balancing apparatus 20 determines the weight value of each member server 30 according to the difference between the current service connection number of each member server and the current total average value of the service connections. In other embodiments, the node information may also include, but is not limited to, other resource index data information such as a CPU and a memory, and the weight value of each member server is calculated according to the other resource index data information such as the CPU and the memory and the current service connection number.
In one embodiment, the smaller the difference between the current number of service connections and the current total average of service connections for each member server 30, the greater the corresponding weight. In one embodiment, if the difference between the current service connection number of the second member server and the current service connection total average value is greater than or equal to a first threshold (e.g., 800), the weight of the second member server may be set to a first preset weight value (e.g., 20). If the difference between the current service connection number of the second member server and the current service connection total average value is greater than or equal to a second threshold (e.g., 500) and less than the first threshold, the weight of the second member server may be set to a second preset weight value (e.g., 60). If the difference between the current number of service connections of the second member server and the current total average of service connections is greater than or equal to a third threshold (e.g., 200) and less than a second threshold, the weight of the second member server may be set to a third preset weight value (e.g., 90). If the difference between the current service connection number of the second member server and the current service connection total average value is smaller than a third threshold (e.g., 200), the weight of the second member server may be set to a fourth preset weight value (e.g., 100), where the first preset weight value is smaller than the second preset weight value, the second preset weight value is smaller than the third preset weight value, and the third preset weight value is smaller than the fourth preset weight value.
In one embodiment, the total of the service connections for all the member servers may be divided by the number of all the member services to obtain a current total average of the service connections.
In one embodiment, the processing system includes a plurality of load balancing devices and a plurality of member servers. Wherein the priority of the load balancing devices in the processing system is different by default. The task monitoring device 10 in the processing system performs data interaction preferentially with the first load balancing device with the highest priority, when the first load balancing device with the highest priority fails, the priority of the second load balancing device with the second priority is changed into the load balancing device with the highest priority, and the task monitoring device 10 performs data interaction with the load balancing device with the highest priority so as to distribute the access request to the corresponding member server through the second load balancing device. In other embodiments, the task monitoring device 10 sends the node information to the load balancing device with the highest current priority, the load balancing device 20 with the highest current priority distributes the access request to the other load balancing devices 20 according to a preset rule, and each other load balancing device 20 distributes the received access sub-request to the associated member server 30. The preset rule may be, but is not limited to, an average allocation, or more access sub-requests are allocated by the load balancing apparatus with higher priority. Other load balancing means may be associated with the member servers according to a predetermined grouping category, for example, a third load balancing means is associated with a member server of the third group, a fourth load balancing means is associated with a member server of the fourth group, and so on.
The present application further provides a computer-readable storage medium, on which a load balancing method program is stored, and when executed by a processor, the load balancing method program implements the steps of the load balancing method in any of the above embodiments.
In the embodiments of the intelligent terminal and the computer-readable storage medium provided in the present application, all technical features of any one of the embodiments of the load balancing method may be included, and the expanding and explaining contents of the specification are basically the same as those of the embodiments of the method, and are not described herein again.
Embodiments of the present application also provide a computer program product, which includes computer program code, when the computer program code runs on a computer, the computer is caused to execute the method in the above various possible embodiments.
Embodiments of the present application further provide a chip, which includes a memory and a processor, where the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a device in which the chip is installed executes the method in the above various possible embodiments.
It is to be understood that the foregoing scenarios are only examples, and do not constitute a limitation on application scenarios of the technical solutions provided in the embodiments of the present application, and the technical solutions of the present application may also be applied to other scenarios. For example, as can be known by those skilled in the art, with the evolution of system architecture and the emergence of new service scenarios, the technical solution provided in the embodiments of the present application is also applicable to similar technical problems.
The above-mentioned serial numbers of the embodiments of the present application are merely for description, and do not represent the advantages and disadvantages of the embodiments.
The steps in the method of the embodiment of the application can be sequentially adjusted, combined and deleted according to actual needs.
The units in the device of the embodiment of the application can be combined, divided and deleted according to actual needs.
In the present application, the same or similar term concepts, technical solutions and/or application scenario descriptions will be generally described only in detail at the first occurrence, and when the description is repeated later, the detailed description will not be repeated in general for brevity, and when understanding the technical solutions and the like of the present application, reference may be made to the related detailed description before the description for the same or similar term concepts, technical solutions and/or application scenario descriptions and the like which are not described in detail later.
In the present application, each embodiment is described with emphasis, and reference may be made to the description of other embodiments for parts that are not described or illustrated in any embodiment.
All possible combinations of the technical features in the embodiments are not described in the present application for the sake of brevity, but should be considered as the scope of the present application as long as there is no contradiction between the combinations of the technical features.
Through the description of the foregoing embodiments, it is clear to those skilled in the art that the method of the foregoing embodiments may be implemented by software plus a necessary general hardware platform, and certainly may also be implemented by hardware, but in many cases, the former is a better implementation. Based on such understanding, the technical solutions of the present application may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, a controlled terminal, or a network device) to execute the method of each embodiment of the present application.
In the above embodiments, all or part of the implementation may be realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The procedures or functions according to the embodiments of the present application are all or partially generated when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, digital subscriber line) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, memory Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk (SSD)), among others.
The above description is only a preferred embodiment of the present application, and not intended to limit the scope of the present application, and all the equivalent structures or equivalent processes that can be directly or indirectly applied to other related technical fields by using the contents of the specification and the drawings of the present application are also included in the scope of the present application.
Claims (10)
1. A load balancing method, characterized in that the load balancing method comprises:
acquiring a weight value of each member server according to current node information of each member server, wherein the node information comprises the current service connection number of each member server;
and distributing the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server.
2. The load balancing method according to claim 1, wherein the step of obtaining the weight value of each member server according to the current node information of each member server comprises:
and when the current service connection number of the first member server is zero, setting the weight value of the first member server to be zero.
3. The load balancing method according to claim 1, wherein the step of obtaining the weight value of each member server according to the current node information of each member server comprises:
and confirming the weight value of each member server according to the difference value between the current service connection number of each member server and the total average value of the current service connection.
4. The load balancing method according to claim 3, wherein the step of obtaining the weight value of each member server according to the current node information of each member server comprises:
and dividing the service connection sum of all the member servers by the number of all the member services to obtain the current service connection total average value.
5. The load balancing method according to claim 1, wherein the step of assigning the access request to the corresponding member server according to the load traffic corresponding to the access request and the weight value of each member server comprises:
and sequentially distributing the access requests to the corresponding member servers according to the weight values.
6. The load balancing method according to claim 1, wherein the step of assigning the access request to the corresponding member server according to the load traffic corresponding to the access request and the weight value of each member server is followed by:
and updating the weight value of each member server in real time according to the current node information of each member server.
7. A load balancing apparatus, characterized in that the load balancing apparatus comprises: a memory and a processor;
the memory is used for storing a computer program;
the processor, when being configured to execute the computer program, is configured to implement the load balancing method according to any one of claims 1 to 6.
8. A processing system is characterized in that the processing system comprises a task monitoring device, at least one load balancing device and at least one member server;
the task monitoring device is used for acquiring the current node information of each member server, wherein the node information comprises the current service connection number of each member server;
the at least one load balancing device is used for acquiring the weight value of each member server according to the current node information of each member server and distributing the access request to the corresponding member server according to the load flow corresponding to the access request and the weight value of each member server;
the at least one member server is configured to process the assigned access request.
9. The processing system of claim 8, wherein the processing system comprises a plurality of load balancing devices and a plurality of member servers;
the task monitoring device sends the node information to a load balancing device with the highest current priority;
and the load balancing device with the highest current priority distributes the access request to other load balancing devices according to a preset rule, so that the other load balancing devices distribute the received access sub-requests to the associated member servers.
10. A readable storage medium, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the load balancing method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210884361.1A CN115150399A (en) | 2022-07-25 | 2022-07-25 | Load balancing method, load balancing device, processing system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210884361.1A CN115150399A (en) | 2022-07-25 | 2022-07-25 | Load balancing method, load balancing device, processing system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115150399A true CN115150399A (en) | 2022-10-04 |
Family
ID=83413393
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210884361.1A Pending CN115150399A (en) | 2022-07-25 | 2022-07-25 | Load balancing method, load balancing device, processing system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115150399A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102436401A (en) * | 2011-12-16 | 2012-05-02 | 北京邮电大学 | Load balancing system and method |
| CN102611735A (en) * | 2011-12-21 | 2012-07-25 | 奇智软件（北京）有限公司 | Load balancing method and system of application services |
| CN103401947A (en) * | 2013-08-20 | 2013-11-20 | 曙光信息产业(北京)有限公司 | Method and device for allocating tasks to multiple servers |
| CN103490914A (en) * | 2012-06-08 | 2014-01-01 | 华耀(中国)科技有限公司 | Switching system and switching method for multi-machine hot standby of network application equipment |
| CN110233866A (en) * | 2018-03-06 | 2019-09-13 | 中国移动通信集团广东有限公司 | A kind of load-balancing method and load balancer |
| CN110602156A (en) * | 2019-03-11 | 2019-12-20 | 平安科技（深圳）有限公司 | Load balancing scheduling method and device |
| CN111930523A (en) * | 2020-09-28 | 2020-11-13 | 支付宝(杭州)信息技术有限公司 | Load balancing method and system for service cluster |
-
2022
- 2022-07-25 CN CN202210884361.1A patent/CN115150399A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102436401A (en) * | 2011-12-16 | 2012-05-02 | 北京邮电大学 | Load balancing system and method |
| CN102611735A (en) * | 2011-12-21 | 2012-07-25 | 奇智软件（北京）有限公司 | Load balancing method and system of application services |
| CN103490914A (en) * | 2012-06-08 | 2014-01-01 | 华耀(中国)科技有限公司 | Switching system and switching method for multi-machine hot standby of network application equipment |
| CN103401947A (en) * | 2013-08-20 | 2013-11-20 | 曙光信息产业(北京)有限公司 | Method and device for allocating tasks to multiple servers |
| CN110233866A (en) * | 2018-03-06 | 2019-09-13 | 中国移动通信集团广东有限公司 | A kind of load-balancing method and load balancer |
| CN110602156A (en) * | 2019-03-11 | 2019-12-20 | 平安科技（深圳）有限公司 | Load balancing scheduling method and device |
| CN111930523A (en) * | 2020-09-28 | 2020-11-13 | 支付宝(杭州)信息技术有限公司 | Load balancing method and system for service cluster |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8185624B2 (en) | Efficient on-demand provisioning of servers for specific software sets | |
| US10652360B2 (en) | Access scheduling method and apparatus for terminal, and computer storage medium | |
| CN108512890B (en) | Container cloud platform resource scheduling method and system based on rack sensing | |
| CN110244901B (en) | Task allocation method and device and distributed storage system | |
| CN107819797B (en) | Access request processing method and device | |
| CN112650576A (en) | Resource scheduling method, device, equipment, storage medium and computer program product | |
| CN110912972A (en) | Service processing method, system, electronic equipment and readable storage medium | |
| CN111324471A (en) | Service adjusting method, device, equipment and storage medium | |
| CN114189525A (en) | Service request method and device and electronic equipment | |
| CN114385353A (en) | Resource scheduling method and device, electronic equipment and storage medium | |
| CN114385370B (en) | Memory allocation method, system, device and medium | |
| CN110290228B (en) | Internet protocol IP address allocation method and device | |
| CN107426109B (en) | Traffic scheduling method, VNF module and traffic scheduling server | |
| CN107634978B (en) | Resource scheduling method and device | |
| CN112506650A (en) | Resource allocation method, system, computer device and storage medium | |
| CN114546493A (en) | Core sharing method and device, processing core, electronic device and medium | |
| CN112416594A (en) | Micro-service distribution method, electronic equipment and computer storage medium | |
| CN115150399A (en) | Load balancing method, load balancing device, processing system and storage medium | |
| CN110275772B (en) | Data processing method and related equipment thereof | |
| CN107835104B (en) | Method, system, equipment and storage medium for sharing NF user permission among network slices | |
| CN115794396A (en) | Resource allocation method, system and electronic equipment | |
| CN102656564B (en) | Reduce the expense in application process | |
| CN115878309A (en) | Resource allocation method, device, processing core, equipment and computer readable medium | |
| CN113055199A (en) | Gateway access method and device and gateway equipment | |
| CN109257201B (en) | License sending method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |