CN114285799B - Method, device, terminal and storage medium for processing service - Google Patents
Method, device, terminal and storage medium for processing service Download PDFInfo
- Publication number
- CN114285799B CN114285799B CN202111580580.2A CN202111580580A CN114285799B CN 114285799 B CN114285799 B CN 114285799B CN 202111580580 A CN202111580580 A CN 202111580580A CN 114285799 B CN114285799 B CN 114285799B
- Authority
- CN
- China
- Prior art keywords
- request
- service request
- sending
- restrictor
- limited
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000004590 computer program Methods 0.000 claims description 11
- 238000010586 diagram Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 4
- 230000006399 behavior Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Landscapes
- Storage Device Security (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The embodiment of the invention provides a method, a device, a terminal and a storage medium for processing a service, wherein the method comprises the following steps: acquiring a service request; if the service request meets a preset current limiting condition, setting the service request as a limited request; determining a current limiter corresponding to the limited request; generating a specified number of tokens in a unit time by the restrictor; if the number of tokens currently remaining by the restrictor is not zero, assigning a token to the restricted request and executing the restricted request to which the token is assigned. According to the scheme, based on the current limiting adjustment and the setting of the current limiter type token, flexible current limiting adjustment can be achieved on the service request, so that automatic current limiting operation under multiple scenes can be achieved, and efficiency and adaptability are improved.
Description
Technical Field
The present invention relates to the field of service processing technologies, and in particular, to a method, an apparatus, a terminal, and a storage medium for processing a service.
Background
At present, as service requests to be processed are more and more, the load of equipment is larger and larger, all service requests cannot be met, and a lot of service requests are malicious, in this case, the service requests need to be screened, but the current general processing mode is to directly discard the identified service requests after identification, but the direct discarding mode can only deal with the malicious service requests, and cannot well meet the service requests in other scenes.
Thus, there is a need for a better method to solve the problems of the prior art.
Disclosure of Invention
In view of this, the present invention provides a method, apparatus, terminal and storage medium for service processing, which are used to solve the problems in the prior art, and can be suitable for the current limiting requirement in more application scenarios.
Specifically, the present invention proposes the following specific embodiments:
the embodiment of the invention provides a method for processing a service, which comprises the following steps:
acquiring a service request;
if the service request meets a preset current limiting condition, setting the service request as a limited request;
determining a current limiter corresponding to the limited request; generating a specified number of tokens in a unit time by the restrictor;
if the number of tokens currently remaining by the restrictor is not zero, assigning a token to the restricted request and executing the restricted request to which the token is assigned;
and if the number of tokens currently remaining by the current limiter is zero, executing preset limiting operation on the limited request.
In a specific embodiment, the token is stored in a redis cache of the restrictor;
after assigning a token to the restricted request, the method further comprises:
the number of tokens in the redis cache is reduced by one.
In a specific embodiment, the current limiting condition includes: whether a current limiting identifier exists in the service request or not;
the method further comprises the steps of: if the service request has the current limiting identifier, determining that the service request meets the preset current limiting condition.
In a specific embodiment, the current limiting condition further includes: whether the number of times of sending the service request by the user ID sending the service request in unit time is less than a preset first quantity threshold value or not; and/or whether the number of times of sending the service request by the application ID sending the service request in unit time is less than a preset second number threshold;
the method further comprises the steps of: if the number of times of sending the service request in the unit time of sending the service request user ID is not less than a preset first quantity threshold value; or the number of times of sending the service request by the application ID sending the service request in unit time is not less than a preset second number threshold, and then preset limiting operation is executed on the service request.
In a specific embodiment, the method further comprises:
and if the limited request does not have the corresponding restrictor, generating a restrictor as the restrictor corresponding to the limited request.
In a specific embodiment, different types of the restricted requests correspond to different ones of the restrictors; different flow restrictors generate different numbers of tokens in unit time;
and if the limited request does not have a corresponding restrictor, generating a restrictor as the restrictor corresponding to the limited request, including:
if the limited request does not have a corresponding restrictor, determining the type of the limited request;
generating a current limiter based on the type, and taking the generated current limiter as the current limiter corresponding to the limited request.
The embodiment of the invention also provides a device for processing the service, which comprises:
the acquisition module is used for acquiring the service request;
the setting module is used for setting the service request as a limited request if the service request meets a preset current limiting condition;
a restrictor module for determining a restrictor corresponding to the restricted request; generating a specified number of tokens in a unit time by the restrictor;
a first processing module configured to assign a token to the restricted request if the number of tokens currently remaining by the restrictor is not zero, and execute the restricted request to which the token is assigned;
and the second processing module is used for executing preset limiting operation on the limited request if the current residual token number of the current limiter is zero.
In a specific embodiment, the token is stored in a redis cache of the restrictor;
further comprises: an updating module, configured to decrease the number of tokens in the redis cache by one after assigning one token to the restricted request.
The embodiment of the invention also provides a terminal which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the method for processing the service when executing the computer program.
The embodiment of the invention also provides a storage medium, wherein the storage medium stores a computer program, and the computer program is executed to realize the method for processing the service.
In this way, the embodiment of the invention provides a method, a device, a terminal and a storage medium for processing a service, wherein the method comprises the following steps: acquiring a service request; if the service request meets a preset current limiting condition, setting the service request as a limited request; determining a current limiter corresponding to the limited request; generating a specified number of tokens in a unit time by the restrictor; if the number of tokens currently remaining by the restrictor is not zero, assigning a token to the restricted request and executing the restricted request to which the token is assigned. According to the scheme, based on the current limiting adjustment and the setting of the current limiter type token, flexible current limiting adjustment can be achieved on the service request, so that automatic current limiting operation under multiple scenes can be achieved, and efficiency and adaptability are improved.
Drawings
In order to more clearly illustrate the technical solutions of the present invention, the drawings that are required for the embodiments will be briefly described, it being understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope of the present invention. Like elements are numbered alike in the various figures.
Fig. 1 is a schematic flow chart of a method for processing a service according to an embodiment of the present invention;
fig. 2 shows a schematic architecture diagram related to a method for processing a service according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of a specific method for processing a service according to an embodiment of the present invention;
fig. 4 shows a schematic structural diagram of an apparatus for processing a service according to an embodiment of the present invention.
Legend description:
201-an acquisition module; 202-setting up a module; 203-a restrictor module; 204-a first processing module;
205-a second processing module.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments.
The components of the embodiments of the present invention generally described and illustrated in the figures herein may be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the invention, as presented in the figures, is not intended to limit the scope of the invention, as claimed, but is merely representative of selected embodiments of the invention. All other embodiments, which can be made by a person skilled in the art without making any inventive effort, are intended to be within the scope of the present invention.
The terms "comprises," "comprising," "including," or any other variation thereof, are intended to cover a specific feature, number, step, operation, element, component, or combination of the foregoing, which may be used in various embodiments of the present invention, and are not intended to first exclude the presence of or increase the likelihood of one or more other features, numbers, steps, operations, elements, components, or combinations of the foregoing.
Furthermore, the terms "first," "second," "third," and the like are used merely to distinguish between descriptions and should not be construed as indicating or implying relative importance.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which various embodiments of the invention belong. The terms (such as those defined in commonly used dictionaries) will be interpreted as having a meaning that is the same as the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein in connection with the various embodiments of the invention.
Example 1
The embodiment 1 of the invention discloses a method for processing business, which is shown in figure 1 and comprises the following steps:
step S101, obtaining a service request;
step S102, if the service request meets a preset current limiting condition, setting the service request as a limited request;
specifically, after the service request is obtained, the service request needs to be judged, and the limited request, namely the request needing to be limited, is screened out.
In a specific embodiment, the current limiting condition includes: whether a current limiting identifier exists in the service request or not;
the method further comprises the steps of: if the service request has the current limiting identifier, determining that the service request meets the preset current limiting condition.
Specifically, as shown in fig. 2 in a specific application scenario, the scheme of the present solution corresponds to a limit (current limiting layer) therein; the service request after the implementation of the scheme needs the rest control layer, service code layer and data access layer to be processed. Therefore, if the flow limiting identifier does not exist in the service request, the service request is determined not to need to execute the scheme, namely the flow limiting layer is not required to be passed.
Specifically, based on the current limit identifier, different restrictions may be made for different methods.
Further, the current limiting condition further includes: whether the number of times of sending the service request by the user ID sending the service request in unit time is less than a preset first quantity threshold value or not; and/or whether the number of times of sending the service request by the application ID sending the service request in unit time is less than a preset second number threshold;
further, if the traffic request has the current limiting identifier, and the number of times of the traffic request sent by the user ID sending the traffic request in unit time is less than a preset first number threshold; or if the number of times of sending the service request by the application ID sending the service request in unit time is less than a preset second number threshold, the service request may be considered as a limited request.
Thus, the method further comprises: if the number of times of sending the service request in the unit time of sending the service request user ID is not less than a preset first quantity threshold value; or the number of times of sending the service request by the application ID sending the service request in unit time is not less than a preset second number threshold, and then preset limiting operation is executed on the service request.
Specifically, if the service request has the current limiting identifier, and the number of times of sending the service request by the service request user ID in unit time is not less than a preset first quantity threshold; or the number of times of sending the service request by the application ID of the service request in unit time is not less than a preset second number threshold, the service request can be determined to be a limited request, and a limiting operation needs to be performed on the limited request, and the specific limiting operation can be, for example, an operation of discarding the service request, rejecting, waiting for retry, or throwing an exception, etc.
Specifically, the user ID (unique identity) in the current limiting condition is the most important dimension of the current limiting policy, and is limited to frequent operations of a certain user for the current limiting service. Based on this, the behavior of the same user to frequently initiate service requests can be restricted.
As for the application ID, i.e. the ID of APP, it is a unique identification used to distinguish individual products in the business ecology of the whole company. The rules that may limit the flow will also vary for different product services, so this dimension is extracted to formulate different policies. Similar to the user ID, acts to restrict the same application from frequently initiating service requests.
Step S103, determining a current limiter corresponding to the limited request; generating a specified number of tokens in a unit time by the restrictor;
specifically, the number of tokens generated by the restrictor is 120, the time interval is 60, i.e. 120 tokens are generated every 60 seconds, meaning that only 120 requests can be received within 60 seconds. Based on this, under the aforementioned limitations of multiple throttling adjustments, further limitations need to be made based further on whether the token is still present.
In a specific embodiment, further, the token is stored in a redis cache of the restrictor;
after assigning a token to the restricted request, the method further comprises:
the number of tokens in the redis cache is reduced by one.
In particular, because redis is a high availability framework, the atomicity problem of data is guaranteed, so that even if a service server uses a multi-node cluster, the number of tokens can still be guaranteed not to be wrong, and the service server can be supported to be used in a distributed environment.
Step S104, if the number of tokens currently remained by the restrictor is not zero, assigning a token to the limited request, and executing the limited request assigned to the token;
specifically, as shown in fig. 3, if the token generated by the restrictor corresponding to the limited request still remains, the token is given to the limited request, so that the limited request can be normally executed.
Step S105, if the number of tokens currently remaining by the restrictor is zero, executing a preset limiting operation on the limited request.
If the token generated by the current limiter corresponding to the limited request does not have any remaining tokens, the preset limiting operation can be directly performed on the limited request.
Further, the method further comprises:
and if the limited request does not have the corresponding restrictor, generating a restrictor as the restrictor corresponding to the limited request.
Furthermore, different types of the restricted requests correspond to different ones of the restrictors; different flow restrictors generate different numbers of tokens in unit time;
in particular, different types of restricted requests may correspond to different restricted policies, in which case different restrictors may be corresponded to thereby achieve more flexible restricting operations.
And if the limited request does not have a corresponding restrictor, generating a restrictor as the restrictor corresponding to the limited request, including:
if the limited request does not have a corresponding restrictor, determining the type of the limited request;
generating a current limiter based on the type, and taking the generated current limiter as the current limiter corresponding to the limited request.
Specifically, if the restrictor corresponding to the restricted request exists, the redis cache service is called based on the restrictor, if tokens remain, the restricted request token is given, the generated restricted request token number is deducted by 1, if the restricted request does not exist corresponding to the restrictor currently, one restrictor can be newly built and corresponds to the restricted request, the token number is set in the newly built restrictor, the token period is generated, and the operation is executed.
Example 2
In order to further explain the present invention, embodiment 2 of the present invention also discloses a device for processing services, as shown in fig. 4, including:
an obtaining module 201, configured to obtain a service request;
a setting module 202, configured to set the service request as a limited request if the service request meets a preset current limiting condition;
a restrictor module 203, configured to determine a restrictor corresponding to the restricted request; generating a specified number of tokens in a unit time by the restrictor;
a first processing module 204 is configured to assign a token to the restricted request if the number of tokens currently remaining by the restrictor is not zero, and execute the restricted request to which the token is assigned.
And a second processing module 205, configured to execute a preset limiting operation on the limited request if the number of tokens currently remaining by the restrictor is zero.
In a specific embodiment, the token is stored in a redis cache of the restrictor;
further comprises: an updating module, configured to decrease the number of tokens in the redis cache by one after assigning one token to the restricted request.
In a specific embodiment, the current limiting condition includes: whether a current limiting identifier exists in the service request or not;
the apparatus further comprises: and the determining module is used for determining that the service request accords with a preset current limiting condition if the current limiting identifier exists in the service request.
In a specific embodiment, the current limiting condition further includes: whether the number of times of sending the service request by the user ID sending the service request in unit time is less than a preset first quantity threshold value or not; and/or whether the number of times of sending the service request by the application ID sending the service request in unit time is less than a preset second number threshold;
the apparatus further comprises: the third output module is used for sending the service request user ID to the service request server if the number of times of sending the service request in unit time is not less than a preset first quantity threshold value; or the number of times of sending the service request by the application ID sending the service request in unit time is not less than a preset second number threshold, and then preset limiting operation is executed on the service request.
In a specific embodiment, the apparatus further comprises: a generation module for: and if the limited request does not have the corresponding restrictor, generating a restrictor as the restrictor corresponding to the limited request.
In a specific embodiment, different types of the restricted requests correspond to different ones of the restrictors; different flow restrictors generate different numbers of tokens in unit time;
the generating module is used for: if the limited request does not have a corresponding restrictor, determining the type of the limited request;
generating a current limiter based on the type, and taking the generated current limiter as the current limiter corresponding to the limited request.
Example 3
The embodiment 3 of the invention also discloses a terminal which comprises a memory and a processor, wherein the memory stores a computer program, and the processor realizes the method for processing the service in the embodiment when executing the computer program.
Example 4
Embodiment 4 of the present invention also discloses a storage medium in which a computer program is stored, which when executed implements the method for processing services described in embodiment 1.
In this way, the embodiment of the invention provides a method, a device, a terminal and a storage medium for processing a service, wherein the method comprises the following steps: acquiring a service request; if the service request meets a preset current limiting condition, setting the service request as a limited request; determining a current limiter corresponding to the limited request; generating a specified number of tokens in a unit time by the restrictor; if the number of tokens currently remaining by the restrictor is not zero, assigning a token to the restricted request and executing the restricted request to which the token is assigned. According to the scheme, based on the current limiting adjustment and the setting of the current limiter type token, flexible current limiting adjustment can be achieved on the service request, so that automatic current limiting operation under multiple scenes can be achieved, and efficiency and adaptability are improved.
In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other manners as well. The apparatus embodiments described above are merely illustrative, for example, of the flow diagrams and block diagrams in the figures, which illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In addition, functional modules or units in various embodiments of the invention may be integrated together to form a single part, or the modules may exist alone, or two or more modules may be integrated to form a single part.
The functions, if implemented in the form of software functional modules and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a smart phone, a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely illustrative of the present invention, and the present invention is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present invention.
Claims (6)
1. A method of processing traffic, comprising:
acquiring a service request;
the current limiting conditions include: whether a current limiting identifier exists in the service request or not; whether the number of times of sending the service request by the user ID sending the service request in unit time is less than a preset first quantity threshold value or not; whether the number of times of sending the service request by the application ID sending the service request in unit time is less than a preset second number threshold value or not;
if the flow limiting identifier exists in the service request, and the number of times of sending the service request in unit time by sending the service request user ID is not less than a preset first quantity threshold, determining that the service request is a limited request;
if the flow limiting identifier exists in the service request, and the number of times of sending the service request by the application ID sending the service request in unit time is not less than a preset second number threshold, determining that the service request is a limited request;
determining a current limiter corresponding to the limited request; generating a specified number of tokens in a unit time by the restrictor; different types of the restricted requests correspond to different ones of the restrictors; different flow restrictors generate different numbers of tokens in unit time;
if the limited request does not have a corresponding restrictor, determining the type of the limited request;
generating a current limiter based on the type, and taking the generated current limiter as a current limiter corresponding to the limited request;
if the number of tokens currently remaining by the restrictor is not zero, assigning a token to the restricted request and executing the restricted request to which the token is assigned;
and if the number of tokens currently remaining by the current limiter is zero, executing preset limiting operation on the limited request.
2. The method of claim 1, wherein the token is stored in a redis cache of the restrictor;
after assigning a token to the restricted request, the method further comprises:
the number of tokens in the redis cache is reduced by one.
3. An apparatus for processing traffic, comprising:
the acquisition module is used for acquiring the service request;
the current limiting conditions include: whether a current limiting identifier exists in the service request or not; whether the number of times of sending the service request by the user ID sending the service request in unit time is less than a preset first quantity threshold value or not; whether the number of times of sending the service request by the application ID sending the service request in unit time is less than a preset second number threshold value or not;
the setting module is used for determining that the service request is a limited request if the flow limiting identifier exists in the service request and the number of times of sending the service request sent by the service request user ID in unit time is not less than a preset first quantity threshold;
if the flow limiting identifier exists in the service request, and the number of times of sending the service request by the application ID sending the service request in unit time is not less than a preset second number threshold, determining that the service request is a limited request;
a restrictor module for determining a restrictor corresponding to the restricted request; generating a specified number of tokens in a unit time by the restrictor; different types of the restricted requests correspond to different ones of the restrictors; different flow restrictors generate different numbers of tokens in unit time;
the generation module is used for determining the type of the limited request if the limited request does not have a corresponding restrictor;
generating a current limiter based on the type, and taking the generated current limiter as a current limiter corresponding to the limited request;
a first processing module configured to assign a token to the restricted request if the number of tokens currently remaining by the restrictor is not zero, and execute the restricted request to which the token is assigned;
and the second processing module is used for executing preset limiting operation on the limited request if the current residual token number of the current limiter is zero.
4. The apparatus of claim 3, wherein the token is stored in a redis cache of the restrictor;
further comprises: an updating module, configured to decrease the number of tokens in the redis cache by one after assigning one token to the restricted request.
5. A terminal comprising a memory and a processor, wherein the memory stores a computer program, and the processor implements the method for processing services according to claim 1 or 2 when executing the computer program.
6. A storage medium having stored therein a computer program which when executed implements the method of processing a service of claim 1 or 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111580580.2A CN114285799B (en) | 2021-12-22 | 2021-12-22 | Method, device, terminal and storage medium for processing service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111580580.2A CN114285799B (en) | 2021-12-22 | 2021-12-22 | Method, device, terminal and storage medium for processing service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114285799A CN114285799A (en) | 2022-04-05 |
| CN114285799B true CN114285799B (en) | 2024-01-19 |
Family
ID=80873720
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111580580.2A Active CN114285799B (en) | 2021-12-22 | 2021-12-22 | Method, device, terminal and storage medium for processing service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114285799B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108848037A (en) * | 2018-05-31 | 2018-11-20 | 平安医疗科技有限公司 | Service request processing method, device, computer equipment and storage medium |
| CN111726303A (en) * | 2019-03-22 | 2020-09-29 | 阿里巴巴集团控股有限公司 | Flow control method and device and computing equipment |
| CN111901249A (en) * | 2020-07-31 | 2020-11-06 | 深圳前海微众银行股份有限公司 | Service current limiting method, device, equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11159359B2 (en) * | 2019-06-26 | 2021-10-26 | Oracle International Corporation | Methods, systems, and computer readable media for diameter-peer-wide egress rate limiting at diameter relay agent (DRA) |
-
2021
- 2021-12-22 CN CN202111580580.2A patent/CN114285799B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108848037A (en) * | 2018-05-31 | 2018-11-20 | 平安医疗科技有限公司 | Service request processing method, device, computer equipment and storage medium |
| CN111726303A (en) * | 2019-03-22 | 2020-09-29 | 阿里巴巴集团控股有限公司 | Flow control method and device and computing equipment |
| CN111901249A (en) * | 2020-07-31 | 2020-11-06 | 深圳前海微众银行股份有限公司 | Service current limiting method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114285799A (en) | 2022-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10225145B2 (en) | Method and device for updating client | |
| US7454199B2 (en) | System and method for temporary application component deletion and reload on a wireless device | |
| CN111245732B (en) | Flow control method, device and equipment | |
| CN106775981B (en) | Process processing method and device and computer readable medium | |
| US10560385B2 (en) | Method and system for controlling network data traffic in a hierarchical system | |
| CN115002143B (en) | Node election method and device, storage medium and electronic equipment | |
| US20160353461A1 (en) | Modifying a priority for at least one flow class of an application | |
| CN112335217A (en) | Distributed data processing method, device and system and machine readable medium | |
| CN116361755A (en) | Application program login verification method, device, equipment and storage medium | |
| CN114285799B (en) | Method, device, terminal and storage medium for processing service | |
| CN107180048B (en) | Method and device for identifying idempotent states in database | |
| CN109587218B (en) | Cluster election method and device | |
| CN115242872B (en) | Data processing method, device, computer equipment and readable storage medium | |
| CN116346728A (en) | Low code platform current limiting method and device | |
| CN108259214B (en) | Configuration command management method, device and machine-readable storage medium | |
| US20170208018A1 (en) | Methods and apparatuses for using exhaustible network resources | |
| CN110780944A (en) | Application permission starting method and device and machine-readable storage medium | |
| CN114422576A (en) | Session cleaning method and device, computer equipment and readable storage medium | |
| CN113347110A (en) | Flow control method, flow control device, storage medium and equipment | |
| CN111371818B (en) | Data request verification method, device and equipment | |
| CN108471422B (en) | Method, device, server and medium for judging remote login | |
| CN110837431A (en) | Service control method, service control device, computer equipment and computer-readable storage medium | |
| CN112446191A (en) | Text processing method, device, equipment and storage medium | |
| CN113179252B (en) | Security policy management method, device, equipment and machine-readable storage medium | |
| CN112115020B (en) | Database connection pool abnormity monitoring method and device 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 |