WO2022095430A1

WO2022095430A1 - Sliding window configuration method and apparatus, computer device and storage medium

Info

Publication number: WO2022095430A1
Application number: PCT/CN2021/097187
Authority: WO
Inventors: 吴名先; 郑丕伟
Original assignee: 平安科技（深圳）有限公司
Priority date: 2020-11-06
Filing date: 2021-05-31
Publication date: 2022-05-12
Also published as: CN112346867A; CN112346867B

Abstract

A sliding window configuration method and apparatus, a computer device and a storage medium, relating to the field of security protection technology. Said method comprises: using a current-limiting burr factor to quantify the probability of a current-limiting burr occurring in a sliding window, wherein the current-limiting burr factor characterizes a product of a request density of the sliding window and a burr coverage degree (S101); using a memory factor to quantify the effect of a segmentation number of the sliding window on memory occupancy, wherein the memory factor characterizes the memory occupied by a target item determined on the basis of the segmentation number of the sliding window (S102); confirming information of intersection of the current-limiting burr factor and the memory factor (S103); and taking coordinate data characterizing a horizontal coordinate value of the intersection in the intersection information as an optimal segmentation number of the sliding window (S104). With said method, an optimal segmentation number can be obtained, thereby effectively reducing the probability of a current-limiting burr occurring, whilst reducing the occupied memory, so as to achieve an optimal current-limiting effect.

Description

A sliding window configuration method, device, computer equipment and storage medium

This application claims the priority of the Chinese patent application filed on November 06, 2020 with the application number 202011229805.5 and the title of the invention is "A sliding window configuration method, device, computer equipment and storage medium", all of which are The contents are incorporated herein by reference.

technical field

The present application relates to the technical field of security protection, and in particular, to a configuration method, device, computer equipment and storage medium for a sliding window.

Background technique

In the prior art, the current limiting strategy is often used to prevent the server from being paralyzed due to the explosive growth of requests, and the sliding window current limiting is a current limiting method that is often adopted. However, the inventor realizes that in actual development and testing, the developers do not know the most reasonable parameters of the window current limit in advance, so that the actual effect of the current limit strategy on the project cannot be well evaluated. If the verification needs to wait until the subsequent production process, the rationality evaluation of the current limiting parameter configuration will be delayed. At the same time, the preliminary test can only test the effect at the functional level, and the configuration effect of the current limiting parameter is unpredictable.

Application content

Embodiments of the present application provide a sliding window configuration method, device, computer equipment, and storage medium, which aim to solve the problem that the existing sliding window current limiting technology cannot accurately configure the number of divisions.

In a first aspect, an embodiment of the present application provides a method for configuring a sliding window, including:

A current-limiting glitch factor is used to quantify the probability of a current-limiting glitch occurring in the sliding window, wherein the current-limiting glitch factor represents the product of the request density and the glitch coverage of the sliding window;

Using a memory factor to quantify the impact of the number of divisions of the sliding window on the memory occupation, wherein the memory factor represents the memory occupied by the target item determined based on the number of divisions of the sliding window;

Confirm the intersection information of the current-limiting glitch factor and the memory factor;

The coordinate data representing the abscissa value of the intersection point in the intersection point information is used as the optimal number of divisions of the sliding window.

In a second aspect, an embodiment of the present application provides a configuration device for a sliding window, including:

a current-limiting burr probability quantization unit, used for quantifying the probability of a current-limiting burr occurring in the sliding window by using a current-limiting burr factor, wherein the current-limiting burr factor represents the product of the request density of the sliding window and the burr coverage;

a memory occupancy quantification unit, used for quantifying the impact of the number of divisions of the sliding window on the memory occupation by using a memory factor, wherein the memory factor represents the memory occupied by the target item determined based on the number of divisions of the sliding window;

an intersection confirmation unit, configured to confirm the intersection information of the current-limiting glitch factor and the memory factor;

A division number setting unit, configured to use the coordinate data representing the abscissa value of the intersection point in the intersection point information as the optimal division number of the sliding window.

In a third aspect, embodiments of the present application provide a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor executes the computer The configuration method of the sliding window described in the first aspect is implemented in a program.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and when executed by a processor, the computer program causes the processor to execute the process as described in Section 1. In one aspect, the configuration method of the sliding window is described.

The embodiments of the present application provide a configuration method, device, computer equipment, and storage medium for a sliding window. Based on the method provided by the embodiments of the present application, the optimal number of divisions can be obtained, thereby effectively reducing the probability of current-limiting glitches, and at the same time Reduce the occupied memory to achieve the optimal current limiting effect.

Description of drawings

In order to explain the technical solutions of the embodiments of the present application more clearly, the following briefly introduces the accompanying drawings used in the description of the embodiments. For those of ordinary skill, other drawings can also be obtained from these drawings without any creative effort.

1 is a schematic flowchart of a method for configuring a sliding window according to an embodiment of the present application;

2 is a schematic sub-flow diagram of a method for configuring a sliding window according to an embodiment of the present application;

3 is a schematic diagram of another sub-flow of a method for configuring a sliding window according to an embodiment of the present application;

4 is a schematic diagram of another sub-flow of a method for configuring a sliding window provided by an embodiment of the present application;

5 is a schematic diagram of a current-limiting glitch factor curve and a memory factor curve provided by an embodiment of the present application;

6 is a schematic block diagram of an apparatus for configuring a sliding window according to an embodiment of the present application;

FIG. 7 is a schematic block diagram of subunits of a sliding window configuration device provided by an embodiment of the present application;

FIG. 8 is a schematic block diagram of another subunit of a sliding window configuration device provided by an embodiment of the present application;

9 is a schematic block diagram of another subunit of a sliding window configuration device provided by an embodiment of the present application;

FIG. 10 is a schematic block diagram of a computer device provided by an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present application.

It is to be understood that, when used in this specification and the appended claims, the terms "comprising" and "comprising" indicate the presence of the described features, integers, steps, operations, elements and/or components, but do not exclude one or The presence or addition of a number of other features, integers, steps, operations, elements, components, and/or sets thereof.

It should also be understood that the terminology used in the specification of the application herein is for the purpose of describing particular embodiments only and is not intended to limit the application. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural unless the context clearly dictates otherwise.

It should also be further understood that, as used in this specification and the appended claims, the term "and/or" refers to and including any and all possible combinations of one or more of the associated listed items .

Please refer to FIG. 1. FIG. 1 is a flowchart of a method for configuring a sliding window provided by an embodiment of the present application. As shown in the figure, the method includes steps S101 to S104:

S101, using a current-limiting burr factor to quantify the probability that a current-limiting burr occurs in a sliding window, wherein the current-limiting burr factor represents the product of the requested density and the burr coverage of the sliding window;

S102, using a memory factor to quantify the impact of the number of divisions of the sliding window on memory occupation, wherein the memory factor represents the memory occupied by the target item determined based on the number of divisions of the sliding window;

S103, confirming the intersection information of the current-limiting glitch factor and the memory factor;

S104. Use the coordinate data representing the abscissa value of the intersection in the intersection information as the optimal number of divisions of the sliding window.

Specifically, the sliding window current limiting is a current limiting strategy, which can avoid some drawbacks of the fixed window current limiting. The core parameter of the sliding window is the number of divisions (x) of the window. The more divisions, the higher the sliding frequency, and the fewer the divisions, the lower the sliding frequency. Under different sliding frequencies, it has different current-limiting effects, and the probability of current-limiting burrs occurring is also different. In this embodiment, a current-limiting burr factor is used to quantify the probability of current-limiting burrs occurring in the sliding window.

In an embodiment, as shown in FIG. 2 , the step S101 includes steps S201-S205:

S201, obtain the value of the sliding window, and use the independent variable x to represent the number of divisions;

The value of the sliding window is preset, for example, the value of the sliding window can be 6s, and the number of divisions is an independent variable, so it can be represented by an independent variable x.

S202, calculating the value of the sliding window divided by the value of the number of divisions to obtain the size of the small window;

The sliding window represents the size of the current-limiting area. Divide the sliding window according to the number of divisions to obtain multiple small windows, that is, divide the value of the sliding window by the value of the number of divisions to obtain the value of the small window.

For example, the value of the sliding window is 6s, and the number of divisions is 6, then 6 small windows with the same size and continuous can be obtained, and the size of each small window is 1s. That is, the sliding interval is 1s.

S203, subtracting the value of the sliding window from the value of the small window to obtain a burr occurrence probability area;

In this step, the size of the entire sliding window is subtracted from the size of the small window, so as to obtain the area where the previous sliding window and the current sliding window overlap, and this area is the burr occurrence probability area, and the burr occurrence probability can be obtained by the above subtraction area size.

For example, the value of the sliding window is 6s, and the value of the small window is 1s, then the size of the glitch probability area is 5s.

S204, dividing the value of the sliding window by the value of the burr occurrence probability region to obtain the burr coverage;

In this step, the value of the entire sliding window is divided by the value of the aforementioned burr occurrence probability area, and the obtained value is the burr coverage, and the burr coverage represents the coverage of the burr in the sliding window.

For example, the value of the sliding window is 6s, and the value of the burr occurrence probability area is 5s, then the burr coverage is 1.2.

S205, dividing the value of the maximum allowable number of requests of the sliding window by the value of the sliding window to obtain the request density;

The function of the sliding window is to limit the number of requests. The maximum number of requests allowed by the sliding window represents the maximum number of requests allowed by the sliding window.

For example, the maximum number of requests allowed by the sliding window is 120 times, and the value of the sliding window is 6s, then the request density is 20.

S206. Multiply the value of the requested density by the value of the burr coverage to obtain a current-limiting burr factor.

In this embodiment of the present application, the value of the current-limiting burr factor is calculated according to the value of the requested density and the burr coverage, and specifically, the value of the requested density is multiplied by the value of the burr coverage. For example, if the requested density is 20 and the glitch coverage is 1.2, then the current-limit glitch factor is 24.

That is to say, the current-limiting glitch factor Y is calculated as follows:

Among them, T is the value of the sliding window, x is the number of divisions, and Q is the value of the maximum number of requests allowed for the sliding window. where x is greater than or equal to 2, which means that the sliding window is divided into at least 2 parts.

Transform the above formula to get:

As can be seen from the above formula, it can be seen that the maximum number of allowed requests Q and the window time in a project will not change in a project, so as the number of divisions x increases, the current limiting glitch factor Y will become more and more smaller until it tends to a fixed value

That is to say, it will tend to an ideal minimum current-limiting glitch factor, so the ideal situation is that the larger the value of x, the better, that is, the larger the number of divisions, the better the current-limiting effect will be.

In the step S102, as mentioned above, the calculation formula of the current-limiting glitch factor is:

It can be seen from the above formula that the ideal situation is that the larger the value of x, the better, that is, the larger the number of divisions, the better the current limiting effect will be. However, as the number of divisions increases infinitely, the amount of memory it occupies will also increase sharply, which will seriously affect the normal operation of the entire system. Therefore, the embodiment of the present application introduces a memory factor to measure the increase of the memory occupied with the increase of the number of divisions.

In an embodiment, as shown in FIG. 3 , the step S102 includes steps S301-S302:

S301, setting the relationship between the memory factor and the number of divisions of the sliding window as a one-dimensional primary relationship in advance, and setting the initial parameters of the one-dimensional primary relationship;

In the embodiment of the present application, the relationship between the number of divisions of the sliding window and the memory factor is defined as a univariate relationship, and there is only one independent variable at the same time, so it is generally a univariate primary relationship, such as F=ax+b, where a and b are constants , x is the number of divisions, and F is the memory factor.

S302. Perform parameter optimization on the initial parameters of the unary primary relationship according to the available memory size of the target item, to obtain optimized parameters.

In the embodiment of the present application, it is necessary to obtain the values of a and b in the aforementioned formula. In order to calculate the values of a and b, the values of a and b can be initialized first, that is, an initial value is set, and then according to the available memory of the target project The size optimizes the values of a and b, so that the values of a and b are constantly close to the target value, so that the relationship between the number of divisions and F is closer to the real situation.

In the step S103, in the embodiment of the present application, the current-limiting glitch factor and the memory factor represent constraints on the number of divisions, and the two express the influence of the number of divisions on the real situation from different angles. In order to accurately obtain the optimal division number, the application can draw the curve represented by the current-limiting glitch factor and the curve represented by the memory factor, thereby determining the number of divisions.

In an embodiment, as shown in FIG. 4 , the step S103 includes steps S401 to S403:

S401, taking the division number as the abscissa and the current-limiting glitch factor as the ordinate, drawing a current-limiting glitch factor curve obtained by changing the current-limiting glitch factor with the number of divisions of the sliding window;

This step is to draw the current-limiting glitch factor curve. As mentioned above, the calculation formula of the current-limiting glitch factor in this embodiment is:

It can be seen from the above formula that the current-limiting glitch factor will tend to a fixed value as the number of divisions increases.

Therefore, taking the number of divisions as the abscissa and the current-limiting glitch factor as the ordinate, the current-limiting glitch factor curve will gradually decrease with the increase of the number of divisions and approach a fixed value.

the curve.

The starting point of the abscissa of the above current-limiting glitch factor curve is 2, and the end point can be set not or within a certain range, such as 100 or 200, because if the number of divisions is continuously increased, the memory occupied by it will continue to increase. large, the subsequent curves will be of no practical significance.

S402. Using the division number as the abscissa and the memory factor as the ordinate, draw a memory factor curve obtained by the memory factor changing with the division number of the sliding window.

This step is to draw the memory factor curve. As mentioned above, the calculation formula of the memory factor curve in this embodiment is:

F=ax+b:

It can be seen from the above formula that the memory factor will increase with the increase of the number of divisions, and it will increase linearly, so the memory factor curve obtained by taking the number of divisions as the abscissa and the memory factor as the ordinate will be a curve with the number of divisions increases and linearly increases. The curve in the embodiment of the present application is a curve in a broad concept, which also includes the concept of a straight line.

In practical applications, the b can be set to 0, then the memory factor and the number of divisions will form a proportional relationship, that is, starting from the origin of the coordinate axis and extending along a straight line.

S403. Obtain the intersection point information of the current-limiting glitch factor curve and the memory factor curve.

In this step, the intersection information of the current-limiting glitch factor curve and the memory factor curve is acquired, where the intersection information includes the abscissa and the ordinate of the intersection.

Finally, in the step S104, the coordinate data representing the abscissa value of the intersection point in the intersection point information is used as the optimal number of divisions of the sliding window.

Combined with the one shown in Figure 5 (this figure is based on

For example, the glitch factor curve is also the current-limiting glitch factor curve). From the previous descriptions of the current-limiting glitch factor curve and the memory factor curve, it can be seen that the current-limiting glitch factor curve is a continuously decreasing curve, and the memory factor curve is a continuously rising curve. , the two will intersect at a certain point, the intersecting point is the intersection, and the abscissa of this intersection is the optimal number of divisions.

In this step, the meaning of the intersection point is the set number of divisions, just so that the current-limiting glitch factor can be directed to a fixed value

close, and at the same time, it can ensure that the memory factor is not too high and achieves the role of the optimal critical point.

In one embodiment, after taking the coordinate data representing the abscissa value of the intersection in the intersection information as the optimal number of divisions of the sliding window, the method includes:

The optimal number of divisions is used as the number of divisions of the sliding window to limit the current of the received requests.

In this embodiment, the optimal number of divisions is used as the number of divisions of the sliding window, and then the sliding window and the maximum allowable number of requests of the sliding window are used to limit the current of the received requests.

Using the method provided by the embodiments of the present application to limit the current can reduce the probability of the occurrence of the current-limiting burr, reduce the occupied memory, and achieve the optimal current-limiting effect.

In one embodiment, described according to the available memory size of the target item, the initial parameters of the unary primary relationship are parameterized, and the optimized parameters are obtained, including:

The available memory size of the target item is acquired, and the slope of the unary primary relationship is adjusted according to the available memory size.

In the embodiment of the present application, the slope of the memory factor curve (the memory factor curve of the dotted line in FIG. 5 ) may be adjusted according to the actual application scenario (ie, the target project). Adjust the slope to a small value. If the available memory in the actual application scenario is small (the memory is relatively tight), you can adjust the slope to a large value, so that the optimal number of divisions can be selected according to the actual situation.

In one embodiment, the acquiring the available memory size of the target item, and adjusting the slope of the unary primary relationship according to the available memory size, includes:

Obtain the available memory size of the target project, and obtain the range to which the available memory size belongs;

The slope is queried in the memory factor database according to the range to which the available memory size belongs, and the memory factor is set according to the slope, wherein the memory factor database stores the corresponding relationship between the range of different memory sizes and the slope.

In this embodiment, the corresponding relationship between the available memory size range and the slope can be preset, and the corresponding relationship is stored in the memory factor library, so that in the actual project, the available memory size can be obtained, so as to determine its belonging range, and then query the corresponding slope from the memory factor library, and then set the slope of the memory factor according to the slope. Through this embodiment, the memory factor curve can be made more in line with the real situation of the actual project, and the available memory size can also be acquired in real time, and the slope of the memory factor can be dynamically adjusted, thereby dynamically adjusting the number of divisions of the sliding window.

The embodiment of the present application further provides a configuration device for a sliding window, and the configuration device for a sliding window is used to execute any embodiment of the foregoing method for configuring a sliding window. Specifically, please refer to FIG. 6 , which is a schematic block diagram of an apparatus for configuring a sliding window provided by an embodiment of the present application. The configuration device 600 of the sliding window can be configured in the server.

The configuration device 600 of the sliding window may include:

A current-limiting glitch probability quantification unit 601, configured to quantify the probability of a current-limiting glitch occurring in the sliding window by using a current-limiting glitch factor, wherein the current-limiting glitch factor represents the product of the request density and the glitch coverage of the sliding window;

The memory occupation quantification unit 602 is used to quantify the impact of the partition number of the sliding window on the memory occupation by using a memory factor, wherein the memory factor represents the memory occupied by the target item determined based on the partition number of the sliding window;

an intersection confirmation unit 603, configured to confirm the intersection information of the current-limiting glitch factor and the memory factor;

The division number setting unit 604 is configured to use the coordinate data representing the abscissa value of the intersection point in the intersection point information as the optimal division number of the sliding window.

In one embodiment, as shown in FIG. 7 , the current-limiting glitch probability quantization unit 601 includes:

Representation unit 701, used to obtain the value of the sliding window, and will use the independent variable x to represent the number of divisions;

A small window calculation unit 702, configured to calculate the value of the sliding window divided by the value of the division number to obtain the size of the small window;

A glitch occurrence probability area calculation unit 703, configured to subtract the value of the small window from the value of the sliding window to obtain a glitch occurrence probability area;

A burr coverage calculation unit 704, configured to divide the value of the sliding window by the value of the burr occurrence probability region to obtain the burr coverage;

a request density calculation unit 705, configured to divide the value of the maximum allowable number of requests of the sliding window by the value of the sliding window to obtain the request density;

The current-limiting glitch factor calculation unit 706 is configured to multiply the value of the requested density by the value of the burr coverage to obtain the current-limiting glitch factor.

In one embodiment, as shown in FIG. 8 , the memory occupancy quantization unit 602 includes:

The relationship setting unit 801 is used to pre-set the relationship between the memory factor and the number of divisions of the sliding window as a one-dimensional primary relationship, and set the initial parameters of the one-dimensional primary relationship;

A parameter optimization unit 802, configured to perform parameter optimization on the initial parameters of the one-dimensional linear relationship according to the available memory size of the target item to obtain optimized parameters.

In one embodiment, as shown in FIG. 9 , the intersection confirmation unit 603 includes:

A current-limiting burr factor curve drawing unit 901, configured to draw the current-limiting burr obtained by taking the division number as the abscissa and the current-limiting burr factor as the ordinate, which is obtained by changing the current-limiting burr factor with the number of divisions of the sliding window factor curve;

A memory factor curve drawing unit 902, configured to draw a memory factor curve obtained by taking the division number as the abscissa and the memory factor as the ordinate;

The intersection obtaining unit 903 is configured to obtain intersection information of the current-limiting glitch factor curve and the memory factor curve.

In one embodiment, the sliding window configuration device 600 further includes:

A current limiting unit, configured to use the optimal number of divisions as the number of divisions of the sliding window to limit the current of the received requests.

In one embodiment, the parameter optimization unit 802 includes:

A slope adjustment unit, configured to obtain the available memory size of the target item, and adjust the slope of the unary primary relationship according to the available memory size.

In one embodiment, the slope adjustment unit includes:

a range obtaining unit, configured to obtain the available memory size of the target item, and obtain the range to which the available memory size belongs;

a slope setting unit, configured to query the slope in a preset memory factor library according to the range to which the available memory size belongs, and set the memory factor according to the slope, wherein different memories are stored in the memory factor library The corresponding relationship between the range to which the size belongs and the slope.

Based on the sliding window configuration device provided in the embodiment of the present application, the optimal number of divisions can be obtained, thereby effectively reducing the probability of occurrence of current limiting burrs, reducing the occupied memory at the same time, and achieving the optimal current limiting effect.

The above-mentioned configuration apparatus 600 for a sliding window can be implemented in the form of a computer program, and the computer program can be executed on a computer device as shown in FIG. 10 .

Please refer to FIG. 10. FIG. 10 is a schematic block diagram of a computer device provided by an embodiment of the present application. The computer device 10 is a server, and the server may be an independent server or a server cluster composed of multiple servers.

Referring to FIG. 10 , the computer device 1000 includes a processor 1002 , a memory and a network interface 1005 connected through a system bus 1001 , wherein the memory may include a non-volatile storage medium 1003 and an internal memory 1004 .

The nonvolatile storage medium 1003 can store an operating system 10031 and a computer program 10032 . When the computer program 10032 is executed, it can cause the processor 1002 to execute the configuration method of the sliding window.

The processor 1002 is used to provide computing and control capabilities to support the operation of the entire computer device 1000 .

The internal memory 1004 provides an environment for running the computer program 10032 in the non-volatile storage medium 1003. When the computer program 10032 is executed by the processor 1002, the processor 1002 can execute the sliding window configuration method.

The network interface 1005 is used for network communication, such as providing transmission of data information. Those skilled in the art can understand that the structure shown in FIG. 10 is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device 1000 to which the solution of the present application is applied. The specific computer device 1000 may include more or fewer components than shown, or combine certain components, or have a different arrangement of components.

Wherein, the processor 1002 is configured to run the computer program 10032 stored in the memory, so as to realize the following function: using a current-limiting glitch factor to quantify the probability of a current-limiting glitch occurring in the sliding window, wherein the current-limiting glitch factor represents the The product of the request density of the sliding window and the burr coverage; using a memory factor to quantify the impact of the number of divisions of the sliding window on the memory occupation, wherein the memory factor represents the target item determined based on the number of divisions of the sliding window The occupied memory; confirming the intersection information of the current-limiting glitch factor and the memory factor; and taking the coordinate data representing the abscissa value of the intersection in the intersection information as the optimal number of divisions of the sliding window.

In one embodiment, the processor 1002 quantifies the probability of the current-limiting glitch occurring in the sliding window by using the current-limiting glitch factor, wherein the current-limiting glitch factor represents the product of the request density and the glitch coverage of the sliding window. During the step of , perform the following operations: obtain the value of the sliding window, and use the independent variable x to represent the number of divisions; calculate the value of the sliding window divided by the value of the number of divisions to obtain the size of the small window; Subtract the value of the sliding window from the value of the small window to obtain the glitch occurrence probability area; divide the value of the sliding window by the value of the glitch occurrence probability area to obtain the glitch coverage; The value of the maximum allowable number of requests is divided by the value of the sliding window to obtain the request density; the value of the request density is multiplied by the value of the burr coverage to obtain the current limiting burr factor.

In one embodiment, the processor 1002 quantifies the impact of the number of partitions of the sliding window on memory occupation by using a memory factor, wherein the memory factor represents the amount of space occupied by the target item determined based on the number of partitions of the sliding window. During the step of memory, perform the following operations: set the relationship between the memory factor and the number of divisions of the sliding window as a one-dimensional relationship in advance, and set the initial parameters of the one-dimensional relationship; according to the available memory of the target item Parameter optimization is performed on the initial parameters of the one-dimensional linear relationship to obtain the optimized parameters.

In one embodiment, when the processor 1002 performs the step of confirming the intersection point information of the current-limiting glitch factor and the memory factor, the processor 1002 performs the following operations: taking the division number as the abscissa, the current-limiting glitch The current-limiting glitch factor curve obtained by plotting the current-limiting glitch factor with the number of divisions of the sliding window as the ordinate is the factor; plotting the current-limiting glitch factor curve with the division number as the abscissa and the memory factor as the ordinate. The memory factor curve obtained by changing the number of divisions of the sliding window; and obtaining the intersection point information of the current-limiting glitch factor curve and the memory factor curve.

In one embodiment, after performing the step of using the coordinate data representing the abscissa value of the intersection in the intersection information as the optimal number of divisions of the sliding window, the processor 1002 performs the following operation: using the optimal The number of divisions is used as the number of divisions of the sliding window to limit the current of the received requests.

In one embodiment, when the processor 1002 performs the step of performing parameter optimization on the initial parameters of the unary primary relationship according to the available memory size of the target item to obtain the optimized parameters, the processor 1002 performs the following operations: obtaining the The available memory size of the target item is adjusted, and the slope of the unary primary relationship is adjusted according to the available memory size.

In one embodiment, when the processor 1002 performs the step of acquiring the available memory size of the target item and adjusting the slope of the unary primary relationship according to the available memory size, the processor 1002 performs the following operations: acquiring the target item The available memory size of the project, and obtain the range to which the available memory size belongs; query the slope in the preset memory factor library according to the range to which the available memory size belongs, and set the memory factor according to the slope, wherein, The memory factor library stores the correspondence between the ranges and slopes to which different memory sizes belong.

Those skilled in the art can understand that the embodiment of the computer device shown in FIG. 10 does not constitute a limitation on the specific structure of the computer device. Either some components are combined, or different component arrangements. For example, in some embodiments, the computer device may only include a memory and a processor. In such an embodiment, the structures and functions of the memory and the processor are the same as those of the embodiment shown in FIG. 10 , which will not be repeated here.

It should be understood that, in this embodiment of the present application, the processor 1002 may be a central processing unit (Central Processing Unit, CPU), and the processor 1002 may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), Application Specific Integrated Circuit (ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Wherein, the general-purpose processor can be a microprocessor or the processor can also be any conventional processor or the like.

In another embodiment of the present application, a computer-readable storage medium is provided. The computer-readable storage medium may be a non-volatile computer-readable storage medium or a volatile computer-readable storage medium. The computer-readable storage medium stores a computer program, wherein when the computer program is executed by the processor, the following steps are implemented: using a current-limiting glitch factor to quantify the probability of a current-limiting glitch occurring in the sliding window, wherein the current-limiting glitch factor represents all the current-limiting glitches. The product of the request density of the sliding window and the burr coverage; adopt the memory factor to quantify the impact of the number of divisions of the sliding window on the memory occupation, wherein, the memory factor represents the target item determined based on the number of divisions of the sliding window. Occupied memory; confirming the intersection information of the current-limiting glitch factor and the memory factor; taking the coordinate data representing the abscissa value of the intersection in the intersection information as the optimal number of divisions of the sliding window.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, for the specific working process of the above-described devices, devices and units, reference may be made to the corresponding processes in the foregoing method embodiments, which will not be repeated here. Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two. Interchangeability, the above description has generally described the components and steps of each example in terms of function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of this application.

In the several embodiments provided in this application, it should be understood that the disclosed apparatus, apparatus and method may be implemented in other manners. For example, the device embodiments described above are only illustrative. For example, the division of the units is only logical function division. In actual implementation, there may be other division methods, or units with the same function may be grouped into one Units, such as multiple units or components, may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may also be electrical, mechanical or other forms of connection.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solutions of the embodiments of the present application.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it may be stored in a storage medium. Based on this understanding, the technical solutions of the present application are essentially or part of contributions to the prior art, or all or part of the technical solutions can be embodied in the form of software products, and the computer software products are stored in a storage medium , including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a removable hard disk, a read-only memory (ROM, Read-Only Memory), a magnetic disk or an optical disk and other media that can store program codes.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of various equivalents within the technical scope disclosed in the present application. Modifications or substitutions shall be covered by the protection scope of this application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

A sliding window configuration method, comprising:

A current-limiting glitch factor is used to quantify the probability of a current-limiting glitch occurring in the sliding window, wherein the current-limiting glitch factor represents the product of the request density and the glitch coverage of the sliding window;

Using a memory factor to quantify the impact of the number of divisions of the sliding window on the memory occupation, wherein the memory factor represents the memory occupied by the target item determined based on the number of divisions of the sliding window;

Confirm the intersection information of the current-limiting glitch factor and the memory factor;

The coordinate data representing the abscissa value of the intersection point in the intersection point information is used as the optimal number of divisions of the sliding window.
The method for configuring a sliding window according to claim 1, wherein the current-limiting glitch factor is used to quantify the probability of a current-limiting glitch occurring in the sliding window, wherein the current-limiting glitch factor represents the request density and glitch of the sliding window The product of coverage, including:

Obtain the value of the sliding window, and use the independent variable x to represent the number of divisions;

Calculate the value of the sliding window divided by the value of the number of divisions to obtain the size of the small window;

The value of the sliding window is subtracted from the value of the small window to obtain the burr occurrence probability area;

Divide the value of the sliding window by the value of the burr occurrence probability area to obtain the burr coverage;

Divide the value of the maximum number of requests allowed by the sliding window by the value of the sliding window to obtain the request density;

Multiply the value of the requested density by the value of the burr coverage to obtain a current-limiting burr factor.
The method for configuring a sliding window according to claim 1, wherein the memory factor is used to quantify the impact of the number of divisions of the sliding window on memory occupation, wherein the memory factor represents the target determined based on the number of divisions of the sliding window The memory used by the project, including:

The relationship between the memory factor and the number of divisions of the sliding window is set as a one-dimensional primary relationship in advance, and the initial parameters of the one-dimensional primary relationship are set;

Parameter optimization is performed on the initial parameters of the one-dimensional primary relationship according to the available memory size of the target item to obtain optimized parameters.
The method for configuring a sliding window according to claim 1, wherein the confirming the intersection information of the current-limiting glitch factor and the memory factor comprises:

Taking the division number as the abscissa and the current-limiting glitch factor as the ordinate to draw a current-limiting glitch factor curve obtained by changing the current-limiting glitch factor with the division number of the sliding window;

Taking the division number as the abscissa and the memory factor as the ordinate, draw the memory factor curve obtained by the memory factor changing with the division number of the sliding window;

Obtain the intersection information of the current-limiting glitch factor curve and the memory factor curve.
The method for configuring a sliding window according to claim 1, wherein after taking the coordinate data representing the abscissa value of the intersection point in the intersection point information as the optimal number of divisions of the sliding window, the method further comprises:

The optimal number of divisions is used as the number of divisions of the sliding window to limit the current of the received requests.
The configuration method of sliding window according to claim 3, wherein, described according to the available memory size of the target project The initial parameters of the one-dimensional relationship are optimized, and the optimized parameters are obtained, including:

The available memory size of the target item is acquired, and the slope of the unary primary relationship is adjusted according to the available memory size.
The method for configuring a sliding window according to claim 6, wherein the obtaining the available memory size of the target item, and adjusting the slope of the unary primary relationship according to the available memory size, comprises:

Obtain the available memory size of the target project, and obtain the range to which the available memory size belongs;

The slope is queried in a preset memory factor library according to the range to which the available memory size belongs, and the memory factor is set according to the slope, wherein the memory factor library stores the ranges and slopes of different memory sizes. Correspondence.
A sliding window configuration device, comprising:

a current-limiting burr probability quantization unit, used for quantifying the probability of a current-limiting burr occurring in the sliding window by using a current-limiting burr factor, wherein the current-limiting burr factor represents the product of the request density of the sliding window and the burr coverage;

a memory occupancy quantification unit, used for quantifying the impact of the number of divisions of the sliding window on the memory occupation by using a memory factor, wherein the memory factor represents the memory occupied by the target item determined based on the number of divisions of the sliding window;

an intersection confirmation unit, configured to confirm the intersection information of the current-limiting glitch factor and the memory factor;

A division number setting unit, configured to use the coordinate data representing the abscissa value of the intersection point in the intersection point information as the optimal division number of the sliding window.
A computer device, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the processor implements when executing the computer program:

A current-limiting glitch factor is used to quantify the probability of a current-limiting glitch occurring in the sliding window, wherein the current-limiting glitch factor represents the product of the request density and the glitch coverage of the sliding window;

Using a memory factor to quantify the impact of the number of divisions of the sliding window on the memory occupation, wherein the memory factor represents the memory occupied by the target item determined based on the number of divisions of the sliding window;

Confirm the intersection information of the current-limiting glitch factor and the memory factor;

The coordinate data representing the abscissa value of the intersection point in the intersection point information is used as the optimal number of divisions of the sliding window.
The computer device according to claim 9, wherein the probability of occurrence of a current-limiting glitch in the sliding window is quantified by using a current-limiting glitch factor, wherein the current-limiting glitch factor represents the difference between the request density of the sliding window and the glitch coverage. Product, including:

Obtain the value of the sliding window, and use the independent variable x to represent the number of divisions;

Calculate the value of the sliding window divided by the value of the number of divisions to obtain the size of the small window;

The value of the sliding window is subtracted from the value of the small window to obtain the burr occurrence probability area;

Divide the value of the sliding window by the value of the burr occurrence probability area to obtain the burr coverage;

Divide the value of the maximum number of requests allowed by the sliding window by the value of the sliding window to obtain the request density;

Multiply the value of the requested density by the value of the burr coverage to obtain a current-limiting burr factor.
The computer device according to claim 9, wherein the memory factor is used to quantify the impact of the number of divisions of the sliding window on the memory occupation, wherein the memory factor represents the occupation of the target item determined based on the number of divisions of the sliding window. memory, including:

The relationship between the memory factor and the number of divisions of the sliding window is set as a one-dimensional primary relationship in advance, and the initial parameters of the one-dimensional primary relationship are set;

Parameter optimization is performed on the initial parameters of the one-dimensional primary relationship according to the available memory size of the target item to obtain optimized parameters.
The computer device according to claim 9, wherein the confirming the intersection information of the current-limiting glitch factor and the memory factor comprises:

Taking the division number as the abscissa and the current-limiting glitch factor as the ordinate to draw a current-limiting glitch factor curve obtained by changing the current-limiting glitch factor with the division number of the sliding window;

Taking the division number as the abscissa and the memory factor as the ordinate, draw the memory factor curve obtained by the memory factor changing with the division number of the sliding window;

Obtain the intersection information of the current-limiting glitch factor curve and the memory factor curve.
The computer device according to claim 9, wherein after taking the coordinate data representing the abscissa value of the intersection in the intersection information as the optimal number of divisions of the sliding window, the method further comprises:

The optimal number of divisions is used as the number of divisions of the sliding window to limit the current of the received requests.
The computer device according to claim 11, wherein the parameter optimization is performed on the initial parameters of the one-dimensional linear relationship according to the available memory size of the target item, and the optimized parameters are obtained, comprising:

The available memory size of the target item is acquired, and the slope of the unary primary relationship is adjusted according to the available memory size.
A computer-readable storage medium, wherein the computer-readable storage medium stores a computer program that, when executed by a processor, causes the processor to execute:

A current-limiting glitch factor is used to quantify the probability of a current-limiting glitch occurring in the sliding window, wherein the current-limiting glitch factor represents the product of the request density and the glitch coverage of the sliding window;

Using a memory factor to quantify the impact of the number of divisions of the sliding window on the memory occupation, wherein the memory factor represents the memory occupied by the target item determined based on the number of divisions of the sliding window;

Confirm the intersection information of the current-limiting glitch factor and the memory factor;

The coordinate data representing the abscissa value of the intersection point in the intersection point information is used as the optimal number of divisions of the sliding window.
The computer-readable storage medium according to claim 15, wherein the probability of occurrence of a current-limiting glitch in the sliding window is quantified by using a current-limiting glitch factor, wherein the current-limiting glitch factor represents a request density and a glitch of the sliding window The product of coverage, including:

Obtain the value of the sliding window, and use the independent variable x to represent the number of divisions;

Calculate the value of the sliding window divided by the value of the number of divisions to obtain the size of the small window;

The value of the sliding window is subtracted from the value of the small window to obtain the burr occurrence probability area;

Divide the value of the sliding window by the value of the burr occurrence probability area to obtain the burr coverage;

Divide the value of the maximum number of requests allowed by the sliding window by the value of the sliding window to obtain the request density;

Multiply the value of the requested density by the value of the burr coverage to obtain a current-limiting burr factor.
16. The computer-readable storage medium of claim 15, wherein the use of a memory factor to quantify the impact of the number of divisions of the sliding window on memory usage, wherein the memory factor represents a target determined based on the number of divisions of the sliding window The memory used by the project, including:

The relationship between the memory factor and the number of divisions of the sliding window is set as a one-dimensional primary relationship in advance, and the initial parameters of the one-dimensional primary relationship are set;

Parameter optimization is performed on the initial parameters of the one-dimensional primary relationship according to the available memory size of the target item to obtain optimized parameters.
The computer-readable storage medium of claim 15, wherein the confirming the intersection information of the current-limiting glitch factor and the memory factor comprises:

Taking the division number as the abscissa and the current-limiting glitch factor as the ordinate to draw a current-limiting glitch factor curve obtained by changing the current-limiting glitch factor with the division number of the sliding window;

Taking the division number as the abscissa and the memory factor as the ordinate, draw the memory factor curve obtained by the memory factor changing with the division number of the sliding window;

Obtain the intersection information of the current-limiting glitch factor curve and the memory factor curve.
The computer-readable storage medium according to claim 15, wherein after taking the coordinate data representing the abscissa value of the intersection in the intersection information as the optimal number of divisions of the sliding window, the method further comprises:

The optimal number of divisions is used as the number of divisions of the sliding window to limit the current of the received requests.
The computer-readable storage medium according to claim 17, wherein the parameter optimization is performed on the initial parameters of the unary primary relationship according to the available memory size of the target item, and the optimized parameters are obtained, comprising:

The available memory size of the target item is acquired, and the slope of the unary primary relationship is adjusted according to the available memory size.