Request information processing method and apparatus, electronic device, and storage medium

Abstract

Embodiments of the present disclosure provide a request information processing method and apparatus, an electronic device, and a storage medium. The request information processing method comprises: acquiring request information; in a preset scenario, determining a priority corresponding to the request information; when the priority corresponding to the request information is a first priority, determining a request amount corresponding to the first priority; and on the basis of the request amount corresponding to the first priority, and a first traffic rate limit threshold, responding to the request information.

Description

Request information processing method, device, electronic device and storage medium

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese patent application filed on December 7, 2023, with application number 202311676199.5 and invention name “A method, device, electronic device and storage medium for request information processing”. The entire contents of that application are incorporated by reference into this application. Technical Field

[0003] The present disclosure relates to computer technology, and more particularly to a request information processing method, apparatus, electronic device, and storage medium. Background Art

[0004] Currently, applications typically use stress testing to assess the maximum number of requests each interface can handle, and then configure fixed thresholds for each interface. When the number of requests to an interface exceeds the corresponding threshold, the interface's requests will not be processed. However, each interface's threshold must be configured and maintained separately, which is costly when there are many interfaces. Furthermore, once the request limit condition is triggered, requests are indiscriminately restricted. Summary of the Invention

[0005] The present disclosure provides a request information processing method, device, electronic device and storage medium, which reduce maintenance costs and improve the effectiveness of request information processing.

[0006] In a first aspect, an embodiment of the present disclosure provides a method for processing request information, including:

[0007] Get request information;

[0008] In a preset scenario, determining a priority corresponding to the request information, where the priority corresponding to the request information includes a first priority or a second priority, and the level of the first priority is higher than the level of the second priority;

[0009] When the priority level corresponding to the request information is the first priority level, determining the request amount corresponding to the first priority level;

[0010] The request information is responded to according to the request volume corresponding to the first priority and the first traffic rate limit threshold.

[0011] In a second aspect, an embodiment of the present disclosure further provides a request information processing device, including:

[0012] Acquisition module, used to obtain request information;

[0013] A first determining module is configured to determine, in a preset scenario, a priority corresponding to the request information, where the priority corresponding to the request information includes a first priority or a second priority, where the first priority is higher than the second priority;

[0014] a second determining module, configured to determine, when the priority corresponding to the request information is the first priority, a request quantity corresponding to the first priority;

[0015] The response module is used to respond to the request information according to the request amount corresponding to the first priority and the first traffic speed limit threshold.

[0016] In a third aspect, an embodiment of the present disclosure further provides an electronic device, the electronic device comprising:

[0017] one or more processing devices;

[0018] a storage device for storing one or more programs,

[0019] When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the request information processing method provided by any embodiment of the present disclosure.

[0020] In a fourth aspect, an embodiment of the present disclosure further provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to execute the request information processing method provided by any embodiment of the present disclosure.

[0021] In an embodiment of the present disclosure, request information is obtained; in a preset scenario, the priority corresponding to the request information is determined, where the priority corresponding to the request information includes a first priority or a second priority, and the level of the first priority is higher than the level of the second priority; when the priority corresponding to the request information is the first priority, the request amount corresponding to the first priority is determined; and the request information is responded to according to the request amount corresponding to the first priority and the first traffic speed limit threshold. BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The above and other features, advantages, and aspects of the various embodiments of the present disclosure will become more apparent with reference to the following detailed description in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numerals represent the same or similar elements. It should be understood that the drawings are schematic and that the originals and elements are not necessarily drawn to scale.

[0023] FIG1 is a flow chart of a method for processing request information provided by an embodiment of the present disclosure;

[0024] FIG2 is a flow chart of another method for processing request information provided by an embodiment of the present disclosure;

[0025] FIG3 is a flow chart of another method for processing request information provided by an embodiment of the present disclosure;

[0026] FIG4 is a schematic diagram of the structure of a request information processing device provided by an embodiment of the present disclosure;

[0027] FIG5 is a schematic structural diagram of an electronic device provided by an embodiment of the present disclosure. DETAILED DESCRIPTION

[0028] The following describes embodiments of the present disclosure in more detail with reference to the accompanying drawings. Although certain embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be construed as limited to the embodiments described herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of protection of the present disclosure.

[0029] It should be understood that the various steps described in the method embodiments of the present disclosure may be performed in different orders and / or in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope of the present disclosure is not limited in this respect.

[0030] As used herein, the term "including" and its variations are open-ended, i.e., "including but not limited to." The term "based on" means "based, at least in part, on." The term "one embodiment" means "at least one embodiment," the term "another embodiment" means "at least one additional embodiment," and the term "some embodiments" means "at least some embodiments." Other terms are defined in the following description.

[0031] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0032] It should be noted that the modifications of "one" and "multiple" mentioned in the present disclosure are illustrative rather than restrictive, and those skilled in the art should understand that unless otherwise clearly indicated in the context, they should be understood as "one or more".

[0033] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0034] It is understandable that before using the technical solutions disclosed in the various embodiments of this disclosure, the type, scope of use, usage scenarios, etc. of the personal information involved in this disclosure should be informed to the user and the user's authorization should be obtained in an appropriate manner in accordance with relevant laws and regulations.

[0035] For example, in response to a user's active request, a prompt message is sent to the user to clearly inform the user that the operation requested will require the acquisition and use of the user's personal information. This allows the user to independently choose whether to provide personal information to the electronic device, application, server, storage medium, or other software or hardware that performs the operations of the disclosed technical solution based on the prompt message.

[0036] As an optional but non-limiting implementation, in response to receiving a user's active request, the prompt information may be sent to the user in the form of a pop-up window, in which the prompt information may be presented in text form. Furthermore, the pop-up window may also contain a selection control for the user to select "agree" or "disagree" to provide personal information to the electronic device.

[0037] It is understandable that the above notification and user authorization process are merely illustrative and do not limit the implementation of the present disclosure. Other methods that comply with relevant laws and regulations may also be applied to the implementation of the present disclosure.

[0038] It is understandable that the data involved in this technical solution (including but not limited to the data itself, the acquisition or use of the data) must comply with the requirements of relevant laws, regulations and relevant provisions.

[0039] Figure 1 is a flow chart of a request information processing method provided by an embodiment of the present disclosure. The embodiment of the present disclosure is applicable to situations where request information is processed. The method can be executed by a request information processing device, which can be implemented in the form of software and / or hardware. Optionally, it can be implemented by an electronic device, which can be a mobile terminal, a PC or a server, etc.

[0040] As shown in FIG1 , the method includes:

[0041] S110: Obtain request information.

[0042] The request information may be information indicating a request, such as information indicating a request triggered by a client. The request information processing method provided in this disclosure may be executed by a server. The server may obtain the request information from the client. The content of the request information is not limited, such as a request to enter a live broadcast room or a request to display a ranking list within the live broadcast room.

[0043] This operation allows the server to obtain the request information transmitted by the client, and then analyze the request information through the server to respond to the request information.

[0044] S120: Under a preset scenario, determine the priority corresponding to the request information.

[0045] The preset scenario can be a scenario where the request information is analyzed for processing, such as a flow control scenario, which is a scenario where the processing of request information is limited. In the preset scenario, whether the request information is processed needs to be determined after analyzing the request information.

[0046] The priority level of a request message may be associated with the interface information corresponding to the request message. The priority level of the request message may include a first priority level or a second priority level, where the first priority level is higher than the second priority level. The priority level may represent the priority with which the request message is processed, with a request message of the first priority level being processed before a request message of the second priority level.

[0047] Interface information can be considered as information that characterizes the interface. Interface information can include an interface identifier that uniquely identifies the interface and / or resource parameters of resources associated with the interface. Interface-associated resources can be resources associated with the interface. Resource parameters can be parameters that characterize resources. For example, if the interface is an interface for entering a live broadcast room, the interface-associated resource can be the live broadcast room being entered. The resource identifier can be a parameter that identifies the live broadcast room.

[0048] In one embodiment, the present disclosure can set the priority of requests according to preset conditions. When the service is overloaded, low-priority requests can be rejected. Interface identification can be used to differentiate priorities based on the interface and implement flow control. For example, interfaces can be divided into different priorities, and a second flow rate limit threshold can be set for the application process. When the request volume exceeds the second flow rate limit threshold, low-priority interface requests are rejected and high-priority interface requests are processed.

[0049] In one embodiment, the present embodiment can determine the traffic of the live broadcast room through resource parameters. Different resource parameters correspond to different priorities, and the response mode of the interface associated with different live broadcast rooms can be determined.

[0050] The priority corresponding to the request information may be determined based on the interface information, and the priority division may be implemented based on the interface information, such as implementing the priority division from the interface dimension and / or resource dimension.

[0051] In one embodiment, this operation may query a priority table that assigns priorities to different interface information based on the interface information corresponding to the request information to determine the priority corresponding to the request information. How to determine the priority based on the interface information is not limited here.

[0052] The first priority level is higher than the second priority level, and the first priority level may be a high priority level. In a preset scenario, this operation may determine whether the request information corresponds to a high priority level, so as to determine a method for responding to the request information.

[0053] When determining the priority in this operation, the priority corresponding to the request information may be determined first, and then whether the current scene is a preset scene; or whether the current scene is a preset scene may be determined first, and then the priority corresponding to the request information may be determined.

[0054] When the current scenario is not in the preset scenario, the priority corresponding to the request information may be determined, or the priority corresponding to the request information may be determined and the request information may be directly processed. The scenario not in the preset scenario may be a scenario without flow restriction.

[0055] This embodiment prioritizes requests into first-priority requests, i.e., high-priority requests, and second-priority requests, i.e., ordinary requests. The first-priority requests and the second-priority requests may have the following characteristics:

[0056] 1. The number of common requests that exceeds the number of high-priority requests is greater than the set number. That is, the number of common requests is much higher than the number of high-priority requests. For example, only a few interfaces that affect the set functions are marked as high-priority requests.

[0057] 2. In most cases, the number of high-priority requests is lower than the total throttling threshold. If the number of high-priority requests exceeds the total throttling threshold, they will also trigger throttling. The total throttling threshold can be considered the sum of the first and second throttling thresholds. The first throttling threshold is used to trigger the preset scenario. The second throttling threshold is used to determine whether the first-priority request is executed.

[0058] S130. When the priority corresponding to the request information is the first priority, determine the request amount corresponding to the first priority.

[0059] In the case where the priority corresponding to the request information is the first priority, the request information may be considered as high-priority request information.

[0060] The number of requests corresponding to the first priority level can be considered the number of high-priority requests received by the server. The number of requests corresponding to the first priority level can be the number of requests obtained by counting the first-priority requests when the server is in a preset scenario; it can also be the number of requests obtained by counting the first-priority requests when the server is not in a preset scenario and in a preset scenario.

[0061] In one embodiment, the number of requests corresponding to the first priority is the number of requests corresponding to the first priority within a set time period under a preset scenario.

[0062] This embodiment counts the requests of the first priority in a preset scenario separately, and determines the count value within a set time period as the request quantity corresponding to the first priority.

[0063] S140. Respond to the request information according to the request volume corresponding to the first priority and the first traffic rate limit threshold.

[0064] The first traffic rate limit threshold can be considered as a threshold for restricting requests of the first priority. In a preset scenario, the first traffic rate limit threshold is used to restrict the number of requests of the first priority that can be processed, such as the number of requests of the first priority that can be processed after the preset scenario is triggered.

[0065] This operation can compare the number of requests corresponding to the first priority with the first traffic rate limit threshold to determine a magnitude relationship. The magnitude relationship can indicate that the number of requests corresponding to the first priority is greater than the first traffic rate limit threshold; it can also indicate that the number of requests corresponding to the first priority is less than or equal to the first traffic rate limit threshold.

[0066] There is no limitation on the method of responding to the request information, which may include processing the request information and rejecting the request information.

[0067] When the request volume corresponding to the first priority is greater than the first traffic speed limit threshold, it can be considered that the request volume of high-priority requests has exceeded the first traffic speed limit threshold, and the request information can be rejected and not processed, or the processing of the request information can be delayed.

[0068] When the request volume corresponding to the first priority is less than or equal to the first traffic speed limit threshold, it can be considered that the request volume of high-priority requests does not exceed the first traffic speed limit threshold, and the request information can be processed.

[0069] This embodiment may display that in a preset scenario, requests with a first priority level and a first traffic rate limit threshold level continue to be processed.

[0070] The technical solution of the embodiment of the present disclosure is as follows: obtaining request information; determining the priority corresponding to the request information under a preset scenario, the priority corresponding to the request information includes a first priority or a second priority, and the level of the first priority is higher than the level of the second priority; in the case where the priority corresponding to the request information is the first priority, determining the request amount corresponding to the first priority; and responding to the request information according to the request amount corresponding to the first priority and the first traffic speed limit threshold. The present disclosure avoids maintaining the flow limit threshold for all interfaces by setting a first traffic speed limit threshold for the request amount corresponding to the first priority, thereby reducing the cost of interface maintenance. Under the preset scenario, the response method of the request information of the first priority is determined based on the request amount corresponding to the first priority and the first traffic speed limit threshold, thereby improving the effectiveness of request information processing.

[0071] Based on the above embodiment, a modified embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the modified embodiment.

[0072] In one embodiment, determining the priority corresponding to the request information in a preset scenario includes:

[0073] Determine whether the request volume of the application process within a set time period is greater than a second traffic rate limit threshold;

[0074] If so, trigger to enter the preset scene;

[0075] In the preset scenario, a priority corresponding to the request information is determined.

[0076] Determining the priority corresponding to the request information can be done via a priority determination service. Determining whether the number of requests from the application process within a set time period exceeds a second traffic rate limit threshold; if so, triggering entry into a preset scenario can be performed by the traffic rate limit system. The priority determination service can be considered a service that determines the priority of the request information. The traffic rate limit system can be a system that implements traffic limiting.

[0077] The application process can be considered to be the process of the application program. The set duration can be a pre-set duration. Statistics for the set duration are not limited, for example, statistics can be calculated using a sliding window. The second traffic rate limit threshold can be considered to be a threshold for determining whether a preset scenario is triggered.

[0078] After receiving the request, the server can first determine the priority of the request using the priority determination service, thereby marking the priority of the request. After determining the priority of the request, the priority determination service can transmit the marked priority to the traffic rate limiting system, or transmit the marked request to the traffic rate limiting system.

[0079] The traffic rate limiting system can determine whether the number of requests from an application process within a set time period exceeds a second traffic rate limiting threshold to determine whether a preset scenario has been entered. The number of requests within the set time period is determined by the number of request messages received within the set time period. When determining the number of requests within the set time period, requests of different priorities can be counted separately, or requests can be counted directly without distinguishing between priorities.

[0080] After triggering the preset scenario, the traffic rate limiting system can query the priority determined by the priority determination service for the request information, so as to determine the way to respond to the request information based on the determined priority.

[0081] In this embodiment, the priority corresponding to the request information can be determined by the server through a priority determination service, or the client can carry the priority corresponding to the request information when sending the request information, and the server can extract the carried priority to determine the priority corresponding to the request information.

[0082] When determining the priority corresponding to the request information through the priority determination service, it can be that after the server obtains the request information, the priority corresponding to the request information is determined through the priority determination service, and when the traffic speed limiting system needs to query the priority, it queries from the priority determination service to determine the priority corresponding to the request information; it can also be that when the traffic speed limiting system needs to determine the priority of the request information, the priority determination service is called to determine the priority corresponding to the request information through the priority determination service.

[0083] In one embodiment, determining the priority corresponding to the request information includes:

[0084] Determining interface information corresponding to the request information, the interface information including an interface identifier and / or resource parameters of resources associated with the interface;

[0085] Determine the priority corresponding to the interface information, and determine the priority corresponding to the interface information as the priority corresponding to the request information.

[0086] An interface identifier can be a parameter that uniquely identifies an interface. An interface identifier can be used to identify an interface. For example, an interface identifier can be used to identify an interface for entering a live broadcast room, or an interface identifier can be used to identify an interface for displaying interactive messages.

[0087] The interface information may be carried in the request information, or may be pre-agreed upon by the server and the client for different request information.

[0088] The priority determination service can query the priority corresponding to the interface information, such as querying the local priority table that assigns priorities to different interface information. The priority table is not limited and can be determined based on actual conditions and can be updated in real time.

[0089] FIG2 is a flowchart of another method for processing request information provided by an embodiment of the present disclosure. This embodiment refines the operation of responding to request information. Referring to FIG2 , this embodiment includes the following steps:

[0090] S210: Obtain request information.

[0091] S220: Under a preset scenario, determine the priority corresponding to the request information.

[0092] S230: When the priority corresponding to the request information is the first priority, determine the request amount corresponding to the first priority.

[0093] S240. Determine whether the request volume corresponding to the first priority is greater than the first traffic rate limit threshold. If so, execute S250; if not, execute S260.

[0094] This operation determines whether the request volume corresponding to the first priority is greater than the first traffic rate limit threshold, and whether the number of processed first priority requests reaches the set number, so as to determine the technical method for responding to the processing request.

[0095] S250: Reject the request corresponding to the request information, and end the operation.

[0096] When the request volume corresponding to the first priority is greater than the first traffic rate limit threshold, the request information may be rejected to avoid application freezing or crashing.

[0097] S260: Process the request corresponding to the request information and update the request quantity within the set time period.

[0098] When the request volume corresponding to the first priority is less than or equal to the first traffic rate limit threshold, the request information may be processed.

[0099] The order of processing the request information and updating the request volume within the set time period is not limited. They can be performed simultaneously, or the request information can be processed first and then the request volume within the set time period can be updated; or the request volume within the set time period can be updated first and then the request information can be processed.

[0100] In a preset scenario, requests of the first priority may be counted separately, and the request amount of the set duration may include a first count value for counting requests of the first priority in the preset scenario and a second count value for counting requests not in the preset scenario.

[0101] The second count value is updated when the scene is not in the preset scenario, and the first count value is updated when the scene is in the preset scenario.

[0102] This embodiment refines different size relationships and response methods for request information, ensuring that in a preset scenario, requests with a first priority level of the first traffic speed limit threshold can be processed, and requests with a second priority level are rejected.

[0103] Based on the above embodiment, a modified embodiment of the above embodiment is proposed. It should be noted that, in order to simplify the description, only the differences from the above embodiment are described in the modified embodiment.

[0104] In one embodiment, updating the request volume within a set time period includes:

[0105] Updating a current first counter of a current first time window corresponding to the request information and a first count value within a sliding window, where the sliding window includes multiple first time windows, each first time window corresponding to a first counter for counting requests of a first priority, the current first time window being a time window corresponding to the request information in a preset scenario, and the first count value being a sum of count values ​​of the first counters corresponding to all first time windows in the sliding window in the preset scenario;

[0106] The sum of the first count value and a second count value that is not in the preset scenario is determined as the updated request amount within the set time period, and the second count value is the number of processed requests in the sliding window corresponding to the non-preset scenario.

[0107] This embodiment counts requests using a sliding window. The sliding window can be divided into multiple time windows. This embodiment can set a first time window for requests of the first priority to implement counting of the requests of the first priority.

[0108] In the preset scenario, the time window corresponding to the request information can be a time window that matches the time corresponding to the request information. The time corresponding to the request information is not limited, for example, it can be the time when the request information is initiated or the time when the server receives the request information.

[0109] Different first time windows may correspond to different moments. The current first time window corresponding to the request information is determined from the multiple first time windows of the sliding window according to the time corresponding to the request information.

[0110] Each first time window corresponds to a first counter, and the first time window is counted by the corresponding first counter. The first counter can be considered as a counter for counting the first time window.

[0111] The first count value can be considered as a value counted for requests of the first priority in a preset scenario. The first count value summarizes the count values ​​of all first counters.

[0112] When processing request information, this embodiment can update the current first counter and first count value corresponding to the request information, so that after receiving new request information, the relationship between the request volume corresponding to the first priority and the first traffic speed limit threshold can be determined to determine the response method for the new request information.

[0113] The updated request quantity within the set time period is the sum of the first count value and the second count value. In a preset scenario, the first count value is updated and the second count value remains unchanged.

[0114] The count value of the sliding window can be stored in the form of an array, and each time the sliding window slides, the value of the corresponding array can be updated.

[0115] The present disclosure can set a sliding window array for high-priority requests, that is, an array storing the count values ​​of multiple first counters. Alternatively, a sliding window array window[n] can be set when the preset scenario is not in progress, for counting requests within a set duration corresponding to the sliding window.

[0116] The triggering of sliding the sliding window is not limited. For example, the sliding time can be counted to determine whether a set time interval is reached. If so, the sliding window can be slid. The value of the corresponding data item can be updated after each sliding of the sliding window.

[0117] After obtaining the request information, the current time may be obtained, and whether to slide the sliding window may be determined based on the interval between the current time and the time when the sliding window last slid.

[0118] In one embodiment, the request information processing method provided by the present disclosure further includes:

[0119] If the scenario is not set to default, process the request information;

[0120] Update the current second counter of the current second time window corresponding to the request information and the second count value in the sliding window, the sliding window includes multiple second time windows, each second time window corresponds to a second counter for counting requests, and the current second time window is the time window corresponding to the request information that is not in the preset scenario.

[0121] If the traffic rate limiting system determines that the request volume of the application process within the set time period is not greater than the second traffic rate limiting threshold, it is determined that the current scenario is not in the preset scenario. If the scenario is not in the preset scenario, the request information is processed.

[0122] There is no restriction on the order of processing request information and updating the request quantity within the set time period. They can be executed in parallel, or the request information can be processed first and then the request quantity within the set time period is updated; or the request quantity within the set time period can be updated first and then the request information is processed.

[0123] The second time window can be considered a time window for counting requests when not in the preset scenario. The sliding window can be divided into multiple second time windows. Each second time window corresponds to a second counter. The second time window counts requests using the corresponding second counter.

[0124] The current second time window is a time window that matches the time corresponding to the request information.

[0125] When processing the second request information, this embodiment may update the current second counter and the second count value, such as by adding 1 to the current second counter. The second count value is added by 1 to indicate the count of the request information, so as to facilitate a basis for determining whether to process subsequent request information.

[0126] The present disclosure is exemplified below. The request information processing method provided by the present disclosure can be considered as an interface current limiting solution that distinguishes business priorities. If the current limiting threshold of each interface is maintained separately, the maintenance cost is high when there are many interfaces. Different requests of the same interface may not have the same priority. In order to ensure the normal operation of certain functions of the application process, this embodiment can set different priorities for different request information to determine the technical method of responding to the request information.

[0127] This embodiment can be implemented through a priority determination service and a traffic rate limiting system.

[0128] The priority determination service, also known as the request priority marking service, marks the priority of the request information based on the interface of the request information or the resource parameters of the request information, and divides the level into first priority and second priority.

[0129] The traffic rate limiting system is also called a priority-supported traffic rate limiting system. When the number of requests exceeds the first traffic rate limiting threshold, it ensures that at least the first priority requests of the second traffic rate limiting threshold are passed.

[0130] The solution for implementing request information processing through a sliding window in this embodiment is as follows:

[0131] The sliding window limits the number of normal requests allowed per second, the second traffic rate limit threshold normalLimit = 1000, and the first traffic rate limit threshold hightLimit = 100 high-priority requests. The 1000 normal requests can include high-priority requests, that is, high-priority requests occupy the counting quota of normal requests.

[0132] Divide 1s into size (size = 10) small time windows. The time span of each time window is 1000ms / 10 = 100ms. Maintain a counter for each time window. When a request arrives, increment the counter of the current time window by 1, and check whether the total request volume N = counter + hightCounter within the last 1s is < normalLimit. Here, counter is the second count value, and hightCounter is the first count value. The request volume of the application process within the set duration is counter + hightCounter. The set duration can be equal to the duration occupied by the sliding window.

[0133] If N < normalLimit, that is, when not in the preset scenario, the request passes (i.e., process the request information), and increment the request count counter and the counter of the current time window window[n] by 1. The current second counter of the current second time window is the counter of the current time window window[n]. The second count value within the sliding window is counter.

[0134] If N >= normalLimit, that is, in the preset scenario, check whether the current request traffic level is a high-priority request, that is, query the priority corresponding to the request information determined by the service through the traffic speed limit system. Determine whether the priority corresponding to the request information is the first priority.

[0135] If it is a normal request, reject the current request. That is, in the preset scenario, if the priority corresponding to the request information is the second priority, reject the request information.

[0136] If it is a high-priority request, check whether the borrowed request quantity N' within the last 1s for high-priority requests (i.e., the quantity of requests corresponding to the first priority within the set duration in the preset scenario) is > highLimit (i.e., the first traffic speed limit threshold). That is, when the priority corresponding to the request information is the first priority, determine the request volume corresponding to the first priority.

[0137] If N' < hightLimit, process the request, and increment the high-priority request counter highCounter (i.e., the first count value) and the high-priority request current time window counter highWindow[n] (i.e., the current first counter) by 1 respectively. That is, when the request volume corresponding to the first priority is less than or equal to the first traffic speed limit threshold, process the request corresponding to the request information and update the request volume within the set duration.

[0138] If N >= hightLimit, the request is rejected. That is, when the request volume corresponding to the first priority is greater than the first traffic rate limit threshold, the request corresponding to the request information is rejected.

[0139] The present disclosure can ensure that the total request volume within the most recent size time windows does not exceed normalLimit + hightLimit, and ensure that at least hightLimit high-priority requests can pass when traffic rate limiting is triggered. When hightLimit = normalLimit, high-priority requests will always be processed preferentially.

[0140] FIG. 3 is a schematic flowchart of another method for processing request information provided by an embodiment of the present disclosure. Referring to FIG. 3:

[0141] 1. The server sets the traffic rate limit threshold within 1 s to normalLimit (normalLimit = 1000), and high-priority traffic is allowed;

[0142] 2. The client sends an interface request to the server, that is, the request starts;

[0143] 3. The traffic marking service determines the traffic level of the current request information, that is, the priority, to implement traffic marking;

[0144] 4. Check whether traffic rate limiting is triggered through the priority traffic rate limiting system:

[0145] Check whether the request volume S within 1 s (that is, the request volume within the set duration) is greater than normalLimit, that is, determine whether the total request volume triggers traffic rate limiting;

[0146] a. If S < normalLimit and does not exceed the traffic rate limit threshold, that is, the second traffic rate limit threshold, process the request;

[0147] b. If S >= normalLimit and the request volume exceeds the traffic rate limit threshold, it is necessary to check the priority of the request information, that is, determine whether it is a high-priority request:

[0148] i. If the priority of the current request information is the second priority, reject the request;

[0149] ii. If the priority of the current request information is the first priority, check whether the high-priority request volume exceeds the limit (implement determining whether high-priority request traffic rate limiting is triggered), that is, determine the request volume corresponding to the first priority.

[0150] 1. If the high-priority request volume does not exceed the limit, process the request;

[0151] 2. If the high-priority request quantity exceeds the limit, reject the request.

[0152] FIG4 is a schematic diagram of the structure of a request information processing device provided by an embodiment of the present disclosure. As shown in FIG4 , the device includes:

[0153] Acquisition module 410, used to obtain request information;

[0154] A first determining module 420 is configured to determine a priority corresponding to the request information in a preset scenario, where the priority corresponding to the request information includes a first priority or a second priority, where the first priority is higher than the second priority;

[0155] A second determining module 430 is configured to determine a request quantity corresponding to the first priority when the priority corresponding to the request information is the first priority;

[0156] The response module 440 is configured to respond to the request information according to the request volume corresponding to the first priority and a first traffic rate limit threshold.

[0157] The technical solution provided by the disclosed embodiments avoids maintaining flow-limiting thresholds for all interfaces by setting a first-priority request volume, thereby reducing interface maintenance costs. In pre-defined scenarios, the response method for first-priority request information is determined based on the first-priority request volume and the first flow-limiting threshold, thereby improving the efficiency of request information processing.

[0158] The request information processing device provided by the embodiments of the present disclosure can execute the request information processing method provided by any embodiment of the present disclosure, and has the corresponding functional modules and beneficial effects of the execution method.

[0159] In one embodiment, the first determining module 420 includes:

[0160] a determining unit, configured to determine whether the request volume of the application process within a set time period is greater than a second traffic rate limit threshold;

[0161] A trigger unit, configured to trigger entry into a preset scene;

[0162] The query unit is used to obtain the priority corresponding to the request information in the preset scenario.

[0163] In one embodiment, the determining unit is specifically configured to:

[0164] Determining interface information corresponding to the request information, the interface information including an interface identifier and / or resource parameters of resources associated with the interface;

[0165] Determine the priority corresponding to the interface information, and determine the priority corresponding to the interface information as the priority corresponding to the request information.

[0166] In one embodiment, the response module 440 includes:

[0167] a rejecting unit, configured to reject the request corresponding to the request information when the request volume corresponding to the first priority is greater than the first traffic rate limit threshold; and / or,

[0168] A processing unit is configured to process the request corresponding to the request information and update the request quantity within a set time period when the request quantity corresponding to the first priority is less than or equal to the first traffic speed limit threshold.

[0169] In one embodiment, the processing unit updates the request volume within a set time period, including:

[0170] Updating a current first counter of a current first time window corresponding to the request information and a first count value within a sliding window, where the sliding window includes multiple first time windows, each first time window corresponding to a first counter for counting requests of a first priority, the current first time window being a time window corresponding to the request information in a preset scenario, and the first count value being a sum of count values ​​of the first counters corresponding to all first time windows in the sliding window in the preset scenario;

[0171] The sum of the first count value and a second count value that is not in the preset scenario is determined as the updated request amount within the set time period, and the second count value is the number of processed requests in the sliding window corresponding to the non-preset scenario.

[0172] In one embodiment, the request information processing device further includes: an update module for

[0173] If the scenario is not set to default, process the request information;

[0174] Update the current second counter of the current second time window corresponding to the request information and the second count value in the sliding window, the sliding window includes multiple second time windows, each second time window corresponds to a second counter for counting requests, and the current second time window is the time window corresponding to the request information that is not in the preset scenario.

[0175] In one embodiment, the number of requests corresponding to the first priority is the number of requests corresponding to the first priority within a set time period under a preset scenario.

[0176] It is worth noting that the various units and modules included in the above-mentioned device are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the embodiments of the present disclosure.

[0177] FIG5 is a schematic diagram of the structure of an electronic device provided by an embodiment of the present disclosure. Referring to FIG5 , it shows a schematic diagram of the structure of an electronic device (eg, a terminal device or server in FIG5 ) 500 suitable for implementing an embodiment of the present disclosure.

[0178] The electronic device 500 includes: one or more processing devices 501;

[0179] Storage device 508, used to store one or more programs,

[0180] When the one or more programs are executed by the one or more processing devices 501 , the one or more processing devices 501 implement the request information processing method provided in the embodiment of the present disclosure.

[0181] The terminal devices in the embodiments of the present disclosure may include, but are not limited to, mobile terminals such as mobile phones, laptop computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (e.g., in-vehicle navigation terminals), and fixed terminals such as digital TVs and desktop computers. The electronic device shown in FIG5 is merely an example and should not limit the functions and scope of use of the embodiments of the present disclosure.

[0182] As shown in FIG5 , the electronic device 500 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. Various programs and data required for the operation of the electronic device 500 are also stored in the RAM 503. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An edit / output (I / O) interface 505 is also connected to the bus 504.

[0183] Typically, the following devices may be connected to the I / O interface 505: an input device 506 including, for example, a touch screen, a touchpad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; an output device 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; a storage device 508 including, for example, a magnetic tape, a hard disk, etc.; and a communication device 509. The communication device 509 may allow the electronic device 500 to communicate with other devices wirelessly or by wire to exchange data. Although FIG5 shows the electronic device 500 with various devices, it should be understood that not all of the devices shown are required to be implemented or present. More or fewer devices may alternatively be implemented or present.

[0184] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a non-transitory computer-readable medium, and the computer program includes a program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from the network through the communication device 509, or installed from the storage device 508, or installed from the ROM 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of the embodiment of the present disclosure are performed.

[0185] The names of the messages or information exchanged between multiple devices in the embodiments of the present disclosure are only used for illustrative purposes and are not used to limit the scope of these messages or information.

[0186] The electronic device provided by the embodiment of the present disclosure and the request information processing method provided by the above embodiment belong to the same inventive concept. For technical details not fully described in this embodiment, please refer to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

[0187] An embodiment of the present disclosure provides a computer storage medium on which a computer program is stored. When the program is executed by a processor, the request information processing method provided by the above embodiment is implemented.

[0188] It should be noted that the computer-readable medium mentioned above in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium or any combination of the two.

[0189] The computer storage medium may be a storage medium of computer-executable instructions, which, when executed by a computer processor, are used to perform the methods provided in the present disclosure.

[0190] Computer-readable storage media may include, but are not limited to, electrical, magnetic, optical, electromagnetic, infrared, or semiconductor systems, devices, or components, or any combination thereof. More specific examples of computer-readable storage media may include, but are not limited to, an electrical connection having one or more conductors, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination thereof. In the present disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, device, or component. In the present disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transfer a program for use by or in conjunction with an instruction execution system, device, or component. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wire, optical cable, RF (radio frequency), etc., or any suitable combination thereof.

[0191] In some embodiments, the client and server can communicate using any currently known or later developed network protocol, such as HTTP (HyperText Transfer Protocol), and can be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), an internet (e.g., the Internet), and a peer-to-peer network (e.g., an ad hoc peer-to-peer network), as well as any currently known or later developed network.

[0192] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0193] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device:

[0194] The computer-readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device: obtains the requested information;

[0195] In a preset scenario, determining a priority corresponding to the request information, where the priority corresponding to the request information includes a first priority or a second priority, and the level of the first priority is higher than the level of the second priority;

[0196] When the priority level corresponding to the request information is the first priority level, determining the request amount corresponding to the first priority level;

[0197] The request information is responded to according to the request volume corresponding to the first priority and the first traffic rate limit threshold.

[0198] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages, or a combination thereof, including, but not limited to, object-oriented programming languages ​​such as Java, Smalltalk, C++, and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0199] The flowcharts and block diagrams in the accompanying drawings illustrate the possible implementation architecture, functions and operations of the systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each box in the flowchart or block diagram can represent a module, program segment, or a part of code, and the module, program segment, or a part of code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order than that marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flowchart, and the combination of the boxes in the block diagram and / or flowchart, can be implemented with a dedicated hardware-based system that performs the specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0200] The modules or units described in the embodiments of the present disclosure may be implemented in software or hardware. The name of a module or unit does not necessarily limit the unit itself. For example, an acquisition module may also be described as a "request information acquisition module."

[0201] The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, and without limitation, exemplary types of hardware logic components that may be used include: field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chip (SOCs), complex programmable logic devices (CPLDs), and the like.

[0202] In the context of the present disclosure, a machine-readable medium can be a tangible medium that can contain or store a program for use by or in conjunction with an instruction execution system, device or equipment. A machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium can include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0203] According to one or more embodiments of the present disclosure, [Example 1] provides a request information processing method, including:

[0204] Get request information;

[0205] In a preset scenario, determining a priority corresponding to the request information, where the priority corresponding to the request information includes a first priority or a second priority, and the level of the first priority is higher than the level of the second priority;

[0206] When the priority level corresponding to the request information is the first priority level, determining the request amount corresponding to the first priority level;

[0207] The request information is responded to according to the request volume corresponding to the first priority and the first traffic rate limit threshold.

[0208] According to one or more embodiments of the present disclosure, [Example 2] provides the method of Example 1, wherein determining the priority corresponding to the request information in a preset scenario includes:

[0209] Determine whether the request volume of the application process within a set time period is greater than a second traffic rate limit threshold;

[0210] If so, trigger to enter the preset scene;

[0211] In the preset scenario, the priority corresponding to the request information is obtained.

[0212] According to one or more embodiments of the present disclosure, [Example 3] provides the method described in Example 2, wherein determining the priority corresponding to the request information includes:

[0213] Determining interface information corresponding to the request information, the interface information including an interface identifier and / or resource parameters of resources associated with the interface;

[0214] Determine the priority corresponding to the interface information, and determine the priority corresponding to the interface information as the priority corresponding to the request information.

[0215] According to one or more embodiments of the present disclosure, [Example 4] provides the method of Example 1, wherein responding to the request information based on the request volume corresponding to the first priority and the first traffic rate limit threshold includes:

[0216] If the request volume corresponding to the first priority is greater than the first traffic rate limit threshold, reject the request corresponding to the request information; and / or

[0217] When the request volume corresponding to the first priority is less than or equal to the first traffic rate limit threshold, the request corresponding to the request information is processed and the request volume within the set time period is updated.

[0218] According to one or more embodiments of the present disclosure, [Example 5] provides the method described in Example 4, which updates the request volume within a set time period, including:

[0219] Updating a current first counter of a current first time window corresponding to the request information and a first count value within a sliding window, where the sliding window includes multiple first time windows, each first time window corresponding to a first counter for counting requests of a first priority, the current first time window being a time window corresponding to the request information in a preset scenario, and the first count value being a sum of count values ​​of the first counters corresponding to all first time windows in the sliding window in the preset scenario;

[0220] The sum of the first count value and a second count value that is not in the preset scenario is determined as the updated request amount within the set time period, and the second count value is the number of processed requests in the sliding window corresponding to the non-preset scenario.

[0221] According to one or more embodiments of the present disclosure, [Example 6] provides the method described in Example 1, further comprising:

[0222] If the scenario is not set to default, process the request information;

[0223] Update the current second counter of the current second time window corresponding to the request information and the second count value in the sliding window, the sliding window includes multiple second time windows, each second time window corresponds to a second counter for counting requests, and the current second time window is the time window corresponding to the request information that is not in the preset scenario.

[0224] According to one or more embodiments of the present disclosure, [Example 7] provides the method described in Example 1, wherein the number of requests corresponding to the first priority is the number of requests corresponding to the first priority within a set time period under a preset scenario.

[0225] According to one or more embodiments of the present disclosure, [Example 8] provides a request information processing device, including:

[0226] Acquisition module, used to obtain request information;

[0227] A first determining module is configured to determine, in a preset scenario, a priority corresponding to the request information, where the priority corresponding to the request information includes a first priority or a second priority, where the first priority is higher than the second priority;

[0228] a second determining module, configured to determine, when the priority corresponding to the request information is the first priority, a request quantity corresponding to the first priority;

[0229] The response module is used to respond to the request information according to the request amount corresponding to the first priority and the first traffic speed limit threshold.

[0230] According to one or more embodiments of the present disclosure, [Example 9] provides an electronic device, comprising:

[0231] one or more processing devices;

[0232] a storage device for storing one or more programs,

[0233] When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the request information processing method as described in any one of Examples 1-7.

[0234] According to one or more embodiments of the present disclosure, [Example 10] provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to execute the request information processing method as described in any one of Examples 1-7.

[0235] The above description is merely a preferred embodiment of the present disclosure and an illustration of the technical principles employed. Those skilled in the art should understand that the scope of disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, but also includes other technical solutions formed by any combination of the above-mentioned technical features or their equivalents without departing from the above-mentioned disclosed concepts. For example, a technical solution formed by replacing the above-mentioned features with (but not limited to) technical features with similar functions disclosed in this disclosure.

[0236] In addition, although each operation is described in a specific order, this should not be understood as requiring these operations to be performed in the specific order shown or in a sequential order. Under certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although some specific implementation details have been included in the above discussion, these should not be interpreted as limiting the scope of the present disclosure. Some features described in the context of a separate embodiment can also be implemented in a single embodiment in combination. On the contrary, the various features described in the context of a single embodiment can also be implemented in multiple embodiments individually or in any suitable sub-combination mode.

[0237] Although the subject matter has been described in language specific to structural features and / or methodological logical acts, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are merely example forms of implementing the claims.

Claims

1. A method for processing request information, comprising: Get request information; In a preset scenario, determining a priority corresponding to the request information, where the priority corresponding to the request information includes a first priority or a second priority, and the level of the first priority is higher than the level of the second priority; In a case where the priority corresponding to the request information is a first priority, determining a request amount corresponding to the first priority; The request information is responded to according to the request amount corresponding to the first priority and the first traffic speed limit threshold.

2. The method according to claim 1, wherein: The determining, in a preset scenario, the priority corresponding to the request information includes: Determine whether the request volume of the application process within a set time period is greater than a second flow rate limit threshold; If so, trigger to enter the preset scene; In the preset scenario, a priority corresponding to the request information is determined.

3. The method according to claim 2, wherein: The determining the priority corresponding to the request information includes: Determine the interface information corresponding to the request information, the interface information including an interface identifier and / or resource parameters of resources associated with the interface; The priority corresponding to the interface information is determined, and the priority corresponding to the interface information is determined as the priority corresponding to the request information.

4. The method according to claim 1, wherein: The responding to the request information according to the request amount corresponding to the first priority and the first traffic rate limit threshold includes: If the request volume corresponding to the first priority is greater than the first traffic rate limit threshold, reject the request corresponding to the request information; and / or, When the request volume corresponding to the first priority is less than or equal to the first traffic speed limit threshold, the request corresponding to the request information is processed and the request volume within the set time period is updated.

5. The method according to claim 4, wherein: Update the number of requests within a set period of time, including: Update the current first counter of the current first time window corresponding to the request information and the first count value in the sliding window, the sliding window includes multiple first time windows, each first time window corresponds to a first counter for counting requests of the first priority, the current first time window is the time window corresponding to the request information in a preset scenario, and the first count value is the sum of the count values ​​of the first counters corresponding to all first time windows in the sliding window in the preset scenario; The sum of the first count value and the second count value that is not in the preset scenario is determined as the updated request amount within the set time period, and the second count value is the number of processed requests in the sliding window corresponding to the non-preset scenario.

6. The method according to claim 1, further comprising: If the preset scenario is not in place, processing the request information; Update the current second counter of the current second time window corresponding to the request information and the second count value in the sliding window, the sliding window includes multiple second time windows, each second time window corresponds to a second counter for counting requests, and the current second time window is a time window corresponding to the request information that is not in a preset scenario.

7. The method according to claim 1, wherein: The number of requests corresponding to the first priority is the number of requests corresponding to the first priority within a set time period under a preset scenario.

8. A request information processing device, comprising: The acquisition module is used to obtain request information; A first determination module, used to determine the priority corresponding to the request information in a preset scenario, where the priority corresponding to the request information includes a first priority or a second priority, and the level of the first priority is higher than the level of the second priority; A second determination module, configured to determine a request amount corresponding to a first priority when the priority corresponding to the request information is a first priority; A response module is used to respond to the request information according to the request amount corresponding to the first priority and a first traffic speed limit threshold.

9. An electronic device, wherein: The electronic device comprises: one or more processing devices; a storage device for storing one or more programs, When the one or more programs are executed by the one or more processing devices, the one or more processing devices implement the request information processing method as described in any one of claims 1-7.

10. A storage medium comprising computer executable instructions, wherein the computer executable instructions are used to execute the request information processing method according to any one of claims 1 to 7 when executed by a computer processor.

Images