CN115022244A - Current limiting method and device, processor and electronic equipment - Google Patents
Current limiting method and device, processor and electronic equipment Download PDFInfo
- Publication number
- CN115022244A CN115022244A CN202210857532.1A CN202210857532A CN115022244A CN 115022244 A CN115022244 A CN 115022244A CN 202210857532 A CN202210857532 A CN 202210857532A CN 115022244 A CN115022244 A CN 115022244A
- Authority
- CN
- China
- Prior art keywords
- transaction
- time window
- flow
- time
- determining
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 78
- 230000000670 limiting effect Effects 0.000 title claims abstract description 76
- 230000000977 initiatory effect Effects 0.000 claims abstract description 21
- 230000004044 response Effects 0.000 claims description 12
- 238000012544 monitoring process Methods 0.000 claims description 6
- 238000012545 processing Methods 0.000 description 31
- 238000004422 calculation algorithm Methods 0.000 description 22
- 238000010586 diagram Methods 0.000 description 14
- 230000008569 process Effects 0.000 description 14
- 238000005516 engineering process Methods 0.000 description 13
- 238000004590 computer program Methods 0.000 description 10
- 230000007246 mechanism Effects 0.000 description 8
- 238000009825 accumulation Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 5
- 230000006870 function Effects 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 3
- 230000008520 organization Effects 0.000 description 3
- 239000000243 solution Substances 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 2
- 238000001514 detection method Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000007619 statistical method Methods 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000036961 partial effect Effects 0.000 description 1
- 230000002829 reductive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/20—Traffic policing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
- H04L47/562—Attaching a time tag to queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/82—Miscellaneous aspects
- H04L47/826—Involving periods of time
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Debugging And Monitoring (AREA)
Abstract
The application discloses a current limiting method, a current limiting device, a processor and electronic equipment. Relates to the field of information security, and the method comprises the following steps: acquiring a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; counting the total transaction number of the transaction transactions being executed in the counting time window; rejecting the transaction request if the total number of transactions exceeds a preset threshold. Through the application, the problem that the current-limiting objects cannot be accurately counted in the related art is solved.
Description
Technical Field
The present application relates to the field of information security, and in particular, to a current limiting method, device, processor, and electronic device.
Background
In the development of distributed systems, high concurrency is inevitably encountered, and throttling is a way to protect the system by controlling the flow. There are many existing current limiting algorithms, the most common of which are counter algorithms, token bucket algorithms, leaky bucket algorithms, etc.
The common algorithms have respective advantages and disadvantages, are usually suitable for a certain single scene, and often cannot process special scenes in some applications in the using process. For example, counter algorithms have fatal time critical problems; the token bucket algorithm cannot control the burst traffic; although the leaky bucket algorithm can smooth the burst traffic on the network, a serious problem may also occur in a special scenario, for example, in a distributed system, when a PaaS container is down due to an excessively large number of requests, an operation of normally decreasing (leaky bucket discharging water at a constant speed) is no longer performed, so that the count is inaccurate, and in an extreme case, the server is continuously restarted and down, or other servers are still limited in current when the number of requests is low. In addition, in comparison with the control of the number of requests per unit time (QPS), there is a general tendency in practical applications to control the number of concurrent Transactions (TPS), which is also not easily achieved with the above algorithm.
For an actual distributed system, service scenarios are often complex or specific, and the following requirements cannot be well realized by using a single current limiting method: not only realizing the current limitation of transactions, but also controlling the instantaneous flow, and considering the problem that the transactions can not be accurately counted in an extreme scene
Aiming at the problem that the current limiting objects cannot be accurately counted in the related technology, an effective solution is not provided at present.
Disclosure of Invention
The present application mainly aims to provide a current limiting method, a current limiting device, a processor, and an electronic device, so as to solve the problem of accurately counting current limiting objects in the related art.
In order to achieve the above object, according to one aspect of the present application, there is provided a current limiting method. The method comprises the following steps: acquiring a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; counting the total transaction number of the transaction transactions being executed in the counting time window; and rejecting the transaction request when the total transaction quantity exceeds a preset threshold value.
Optionally, counting the transaction number of transaction transactions being executed within the statistical time window includes: determining an access object to which the transaction request is directed; acquiring a time window sequence of the access object, wherein the time window sequence comprises at least one flow time window, and each flow time window is used for recording transaction transactions which are executed in a preset time period; selecting at least one traffic time window to be counted corresponding to the counting time window in the time window sequence; and counting the total transaction number of at least one traffic time window to be counted.
Optionally, obtaining the time window sequence of the access object includes: identifying a target object that initiated the transaction request; acquiring at least one transaction of the target object; adding a timestamp and identification information for each transaction according to the transaction time, wherein the identification information is determined according to the timestamp and a random number; logging at least one transaction into the corresponding flow time window according to the timestamp; and arranging at least one flow time window according to a time sequence to obtain the time window sequence.
Optionally, entering at least one of the transaction transactions into the corresponding flow time window according to the timestamp includes: arranging at least one transaction according to the time sequence according to the time stamp to obtain a transaction sequence; dividing the transaction sequence into a plurality of transaction sets according to a preset time period indicated by the flow time window; and recording each transaction set into the corresponding flow time window.
Optionally, selecting at least one to-be-counted traffic time window corresponding to the counting time window in the time window sequence includes: determining a time start point and a time end point of the sliding time window; determining the flow time window corresponding to the time starting point as a first flow time window; determining the flow time window corresponding to the time end point as a second flow time window; and determining the first flow time window, the second flow time window and a flow time window between the first flow time window and the second flow time window as the flow time window to be counted.
Optionally, the counting the number of transactions in at least one traffic time window to be counted includes: counting the window transaction number of transaction transactions in each flow time window to be counted; and accumulating the window transaction number to determine the total transaction number.
Optionally, after determining the total transaction number of transaction transactions being executed within the statistical time window, the method further comprises: responding to the transaction request under the condition that the total transaction number does not exceed a preset threshold value; recording transaction transactions generated in response to the transaction requests; monitoring a transaction state of the transaction; and deleting the record of the transaction when the transaction state is the transaction end.
In order to achieve the above object, according to another aspect of the present application, there is provided a current limiting device. The device includes: the acquisition module is used for acquiring a transaction request; the determining module is used for determining a statistical time window with preset duration by taking the initiation time of the transaction request as a time starting point; the counting module is used for counting the total transaction quantity of the transaction transactions which are executed in the counting time window; and the current limiting module is used for rejecting the transaction request under the condition that the total transaction quantity exceeds a preset threshold value.
To achieve the above object, according to another aspect of the present application, there is provided a processor. The processor is used for running a program, wherein the program runs to execute the current limiting method.
To achieve the above object, according to another aspect of the present application, there is provided an electronic device. The electronic device comprises one or more processors and a memory for storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the current limiting method described above.
Through the application, the following steps are adopted: acquiring a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; determining a total transaction number of transaction transactions being executed within a statistical time window; refusing the transaction request under the condition that the total transaction number exceeds a preset threshold value; the problem that the current-limiting objects cannot be accurately counted in the related technology is solved; the transaction is executed according to the definition of the statistical time window, so that the flow limitation is performed according to the transaction which is executed, the purpose of performing flow limitation based on the transaction processing amount per second (TPS) is realized, and compared with the scheme of performing flow limitation based on the query rate per second (QPS) in the prior art, the flow limitation based on the transaction processing amount per second (TPS) can perform flow limitation more accurately according to the processing capacity of the transaction; and because the statistical time window in the application is defined according to the transaction initiation time, the accumulation condition of historical transaction does not exist, compared with the scheme that the window is added in the sliding time window according to a fixed time interval used by the existing sliding time window technology, the statistical method can more accurately count the transaction transactions being executed, and the technical effect of accurately counting the current-limiting objects is achieved.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the application and, together with the description, serve to explain the application and are not intended to limit the application. In the drawings:
fig. 1 is a flow chart of a method for limiting current according to an embodiment of the present application;
FIG. 2 is a schematic diagram of a statistical time window provided in accordance with an embodiment of the present application;
FIG. 3 is a schematic diagram of a distributed global current limiting mechanism improved based on a sliding window algorithm according to an embodiment of the present application;
FIG. 4 is a schematic view of a current limiting device according to an embodiment of the present application;
fig. 5 is a schematic diagram of an electronic device according to an embodiment of the application.
Detailed Description
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
In order to make the technical solutions better understood by those skilled in the art, 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 partial embodiments of the present application, but not all 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.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the accompanying drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the application described herein may be used. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
For convenience of description, some terms or expressions referred to in the embodiments of the present application are explained below:
distributed application: the method refers to a working mode that application programs are distributed on different computers and jointly complete a task through a network.
Current limiting: the number of requests in a time window is limited, the availability and the stability of the system are maintained, and the slow operation or the downtime of the system caused by the sudden increase of the flow is prevented.
And (3) global current limiting: distinguished from single point current limiting. Single point flow limitation only performs traffic limitation of transaction requests for a single server, while global flow limitation enables one overall flow control for all servers in a distributed application.
The Token Bucket algorithm (Token Bucket) is one of the most commonly used current limiting algorithms to control the amount of data sent onto the network and to allow the transmission of bursts of data.
The leakage Bucket algorithm (leak Bucket) is mainly used for controlling the rate of data injection into the network and smoothing the burst traffic on the network.
It should be noted that relevant information (including but not limited to user equipment information, user personal information, etc.) and data (including but not limited to data for presentation, analyzed data, etc.) referred to in the present disclosure are information and data that are authorized by the user or sufficiently authorized by various parties. For example, an interface is provided between the system and the relevant user or organization, before obtaining the relevant information, an obtaining request needs to be sent to the user or organization through the interface, and after receiving the consent information fed back by the user or organization, the relevant information is obtained.
The present invention is described below with reference to preferred implementation steps, and fig. 1 is a flowchart of a current limiting method provided in an embodiment of the present application, and as shown in fig. 1, the method includes the following steps:
step S102, acquiring a transaction request;
step S104, taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration;
step S106, determining the total transaction quantity of the transaction transactions being executed in the statistical time window;
and step S108, refusing the transaction request under the condition that the total transaction number exceeds a preset threshold value.
Acquiring a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; determining a total transaction number of transaction transactions being executed within a statistical time window; refusing the transaction request under the condition that the total transaction quantity exceeds a preset threshold value; the problem that the current-limiting objects cannot be accurately counted in the related technology is solved; the transaction is executed according to the definition of the statistical time window, so that the flow limitation is performed according to the transaction which is executed, the purpose of performing flow limitation based on the transaction processing amount per second (TPS) is realized, and compared with the scheme of performing flow limitation based on the query rate per second (QPS) in the prior art, the flow limitation based on the transaction processing amount per second (TPS) can perform flow limitation more accurately according to the processing capacity of the transaction; and because the statistical time window in the application is defined according to the transaction initiation time, the accumulation condition of historical transaction does not exist, compared with the scheme that the window is added in the sliding time window according to a fixed time interval used by the existing sliding time window technology, the statistical method can more accurately count the transaction transactions being executed, and the technical effect of accurately counting the current-limiting objects is achieved.
The current limiting method can be applied to the development process of a distributed system, and the problem of high concurrency of transaction transactions is avoided.
In the above step S102, the object of acquiring the transaction request may be a server. At the server side, the server receives the transaction request, processes the transaction request and then takes the process of returning the processing result as a complete transaction.
Note that TPS: transactions Per Second, meaning number of Transactions Per Second; and QPS: queries Per Second, meaning query rate Per Second, may include multiple Queries Per transaction.
For example, if a transaction includes 3 server response events, and the processing event of a transaction is 1S, the statistical result of the TPS is 1, and the statistical result of the QPS is 3.
In the step S102, in response to the transaction request, the device for performing the transaction action may be a distributed server, and the execution capacity of each server is limited, so as to avoid a high concurrency problem occurring during the transaction action performed by the server, and therefore, before responding to the transaction request, it is necessary to count the transaction transactions being executed, determine the total number of transactions, and then determine whether to respond to the transaction request according to the total number of transactions.
Optionally, the current limiting method provided by the present invention may be applied to each node of a distributed system to be arranged independently, and may be arranged globally in the distributed system.
In step S106, the transaction generated in response to the transaction request in each time period may be recorded through the traffic time window.
In step S106, the statistical time window is a fixed-width time window, i.e. the time period represented by the statistical time window is fixed, and the transaction generated by the transaction request responding in the specified time period can be determined through the statistical time window.
Optionally, in the current limiting method provided in the embodiment of the present application, counting the number of transactions of the transaction transactions being executed within the time window includes: determining an access object to which the transaction request is directed; acquiring a time window sequence of an access object, wherein the time window sequence comprises at least one flow time window, and each flow time window is used for recording transaction transactions which are executed in a preset time period; selecting at least one flow time window to be counted corresponding to the counting time window in the time window sequence; and counting the total transaction number of at least one traffic time window to be counted.
Alternatively, the access object may be the object that obtains the transaction request, such as a server.
In the above embodiment of the present invention, after receiving the transaction request, statistics needs to be performed on the transaction transactions generated in response to the transaction request, in the statistics process, a time window sequence can be established according to the initiation time of the transaction request, flow time windows are set in the time window sequence according to the time sequence, and each flow time window records the transaction transactions generated in response to the transaction request in each preset time period; further, under the condition that the total transaction number of the statistical time window is determined, the flow time window included in the statistical time window can be circled in the time window sequence, and the total transaction number is counted according to the circled flow time window; because the flow time windows in the statistical window sequence are arranged according to the time sequence, after the time starting point of the statistical time window is determined, the statistical time window can be quickly defined based on the time window sequence, and the selection of the statistical time window is convenient.
In step S106, the statistical time window is a fixed-width time window, and each traffic time window corresponds to a preset time period, the statistical time window may include a preset number of traffic time windows, and the total transaction number of the transaction transactions in the statistical time window may be determined by performing statistics on the transaction transactions in each traffic time window in the statistical time window.
Fig. 2 is a schematic diagram of a statistical time window provided according to an embodiment of the present application, and as shown in fig. 2, the statistical time window is a fixed-width time window, and this sliding time window is circled by using score of zset basic data type of Redis. The zset data type corresponds to an ordered set, with the order of different value values being differentiated by score size.
In step S106, the counting time window is defined again every time the total transaction number is counted.
In the above step S108, in the case that the total transaction number exceeds the preset threshold, it indicates that the transaction being executed has reached the maximum execution number, and therefore, in order to ensure the correct execution of the transaction, the subsequent transaction request needs to be rejected, and the current limiting operation needs to be executed.
In the step S108, when the total transaction number exceeds the preset threshold, an alarm message is triggered to prompt that the transaction number being executed has reached the maximum execution number.
The technical scheme provided by the invention is improved based on the original sliding window algorithm, forms a sliding window mixed counting algorithm (namely, a counting algorithm according to a statistical time window), strives to accurately control the transaction concurrence and simultaneously stably cope with a sudden scene, and avoids the problem that new current is introduced due to the loss of size.
The technical scheme provided by the invention is improved based on a simple sliding window algorithm, and the sliding window is embedded in a time window sequence and continuously moves forwards, and the number contained in the window is limited and fixed. Whenever a transaction enters, it is placed in the most advanced position in the time window sequence (ordered by the incoming timestamp of the transaction), at which point the number of flow meters in the window is incremented by one; when the transaction is finished, the transaction is cleared, and the number of flow meters in the window is reduced by one. This allows only a fixed number of transactions to be conducted simultaneously over a period of time, i.e. instant concurrency is limited. Meanwhile, the statistical time window is realized based on the timestamp, and the transaction is finally removed out of the window along with the time, so that even if the service request is overtime in a peak period or the server is down to cause no service response and other special scenes, the counting accuracy is not influenced.
Optionally, operations such as calculation and storage of data are realized through an Rdis database, so that the requirement that servers share the same data storage space in distributed application can be met, and more accurate global current limiting is realized.
Alternatively, multiple transaction transactions for the same target object may be represented by the same sequence of time windows.
Optionally, in the current limiting method provided in the embodiment of the present application, the obtaining a time window sequence of an access object includes: identifying a target object that initiated the transaction request; acquiring at least one transaction of a target object; adding a timestamp and identification information for each transaction according to the transaction time, wherein the identification information is determined according to the timestamp and a random number; logging at least one transaction into a corresponding flow time window according to the timestamp; and arranging at least one flow time window according to the time sequence to obtain a time window sequence.
In the actual operation process, each user transaction is stored by using a zset, and the key value of the set is as follows: user number + transaction name, zset { (score1, value1), (score2, value2),. }, where each (score, value) represents the call record for each transaction.
According to the embodiment of the invention, the transaction table of each target object can be recorded through the user number + the transaction name, and the transaction table can record the transaction of the target object through the zset data type, wherein score is Long type data, record millisecond timestamp is used for representing the timestamp of the transaction, value is String type data, record timestamp + random number is used for representing the identification information of the transaction, so that the problem that the transaction is covered when multiple calls are instantaneously called to cause inaccurate final current limiting statistics can be avoided, and the multiple calls which are concurrently carried out at the same time can be distinguished through the identification information.
In the above embodiment of the present invention, under the condition that the transaction transactions are recorded by using the flow time windows, each flow time window corresponds to a preset time period, the transaction transactions can be filled into the corresponding flow time window according to the timestamp of each transaction, and the flow time windows are ordered according to the time sequence, so as to obtain the time window sequence.
Optionally, in the method for throttling current provided in this embodiment of the present application, posting at least one transaction into a corresponding current time window according to the timestamp includes: arranging at least one transaction according to the time sequence according to the time stamp to obtain a transaction sequence; dividing the transaction sequence into a plurality of transaction sets according to a preset time period indicated by the flow time window; each set of transaction transactions is logged into a corresponding traffic time window.
In the above embodiment of the present invention, under the condition that the transaction is recorded by using the flow time window, the transaction may be ordered according to the time sequence based on the timestamp, so as to obtain the transaction sequence, and according to the preset time period indicated by the flow time window, the transaction sequence arranged according to the time sequence may be divided into a plurality of transaction sets, so that each transaction set may represent the transaction generated within the corresponding preset time period, and further, the corresponding flow time window is entered according to the transaction set, so as to achieve the purpose of recording the transaction through the flow time window.
For example, the first traffic time window represents a first time period, the second traffic time window represents a second time period, the transaction sequence may be divided into a first transaction set corresponding to the first time period and a second transaction set corresponding to the second time period, and then the transaction transactions in the first transaction set may be logged into the first traffic time window, and the transaction transactions in the second transaction set may be logged into the second traffic time window.
Optionally, in the current limiting method provided in the embodiment of the present application, selecting at least one to-be-counted traffic time window corresponding to the counting time window in the time window sequence includes: determining a time starting point and a time end point of a statistical time window; determining a flow time window corresponding to the time starting point as a first flow time window; determining a flow time window corresponding to the time end point as a second flow time window; and determining a first flow time window, a second flow time window and a flow time window between the first flow time window and the second flow time window as the flow time window to be counted.
Alternatively, the time end point may be determined according to the time start point and the width of the statistical time window (i.e., the preset duration).
In the above embodiment of the present invention, the first traffic window corresponding to the start time and the second traffic window corresponding to the end time of the statistical time window are determined in the time window sequence, and then the first traffic window, the second traffic window, and the traffic window between the first traffic window and the second traffic window are determined in the time window sequence as the time window to be counted, so as to determine the time window to be counted.
Optionally, in the flow limiting method provided in the embodiment of the present application, the counting the number of transactions in at least one to-be-counted flow time window includes: counting the window transaction number of transaction transactions in each flow time window to be counted; and accumulating the window transaction number to determine the total transaction number.
In the above embodiment of the present invention, the statistical time window includes the preset number of flow time windows, so that the total transaction number of the transaction transactions in the statistical time window is counted, that is, the window transaction number of the statistical time window for counting the preset number of transaction transactions is obtained, after the statistical time window is determined, the flow time window in the statistical time window can be determined as the flow time window to be counted, the transaction transactions in the flow time window to be counted are respectively counted, the window transaction number of each flow time window to be counted is determined, and the window transaction numbers of the preset number of flow time windows to be counted are accumulated, so that the total transaction number can be determined, thereby realizing the statistics of the total transaction number in the statistical time window.
Optionally, in the method for limiting current provided in this embodiment of the present application, after determining the total transaction number of the transaction transactions being executed within the statistical time window, the method further includes: responding to the transaction request under the condition that the total transaction number does not exceed a preset threshold value; recording transaction transactions generated in response to the transaction requests; monitoring a transaction state of a transaction; and deleting the record of the transaction when the transaction state is the transaction end.
In the above embodiment of the present invention, under the condition that the total transaction amount does not exceed the preset threshold, it indicates that the transaction being executed does not reach the maximum execution amount, and the transaction request can be responded to at present, and further the transaction generated by responding to the transaction request is recorded through the flow time window, and the transaction state of the transaction is detected in the transaction process, and after the transaction is finished, the record of the transaction is deleted, so as to avoid the transaction that has finished the transaction from interfering with the statistical result, and ensure the accuracy of the statistical result.
The current limiting method provided by the embodiment of the application acquires a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; determining a total transaction number of transaction transactions being executed within a statistical time window; refusing the transaction request under the condition that the total transaction number exceeds a preset threshold value; the problem that the current-limiting objects cannot be accurately counted in the related technology is solved; the transaction is executed according to the definition of the statistical time window, so that the flow limitation is performed according to the transaction which is executed, the purpose of performing flow limitation based on the transaction processing amount per second (TPS) is realized, and compared with the scheme of performing flow limitation based on the query rate per second (QPS) in the prior art, the flow limitation based on the transaction processing amount per second (TPS) can perform flow limitation more accurately according to the processing capacity of the transaction; and because the statistical time window in the application is defined according to the transaction initiation time, the accumulation condition of historical transaction does not exist, compared with the scheme that the window is added in the sliding time window according to a fixed time interval, which is used in the existing sliding time window technology, the transaction which is being executed can be more accurately counted, and the technical effect of accurately counting the current-limiting object is achieved.
The present invention also provides a preferred embodiment, which provides an improved distributed global current limiting mechanism based on a sliding window algorithm, i.e. a current limiting mechanism according to a statistical time window.
Fig. 3 is a schematic diagram of a distributed global current limiting mechanism improved based on a sliding window algorithm according to an embodiment of the present application, and as shown in fig. 3, a tangent plane in a Spring framework is used, when a transaction enters, a series of operations are started, whether the transaction is overrun is judged, and then a transaction record is deleted after the transaction is ended.
As an optional embodiment, as shown in fig. 3, after a container for responding to a transaction request is started, obtaining a current-limiting configuration and initializing, then starting execution of a ring-shaped plane, determining whether to execute current limiting, if not, performing tool class calling, performing transaction service, storing the current calling (i.e., recording transaction transactions) on Redis, dynamically calculating the total transaction number within a statistical time window, then determining whether the total transaction number exceeds a preset threshold, and if not, returning the transaction service normally; if the current exceeds the preset threshold value, the transaction service returns and reports an error, and an alarm is given out to limit the current.
Optionally, after determining to perform current limiting, the reconnection number of the transaction service (i.e. the transaction request) may be checked, and if the reconnection number of the transaction service (i.e. the transaction request) exceeds an abnormal threshold, an error is reported; the number of reconnections for the transaction service (i.e., transaction request) may be stored on the Redis.
Optionally, after the transaction is executed, the post-section is executed, the tool for transaction service is called, and the call record stored in the Redis at this time is deleted (i.e., the transaction at this time is deleted).
Optionally, when a transaction enters, it is only necessary to count whether a current throttling value within this statistical time window (which may be set as the timeout time of the transaction) exceeds a threshold, and two steps of operation of respectively circling out the statistical time window and calculating the total transaction number within the window may be performed by using methods of redis. If the concurrent threshold value (namely the preset threshold value) is exceeded, an error report of exceeding the current limiting threshold value is returned, and an alarm mechanism can be added when the transaction is rejected, so that operation and maintenance personnel can be prompted to analyze or add manual intervention. When the transaction is finished, a Redis.zrem () method is called to delete the transaction.
Optionally, the current limiting mechanism provided by the present invention may support current limiting in different dimensions by configuring a current limiting mechanism effective node autonomously, and when only a single node is configured, single-point current limiting is performed, that is, current limiting control is performed only for a service of a single container, and other containers do not come into a control range, and when nodes are not configured, current limiting control is performed on all nodes by default, that is, global current limiting is performed. In addition, the current limiting control can be performed on the service call of a single group, and the current limiting control of the dimension of service + method can also be performed on all groups respectively. The multi-dimensional current limiting control is beneficial to performing trial verification work in the early stage of popularization, and is beneficial to more accurately evaluating the current limiting threshold while reducing the influence on customers.
The technical scheme provided by the invention can accurately control the entering of the instantaneous flow, avoid the damage of the system caused by the burst flow in the peak period of the transaction and ensure the availability of the system. Meanwhile, the mechanism of counting the time window can avoid the problem that the current-limiting counting of other containers is influenced because the counting cannot be decreased after a single container is damaged. More importantly, the algorithm limits the concurrent number of transactions rather than the request number in unit time, so that the algorithm is more reasonable and humanized for actual service scenes. By combining with the use of Redis, the algorithm can well perform unified flow management on the whole processing capacity of the service cluster, and is an effective means for protecting a distributed system.
It should be noted that the steps illustrated in the flowcharts of the figures may be performed in a computer system such as a set of computer-executable instructions and that, although a logical order is illustrated in the flowcharts, in some cases, the steps illustrated or described may be performed in an order different than here.
The embodiment of the present application further provides a current limiting device, and it should be noted that the current limiting device according to the embodiment of the present application may be used to execute the method for limiting current provided by the embodiment of the present application. The following describes a current limiting device provided in an embodiment of the present application.
Fig. 4 is a schematic view of a current limiting device according to an embodiment of the present application. As shown in fig. 4, the apparatus includes: an obtaining module 42, configured to obtain a transaction request; the first determining module 44 is configured to determine a statistical time window of a preset duration by using the initiation time of the transaction request as a time starting point; a second determining module 46 for determining a total transaction number of transaction transactions being executed within the statistical time window; and a current limiting module 48, configured to reject the transaction request if the total number of transactions exceeds a preset threshold.
It should be noted that the obtaining module 42 in this embodiment may be configured to execute step S102 in this embodiment, the first determining module 44 in this embodiment may be configured to execute step S104 in this embodiment, the second determining module 46 in this embodiment may be configured to execute step S106 in this embodiment, and the current limiting module 48 in this embodiment may be configured to execute step S108 in this embodiment. The modules are the same as the corresponding steps in the realized examples and application scenarios, but are not limited to the disclosure of the above embodiments.
In the above embodiment of the present invention, a transaction request is obtained; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; determining a total transaction number of transaction transactions being executed within a statistical time window; refusing the transaction request under the condition that the total transaction number exceeds a preset threshold value; the problem that the current-limiting objects cannot be accurately counted in the related technology is solved; the transaction is executed according to the definition of the statistical time window, so that the flow limitation is performed according to the transaction which is executed, the purpose of performing flow limitation based on the transaction processing amount per second (TPS) is realized, and compared with the scheme of performing flow limitation based on the query rate per second (QPS) in the prior art, the flow limitation based on the transaction processing amount per second (TPS) can perform flow limitation more accurately according to the processing capacity of the transaction; and because the statistical time window in the application is defined according to the transaction initiation time, the accumulation condition of historical transaction does not exist, compared with the scheme that the window is added in the sliding time window according to a fixed time interval, which is used in the existing sliding time window technology, the transaction which is being executed can be more accurately counted, and the technical effect of accurately counting the current-limiting object is achieved.
Optionally, in the current limiting apparatus provided in the embodiment of the present application, the second determining module includes: a determination unit, configured to determine an access object to which the transaction request is directed; the system comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring a time window sequence of an access object, the time window sequence comprises at least one flow time window, and each flow time window is used for recording transaction transactions which are executed in a preset time period; the selection unit is used for selecting at least one to-be-counted flow time window corresponding to the counting time window in the time window sequence; and the counting unit is used for counting the total transaction quantity of at least one flow time window to be counted.
Optionally, in the current limiting device provided in the embodiment of the present application, the obtaining unit includes: an identification unit for identifying a target object initiating a transaction request; an acquisition subunit, configured to acquire at least one transaction of a target object; the adding unit is used for adding a timestamp and identification information to each transaction according to the transaction time, wherein the identification information is determined according to the timestamp and the random number; the recording unit is used for recording at least one transaction into a corresponding flow time window according to the timestamp; and the sequencing unit is used for sequencing at least one flow time window according to the time sequence to obtain a time window sequence.
Optionally, in the current limiting apparatus provided in the embodiment of the present application, the recording unit includes: the ordering subunit is used for arranging at least one transaction according to the time sequence according to the time stamp to obtain a transaction sequence; the dividing subunit is used for dividing the transaction sequence into a plurality of transaction sets according to the preset time period indicated by the flow time window; and the recording subunit is used for recording each transaction set into the corresponding flow time window.
Optionally, in the current limiting device provided in the embodiment of the present application, the selecting unit includes: the first determining subunit is used for determining a time starting point and a time ending point of the statistical time window; the second determining subunit is configured to determine that the traffic time window corresponding to the time starting point is the first traffic time window; the third determining subunit is configured to determine that a traffic time window corresponding to the time endpoint is a second traffic time window; and the fourth determining subunit is configured to determine the first traffic time window, the second traffic time window, and a traffic time window between the first traffic time window and the second traffic time window as a traffic time window to be counted.
Optionally, in the current limiting apparatus provided in the embodiment of the present application, the second determining module includes: the counting subunit is used for counting the window transaction number of the transaction transactions in each flow time window to be counted; and the accumulation subunit is used for accumulating the window transaction number and determining the total transaction number.
Optionally, in the current limiting device provided in the embodiment of the present application, the device further includes: the execution module is used for responding to the transaction request under the condition that the total transaction number does not exceed a preset threshold after the total transaction number of the transaction transactions which are executed in the statistical time window is determined; the recording module is used for recording the transaction generated in response to the transaction request; the detection module is used for monitoring the transaction state of the transaction; and the deleting module is used for deleting the records of the transaction transactions under the condition that the transaction state is the transaction end.
The current limiting device provided by the embodiment of the application acquires a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; determining a total transaction number of transaction transactions being executed within a statistical time window; refusing the transaction request under the condition that the total transaction number exceeds a preset threshold value; the problem that the current-limiting objects cannot be accurately counted in the related technology is solved; the transaction is executed according to the definition of the statistical time window, so that the flow limitation is performed according to the transaction which is executed, the purpose of performing flow limitation based on the transaction processing amount per second (TPS) is realized, and compared with the scheme of performing flow limitation based on the query rate per second (QPS) in the prior art, the flow limitation based on the transaction processing amount per second (TPS) can perform flow limitation more accurately according to the processing capacity of the transaction; and because the statistical time window in the application is defined according to the transaction initiation time, the accumulation condition of historical transaction does not exist, compared with the scheme that the window is added in the sliding time window according to a fixed time interval, which is used in the existing sliding time window technology, the transaction which is being executed can be more accurately counted, and the technical effect of accurately counting the current-limiting object is achieved.
The current limiting device comprises a processor and a memory, wherein the detection module 42, the statistic module 44, the current limiting module 46 and the like are stored in the memory as program units, and the processor executes the program units stored in the memory to realize corresponding functions.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. The kernel can be set to be one or more than one, and the current limiting object is accurately counted by adjusting the kernel parameters.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
An embodiment of the present invention provides a computer-readable storage medium on which a program is stored, the program implementing the current limiting method when executed by a processor.
The embodiment of the invention provides a processor, which is used for running a program, wherein the program executes the current limiting method during running.
Fig. 5 is a schematic diagram of an electronic device according to an embodiment of the present application, and as shown in fig. 5, an embodiment of the present invention provides an electronic device 50, which includes a processor 52, a memory 54, and a program stored in the memory and executable on the processor, and the processor executes the program to implement the following steps: acquiring a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; determining a total transaction number of transaction transactions being executed within a statistical time window; and rejecting the transaction request under the condition that the total transaction number of the transaction transactions exceeds a preset threshold value.
Optionally, the processor executes the program to implement the following steps: determining an access object to which a transaction request is directed; determining an access object to which the transaction request is directed; acquiring a time window sequence of an access object, wherein the time window sequence comprises at least one flow time window, and each flow time window is used for recording transaction transactions which are executed within a preset time period; selecting at least one flow time window to be counted corresponding to the counting time window in the time window sequence; and counting the total transaction number of at least one traffic time window to be counted.
Optionally, the processor executes the program to implement the following steps: identifying a target object that initiated the transaction request; acquiring at least one transaction of a target object; adding a timestamp and identification information for each transaction according to the transaction time, wherein the identification information is determined according to the timestamp and a random number; logging at least one transaction into a corresponding flow time window according to the timestamp; and arranging at least one flow time window according to the time sequence to obtain a time window sequence.
Optionally, the processor executes the program to implement the following steps: arranging at least one transaction according to the time sequence according to the time stamp to obtain a transaction sequence; dividing the transaction sequence into a plurality of transaction sets according to a preset time period indicated by the flow time window; each set of transaction transactions is logged into a corresponding traffic time window.
Optionally, the processor executes the program to implement the following steps: determining a time starting point and a time end point of a statistical time window; determining a flow time window corresponding to the time starting point as a first flow time window; determining a flow time window corresponding to the time end point as a second flow time window; and determining a first flow time window, a second flow time window and a flow time window between the first flow time window and the second flow time window as the flow time window to be counted.
Optionally, the processor executes the program to implement the following steps: counting the window transaction number of transaction transactions in each flow time window to be counted; and accumulating the window transaction number to determine the total transaction number.
Optionally, the processor executes the program to implement the following steps: after determining the total transaction number of the transaction transactions executing in the statistical time window, responding to the transaction request under the condition that the total transaction number does not exceed a preset threshold value; recording transaction transactions generated in response to the transaction requests; monitoring a transaction state of a transaction; and deleting the record of the transaction when the transaction state is the transaction end.
The device herein may be a server, a PC, a PAD, a mobile phone, etc.
The present application further provides a computer program product adapted to perform a program for initializing the following method steps when executed on a data processing device: acquiring a transaction request; taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration; determining a total transaction number of transaction transactions being executed within a statistical time window; and rejecting the transaction request under the condition that the total transaction number of the transaction transactions exceeds a preset threshold value.
Alternatively, it is adapted to perform a procedure when executed on a data processing device, which initializes the following method steps: determining an access object to which the transaction request is directed; acquiring a time window sequence of an access object, wherein the time window sequence comprises at least one flow time window, and each flow time window is used for recording transaction transactions which are executed in a preset time period; selecting at least one flow time window to be counted corresponding to the counting time window in the time window sequence; and counting the total transaction number of at least one traffic time window to be counted.
Alternatively, it is adapted to perform a procedure when executed on a data processing device, which initializes the following method steps: identifying a target object that initiated the transaction request; acquiring at least one transaction of a target object; adding a timestamp and identification information for each transaction according to the transaction time, wherein the identification information is determined according to the timestamp and a random number; logging at least one transaction into a corresponding flow time window according to the timestamp; and arranging at least one flow time window according to the time sequence to obtain a time window sequence.
Alternatively, it is adapted to perform a procedure when executed on a data processing device, which initializes the following method steps: arranging at least one transaction according to the time sequence according to the time stamp to obtain a transaction sequence; dividing the transaction sequence into a plurality of transaction sets according to a preset time period indicated by the flow time window; each set of transaction transactions is logged into a corresponding traffic time window.
Alternatively, it is adapted to perform a procedure when executed on a data processing device, which initializes the following method steps: determining a time starting point and a time end point of a statistical time window; determining a flow time window corresponding to the time starting point as a first flow time window; determining a flow time window corresponding to the time end point as a second flow time window; and determining a first flow time window, a second flow time window and a flow time window between the first flow time window and the second flow time window as the flow time window to be counted.
Alternatively, it is adapted to perform a procedure when executed on a data processing device, which initializes the following method steps: counting the window transaction number of transaction transactions in each flow time window to be counted; and accumulating the window transaction number to determine the total transaction number.
Alternatively, it is adapted to perform a procedure when executed on a data processing device, which initializes the following method steps: after determining the total transaction number of the transaction transactions executing in the statistical time window, responding to the transaction request under the condition that the total transaction number does not exceed a preset threshold value; recording transaction transactions generated in response to the transaction requests; monitoring a transaction state of a transaction; and deleting the record of the transaction when the transaction state is the transaction end.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application 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 the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. 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). The 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.
It should also be noted that 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, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application 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 above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement or the like made within the spirit and principle of the present application shall be included in the scope of the claims of the present application.
Claims (10)
1. A method of limiting current, comprising:
acquiring a transaction request;
taking the initiation time of the transaction request as a time starting point, and determining a statistical time window with preset duration;
determining a total transaction number of transaction transactions being executed within the statistical time window;
rejecting the transaction request if the total number of transactions exceeds a preset threshold.
2. The method of claim 1, wherein determining the transaction number of transaction transactions executing within the statistical time window comprises:
determining an access object to which the transaction request is directed;
acquiring a time window sequence of the access object, wherein the time window sequence comprises at least one flow time window, and each flow time window is used for recording transaction transactions which are executed in a preset time period;
selecting at least one traffic time window to be counted corresponding to the counting time window in the time window sequence;
and counting the total transaction number of at least one traffic time window to be counted.
3. The method of claim 2, wherein obtaining the sequence of time windows of the access object comprises:
identifying a target object that initiated the transaction request;
acquiring at least one transaction of the target object;
adding a timestamp and identification information for each transaction according to the transaction time, wherein the identification information is determined according to the timestamp and a random number;
logging at least one transaction into the corresponding flow time window according to the timestamp;
and arranging at least one flow time window according to a time sequence to obtain the time window sequence.
4. The method of claim 3, wherein posting at least one of the transaction transactions to the corresponding flow time window based on the timestamp comprises:
arranging at least one transaction according to the time sequence according to the time stamp to obtain a transaction sequence;
dividing the transaction sequence into a plurality of transaction sets according to a preset time period indicated by the flow time window;
and recording each transaction set into the corresponding flow time window.
5. The method according to claim 2, wherein selecting at least one to-be-counted traffic time window corresponding to the counting time window in the time window sequence comprises:
determining a time starting point and a time ending point of the statistical time window;
determining the flow time window corresponding to the time starting point as a first flow time window;
determining the flow time window corresponding to the time end point as a second flow time window;
and determining the first flow time window, the second flow time window and a flow time window between the first flow time window and the second flow time window as the flow time window to be counted.
6. The method of claim 2, wherein counting the number of transactions for at least one traffic time window to be counted comprises:
counting the window transaction number of transaction transactions in each flow time window to be counted;
and accumulating the window transaction number to determine the total transaction number.
7. The method of claim 1, wherein after determining a total transaction number of transactional transactions being performed within the statistical time window, the method further comprises:
responding to the transaction request under the condition that the total transaction number does not exceed a preset threshold value;
recording a transaction generated in response to the transaction request;
monitoring a transaction state of the transaction;
and deleting the record of the transaction when the transaction state is the transaction end.
8. A current limiting device, comprising:
the acquisition module is used for acquiring a transaction request;
the first determining module is used for determining a statistical time window with preset duration by taking the initiation time of the transaction request as a time starting point;
the second determining module is used for counting the total transaction quantity of the transaction transactions which are executed in the counting time window;
and the current limiting module is used for rejecting the transaction request under the condition that the total transaction quantity exceeds a preset threshold value.
9. A processor configured to run a program, wherein the program is configured to execute the method of limiting current according to any one of claims 1 to 7 when the program is run.
10. An electronic device comprising one or more processors and memory storing one or more programs, wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the current limiting method of any of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210857532.1A CN115022244A (en) | 2022-07-20 | 2022-07-20 | Current limiting method and device, processor and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210857532.1A CN115022244A (en) | 2022-07-20 | 2022-07-20 | Current limiting method and device, processor and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115022244A true CN115022244A (en) | 2022-09-06 |
Family
ID=83082094
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210857532.1A Pending CN115022244A (en) | 2022-07-20 | 2022-07-20 | Current limiting method and device, processor and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115022244A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170250916A1 (en) * | 2016-02-29 | 2017-08-31 | Intel Corporation | Traffic shaper with policer(s) and adaptive timers |
| CN107707488A (en) * | 2017-10-25 | 2018-02-16 | 北京数码视讯支付技术有限公司 | Pay on-line transaction flow control methods, current limliting service end and client |
| CN111262795A (en) * | 2020-01-08 | 2020-06-09 | 京东数字科技控股有限公司 | Service interface-based current limiting method and device, electronic equipment and storage medium |
| CN111786895A (en) * | 2020-03-16 | 2020-10-16 | 北京京东尚科信息技术有限公司 | Method and apparatus for dynamic global current limiting |
-
2022
- 2022-07-20 CN CN202210857532.1A patent/CN115022244A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170250916A1 (en) * | 2016-02-29 | 2017-08-31 | Intel Corporation | Traffic shaper with policer(s) and adaptive timers |
| CN107707488A (en) * | 2017-10-25 | 2018-02-16 | 北京数码视讯支付技术有限公司 | Pay on-line transaction flow control methods, current limliting service end and client |
| CN111262795A (en) * | 2020-01-08 | 2020-06-09 | 京东数字科技控股有限公司 | Service interface-based current limiting method and device, electronic equipment and storage medium |
| CN111786895A (en) * | 2020-03-16 | 2020-10-16 | 北京京东尚科信息技术有限公司 | Method and apparatus for dynamic global current limiting |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20180365085A1 (en) | Method and apparatus for monitoring client applications | |
| CN110601900B (en) | Network fault early warning method and device | |
| US11163735B2 (en) | Database capacity estimation for database sizing | |
| CN101635651A (en) | Method, system and device for managing network log data | |
| CN113297183B (en) | Alarm analysis method and device for time window | |
| CN104503912A (en) | Monitoring method and device for service responding process | |
| CN111131290B (en) | Flow data processing method and device | |
| CN106934031B (en) | Method and device for monitoring and processing hotspot records in real-time processing system | |
| CN107368372B (en) | Resource display method and device based on cloud sea OS platform | |
| CN106202280A (en) | A kind of information processing method and server | |
| CN111984495A (en) | Big data monitoring method and device and storage medium | |
| CN114022151A (en) | Block chain data visualization method and system, electronic device and storage medium | |
| CN115022244A (en) | Current limiting method and device, processor and electronic equipment | |
| CN111324583B (en) | Service log classification method and device | |
| CN113472881B (en) | Statistical method and device for online terminal equipment | |
| CN109408302A (en) | A kind of fault detection method, device and electronic equipment | |
| CN114741218A (en) | Method, device, equipment, system and medium for extracting abnormal index of operating system | |
| CN114547406A (en) | Data monitoring method, system, storage medium and electronic device | |
| CN111291409A (en) | Data monitoring method and device | |
| CN112882854A (en) | Request exception handling method and device | |
| CN111427871A (en) | Data processing method, device and equipment | |
| CN114416817A (en) | Method, apparatus, device, system and storage medium for processing data | |
| CN112597223B (en) | Consistency data acquisition method and system | |
| CN117221930A (en) | Base station on-premise rate determining method and device, electronic equipment and storage medium | |
| CN107508789B (en) | Abnormal data identification method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |