CN111767142A - Current limiting threshold setting method of service node and server side equipment - Google Patents
Current limiting threshold setting method of service node and server side equipment Download PDFInfo
- Publication number
- CN111767142A CN111767142A CN202010578988.5A CN202010578988A CN111767142A CN 111767142 A CN111767142 A CN 111767142A CN 202010578988 A CN202010578988 A CN 202010578988A CN 111767142 A CN111767142 A CN 111767142A
- Authority
- CN
- China
- Prior art keywords
- service
- node
- current
- service node
- threshold
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/5038—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the execution order of a plurality of tasks, e.g. taking priority or time dependency constraints into consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5021—Priority
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/506—Constraint
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
Abstract
The application provides a method for setting a current limiting threshold of a service node and a server device, wherein the method comprises the following steps: acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service; generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file; and pushing the generated current limiting threshold to each service node. By the scheme, the problem of unreasonable setting caused by not considering the priority of the service in the existing current limiting threshold setting process is solved, and the reasonable setting of the current limiting threshold is achieved, so that the technical effect of optimal configuration of system resources is achieved.
Description
Technical Field
The application belongs to the technical field of internet, and particularly relates to a method for setting a current limiting threshold of a service node and a server device.
Background
As internet users increase, it is generally necessary to ensure that the request amount received by the system is within a normal range through flow control. Because the throughput of any system has an upper limit, a reasonable limit value must be set to avoid the system crash caused by the flow flood peak, thereby ensuring that the system can run smoothly under the controllable load.
At present, most of internet applications have own current limiting components, wherein counter algorithms, leaky bucket algorithms, token bucket algorithms and the like are commonly used, and each algorithm has an application scene. For these algorithms, the current limit threshold is typically set either empirically or by server pressure measurements.
Then, in some scenarios (e.g., financial services), the data processing amount is large, the number of services to be called is large, the calling situation and the calling requirement between services are also different, and if the threshold is set according to a fixed threshold or according to experience, the stability of the system cannot be guaranteed, and the system resources cannot be optimally configured.
An effective solution is not provided at present for the problem of how to reasonably set the current limiting threshold.
Disclosure of Invention
The application aims to provide a method for setting a current limiting threshold of a service node and a server device, which can realize reasonable setting of the current limiting threshold, thereby achieving optimal configuration of system resources.
The application provides a method for setting a current limiting threshold of a service node and a server device, which are realized as follows:
a method of current limit threshold setting for a service node, the method comprising:
acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service;
generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and pushing the generated current limiting threshold to each service node.
In one embodiment, the current limit indicator profile further comprises at least one of: the execution time of the service at the current service node, the times of the current service node as the called party and the random factor of the service belonging to the service.
In one embodiment, generating a current limiting threshold corresponding to each service for each service node in a service cluster according to the current limiting index profile includes:
the current limit threshold is calculated according to the following formula:
wherein, Y0Indicating a current limit threshold of a current service node, qps1 indicating a throughput trough of a first service node in a service cluster, qps2 indicating a throughput trough of a second service node in the service cluster, qpsm indicating a throughput trough of an mth service node in the service cluster, and min indicating a minimum value;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaRepresents the execution time of the service a at the current service node, n0The number of times that the current service node is taken as the called party is shown, and the service a is the service to which the service executed by the current service node belongs.
In one embodiment, after pushing the generated current limiting threshold to each service node, the method further includes:
and processing the service according to the generated flow threshold value.
In one embodiment, in processing traffic according to the generated traffic threshold, the method includes:
detecting whether the real-time flow value of the previous node of the current service node exceeds a preset threshold value;
if the current traffic value exceeds the preset threshold value, generating a traffic threshold value of the current service node according to the real-time traffic value of the previous node;
and pushing the generated traffic threshold value to the current service node.
In one embodiment, generating the traffic threshold of the current serving node according to the real-time traffic value of the previous node includes:
calculating the flow threshold value of the current service node according to the following formula:
wherein, Y0Indicating a current limit threshold of a current service node, qps1 indicating a throughput trough of a first service node in a service cluster, qps2 indicating a throughput trough of a second service node in the service cluster, qpsm indicating a throughput trough of an mth service node in the service cluster, and min indicating a minimum value;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaThe method comprises the steps of representing the execution time of a service a at a current service node, representing the number of times that the current service node is taken as a called party, representing the service a to which the service executed by the current service node belongs, and representing the real-time flow value of a previous node.
In one embodiment, if the preset threshold is exceeded, generating a traffic threshold of the current serving node according to the real-time traffic value of the previous node includes:
if the preset threshold value is exceeded, determining whether the dynamic adjustment switch is in an opening state;
and if the dynamic adjustment switch is in an on state, generating a flow threshold value of the current service node according to the real-time flow value of the previous node.
In another aspect, an apparatus for setting a current limit threshold of a service node is provided, including:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a current limiting index configuration file, and the current limiting index configuration file at least comprises the priority of a service;
the generating module is used for generating a current limiting threshold value corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and the pushing module is used for pushing the generated current limiting threshold value to each service node.
In yet another aspect, a server device is provided, comprising a processor and a memory for storing processor-executable instructions, the instructions when executed by the processor implementing the steps of the method of:
acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service;
generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and pushing the generated current limiting threshold to each service node.
In yet another aspect, a computer-readable storage medium is provided having computer instructions stored thereon which, when executed, implement the steps of the method of:
acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service;
generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and pushing the generated current limiting threshold to each service node.
According to the method for setting the current limiting threshold of the service node and the server side equipment, when the current limiting threshold of each service node in each service is determined, the priority of the service is introduced instead of adopting the same priority mode for all services, the problem that the current limiting threshold is unreasonable to set due to the fact that the priority of the service is not considered in the existing current limiting threshold setting process is solved, the current limiting threshold is reasonably set, and therefore the technical effect of optimal configuration of system resources is achieved.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative effort.
Fig. 1 is a flowchart of a method of an embodiment of a method for setting a current limit threshold of a service node provided in the present application;
FIG. 2 is a block diagram of a dynamic current limiting device provided herein;
FIG. 3 is a flow chart of a method of dynamic current limiting provided herein;
FIG. 4 is a schematic diagram of a model architecture of one embodiment of a server provided herein;
fig. 5 is a block diagram illustrating a configuration of a current limiting threshold setting apparatus of a service node according to the present invention.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
In order to solve the problem of setting the current limiting threshold value of different service nodes called by different services, the embodiment provides a dynamic flow setting method, and a dynamic current limiting device is set, wherein the device is a global flow resource coordination distribution cluster. Specifically, threshold calculation based on two dimensions of a service and a service node can be supported, and during implementation, the current limiting threshold of each service node can be set according to the priority of the service, so that different current limiting thresholds can be dynamically generated according to the priority of the service when restarting or initializing. After the current limiting threshold is generated, the threshold can be actively pushed to each node, so that the configuration of the application system can be effective in real time, and the optimal configuration of system flow resources and the stability of the system are ensured.
Based on this, in this example, a method for setting a current limiting threshold of a service node is provided, as shown in fig. 1, which may include the following steps:
step 101: acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service;
specifically, a plurality of service nodes may be included in the service cluster, each service node providing a plurality of services, and a service relates to a plurality of services. Assume that for service a, the services involved are service 1 and service 2, where service 1 is provided sequentially by service node a, service node b, service node c, and service node e. The service B relates to a service 3, which is provided by a service node c and a service node e in turn. Then for serving node c, the last serving node is b when service 1 is provided, and there is no last node when service 2 is provided.
When the system is started or restarted, a current-limiting index configuration file may be obtained, and the priority of each service may be carried in the current-limiting index configuration file in order to set a traffic threshold value based on the priority of the service in the following. For example, service a has the highest priority and is assigned a value of 100, service B has a medium priority and is assigned a value of 50.
However, it should be noted that the above assignment of the service priority is only an exemplary description, and in an actual implementation, the priority may be assigned according to an actual requirement, which is not limited in this application.
Step 102: generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
since the current limit index configuration file carries the priority of the service, the current limit threshold is calculated according to the current limit index configuration file, and the priority factor of the service is considered, so that the set current limit threshold can be more reasonable.
When the current limiting threshold is generated, the current limiting threshold corresponding to each service may be generated for each service node, and therefore, one service node may provide a plurality of services.
Step 103: and pushing the generated current limiting threshold to each service node.
In order to generate the current limiting threshold more accurately and efficiently, a threshold control module may be separately set, the module is used to obtain the configuration file and calculate the current limiting threshold, and after the current limiting threshold is calculated, the calculated current limiting threshold may be pushed to each service node so as to function at each service node.
In the above example, when the current limiting threshold of each service node in each service is determined, the priority of the service is introduced, instead of adopting the same priority for all services, and by this way, the problem that the setting is unreasonable due to the fact that the priority of the service itself is not considered in the existing current limiting threshold setting process is solved, and the current limiting threshold is set reasonably, so that the technical effect of optimal configuration of system resources is achieved.
Specifically, the execution time of the service at the current service node, the number of times that the current service node is taken as the called party, and the random factor of the service belonging to the service all affect the setting of the traffic threshold of the service node, so that these parameters can be combined when setting the traffic threshold.
Specifically, the following characteristics are considered for the above indexes:
1) service execution time (RT): is the response time of the service node, and determines the flow rate requested by the node to a certain extent, the node threshold value with high RT should be set relatively small, therefore,
should be inversely related to RT;
2) priority (P): the priority of the service ensures that the service with high priority has sufficient resources, and the corresponding threshold value should be properly increased for the service node of the service with high priorityIn addition, therefore,
should be positively correlated with priority p;
3) service invocation amount (n): the number of times that the service node is used as the called party is determined, in order to ensure that the key node (the node called more by other nodes) in the ecosystem can operate stably, if the service calling amount (n) is larger, the setting of the node threshold of the node is relatively small, and therefore,
should be negatively correlated with n;
4) random factor (r): the randomness of the service is represented, and sometimes the service has a requirement of batch processing, so that the peak value and the valley value of the service are relatively large, and a reasonable threshold value cannot be accurately given according to the mean value of the service, so that a random factor (r) is needed to adjust the setting of the threshold value. The larger the difference between the maximum and minimum values of the traffic, the larger the value of the random factor, and, therefore,
should be positively correlated with r;
therefore, the current limit threshold may be calculated according to the following formula:
wherein, Y0Indicating a current limit threshold of a current service node, qps1 indicating a throughput trough of a first service node in a service cluster, qps2 indicating a throughput trough of a second service node in the service cluster, qpsm indicating a throughput trough of an mth service node in the service cluster, and min indicating a minimum value;
wherein, PaIndicates the priority of the service a, raPresentation servicea random factor, RTaRepresents the execution time of the service a at the current service node, n0The number of times that the current service node is taken as the called party is shown, and the service a is the service to which the service executed by the current service node belongs.
The above-mentioned manner of calculating the traffic threshold may be executed when the system is started up or restarted, and after the generated current limiting threshold is pushed to each service node, the service may be processed according to the generated traffic threshold, that is, the processing of the service may be controlled based on the traffic threshold generated and pushed to each service node.
Further, considering that there may be an emergency situation at the upstream node sometimes, which may cause a sudden abnormal rise in the node traffic of the upstream node, which will affect the entire ecological circle, if the current node detects these abnormal situations of the upstream node, the current limit threshold of the node may be automatically adjusted, so as to prevent the abnormal request from being transmitted to the downstream service node.
Therefore, in the process of processing the service according to the generated flow threshold, whether the real-time flow value of the previous node of the current service node exceeds a preset threshold or not can be detected; if the current traffic value exceeds the preset threshold value, generating a traffic threshold value of the current service node according to the real-time traffic value of the previous node; and pushing the generated traffic threshold value to the current service node.
In order to solve this problem, during the service execution process, when the traffic threshold is dynamically adjusted, the real-time traffic of the previous node may be introduced, so as to guide the reasonable setting of the traffic threshold, for example:
the traffic threshold of the current serving node may be calculated according to the following formula:
wherein, Y0A current limit threshold representing a current serving node, qps1 representing a trough in throughput for a first serving node in a serving cluster, qps2 representing a trough in throughput for a second serving node in a serving cluster, qpsm representing throughput for an mth serving node in a serving clusterThe minimum value is calculated by min;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaThe method comprises the steps of representing the execution time of a service a at a current service node, representing the number of times that the current service node is taken as a called party, representing the service a to which the service executed by the current service node belongs, and representing the real-time flow value of a previous node.
In the actual implementation, dynamically adjusting the flow threshold may be an optional function, that is, the function may be turned on or off, and if the function is turned on, the dynamic adjustment is performed, and if the function is turned off, the dynamic adjustment is not performed. Specifically, when the traffic threshold of the current service node is generated according to the real-time traffic value of the previous node, the method may include: determining whether the dynamic adjustment switch is in an on state; and if the dynamic adjustment switch is in an on state, generating a flow threshold value of the current service node according to the real-time flow value of the previous node.
The above method is described below with reference to a specific example, however, it should be noted that the specific example is only for better describing the present application and is not to be construed as limiting the present application.
In order to solve the problem of setting the current limiting threshold value of different service nodes called by different services, the embodiment provides a dynamic flow setting method, and a dynamic current limiting device is set, wherein the device is a global flow resource coordination distribution cluster. Specifically, threshold calculation based on two dimensions of a service node and a service node can be supported, during implementation, the current limiting thresholds of the current node and the subsequent node can be dynamically adjusted according to the flow value of the previous node, and during restart or initialization, different current limiting thresholds can be dynamically generated according to service priority. After the current limit threshold is generated, the threshold may be actively pushed to each node so that the configuration of the application system may take effect in real time. Thereby ensuring the optimal configuration of system flow resources and the stability of the system.
A plurality of service nodes may be included in a service cluster, each service node providing a plurality of services, and a service may involve a plurality of services (either at the same node or across nodes). The throughput of the whole service node ecological group is min { qps1, qps2 … …, qpsm } and the threshold value of each node is set as
Wherein
For each of the dynamic factors of the nodes,
the value of (c) may dynamically depend on such metrics as service invocation amount, service execution time, average throughput, average traffic invocation amount, priority, and random factor.
The following characteristics are considered for the above indexes:
1) service execution time (RT): is the response time of the service node, and determines the flow rate requested by the node to a certain extent, the node threshold value with high RT should be set relatively small, therefore,
should be inversely related to RT;
2) priority (P): is the priority of the service, the setting of the priority ensures that the service with high priority has sufficient resources, and the corresponding threshold value should be properly increased aiming at the service node of the service with high priority, therefore,
should be positively correlated with priority p;
3) service invocation amount (n): the number of times that the service node is taken as the called party is used for ensuring key nodes (nodes called by other nodes more frequently) in the ecological circle) Can operate stably, the larger the service call amount (n), the smaller the setting of the node threshold of the node should be, and therefore,
should be negatively correlated with n;
4) random factor (r): the randomness of the service is represented, and sometimes the service has a requirement of batch processing, so that the peak value and the valley value of the service are relatively large, and a reasonable threshold value cannot be accurately given according to the mean value of the service, so that a random factor (r) is needed to adjust the setting of the threshold value. The larger the difference between the maximum and minimum values of the traffic, the larger the value of the random factor, and, therefore,
should be positively correlated with r;
therefore, it can be set as follows
Wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaRepresents the execution time of the service a in the service node, and n represents the number of times the service node is taken as the called party.
Further, considering that there may be an emergency situation at the upstream node sometimes, which may cause a sudden abnormal rise in the node traffic of the upstream node, which will affect the entire ecological circle, if the current node detects these abnormal situations of the upstream node, the current limit threshold of the node may be automatically adjusted, so as to prevent the abnormal request from being transmitted to the downstream service node.
For this purpose, the above-mentioned
Can introduce the node flow of the previous nodeQuantity:
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaThe execution time of the service a at the service node is shown, n is the number of times that the service node is taken as the called party, and L is the node flow of the last abnormal node.
Specifically, the current limiting may be performed according to the following steps:
step 1: initializing a dynamic current limiting device, and loading a current limiting index configuration file:
that is, when the system is started, the dynamic current limiting device loads the index configuration file at the time of starting to obtain the basic threshold calculation indexes (such as service call volume, service star time, average throughput, average service call volume, priority and random factor), and stores the obtained basic threshold calculation indexes in the memory.
Step 2: the current limit threshold of each service node is calculated as an initial value based on the basic threshold calculation index.
That is, when the service node is deployed for the first time, the current limiting threshold of each service node is calculated according to the basic threshold calculation index, and is used as the initial value of each service node.
When calculating the initial value, the current limit threshold Y of each node may be calculated according to the following formula0：
Wherein, Y0Indicating a current limit threshold of the current node, qps1 indicating a throughput trough of a first service node in the service cluster, qps2 indicating a throughput trough of a second service node in the service cluster, qpsm indicating a throughput trough of an mth service node in the service cluster, and min indicating a minimum value;
the throughput is the number of times of processing requests per second by the service node, and is a basic index value obtained by node pressure measurement.
Wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaRepresents the execution time of the service a at the service node, n0Representing the number of times the current serving node is the callee.
And step 3: and in the service providing process, the flow value of the previous node is checked in real time, and the threshold value of the following node is dynamically adjusted.
Specifically, if it is detected that the traffic of the previous node has an abnormal change (for example, greater than 3 times of the daily value) and the dynamic adjustment threshold switch is on (i.e., it is determined that the current traffic is in a dynamically adjustable state), the current limiting threshold of the current service node may be reset, the current limiting threshold of the current service node may be directly reduced by a predetermined ratio, or the updated current limiting threshold may be calculated according to the following formula:
wherein, Y1Indicating the current node adjusted current limit threshold, qps1 indicating the throughput valley of the first service node in the service cluster, qps2 indicating the throughput valley of the second service node in the service cluster, qpsm indicating the throughput valley of the mth service node in the service cluster, and min indicating the minimum value;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaRepresents the execution time of the service a at the service node, n1Representing the number of times the serving node is called, and L represents the node of the last abnormal nodeAnd (4) flow rate.
And 4, step 4: and pushing the determined updated current limiting threshold to the current node.
For example, the service nodes required by service a are: the a node, the b node, the c node and the d node, that is, the execution of the whole service a requires four abcd nodes, if the b node suddenly experiences a traffic surge, the current limit threshold of the c node needs to be adjusted, so that excessive abnormal traffic can be prevented from flowing to the d node, and if the a node suddenly experiences a traffic surge, the current limit threshold of the b node needs to be adjusted, so that excessive abnormal traffic can be prevented from flowing to the c node and the d node.
As shown in fig. 2, the dynamic current limiting apparatus may include: the device comprises a current limiting index configuration file initialization module, a threshold dynamic adjustment detection module, a threshold calculation module and a threshold dynamic pushing module.
Based on the dynamic current limiting apparatus shown in fig. 2, the following current limiting operations may be performed as shown in fig. 3:
s1: restarting a current limit index device;
s2: loading a current limit index configuration file, if loading is successful, executing S3, and if loading is unsuccessful, executing S5;
s3: a dynamic threshold adjusting module calculates a node threshold;
s4: refreshing a threshold value of a service node;
s5: the current limiting process is ended.
The dynamic current-limiting threshold setting method can be applied to financial market business, due to the characteristics of the financial market business, the trading volume is large, the trading flow is complex, the called services are more, besides individual differences, different businesses also have a plurality of same flows, and different businesses also have priority differences. For example, the agent field relates to processes: the system comprises a business parameter checking service, a pre-examination and approval bill bookkeeping service, a pre-existing control service, a transaction bill bookkeeping service, a transaction element comparison service, an examination and approval process service, a middle-platform rechecking service and a background downloading service. Similarly, taking the structured deposit service in the transaction field as an example, the service flow is as follows: parameter checking service, transaction list bookkeeping service, wind control compliance service, examination and approval process service and middle platform rechecking service. Different current limiting thresholds can be set according to the priority level or the importance level of different services in the financial market services, and the current limiting threshold of each service of each node in the financial market service group can be dynamically set.
In the above example, different current limiting thresholds are dynamically loaded by different services according to different services in a financial market service scene, and the setting of the thresholds replaces a fixed threshold setting mode, so that different current limiting thresholds can be set according to the importance degree of financial market services, the current limiting threshold of each service of each node in a financial market service group is dynamically set, and the threshold of the node is dynamically adjusted according to the traffic of the previous node, so that the traffic of the whole service node is in the optimal state.
The method embodiments provided in the above embodiments of the present application may be executed in a server, a computer terminal, or a similar computing device. Taking the example of running on a server, fig. 4 is a hardware structure block diagram of the server of the method for setting the current limiting threshold of the service node according to the embodiment of the present invention. As shown in fig. 4, the server 10 may include one or more (only one shown) processors 102 (the processors 102 may include, but are not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA, etc.), a memory 104 for storing data, and a transmission module 106 for communication functions. It will be understood by those skilled in the art that the structure shown in fig. 4 is only an illustration and is not intended to limit the structure of the electronic device. For example, the server 10 may also include more or fewer components than shown in FIG. 4, or have a different configuration than shown in FIG. 4.
The memory 104 may be configured to store software programs and modules of application software, such as program instructions/modules corresponding to the current limiting threshold setting method of the service node in the embodiment of the present invention, and the processor 102 executes various functional applications and data processing by running the software programs and modules stored in the memory 104, that is, implements the current limiting threshold setting method of the service node of the application program. The memory 104 may include high speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include memory located remotely from the processor 102, which may be connected to the computer terminal 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission module 106 is used to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communication provider of the computer terminal 10. In one example, the transmission module 106 includes a Network adapter (NIC) that can be connected to other Network devices through a base station to communicate with the internet. In one example, the transmission module 106 may be a Radio Frequency (RF) module, which is used for communicating with the internet in a wireless manner.
In the software aspect, the current limiting threshold setting apparatus of the device service node may be as shown in fig. 5, and includes:
an obtaining module 501, configured to obtain a current limit indicator configuration file, where the current limit indicator configuration file at least includes a priority of a service;
a generating module 502, configured to generate a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
a pushing module 503, configured to push the generated current limiting threshold to each service node.
In an embodiment, the above-mentioned current limit indicator profile may further include at least one of: the execution time of the service at the current service node, the times of the current service node as the called party and the random factor of the service belonging to the service.
In an embodiment, the generating module 502 may specifically calculate the current limit threshold according to the following formula:
wherein, Y0Indicating a current limit threshold of a current service node, qps1 indicating a throughput trough of a first service node in a service cluster, qps2 indicating a throughput trough of a second service node in the service cluster, qpsm indicating a throughput trough of an mth service node in the service cluster, and min indicating a minimum value;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaRepresents the execution time of the service a at the current service node, n0The number of times that the current service node is taken as the called party is shown, and the service a is the service to which the service executed by the current service node belongs.
In an embodiment, the current limiting threshold setting apparatus of the service node may further include:
and the processing module is used for processing the service according to the generated flow threshold value.
In one embodiment, in the process of processing the service according to the generated traffic threshold, it may also be detected whether a real-time traffic value of a previous node of the current service node exceeds a preset threshold; if the current traffic value exceeds the preset threshold value, generating a traffic threshold value of the current service node according to the real-time traffic value of the previous node; and pushing the generated traffic threshold value to the current service node.
Specifically, the traffic threshold of the current service node may be calculated according to the following formula:
wherein, Y0A current limit threshold representing a current service node, qps1 representing a trough in throughput for a first service node in a service cluster, qps2 representing a trough in throughput for a second service node in a service cluster, qpsm representing a trough in throughput for an mth service node in a service clusterMin represents the minimum value;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaThe method comprises the steps of representing the execution time of a service a at a current service node, representing the number of times that the current service node is taken as a called party, representing the service a to which the service executed by the current service node belongs, and representing the real-time flow value of a previous node.
In one embodiment, generating the traffic threshold of the current serving node according to the real-time traffic value of the previous node may include: determining whether the dynamic adjustment switch is in an on state; and if the dynamic adjustment switch is in an on state, generating a flow threshold value of the current service node according to the real-time flow value of the previous node.
An embodiment of the present application further provides a specific implementation manner of an electronic device, which is capable of implementing all steps in the method for setting a current limit threshold of a service node in the foregoing embodiment, where the electronic device specifically includes the following contents: a processor (processor), a memory (memory), a communication Interface (Communications Interface), and a bus; the processor, the memory and the communication interface complete mutual communication through the bus; the processor is configured to invoke a computer program in the memory, and when executing the computer program, the processor implements all steps in the method for setting a current limiting threshold of a service node in the foregoing embodiment, for example, when executing the computer program, the processor implements the following steps:
step 1: acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service;
step 2: generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and step 3: and pushing the generated current limiting threshold to each service node.
As can be seen from the above description, in the embodiments of the present application, when the current limiting threshold of each service node in each service is used, the priority of the service is introduced, instead of using the same priority for all services, and this way solves the problem of unreasonable setting caused by not considering the priority of the service in the existing current limiting threshold setting process, and achieves the technical effect of reasonably setting the current limiting threshold, thereby achieving the optimal configuration of system resources.
An embodiment of the present application further provides a computer-readable storage medium capable of implementing all the steps in the method for setting a current limiting threshold of a service node in the foregoing embodiment, where the computer-readable storage medium stores a computer program, and the computer program, when executed by a processor, implements all the steps of the method for setting a current limiting threshold of a service node in the foregoing embodiment, for example, when the processor executes the computer program, implements the following steps:
step 1: acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service;
step 2: generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and step 3: and pushing the generated current limiting threshold to each service node.
As can be seen from the above description, in the embodiments of the present application, when the current limiting threshold of each service node in each service is used, the priority of the service is introduced, instead of using the same priority for all services, and this way solves the problem of unreasonable setting caused by not considering the priority of the service in the existing current limiting threshold setting process, and achieves the technical effect of reasonably setting the current limiting threshold, thereby achieving the optimal configuration of system resources.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the hardware + program class embodiment, since it is substantially similar to the method embodiment, the description is simple, and the relevant points can be referred to the partial description of the method embodiment.
The foregoing description has been directed to specific embodiments of this disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
Although the present application provides method steps as described in an embodiment or flowchart, additional or fewer steps may be included based on conventional or non-inventive efforts. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or client product executes, it may execute sequentially or in parallel (e.g., in the context of parallel processors or multi-threaded processing) according to the embodiments or methods shown in the figures.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a vehicle-mounted human-computer interaction device, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
Although embodiments of the present description provide method steps as described in embodiments or flowcharts, more or fewer steps may be included based on conventional or non-inventive means. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or end product executes, it may execute sequentially or in parallel (e.g., parallel processors or multi-threaded environments, or even distributed data processing environments) according to the method shown in the embodiment or the figures. 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 presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded.
For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, in implementing the embodiments of the present description, the functions of each module may be implemented in one or more software and/or hardware, or a module implementing the same function may be implemented by a combination of multiple sub-modules or sub-units, and the like. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may therefore be considered as a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
As will be appreciated by one skilled in the art, embodiments of the present description may be provided as a method, system, or computer program product. Accordingly, embodiments of the present description may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, embodiments of the present description may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The embodiments of this specification may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The described embodiments may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment. In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of an embodiment of the specification. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
The above description is only an example of the embodiments of the present disclosure, and is not intended to limit the embodiments of the present disclosure. Various modifications and variations to the embodiments described herein will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the embodiments of the present specification should be included in the scope of the claims of the embodiments of the present specification.
Claims (10)
1. A method for setting a current limit threshold of a service node, the method comprising:
acquiring a current limiting index configuration file, wherein the current limiting index configuration file at least comprises the priority of a service;
generating a current limiting threshold corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and pushing the generated current limiting threshold to each service node.
2. The method of claim 1, wherein the flow restriction indicator profile further comprises at least one of: the execution time of the service at the current service node, the times of the current service node as the called party and the random factor of the service belonging to the service.
3. The method of claim 2, wherein generating a current limit threshold for each service node in a service cluster according to the current limit metric profile comprises:
the current limit threshold is calculated according to the following formula:
wherein, Y0Indicating a current limit threshold of a current service node, qps1 indicating a throughput trough of a first service node in a service cluster, qps2 indicating a throughput trough of a second service node in the service cluster, qpsm indicating a throughput trough of an mth service node in the service cluster, and min indicating a minimum value;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaRepresents the execution time of the service a at the current service node, n0The number of times that the current service node is taken as the called party is shown, and the service a is the service to which the service executed by the current service node belongs.
4. The method of claim 1, wherein after pushing the generated current limit threshold to each service node, further comprising:
and processing the service according to the generated flow threshold value.
5. The method of claim 4, wherein in processing traffic according to the generated traffic threshold, comprising:
detecting whether the real-time flow value of the previous node of the current service node exceeds a preset threshold value;
if the current traffic value exceeds the preset threshold value, generating a traffic threshold value of the current service node according to the real-time traffic value of the previous node;
and pushing the generated traffic threshold value to the current service node.
6. The method of claim 5, wherein generating the traffic threshold of the current serving node according to the real-time traffic value of the previous node comprises:
calculating the flow threshold value of the current service node according to the following formula:
wherein, Y0Indicating a current limit threshold of a current service node, qps1 indicating a throughput trough of a first service node in a service cluster, qps2 indicating a throughput trough of a second service node in the service cluster, qpsm indicating a throughput trough of an mth service node in the service cluster, and min indicating a minimum value;
wherein, PaIndicates the priority of the service a, raRandom factor, RT, representing service aaThe method comprises the steps of representing the execution time of a service a at a current service node, representing the number of times that the current service node is taken as a called party, representing the service a to which the service executed by the current service node belongs, and representing the real-time flow value of a previous node.
7. The method of claim 5, wherein if the preset threshold is exceeded, generating a traffic threshold of the current serving node according to the real-time traffic value of the previous node comprises:
if the preset threshold value is exceeded, determining whether the dynamic adjustment switch is in an opening state;
and if the dynamic adjustment switch is in an on state, generating a flow threshold value of the current service node according to the real-time flow value of the previous node.
8. A current limit threshold setting apparatus of a service node, comprising:
the system comprises an acquisition module, a processing module and a processing module, wherein the acquisition module is used for acquiring a current limiting index configuration file, and the current limiting index configuration file at least comprises the priority of a service;
the generating module is used for generating a current limiting threshold value corresponding to each service for each service node in the service cluster according to the current limiting index configuration file;
and the pushing module is used for pushing the generated current limiting threshold value to each service node.
9. A server device comprising a processor and a memory for storing processor-executable instructions which, when executed by the processor, implement the steps of the method of any one of claims 1 to 7.
10. A computer readable storage medium having stored thereon computer instructions which, when executed, implement the steps of the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010578988.5A CN111767142B (en) | 2020-06-23 | 2020-06-23 | Method for setting current limiting threshold of service node and service terminal equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010578988.5A CN111767142B (en) | 2020-06-23 | 2020-06-23 | Method for setting current limiting threshold of service node and service terminal equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111767142A true CN111767142A (en) | 2020-10-13 |
| CN111767142B CN111767142B (en) | 2023-08-08 |
Family
ID=72721777
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010578988.5A Active CN111767142B (en) | 2020-06-23 | 2020-06-23 | Method for setting current limiting threshold of service node and service terminal equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111767142B (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112929290A (en) * | 2021-02-02 | 2021-06-08 | 湖南快乐阳光互动娱乐传媒有限公司 | Current limiting method, device, system, storage medium, equipment and gateway |
| CN114039893A (en) * | 2021-11-08 | 2022-02-11 | 航天信息股份有限公司 | API gateway speed limiting method and device |
| CN114500381A (en) * | 2022-01-20 | 2022-05-13 | 北京奇艺世纪科技有限公司 | Network bandwidth limiting method, system, electronic device and readable storage medium |
| CN114745328A (en) * | 2022-02-16 | 2022-07-12 | 多点生活(成都)科技有限公司 | Dynamic gateway current limiting method and real-time current limiting method formed by same |
| CN114978864A (en) * | 2022-05-18 | 2022-08-30 | 中国工商银行股份有限公司 | Dynamic current-limiting threshold adjusting method and device |
| CN115242718A (en) * | 2022-06-21 | 2022-10-25 | 平安科技（深圳）有限公司 | Cluster current limiting method, device, equipment and medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332785A (en) * | 2017-05-23 | 2017-11-07 | 国家电网公司 | A kind of effective discharge control method based on dynamic duty threshold value |
| CN110996352A (en) * | 2019-12-20 | 2020-04-10 | 众安在线财产保险股份有限公司 | Flow control method and device, computer equipment and storage medium |
| CN111262791A (en) * | 2020-01-08 | 2020-06-09 | 江苏满运软件科技有限公司 | Flow control method and device, electronic equipment and storage medium |
-
2020
- 2020-06-23 CN CN202010578988.5A patent/CN111767142B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107332785A (en) * | 2017-05-23 | 2017-11-07 | 国家电网公司 | A kind of effective discharge control method based on dynamic duty threshold value |
| CN110996352A (en) * | 2019-12-20 | 2020-04-10 | 众安在线财产保险股份有限公司 | Flow control method and device, computer equipment and storage medium |
| CN111262791A (en) * | 2020-01-08 | 2020-06-09 | 江苏满运软件科技有限公司 | Flow control method and device, electronic equipment and storage medium |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112929290A (en) * | 2021-02-02 | 2021-06-08 | 湖南快乐阳光互动娱乐传媒有限公司 | Current limiting method, device, system, storage medium, equipment and gateway |
| CN112929290B (en) * | 2021-02-02 | 2023-02-24 | 湖南快乐阳光互动娱乐传媒有限公司 | Current limiting method, device, system, storage medium, equipment and gateway |
| CN114039893A (en) * | 2021-11-08 | 2022-02-11 | 航天信息股份有限公司 | API gateway speed limiting method and device |
| CN114500381A (en) * | 2022-01-20 | 2022-05-13 | 北京奇艺世纪科技有限公司 | Network bandwidth limiting method, system, electronic device and readable storage medium |
| CN114745328A (en) * | 2022-02-16 | 2022-07-12 | 多点生活(成都)科技有限公司 | Dynamic gateway current limiting method and real-time current limiting method formed by same |
| CN114745328B (en) * | 2022-02-16 | 2023-12-26 | 多点生活(成都)科技有限公司 | Gateway dynamic current limiting method and real-time current limiting method formed by same |
| CN114978864A (en) * | 2022-05-18 | 2022-08-30 | 中国工商银行股份有限公司 | Dynamic current-limiting threshold adjusting method and device |
| CN115242718A (en) * | 2022-06-21 | 2022-10-25 | 平安科技（深圳）有限公司 | Cluster current limiting method, device, equipment and medium |
| CN115242718B (en) * | 2022-06-21 | 2024-01-30 | 平安科技（深圳）有限公司 | Cluster current limiting method, device, equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111767142B (en) | 2023-08-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111767142B (en) | Method for setting current limiting threshold of service node and service terminal equipment | |
| CN110768912B (en) | API gateway current limiting method and device | |
| CN111817974B (en) | Interface current limiting method, device and system based on token bucket and readable storage medium | |
| CN107547433B (en) | Method, device and equipment for current limiting based on token leaky bucket | |
| CN109257758B (en) | Network capacity expansion method and device | |
| CN107451854B (en) | Method and device for determining user type and electronic equipment | |
| CN107957888B (en) | Application program gray scale upgrading method and device | |
| CN112527544B (en) | Server, and method and device for triggering fusing | |
| CN111159195A (en) | Data storage control method and equipment in block chain system | |
| CN111245732A (en) | Flow control method, device and equipment | |
| CN108647102B (en) | Service request processing method and device of heterogeneous system and electronic equipment | |
| CN114124942B (en) | Method and device for scheduling core network resources and electronic equipment | |
| CN110995856B (en) | Method, device and equipment for server expansion and storage medium | |
| CN115361295B (en) | TOPSIS-based resource backup method, device, equipment and medium | |
| CN108470242B (en) | Risk management and control method, device and server | |
| CN115498735A (en) | Fuel cell monomer voltage monitoring method and fuel cell controller | |
| CN114978945A (en) | Network dial testing method, device, system, electronic equipment and storage medium | |
| CN114281474A (en) | Resource adjusting method and device | |
| CN110535785B (en) | Control method and device for sending frequency and distributed system | |
| CN112333110A (en) | Request verification processing method based on funnel flow-limiting model and related equipment | |
| CN113535378A (en) | Resource allocation method, storage medium and terminal equipment | |
| CN112434607B (en) | Feature processing method, device, electronic equipment and computer readable storage medium | |
| CN115150400B (en) | Service fault processing method and device, cloud service platform and storage medium | |
| CN113364871B (en) | Node election method and device based on intelligent contract and electronic equipment | |
| CN109582449B (en) | Wind control task grouping method and device in wind control service system and computer equipment |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |