CN110166371B - Flow control method and device, electronic equipment and storage medium - Google Patents
Flow control method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN110166371B CN110166371B CN201910410620.5A CN201910410620A CN110166371B CN 110166371 B CN110166371 B CN 110166371B CN 201910410620 A CN201910410620 A CN 201910410620A CN 110166371 B CN110166371 B CN 110166371B
- Authority
- CN
- China
- Prior art keywords
- time window
- service
- flow threshold
- current time
- flow
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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/22—Traffic shaping
- H04L47/225—Determination of shaping rate, e.g. using a moving window
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- 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/29—Flow control; Congestion control using a combination of thresholds
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Abstract
The disclosure relates to a flow control method, a flow control device, an electronic device and a storage medium. The flow control method comprises the following steps: for a plurality of adjacent time windows before the current time window, respectively acquiring the average consumed time for receiving and processing the service request by the first service in each adjacent time window; calculating to obtain a flow threshold of the current time window according to the average time consumption variation trend of the plurality of adjacent time windows; counting the number of requests of received service requests in a current time window, and judging whether the number of the requests is greater than a flow threshold of the current time window; and if the request number is larger than the flow threshold value of the current time window, carrying out flow limiting operation. The flow control method avoids the problem that the flow threshold is obviously smaller than the processing capacity of the current first service, and the server resource utilization is insufficient due to the early adoption of flow control on the service request.
Description
Technical Field
The present disclosure relates to the field of network technologies, and in particular, to a flow control method and apparatus, an electronic device, and a storage medium.
Background
In the related art, each background service in the high-concurrency system has its own service capacity limit, such as qps (number of service requests per second), tps (number of transactions per second), and the like. In the scenes of killing a second, robbing a red packet and the like, in order to prevent the background service from simultaneously receiving too many service requests and exceeding the service capacity of the background service, a reasonable service flow threshold value needs to be set for the background service. In a related flow control scheme, a fixed configuration manner is usually adopted to limit the flow of the service request, so as to prevent a system crash of the server device caused by an excessively large access flow. However, after the fixed traffic threshold is set, access to the user is limited when the upper limit of the system performance of the server device is not reached, which causes waste of system resources.
Disclosure of Invention
The present disclosure provides a flow control method, a flow control apparatus, an electronic device, and a storage medium, so as to at least solve a problem of system resource waste caused by a fixed configuration of a flow threshold of a service request in the related art. The technical scheme of the disclosure is as follows:
according to a first aspect of an embodiment of the present disclosure, there is provided a flow control method, including:
respectively acquiring average consumed time for receiving and processing a service request by a first service in each adjacent time window for a plurality of adjacent time windows before the current time window;
calculating to obtain a flow threshold of the current time window according to the average time consumption variation trend of the plurality of adjacent time windows;
counting the number of received service requests in a current time window, and judging whether the number of the requests is greater than a flow threshold of the current time window; and
and if the request number is larger than the flow threshold value of the current time window, carrying out flow limiting operation.
Optionally, the calculating, according to the trend of average time consumption change of the multiple adjacent time windows, a flow threshold of a current time window includes:
calculating to obtain a change trend of the average consumed time for receiving and processing the service request by the first service in the last time window and the average consumed time for receiving and processing the service request by the first service in the last time window;
and adjusting the flow threshold of the last time window according to the average time consumption change trend and the change trend opposite to the average time consumption change trend to obtain the flow threshold of the current time window.
Optionally, the calculation formula for calculating the flow threshold of the current time window according to the variation trend of the average consumed time of the multiple adjacent time windows is as follows:
limit 0 ＝(T 2 /T 1 )×limit 1
wherein, limit 0 Is the flow threshold, limit, of the current time window 1 Is the flow threshold, T, of the last time window 1 Is the average elapsed time, T, for the first service to receive and process the service request within the last time window 2 Is that the first service received and processed the service request within the last time windowThe averaging of (2) is time consuming.
Optionally, the flow control method further includes:
setting a traffic threshold for the time window for a first and a second time window in which the first service receives and processes the service request.
Optionally, the flow control method further includes:
and setting a maximum flow threshold and a minimum flow threshold for receiving and processing the service request by the first service.
Optionally, if the calculated flow threshold of the current time window is greater than the maximum flow threshold, taking the maximum flow threshold as the flow threshold of the current time window;
and if the calculated flow threshold value of the current time window is smaller than the minimum flow threshold value, taking the minimum flow threshold value as the flow threshold value of the current time window.
According to a second aspect of an embodiment of the present disclosure, there is provided a flow control device including:
the acquisition unit is configured to execute the steps of respectively acquiring the average consumed time of receiving and processing the service request by the first service in each adjacent time window for a plurality of adjacent time windows before the current time window;
the calculating unit is configured to calculate a flow threshold of the current time window according to the variation trend of the average consumed time of the plurality of adjacent time windows;
a judging unit configured to perform counting of a request quantity of the received service requests in a current time window, and judge whether the request quantity is greater than a traffic threshold of the current time window; and
and the current limiting unit is configured to perform a current limiting operation if the request quantity is greater than the flow threshold of the current time window.
Optionally, the calculating the flow threshold of the current time window according to the variation trend of the average consumed time of the multiple adjacent time windows includes:
calculating to obtain a change trend of the average consumed time for receiving and processing the service request by the first service in the last time window and the average consumed time for receiving and processing the service request by the first service in the last time window;
and adjusting the flow threshold of the last time window according to the change trend of the average consumed time and the change trend opposite to the change trend of the average consumed time to obtain the flow threshold of the current time window.
Optionally, the calculation formula for calculating the flow threshold of the current time window according to the variation trend of the average consumed time of the multiple adjacent time windows is as follows:
limit 0 ＝(T 2 /T 1 )×limit 1
wherein, limit 0 Is the flow threshold, limit, of the current time window 1 Is the flow threshold, T, of the last time window 1 Is the average elapsed time, T, for the first service to receive and process the service request within the last time window 2 Is the average elapsed time for the first service to receive and process the service request within the last time window.
Optionally, the flow control device further includes:
a setting unit configured to perform a first and a second time window of receiving and processing the service request for the first service, setting a traffic threshold of the time window.
Optionally, the flow control device further includes:
a setting unit configured to perform setting of a maximum traffic threshold and a minimum traffic threshold for the first service to receive and process the service request.
Optionally, if the calculated flow threshold of the current time window is greater than the maximum flow threshold, taking the maximum flow threshold as the flow threshold of the current time window;
and if the calculated flow threshold value of the current time window is smaller than the minimum flow threshold value, taking the minimum flow threshold value as the flow threshold value of the current time window.
According to a third aspect of the embodiments of the present disclosure, there is provided an electronic apparatus including:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the flow control method as described above.
According to a fourth aspect of the embodiments of the present disclosure, there is provided a storage medium, wherein instructions, when executed by a processor of an electronic device, enable the electronic device to execute the flow control method as described above
According to a fifth aspect of embodiments of the present disclosure, there is provided a computer program product, comprising a computer program product, the computer program comprising program instructions, which, when executed by a mobile terminal, cause the mobile terminal to perform the steps of the above-mentioned flow control method.
The technical scheme provided by the embodiment of the disclosure at least brings the following beneficial effects:
1) The flow control method calculates the flow threshold value of the current time window according to the variation trend of the average consumed time of receiving and processing the service request by the first service in a plurality of adjacent time windows before the current time window, thereby being capable of adaptively carrying out flow control on the service request according to the real-time running condition of the first service, avoiding the problem that the number of the service requests exceeds the processing capacity of the current first service to cause downtime of the server, simultaneously avoiding the problem that the flow threshold value is obviously smaller than the processing capacity of the current first service, and the problem that the service request is controlled prematurely to cause insufficient utilization of server resources, thereby improving the efficiency of receiving and processing the service request by the first service running on the server;
2) The flow control method determines whether to adjust the flow threshold value of the current time window according to the change trend of the average consumed time of receiving and processing the service request by the first service in a plurality of adjacent time windows before the current time window, if the average consumed time of the adjacent time windows is not changed, the flow threshold value of the time window which is closer to the current time window in the adjacent time windows is directly used as the flow threshold value of the current time window, the adjusting action times of the flow threshold value are reduced, the calculation efficiency of the flow threshold value of the current time window is improved, and the calculation load of the server is reduced. When the operation load of the server is reduced, the efficiency of receiving and processing the service request by the first service operated on the server is further improved;
3) The flow control method sets a maximum flow threshold and a minimum flow threshold of a first service receiving and processing service requests, so that the flow threshold of a current time window is always limited within the range of the minimum flow threshold and the maximum flow threshold. The problem that the server resource utilization rate is low or the server resources are insufficient to cause downtime when the calculated flow threshold of the current time window is seriously deviated from the actual condition is solved, so that the resource utilization rate of the server is improved, and the processing efficiency of receiving and processing the service request by the first service running on the server is improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the disclosure and are not to be construed as limiting the disclosure.
FIG. 1 is a flow diagram illustrating a flow control method in accordance with an exemplary embodiment;
FIG. 2 is a flow diagram illustrating a flow control method in accordance with an exemplary embodiment;
FIG. 3 is a block diagram illustrating a flow control device according to an exemplary embodiment;
FIG. 4 is a block diagram of a flow control device shown in accordance with an exemplary embodiment;
FIG. 5 is a block diagram illustrating an apparatus to perform a flow control method in accordance with an exemplary embodiment;
fig. 6 is a block diagram illustrating an apparatus to perform a flow control method according to an example embodiment.
Detailed Description
In order to make the technical solutions of the present disclosure better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the disclosure described herein are capable of operation in sequences other than those illustrated or otherwise described herein. The implementations described in the exemplary embodiments below are not intended to represent all implementations consistent with the present disclosure. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.
In a highly concurrent system, the input and output flows of the system may be limited using current limiting techniques to achieve protection of the system. Specifically, a flow rate threshold value may be set in advance. The traffic threshold here is the maximum number of requests that the first service running on the server can receive and process the service request. The first service is a background service running on the server. By comparing the flow threshold value with the request quantity of the service requests received in real time in the system, the operation load of the system is limited within the range of the flow threshold value, so that the server downtime caused by overlarge concurrency of the service requests is avoided.
However, the preset flow threshold is a value obtained by predicting the operation performance of the server. The operational performance of the server is variable in the actual operational environment. On the one hand, the running performance is actually greatly reduced due to the long-term over-running of the server, and if the flow is still limited by the previously set flow threshold, the server may be overloaded and go down. On the other hand, in the process of limiting the flow of the server by using the preset flow threshold, maintenance personnel may perform maintenance and upgrade on the server, and the operation performance of the upgraded server is obviously improved. At this time, if the flow is still limited by the previously set flow threshold, the flow is limited when the upper limit of the operation performance of the server is not reached, which causes waste of server resources. It can be seen that if the service request is limited by the fixedly configured traffic threshold, the flow cannot be flexibly limited according to the actual operation condition of the server, and the resource utilization rate of the server can be greatly reduced.
To this end, the present invention provides a flow control method, and fig. 1 is a flowchart illustrating the flow control method according to an exemplary embodiment.
In step S110, for a plurality of adjacent time windows before the current time window, an average consumed time for receiving and processing the service request by the first service in each adjacent time window is respectively obtained.
In this step, the average elapsed time for the first service to receive and process the service request in a plurality of adjacent time windows before the current time window is obtained. The first service here is a background service running on the server. Considering that the service capacity of the server may fluctuate greatly due to changes in the server operating conditions (the central processing unit usage rate, the hard disk usage rate, the memory exchange area usage rate, and the like), in order to ensure the service quality of the first service running on the server in such a complex operating environment, a time window is divided, and the processing conditions of receiving and processing the service request by the first service are counted according to the time window. The time window may be a time in units of segments, each segment being referred to as a time window. The length of the time window may be determined according to actual requirements.
Optionally, the average elapsed time for the first service to receive and process the service request in two adjacent time windows before the current time window is obtained respectively. The length of the time window is set to 10 seconds, and the time range of the current time window is 54 minutes 50 seconds at 10 hours on 23 days 4 and 23 months in 2019 to 54 minutes 60 seconds at 10 hours on 23 days 4 and 23 months in 2019. The time range of the adjacent time window 1 before the current time window is 54 minutes 40 seconds at 10 days 4 month 23 year 2019 to 54 minutes 50 seconds at 10 days 23 month 23 day 2019. The time range of the adjacent time window 2 before the current time window is 54 minutes 30 seconds at 23 days 10 at 4 months in 2019 to 54 minutes 40 seconds at 10 days 23 days 10 at 4 months in 2019. The average consumed time for receiving and processing the service request by the first service in the corresponding time window may be calculated after the time ranges of the adjacent time window 1 and the adjacent time window 2 are ended, that is, after 54 minutes and 50 seconds at 10 hours and 54 minutes at 20 days and 50 seconds at 23 days and 10 minutes at 54 minutes and 40 seconds at 4 months and 23 days at 10 days in 2019. It is to be understood that a plurality of adjacent time windows before the current time window may be immediately adjacent to the current time window, and a plurality of adjacent time windows before the current time window may also be separated from the current time window by a plurality of time windows, which should not limit the embodiments of the present disclosure.
It is easy to understand that, the average consumed time of the first service receiving and processing the service request in three and more than three adjacent time windows before the current time window may be respectively obtained, and the traffic threshold of the current time window is calculated according to the variation trend of the average consumed time of the three and more than three adjacent time windows. It is understood that the number of the plurality of adjacent time windows before the current time window for determining the trend of the average elapsed time may be two, or may be three or more, and should not limit the embodiments of the present disclosure in any way.
In step S120, a flow threshold of the current time window is calculated according to the variation trend of the average consumed time of the plurality of adjacent time windows.
In this step, the flow threshold of the current time window is calculated according to the average time consumption variation trend of a plurality of adjacent time windows.
Taking an adjacent time window 1 and an adjacent time window 2 before the current time window as an example, the adjacent time window 1 is closer to the current time window, and the adjacent time window 2 is farther from the current time window.
If the average consumed time for receiving and processing the service request by the first service in the adjacent time window 1 is greater than the average consumed time for receiving and processing the service request by the first service in the adjacent time window 2, the traffic threshold of the adjacent time window 1 is correspondingly reduced, and then the reduced traffic threshold is used as the traffic threshold of the current time window.
And if the average consumed time for receiving and processing the service request by the first service in the adjacent time window 1 is less than the average consumed time for receiving and processing the service request by the first service in the adjacent time window 2, correspondingly increasing the traffic threshold of the adjacent time window 1, and then taking the increased traffic threshold as the traffic threshold of the current time window.
And if the average consumed time for receiving and processing the service request by the first service in the adjacent time window 1 is equal to the average consumed time for receiving and processing the service request by the first service in the adjacent time window 2, directly taking the traffic threshold of the time window 1 as the traffic threshold of the current time window.
Optionally, the flow threshold of the current time window is calculated according to the variation trend of the average consumed time of three or more adjacent time windows.
For the trend of the average elapsed time of three or more adjacent time windows, there are the following determination methods:
one is to compare the average elapsed time of three or more adjacent time windows and determine the maximum and minimum values of the average elapsed time of the adjacent time windows. And determining the variation trend of the average consumed time of the plurality of adjacent time windows by judging the front and back sequence of the maximum value and the minimum value.
And if the maximum value is closer to the current time window than the minimum value, correspondingly reducing the flow threshold value of the adjacent time window corresponding to the maximum value, and then taking the reduced flow threshold value as the flow threshold value of the current time window.
And if the minimum value is closer to the current time window than the maximum value, correspondingly increasing the flow threshold value of the adjacent time window corresponding to the minimum value, and then taking the increased flow threshold value as the flow threshold value of the current time window.
And if the average consumed time of the plurality of adjacent time windows does not change, directly taking the traffic threshold value of the time window closer to the current time window as the traffic threshold value of the current time window.
And the other way is to compare the average consumed time of three or more adjacent time windows and determine a plurality of wave peak values and a plurality of wave valley values of the average consumed time of a plurality of adjacent time windows. And determining the variation trend of the average consumed time of the plurality of adjacent time windows by judging the variation trend of the plurality of peak values. Specifically, the maximum value and the minimum value in the plurality of peak values may be determined, and further, the trend of the average elapsed time of the plurality of adjacent time windows may be determined by judging the front and back order of the maximum value and the minimum value.
In step S130, in the current time window, the request number of the received service requests is counted, and it is determined whether the request number is greater than the traffic threshold of the current time window.
In this step, in a current time window, the number of requests of the received service request is counted, and it is determined whether the number of requests is greater than a traffic threshold of the current time window. For example, in a highly concurrent web page access scenario, there are a large number of users going to access a shopping website at the same time, but the shopping website has a plurality of sold products, and each product has a separate corresponding product web page, such as a web page showing product a and B web page showing product B. It is easy to understand that the a web page and the B web page may have web page access volumes with large differences, so different traffic thresholds need to be set for the first service of the a web page and the first service of the B web page, the request number of the received service request is counted in the current time windows of the a web page and the B web page, respectively, and whether the request number is greater than the traffic threshold of the current time window is judged, thereby realizing differential current limiting operation.
In step S140, if the number of requests is greater than the flow threshold of the current time window, a flow limiting operation is performed.
In this step, if the number of requests for service requests received in the current time window is greater than the traffic threshold of the current time window, a throttling operation is performed. For example, the number of requests for service requests received in the current time window is 9000 times. If the calculated traffic threshold of the current time window is 8000 times, the number of service requests that can be received and processed by the first service in the current time window is 8000 times, and the remaining 1000 service requests are subjected to current limiting operation. Here, the throttling operation may be to directly reject the 1000 service requests exceeding the traffic threshold, or to cache the 1000 service requests exceeding the traffic threshold, and when the server running the first service has additional computing resources, receive and process the 1000 service requests. It should be understood that the specific manner of the current limiting operation is not intended to limit the technical solution of the present disclosure.
In the embodiment of the disclosure, the average consumed time of receiving and processing the service request by the first service in a plurality of adjacent time windows before the current time window is respectively obtained, and the traffic threshold of the current time window is calculated according to the variation trend of the average consumed time of the plurality of adjacent time windows, so that the flow control of the service request can be adaptively performed according to the real-time running condition of the first service, the problem that the server is down due to the fact that the number of the service requests exceeds the processing capacity of the current first service is avoided, meanwhile, the problem that the resource utilization of the server is insufficient due to the fact that the traffic control is performed too early on the service request is avoided, and the efficiency of receiving and processing the service request by the first service running on the server is further improved. When the server resources can be utilized reasonably, the overall processing efficiency of the highly concurrent system for processing the service request of the user is also improved.
Optionally, if the average consumed time of the multiple adjacent time windows does not change, directly taking the traffic threshold of the time window closer to the current time window in the adjacent time windows as the traffic threshold of the current time window, if the average consumed time of the adjacent time windows changes, correspondingly adjusting the traffic threshold of the time window closer to the current time window in the adjacent time windows according to the change trend of the average consumed time, and taking the adjusted traffic threshold as the traffic threshold of the current time window, so as to reduce the number of adjusting actions of the traffic threshold, thereby improving the calculation efficiency of the traffic threshold of the current time window, and reducing the operation load of the server. The efficiency of receiving and processing service requests by the first service running on the server is further improved when the operational load of the server is reduced.
Fig. 2 is a flow chart illustrating a flow control method in accordance with an example embodiment. The method comprises the following specific steps:
in step S210, a maximum traffic threshold and a minimum traffic threshold are set for the first service to receive and process the service request.
In this step, a maximum traffic threshold and a minimum traffic threshold for the first service to receive and process the service request are set such that the traffic threshold of the current time window is always limited within the minimum traffic threshold and the maximum traffic threshold.
Specifically, if the calculated flow threshold of the current time window is greater than the maximum flow threshold, the maximum flow threshold is used as the flow threshold of the current time window. And if the calculated flow threshold value of the current time window is smaller than the minimum flow threshold value, taking the minimum flow threshold value as the flow threshold value of the current time window. The minimum flow threshold and the maximum flow threshold may be set by the operation and maintenance staff in advance in consideration of an expected operation condition of the first service running on the server and an expected access amount of the service request. The flow threshold value of the current time window is always limited in the range of the minimum flow threshold value and the maximum flow threshold value, so that the problem that the utilization rate of server resources is low or the server resources are insufficient to cause downtime when the calculated flow threshold value of the current time window is seriously deviated from the actual condition is solved.
In step S220, for the first and second time windows in which the first service receives and processes the service request, a traffic threshold for the time windows is set.
In this step, for a first and a second time window in which the first service receives and processes the service request, traffic thresholds for these two time windows are set. For example, the traffic thresholds for the first service to receive and process service requests within the first and second time windows are set to C and D, respectively. It is understood that C may or may not be equal to D. Here, C and D may be set by the operation and maintenance staff in advance in consideration of the expected operation condition of the first service running on the server and the expected access amount of the service request.
Optionally, the traffic thresholds for the first service to receive and process the service request within the first and second time windows are set to C and D, respectively (C = D). Starting from the third time window, the traffic threshold for the first service to receive and process the service request is calculated by equation (1). The formula (1) will be described in detail hereinafter.
Starting from the third time window, the flow threshold of the current time window is calculated through the following steps S230-S240.
In step S230, for a plurality of adjacent time windows before the current time window, an average consumed time for receiving and processing the service request by the first service in each adjacent time window is respectively obtained.
In this step, the average consumed time for the first service to receive and process the service request in the previous time window of the current time window and the average consumed time for the first service to receive and process the service request in the previous time window are respectively obtained. The average consumed time for receiving and processing the service request by the first service in the corresponding time window may be calculated after the last time window and the last time window are finished. For example, in the last time window, 5 service requests are received, the time consumed for the first service to receive and process the 5 service requests is 1.8 seconds, 1.2 seconds, 1.5 seconds, 2.5 seconds, and 2.2 seconds, respectively, and then the average time consumed for the first service to receive and process the service requests in the last time window is (1.8 +1.2+1.5+2.5+ 2.2)/5 =1.84 seconds. In the last time window, 8 service requests are received, the time consumed for the first service to receive and process the 8 service requests is 1.5 seconds, 1.3 seconds, 1.2 seconds, 0.9 seconds, 1.2 seconds, 0.9 seconds and 0.8 seconds, respectively, and the average time consumed for the first service to receive and process the service requests in the last time window is (1.5 +1.3+1.2+0.9+1.2+ 0.9+ 0.8)/8 =1.125 seconds.
In step S240, a flow threshold of the current time window is calculated according to the average time consumption trend of the plurality of adjacent time windows.
In this step, a trend of a change between an average time consumed for the first service to receive and process the service request in a previous time window and an average time consumed for the first service to receive and process the service request in the previous time window is calculated. And adjusting the flow threshold of the last time window according to the change trend of the average consumed time and the change trend opposite to the change trend of the average consumed time to obtain the flow threshold of the current time window.
Optionally, according to the variation trend of the average consumed time of a plurality of adjacent time windows, the calculation formula for calculating the flow threshold of the current time window is as follows:
limit 0 ＝(T 2 /T 1 )×limit 1 (1)
wherein, limit 0 Is the flow threshold, limit, of the current time window 1 Is the traffic threshold, T, of the last time window 1 Is the average elapsed time, T, for the first service to receive and process the service request within the last time window 2 Is the average elapsed time for the first service to receive and process the service request within the last time window.
For example, the average elapsed time for the first service to receive and process the service request within the last time window is 1.84 seconds. The average time it takes for the first service to receive and process the service request within the last time window is 1.125 seconds. The flow threshold value of the last time window is 20 times, and the flow threshold value of the current time window is 1.125/1.84 × 20 ≈ 12 times.
In step S250, in the current time window, the request number of the received service requests is counted, and it is determined whether the request number is greater than the traffic threshold of the current time window.
This step is identical to step S130 in fig. 1, and will not be described here.
In step S260, if the number of requests is greater than the flow threshold of the current time window, a flow limiting operation is performed.
This step is identical to step S140 in fig. 1, and will not be described herein.
According to the embodiment of the disclosure, the maximum traffic threshold and the minimum traffic threshold of the first service for receiving and processing the service request are set, so that the traffic threshold of the current time window is always limited within the range of the minimum traffic threshold and the maximum traffic threshold, and the traffic thresholds of the two time windows are set for the first time window and the second time window of the first service for receiving and processing the service request. And calculating the variation trend of the average time consumption of the first service for receiving and processing the service request in the last time window and the average time consumption of the first service for receiving and processing the service request in the last time window from the third time window. And adjusting the flow threshold of the last time window according to the change trend of the average consumed time and the change trend opposite to the change trend of the average consumed time to obtain the flow threshold of the current time window. Counting the number of the received service requests in the current time window, judging whether the number of the requests is larger than the traffic threshold of the current time window, and if the number of the requests is larger than the traffic threshold of the current time window, performing a current limiting operation.
In this embodiment, the maximum traffic threshold and the minimum traffic threshold of the first service for receiving and processing the service request are set, so that the traffic threshold of the current time window is always limited within the range of the minimum traffic threshold and the maximum traffic threshold. The problem that the server resource utilization rate is low or the server resources are insufficient to cause downtime when the calculated flow threshold of the current time window is seriously deviated from the actual condition is solved, so that the resource utilization rate of the server is improved, and the processing efficiency of receiving and processing the service request by the first service running on the server is improved.
In addition, from the third time window, the average time consumption of the first service receiving and processing the service request in the last time window and the change trend of the average time consumption of the first service receiving and processing the service request in the last time window are obtained through calculation, and then the traffic threshold value of the current time window is obtained by adjusting the traffic threshold value of the last time window according to the change trend of the average time consumption and the change trend opposite to the change trend of the average time consumption. The flow threshold value of the previous time window is adjusted according to the change trend of the average consumed time of receiving and processing the service requests by the first service in two adjacent time windows nearest to the current time window to obtain the flow threshold value of the current time window, so that the calculated flow threshold value of the current time window is more suitable for the processing performance of receiving and processing the service requests by the first service running on the current server, the problem that the server is down due to the fact that the number of the service requests exceeds the processing capacity of the current first service is avoided, meanwhile, the problem that the utilization rate of server resources is insufficient due to the fact that the flow control is adopted too early for the service requests is avoided, the utilization rate of the server resources is improved, and the efficiency of receiving and processing the service requests by the first service running on the server is further improved.
Fig. 3 is a block diagram of a flow control device shown in accordance with an exemplary embodiment. The method comprises the following steps: an acquisition unit 310, a calculation unit 320, a judgment unit 330, and a current limiting unit 340.
The obtaining unit 310 is configured to perform, for a plurality of adjacent time windows before the current time window, obtaining an average consumed time for receiving and processing the service request by the first service in each adjacent time window respectively.
The calculating unit 320 is configured to calculate the flow threshold of the current time window according to the trend of the average elapsed time of the plurality of adjacent time windows.
A determining unit 330 configured to perform counting the number of requests of the received service requests in a current time window, and determining whether the number of requests is greater than a traffic threshold of the current time window.
A current limiting unit 340 configured to perform a current limiting operation if the number of requests is greater than the traffic threshold of the current time window.
In the embodiment of the disclosure, the flow control device respectively obtains the average consumed time of the first service receiving and processing the service request in a plurality of adjacent time windows before the current time window, and calculates the flow threshold of the current time window according to the variation trend of the average consumed time of the plurality of adjacent time windows, so that the flow control device can adaptively control the flow of the service request according to the real-time running condition of the first service, thereby avoiding the problem that the number of the service requests exceeds the processing capacity of the current first service, which causes insufficient server resources and downtime, and simultaneously avoiding the problem that the flow threshold is obviously smaller than the processing capacity of the current first service, and the problem that the server resources are not fully utilized due to too early flow control of the service request, thereby improving the efficiency of the first service running on the server receiving and processing the service request. When the server resources can be utilized reasonably, the overall processing efficiency of the highly concurrent system for processing the service request of the user is also improved.
FIG. 4 is a block diagram illustrating a flow control device according to an exemplary embodiment. The method comprises the following steps: a setting unit 410, an obtaining unit 420, a calculating unit 430, a judging unit 440, and a current limiting unit 450.
A setting unit 410 configured to perform a first and a second time window of receiving and processing the service request for the first service, setting a traffic threshold of the time window.
Optionally, the setting unit 410 is configured to perform setting of a maximum traffic threshold and a minimum traffic threshold for the first service to receive and process the service request. If the calculated flow threshold value of the current time window is larger than the maximum flow threshold value, taking the maximum flow threshold value as the flow threshold value of the current time window; and if the calculated flow threshold value of the current time window is smaller than the minimum flow threshold value, taking the minimum flow threshold value as the flow threshold value of the current time window.
The obtaining unit 420, the calculating unit 430, the judging unit 440, and the current limiting unit 450 correspond to the obtaining unit 310, the calculating unit 320, the judging unit 330, and the current limiting unit 340 in fig. 3 one to one, and are not described herein again.
Fig. 5 is a block diagram illustrating a flow control apparatus 500 for use in the above-described flow control method according to an exemplary embodiment. For example, the flow control device 500 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, an exercise device, a personal digital assistant, and the like.
Referring to fig. 5, the apparatus 500 may include one or more of the following components: processing components 510, memory 520, power components 530, multimedia components 540, audio components 550, input/output (I/O) interfaces 560, sensor components 570, and communication components 580.
The processing component 510 generally controls the overall operation of the device 500, such as operations associated with display, telephone calls, data communications, camera operations, and recording operations. The processing component 510 may include one or more processors 590 to execute instructions to perform all or part of the steps of the methods described above. Further, the processing component 510 can include one or more modules that facilitate interaction between the processing component 510 and other components. For example, the processing component 510 may include a multimedia module to facilitate interaction between the multimedia component 540 and the processing component 510.
The memory 520 is configured to store various types of data to support operation at the device 500. Examples of such data include instructions for any application or method operating on device 500, contact data, phonebook data, messages, pictures, videos, and so forth. The memory 520 may be implemented by any type or combination of volatile or non-volatile storage devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
The power supply component 530 provides power to the various components of the device 500. The power components 530 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the apparatus 500.
The multimedia component 540 includes a screen that provides an output interface between the device 500 and the user. In some embodiments, the screen may include a Liquid Crystal Display (LCD) and a Touch Panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive an input signal from a user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundary of a touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 540 includes a front facing camera and/or a rear facing camera. The front-facing camera and/or the rear-facing camera may receive external multimedia data when the device 500 is in an operating mode, such as a shooting mode or a video mode. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.
The audio component 550 is configured to output and/or input audio signals. For example, audio component 550 includes a Microphone (MIC) configured to receive external audio signals when apparatus 500 is in an operating mode, such as a call mode, a record mode, and a voice recognition mode. The received audio signal may further be stored in the memory 520 or transmitted via the communication component 580. In some embodiments, audio assembly 550 also includes a speaker for outputting audio signals.
The I/O interface 560 provides an interface between the processing component 510 and peripheral interface modules, which may be keyboards, click wheels, buttons, etc. These buttons may include, but are not limited to: a home button, a volume button, an enable button, and a lock button.
The sensor assembly 570 includes one or more sensors for providing various aspects of status assessment for the device 500. For example, the sensor assembly 570 may detect an open/closed state of the device 500, the relative positioning of the components, such as a display and keypad of the apparatus 500, the sensor assembly 570 may also detect a change in position of the apparatus 500 or a component of the apparatus 500, the presence or absence of user contact with the apparatus 500, orientation or acceleration/deceleration of the apparatus 500, and a change in temperature of the apparatus 500. The sensor assembly 570 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 570 may also include a light sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 570 may also include an acceleration sensor, a gyroscope sensor, a magnetic sensor, a pressure sensor, or a temperature sensor.
The communications component 580 is configured to facilitate communications between the apparatus 500 and other devices in a wired or wireless manner. The apparatus 500 may access a wireless network based on a communication standard, such as WiFi, an operator network (such as 2G, 3G, 4G, or 5G), or a combination thereof. In an exemplary embodiment, the communication component 580 receives a broadcast signal or broadcast associated information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communications component 580 further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, ultra Wideband (UWB) technology, bluetooth (BT) technology, and other technologies.
In an exemplary embodiment, the apparatus 500 may be implemented by one or more Application Specific Integrated Circuits (ASICs), digital Signal Processors (DSPs), digital Signal Processing Devices (DSPDs), programmable Logic Devices (PLDs), field Programmable Gate Arrays (FPGAs), controllers, micro-controllers, microprocessors or other electronic components for performing the above-described methods.
In an exemplary embodiment, a storage medium comprising instructions, such as memory 520 comprising instructions, executable by processor 590 of apparatus 500 to perform the above-described method is also provided. Alternatively, the storage medium may be a non-transitory computer readable storage medium, which may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
In an exemplary embodiment, there is also provided a computer program product, including a computer program product, the computer program including program instructions, which when executed by a mobile terminal, cause the mobile terminal to perform the steps of the above-mentioned flow control method: for a plurality of adjacent time windows before the current time window, respectively acquiring the average consumed time for receiving and processing the service request by the first service in each adjacent time window; calculating to obtain a flow threshold value of the current time window according to the average time consumption variation trend of the plurality of adjacent time windows; counting the number of received service requests in a current time window, and judging whether the number of the requests is greater than a flow threshold of the current time window; and if the request number is larger than the flow threshold value of the current time window, carrying out flow limiting operation.
Fig. 6 is a block diagram illustrating a flow control device 600 for use in the above-described flow control method according to an example embodiment. For example, the apparatus 600 may be provided as a server. Referring to fig. 6, the apparatus 600 includes a processing component 610 that further includes one or more processors and memory resources, represented by memory 620, for storing instructions, such as applications, that are executable by the processing component 610. The application programs stored in memory 620 may include one or more modules that each correspond to a set of instructions. Further, the processing component 610 is configured to execute instructions to perform the flow control methods described above.
The apparatus 600 may also include a power component 630 configured to perform power management of the apparatus 600, a wired or wireless network interface 640 configured to connect the apparatus 600 to a network, and an input output (I/O) interface 650. The apparatus 600 may operate based on an operating system stored in the memory 620, such as Windows Server, mac OS XTM, unixTM, linuxTM, freeBSDTM, or the like.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice in the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.
Claims (14)
1. A method of flow control, comprising:
for a plurality of adjacent time windows before the current time window, respectively acquiring the average consumed time for receiving and processing the service request by the first service in each adjacent time window;
calculating to obtain a flow threshold of a current time window according to a variation trend of average consumed time of the multiple adjacent time windows, wherein if the average consumed time of the multiple adjacent time windows does not change, the flow threshold of a previous time window is directly used as the flow threshold of the current time window, and if the average consumed time of the multiple adjacent time windows changes, the flow threshold of the previous time window is adjusted according to the variation trend of the average consumed time with a variation trend opposite to the variation trend of the average consumed time to obtain the flow threshold of the current time window;
counting the number of requests of received service requests in a current time window, and judging whether the number of the requests is greater than a flow threshold of the current time window; and
and if the request quantity is larger than the flow threshold value of the current time window, carrying out flow limiting operation.
2. The flow control method according to claim 1, wherein the calculating the flow threshold of the current time window according to the trend of the average elapsed time of the plurality of adjacent time windows comprises:
and calculating the change trend of the average time consumption of the first service for receiving and processing the service request in the last time window and the average time consumption of the first service for receiving and processing the service request in the last time window.
3. The flow control method according to claim 2, wherein the calculation formula for calculating the flow threshold of the current time window according to the trend of the average elapsed time of the plurality of adjacent time windows is:
limit 0 ＝(T 2 /T 1 )×limit 1
wherein, limit 0 Is the flow threshold, limit, of the current time window 1 Is the flow threshold, T, of the last time window 1 Is the average elapsed time, T, for the first service to receive and process the service request within the last time window 2 Is the average elapsed time for the first service to receive and process the service request within the last time window.
4. The flow control method according to claim 1, further comprising:
setting a traffic threshold for the time window for a first and a second time window in which the first service receives and processes the service request.
5. The flow control method according to claim 1, further comprising:
setting a maximum traffic threshold and a minimum traffic threshold for the first service to receive and process the service request.
6. The flow control method according to claim 5,
if the calculated flow threshold value of the current time window is larger than the maximum flow threshold value, taking the maximum flow threshold value as the flow threshold value of the current time window;
and if the calculated flow threshold value of the current time window is smaller than the minimum flow threshold value, taking the minimum flow threshold value as the flow threshold value of the current time window.
7. A flow control device, comprising:
the acquisition unit is configured to execute the steps of acquiring average consumed time for receiving and processing the service request by the first service in each adjacent time window for a plurality of adjacent time windows before the current time window;
a calculating unit, configured to calculate and obtain a flow threshold of a current time window according to a variation trend of average consumed time of the multiple adjacent time windows, wherein if the average consumed time of the multiple adjacent time windows does not vary, a flow threshold of a previous time window is directly used as the flow threshold of the current time window, and if the average consumed time of the multiple adjacent time windows varies, the flow threshold of the previous time window is adjusted according to the variation trend of the average consumed time with a variation trend opposite to the variation trend of the average consumed time to obtain the flow threshold of the current time window;
a judging unit configured to perform counting of a request quantity of the received service requests in a current time window, and judge whether the request quantity is greater than a traffic threshold of the current time window; and
and the current limiting unit is configured to perform a current limiting operation if the request quantity is greater than the flow threshold of the current time window.
8. The flow control device of claim 7, wherein said calculating the flow threshold for the current time window according to the trend of the average elapsed time of the plurality of adjacent time windows comprises:
and calculating the change trend of the average time consumption of the first service for receiving and processing the service request in the last time window and the average time consumption of the first service for receiving and processing the service request in the last time window.
9. The flow control device according to claim 8, wherein the calculation formula for calculating the flow threshold value of the current time window according to the trend of the average elapsed time of the plurality of adjacent time windows is as follows:
limit 0 ＝(T 2 /T 1 )×limit 1
wherein, limit 0 Is the flow threshold, limit, of the current time window 1 Is the flow threshold, T, of the last time window 1 Is the average elapsed time, T, for the first service to receive and process the service request within the last time window 2 Is the average elapsed time for the first service to receive and process the service request within the last time window.
10. A flow control device according to claim 7, further comprising:
a setting unit configured to perform a first and a second time window for receiving and processing the service request for the first service, setting a traffic threshold of the time window.
11. A flow control device according to claim 7, wherein said flow control device further comprises:
a setting unit configured to perform setting of a maximum traffic threshold and a minimum traffic threshold for the first service to receive and process the service request.
12. The flow control device of claim 11,
if the calculated flow threshold value of the current time window is larger than the maximum flow threshold value, taking the maximum flow threshold value as the flow threshold value of the current time window;
and if the calculated flow threshold value of the current time window is smaller than the minimum flow threshold value, taking the minimum flow threshold value as the flow threshold value of the current time window.
13. An electronic device, comprising:
a processor;
a memory for storing the processor-executable instructions;
wherein the processor is configured to execute the instructions to implement the flow control method of any one of claims 1 to 6.
14. A storage medium in which instructions, when executed by a processor of an electronic device, enable the electronic device to perform the flow control method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910410620.5A CN110166371B (en) | 2019-05-16 | 2019-05-16 | Flow control method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910410620.5A CN110166371B (en) | 2019-05-16 | 2019-05-16 | Flow control method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110166371A CN110166371A (en) | 2019-08-23 |
| CN110166371B true CN110166371B (en) | 2022-11-22 |
Family
ID=67631190
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910410620.5A Active CN110166371B (en) | 2019-05-16 | 2019-05-16 | Flow control method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110166371B (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111092959B (en) * | 2019-12-29 | 2022-08-12 | 浪潮电子信息产业股份有限公司 | Request processing method, system and related device for servers in cluster |
| CN111262795B (en) * | 2020-01-08 | 2024-02-06 | 京东科技控股股份有限公司 | Service interface-based current limiting method and device, electronic equipment and storage medium |
| CN113783799A (en) * | 2020-06-09 | 2021-12-10 | 马上消费金融股份有限公司 | Flow control method and device |
| CN111935782B (en) * | 2020-06-29 | 2023-08-08 | 福建天泉教育科技有限公司 | Optimization method of client retry mechanism and storage medium |
| CN113765813A (en) * | 2020-09-24 | 2021-12-07 | 北京沃东天骏信息技术有限公司 | Method and device for dynamically adjusting message receiving rate |
| CN112367269A (en) * | 2020-10-30 | 2021-02-12 | 深圳壹账通智能科技有限公司 | Double-pointer-based sliding window current limiting method, device, equipment and storage medium |
| CN112769657B (en) * | 2020-12-26 | 2022-07-26 | 度小满科技(北京)有限公司 | Flow control method and device |
| CN113691604A (en) * | 2021-08-18 | 2021-11-23 | 深圳鼎盛电脑科技有限公司 | Adaptive current limiting method, device, equipment and medium for network request |
| CN114513461A (en) * | 2022-02-11 | 2022-05-17 | 联仁健康医疗大数据科技股份有限公司 | Current limiting method and device, electronic equipment and storage medium |
| CN115086234B (en) * | 2022-05-09 | 2024-04-26 | 阿里巴巴（中国）有限公司 | Message processing method, system, equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103442087A (en) * | 2013-09-12 | 2013-12-11 | 重庆大学 | Web service system access volume control device and method based on response time trend analysis |
| CN107071151A (en) * | 2017-03-15 | 2017-08-18 | 广东欧珀移动通信有限公司 | For the control method and mobile terminal of the physical button corresponding to home keys |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102779062A (en) * | 2011-05-09 | 2012-11-14 | 阿里巴巴集团控股有限公司 | Method and device for controlling number of threads accessing system resources |
| CN104753805B (en) * | 2013-12-31 | 2018-07-24 | 腾讯科技（深圳）有限公司 | Distributed flow control method, server and system |
| CN107454004A (en) * | 2016-05-30 | 2017-12-08 | 阿里巴巴集团控股有限公司 | A kind of flow control methods and device |
| CN106160953B (en) * | 2016-07-06 | 2019-04-16 | 四川大学 | A kind of transmission method based on learning-oriented energy efficiency model |
| CN108712350B (en) * | 2018-06-05 | 2022-04-05 | 中国农业银行股份有限公司 | Flow control method and device capable of automatically regulating and controlling in real time based on custom rule |
-
2019
- 2019-05-16 CN CN201910410620.5A patent/CN110166371B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103442087A (en) * | 2013-09-12 | 2013-12-11 | 重庆大学 | Web service system access volume control device and method based on response time trend analysis |
| CN107071151A (en) * | 2017-03-15 | 2017-08-18 | 广东欧珀移动通信有限公司 | For the control method and mobile terminal of the physical button corresponding to home keys |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110166371A (en) | 2019-08-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110166371B (en) | Flow control method and device, electronic equipment and storage medium | |
| CN109474538B (en) | Data transmission method and device, terminal equipment and storage medium | |
| CN110611829B (en) | Video preloading method and device, electronic equipment and storage medium | |
| CN106528389B (en) | Performance evaluation method and device for system fluency and terminal | |
| CN107040591B (en) | Method and device for controlling client | |
| CN110120896B (en) | Network delay control method and device, electronic equipment and storage medium | |
| CN107193653B (en) | Bandwidth resource allocation method, device and storage medium | |
| US20170055221A1 (en) | Method and apparatus for starting energy saving mode | |
| CN106231640B (en) | Wireless access point switching method and device | |
| CN111581174A (en) | Resource management method and device based on distributed cluster system | |
| CN108427618B (en) | Method and device for determining stuck state and computer readable storage medium | |
| CN111880681A (en) | Touch screen sampling rate adjusting method and device and computer storage medium | |
| CN109783337B (en) | Model service method, system, apparatus and computer readable storage medium | |
| CN105955821B (en) | Pre-reading method and device | |
| CN110856196B (en) | WLAN service optimization method, terminal device and storage medium | |
| CN113725954A (en) | Charging method, device, equipment and storage medium | |
| CN114487840A (en) | Battery control method, device and storage medium | |
| CN114442792A (en) | Method and device for adjusting operating frequency of processor and storage medium | |
| CN108427582B (en) | Method and device for determining stuck state and computer readable storage medium | |
| CN111314232A (en) | Application acceleration method, device and storage medium | |
| CN108304288B (en) | Method, device and storage medium for acquiring bandwidth utilization rate | |
| CN108231037B (en) | Method and device for determining screen brightness setting range | |
| CN112187326A (en) | Antenna control method, device, equipment and storage medium | |
| CN111240590A (en) | Dirty data erasing method, dirty data erasing device and electronic equipment | |
| CN111722919A (en) | Method and device for running background application program, storage medium and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |