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

Abstract

The embodiment of the invention provides a request information processing method and device, electronic equipment and a storage medium. The request information processing method comprises the steps that request information is acquired; in a preset scene, determining a priority corresponding to the request information; under the condition that the priority corresponding to the request information is the first priority, determining a request quantity corresponding to the first priority; and responding to the request information according to the request quantity corresponding to the first priority and the first flow speed limit threshold. According to the invention, the cost of interface maintenance is reduced, and the validity of request information processing is improved.

Description

Technical Field

[0001] Embodiments of the present disclosure relate to computer technologies, and in particular, to a method, an apparatus, an electronic device, and a storage medium for processing request information. Background Art

[0002] Currently, an application generally evaluates the maximum number of requests that each interface can handle through stress testing and configures a fixed threshold for the interface. When the number of requests for an interface exceeds the corresponding threshold, the requests for the interface will not be processed. However, the threshold for each interface needs to be configured and maintained separately, resulting in a high maintenance cost in the case of a large number of interfaces. Moreover, after the condition for restricting the number of requests is triggered, the request information is restricted without discrimination. Summary of the Invention

[0003] The present disclosure provides a method, an apparatus, an electronic device, and a storage medium for processing request information, which reduces the maintenance cost and improves the effectiveness of request information processing.

[0004] In a first aspect, embodiments of the present disclosure provide a method for processing request information, including:

[0005] Obtaining request information;

[0006] In a preset scenario, determining the 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;

[0007] When the priority corresponding to the request information is the first priority, determining the request volume corresponding to the first priority;

[0008] Responding to the request information according to the request volume corresponding to the first priority and a first traffic rate limiting threshold.

[0009] In a second aspect, embodiments of the present disclosure further provide an apparatus for processing request information, including:

[0010] An obtaining module, configured to obtain request information;

[0011] A first determining module, configured 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;

[0012] A second determining module, configured to determine the request volume corresponding to the first priority when the priority corresponding to the request information is the first priority;

[0013] A response module, configured to respond to the request information according to the request volume corresponding to the first priority and the first traffic rate limiting threshold.

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

[0015] One or more processing devices;

[0016] A storage device, configured to store one or more programs,

[0017] 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 in any embodiment of the present disclosure.

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

[0019] In the embodiments of the present disclosure, request information is obtained; in a preset scenario, the priority corresponding to the request information is determined, and 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 volume corresponding to the first priority is determined; according to the request volume corresponding to the first priority and the first traffic rate limiting threshold, the request information is responded to. By setting the first traffic rate limiting threshold for the request volume corresponding to the first priority, the present disclosure avoids maintaining the rate limiting threshold for all interfaces, reducing the cost of interface maintenance. In a preset scenario, the response method for the request information with the first priority is determined based on the request volume corresponding to the first priority and the first traffic rate limiting threshold, improving the effectiveness of request information processing. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] Combined with the drawings and referring to the following specific embodiments, the above and other features, advantages and aspects of the embodiments of the present disclosure will become more obvious. 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 the original elements and elements are not necessarily drawn to scale.

[0021] Figure 1 is a flowchart of a request information processing method provided by an embodiment of the present disclosure;

[0022] Figure 2 is a flowchart of another request information processing method provided by an embodiment of the present disclosure;

[0023] Figure 3It is a schematic flowchart of another request information processing method provided by an embodiment of the present disclosure;

[0024] Figure 4 It is a schematic structural diagram of a request information processing device provided by an embodiment of the present disclosure;

[0025] Figure 5 It is a schematic structural diagram of an electronic device provided by an embodiment of the present disclosure. Detailed implementation manners

[0026] Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although some embodiments of the present disclosure are shown in the 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 set forth herein. On the contrary, these embodiments are provided to more thoroughly and completely understand the present disclosure. It should be understood that the drawings and embodiments of the present disclosure are only for exemplary purposes and are not used to limit the protection scope of the present disclosure.

[0027] It should be understood that the various steps recited in the method embodiments of the present disclosure can be executed in a different order 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 regard.

[0028] The term "including" and its variations used herein are open-ended, that is, "including but not limited to". The term "based on" is "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0029] It should be noted that the concepts such as "first" and "second" mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependent relationships.

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

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

[0032] It is understandable that before using the technical solutions disclosed in the embodiments of the present disclosure, the types, usage scopes, usage scenarios, etc. of the personal information involved in the present disclosure should be informed to users in an appropriate manner and the authorization of users should be obtained in accordance with relevant laws and regulations.

[0033] For example, when responding to an active request from a user, a prompt message is sent to the user to clearly prompt the user that the operation requested by the user will require obtaining and using the user's personal information. Thus, the user can autonomously choose whether to provide personal information to software or hardware such as an electronic device, an application program, a server, or a storage medium that performs the operations of the technical solutions of the present disclosure according to the prompt message.

[0034] As an optional but non-limiting implementation manner, the manner of sending a prompt message to the user in response to receiving an active request from the user may be, for example, in the form of a pop-up window, and the prompt message may be presented in text in the pop-up window. In addition, the pop-up window may also carry a selection control for the user to choose "agree" or "disagree" to provide personal information to the electronic device.

[0035] It is understandable that the above process of notifying and obtaining user authorization is only illustrative and does not limit the implementation manner of the present disclosure, and other manners that meet relevant laws and regulations can also be applied to the implementation manner of the present disclosure.

[0036] It is understandable that the data involved in the present technical solution (including but not limited to the data itself, the acquisition or use of the data) should comply with the requirements of the corresponding laws, regulations and related provisions.

[0037] Figure 1 FIG. is a schematic flowchart of a method for processing request information provided by an embodiment of the present disclosure. The embodiments of the present disclosure are applicable to the situation of processing request information. This method can be executed by a request information processing device, and this device can be implemented in the form of software and / or hardware. Optionally, it is implemented by an electronic device, and this electronic device can be a mobile terminal, a PC terminal or a server, etc.

[0038] As Figure 1 shown, the method includes:

[0039] S110. Obtain request information.

[0040] The request information may be information indicating a request, such as information indicating a request triggered by a client. The method for processing request information provided by the present disclosure can be executed by a server. The server can obtain the request information of the client. The content requested by the request information is not limited, such as a request to enter a live broadcast room, or a request to display a list in the live broadcast room.

[0041] This operation can obtain the request information transmitted by the client at the server side, and then analyze the request information at the server side to implement the response to the request information.

[0042] S120. In a preset scenario, determine the priority corresponding to the request information.

[0043] The preset scenario can be a scenario for analyzing whether to process the request information, such as a traffic limiting scenario, that is, a scenario for limiting the processing of request information. In the preset scenario, whether the request information is processed needs to be determined after analyzing the request information.

[0044] The priority corresponding to the request information can be associated with the interface information corresponding to the request information. 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. The priority can represent the priority degree of processing the request information, and the request information with the first priority is processed prior to the request information with the second priority.

[0045] The interface information can be considered as the information representing the interface. The interface information can include an interface identifier that uniquely identifies the interface and / or resource parameters of resources associated with the interface. The resources associated with the interface can be resources associated with the interface. The resource parameters can be parameters representing the resources. Exemplarily, when the interface is an interface for entering a live broadcast room, the resources associated with the interface can be the live broadcast room entered. The resource identifier can be a parameter for identifying the live broadcast room.

[0046] In one embodiment, the present disclosure can set the priority of the request according to preset conditions. When the server is overloaded, requests with low priority can be rejected. Based on the interface identifier, traffic limiting can be implemented by differentiating priorities based on the interface. For example, the interfaces can be divided into different priorities, and a second traffic limiting threshold is set for the application process. After the request volume exceeds the second traffic limiting threshold, requests for interfaces with low priority are rejected, and requests for interfaces with high priority are processed.

[0047] In one embodiment, this embodiment can determine the traffic of the live broadcast room through the resource parameters. Different resource parameters correspond to different priorities, and the response methods for interfaces associated with different live broadcast rooms are determined.

[0048] The priority corresponding to the request information can be determined based on the interface information, and the priority is divided based on the interface information. For example, the priority is divided from the interface dimension and / or the resource dimension.

[0049] In one embodiment, this operation can query a priority table that assigns priorities to different interface information based on the interface information corresponding to the request information, and determine the priority corresponding to the request information. Here, there is no limitation on how to determine the priority based on the interface information.

[0050] The level of the first priority is higher than that of the second priority, and the first priority can be a high priority. In a preset scenario, this operation can determine whether the request information corresponds to a high priority, so as to determine the way to respond to the request information.

[0051] When determining the priority, this operation can first determine the priority corresponding to the request information, and then determine whether it is currently in the preset scenario; it can also first determine whether it is currently in the preset scenario, and then determine the priority corresponding to the request information.

[0052] When it is not currently in the preset scenario, it is possible to determine the priority corresponding to the request information, or it is possible not to determine the priority corresponding to the request information and directly process the request information. Not being in the preset scenario can be a scenario where there is no traffic limiting.

[0053] In this embodiment, by dividing the requests into priorities, there are requests of the first priority, that is, high-priority requests, and requests of the second priority, that is, normal requests. The requests of the first priority and the requests of the second priority can have the following characteristics:

[0054] 1. The quantity of normal requests is greater than the set quantity compared to the quantity of high-priority requests, that is, the quantity of normal requests is much higher than the quantity of high-priority requests. For example, only a few interfaces that affect the set functions are marked as high-priority requests.

[0055] 2. In most cases, the quantity of high-priority requests is lower than the total traffic limiting threshold. If the high-priority requests have exceeded the total traffic limiting threshold, then the high-priority requests will also trigger traffic limiting. The total traffic limiting threshold can be considered as the sum of the first traffic speed limiting threshold and the second traffic speed limiting threshold. The first traffic speed limiting threshold is used to trigger the preset scenario. The second traffic speed limiting threshold is used to determine whether the requests of the first priority are executed.

[0056] S130. When the priority corresponding to the request information is the first priority, determine the quantity of requests corresponding to the first priority.

[0057] When the priority corresponding to the request information is the first priority, it can be considered that the request information is high-priority request information.

[0058] The quantity of requests corresponding to the first priority can be considered as the quantity of high-priority requests received by the server. The quantity of requests corresponding to the first priority can be the quantity obtained after counting the requests of the first priority after the server is in the preset scenario; it can also be the quantity obtained after counting the requests of the first priority when the server is not in the preset scenario and in the preset scenario.

[0059] In one embodiment, the quantity of requests corresponding to the first priority is the quantity of requests of the first priority within a set duration in the preset scenario.

[0060] In this embodiment, the requests of the first priority in a preset scenario are counted separately, and the count value within a set time period is determined as the request volume corresponding to the first priority.

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

[0062] The first traffic rate limit threshold can be regarded as the threshold for restricting the requests of the first priority. In a preset scenario, the number of requests of the first priority that can be processed is restricted by the first traffic rate limit threshold. For example, after the preset scenario is triggered, the number of requests of the first priority that can be processed.

[0063] This operation can compare the request volume corresponding to the first priority with the first traffic rate limit threshold to obtain a magnitude relationship. The magnitude relationship can indicate that the request volume corresponding to the first priority is greater than the first traffic rate limit threshold; it can also indicate that the request volume corresponding to the first priority is less than or equal to the first traffic rate limit threshold.

[0064] The manner of responding to the request information is not limited and may include processing the request information and rejecting the request information.

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

[0066] When the request volume corresponding to the first priority is less than or equal to the first traffic rate limit threshold, it can be considered that the request volume of the high-priority requests has not exceeded the first traffic rate limit threshold. Then, the request information can be processed.

[0067] This embodiment can display that, in the preset scenario, the first traffic rate limit threshold number of requests of the first priority are continuously processed.

[0068] The technical solution of the embodiment of the present disclosure includes obtaining request information; determining 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 that of the second priority; when the priority corresponding to the request information is the first priority, determining the request volume corresponding to the first priority; and responding to the request information according to the request volume corresponding to the first priority and the first traffic rate limit threshold. The present disclosure sets a first traffic rate limit threshold for the request volume corresponding to the first priority, avoiding maintaining a rate limit threshold for all interfaces and reducing the cost of interface maintenance. In a preset scenario, the response method of the request information with the first priority is determined based on the request volume corresponding to the first priority and the first traffic rate limit threshold, improving the effectiveness of request information processing.

[0069] Based on the above embodiment, a variant embodiment of the above embodiment is proposed. Here, it should be noted that for the sake of brevity of description, only the differences from the above embodiment are described in the variant embodiment.

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

[0071] Determining whether the request volume of the application process within a set duration is greater than a second traffic rate limit threshold;

[0072] If so, triggering to enter the preset scenario;

[0073] In the preset scenario, determining the priority corresponding to the request information.

[0074] Determining the priority corresponding to the request information can be determined by a priority determination service. Determining whether the request volume of the application process within a set duration is greater than a second traffic rate limit threshold; if so, triggering to enter the preset scenario can be executed by a traffic rate limit system. The priority determination service can be considered as a service for determining the priority of request information. The traffic rate limit system can be a system for implementing rate limiting.

[0075] The application process can be considered as the process of the application program. The set duration can be a preset duration. There is no limitation on the statistics of the set duration. For example, it can be statistically calculated through a sliding window. The second traffic rate limit threshold can be considered as a threshold for determining whether to trigger the preset scenario.

[0076] After the server obtains the request information, it can first determine the priority corresponding to the request information through the priority determination service to mark the priority of the request information. After the priority determination service determines the priority of the request information, it can transmit the marked priority to the traffic rate limit system, or transmit the marked request information to the traffic rate limit system.

[0077] The traffic throttling system can determine whether the number of requests of an application process within a set duration is greater than a second traffic throttling threshold to determine whether to enter a preset scenario. The number of requests within the set duration is determined by the number of request messages received within the set duration. When determining the number of requests within the set duration, requests with different priorities can be counted separately, or requests can be counted directly without distinguishing priorities.

[0078] After triggering the entry into the preset scenario, the traffic throttling system can query the priority determined by the priority determination service for the request message, so as to determine the way to respond to the request message based on the determined priority.

[0079] In this embodiment, determining the priority corresponding to the request message can be determined by the server through the priority determination service, or when the client sends the request message, the priority corresponding to the request message is carried, and the server extracts the carried priority to implement the determination of the priority corresponding to the request message.

[0080] When determining the priority corresponding to the request message through the priority determination service, it can be that after the server obtains the request message, the priority determination service determines the priority corresponding to the request message, and when the traffic throttling system needs to query the priority, it queries from the priority determination service to determine the priority corresponding to the request message; it can also be that when the traffic throttling system needs to determine the priority of the request message, it calls the priority determination service to determine the priority corresponding to the request message through the priority determination service.

[0081] In one embodiment, determining the priority corresponding to the request message includes:

[0082] Determining the interface information corresponding to the request message, where the interface information includes an interface identifier and / or resource parameters of a resource associated with the interface;

[0083] Determining the priority corresponding to the interface information, and determining the priority corresponding to the interface information as the priority corresponding to the request message.

[0084] The interface identifier can be a parameter that uniquely identifies the interface. The interface can be determined through the interface identifier. For example, the interface identifier is the interface for entering the live broadcast room; another example is that the interface identifier is the interface for displaying interactive messages.

[0085] The interface information can be carried in the request message, or can be pre-agreed by the server and the client for different request messages.

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

[0087] Figure 2 It is a flowchart of another request information processing method provided by an embodiment of the present disclosure. In this embodiment, the operation of responding to the request information is refined. Refer to Figure 2 , this embodiment includes the following steps:

[0088] S210. Obtain the request information.

[0089] S220. Determine the priority corresponding to the request information in a preset scenario.

[0090] S230. When the priority corresponding to the request information is the first priority, determine the request volume corresponding to the first priority.

[0091] 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.

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

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

[0094] When the request volume corresponding to the first priority is greater than the first traffic rate limit threshold, the request information can be rejected to avoid application program lag or crash.

[0095] S260. Process the request corresponding to the request information and update the request volume within the set duration.

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

[0097] The sequence of processing the request information and updating the request volume within the set duration is not limited here. They can be executed simultaneously, or the request information can be processed first and then the request volume within the set duration can be updated; or the request volume within the set duration can be updated first and then the request information can be processed.

[0098] In a preset scenario, the requests with the first priority can be counted separately, and the request volume within the set duration can include a first count value for counting the requests with the first priority in the preset scenario and a second count value for counting the requests not in the preset scenario.

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

[0100] This embodiment refines different size relationships and response methods of request information, ensuring that in a preset scenario, the first traffic throttling threshold number of requests with the first priority can be processed, and requests with the second priority are refused to be processed.

[0101] Based on the above embodiment, a variant embodiment of the above embodiment is proposed. Here, it should be noted that for the sake of brevity of description, only the differences from the above embodiment are described in the variant embodiment.

[0102] In one embodiment, updating the request volume within a set duration includes:

[0103] Updating the current first counter of the current first time window corresponding to the request information and the first count value within the sliding window. The sliding window includes multiple first time windows, and each first time window corresponds to a first counter for counting requests with the first priority. The current first time window is the time window corresponding to the request information in the preset scenario, and the first count value is the sum value of the count values of the first counters corresponding to all the first time windows within the sliding window in the preset scenario;

[0104] Determining the sum of the first count value and the second count value not in the preset scenario as the updated request volume within the set duration. The second count value is the number of processed requests within the corresponding sliding window not in the preset scenario.

[0105] This embodiment counts requests through a sliding window. The sliding window can be divided into multiple time windows. This embodiment can set a first time window for requests with the first priority to achieve counting of requests with the first priority.

[0106] The time window corresponding to the request information in the preset scenario can be a time window matching 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.

[0107] Different first time windows can correspond to different moments. Through the time corresponding to the request information, the current first time window corresponding to the request information is determined from the multiple first time windows of the sliding window.

[0108] Each first time window corresponds to a first counter, and the first time window realizes counting through the corresponding first counter. The first counter can be regarded as a counter for counting the first time window.

[0109] The first count value can be regarded as the value for counting requests with the first priority in the preset scenario. The first count value summarizes the count values of all the first counters.

[0110] In the case of processing request information, this embodiment can update the current first counter and the first count value corresponding to the request information, so as to determine the magnitude relationship between the request volume corresponding to the first priority and the first traffic rate limit threshold after receiving new request information, and determine the response method of the new request information.

[0111] The updated request volume within the set duration 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.

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

[0113] 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. It can also set a sliding window array window[n] when not in the preset scenario, which is used to count the requests within the set duration corresponding to the sliding window.

[0114] There is no limitation on the trigger for the sliding of the sliding window. For example, by counting the sliding time, it can be determined whether the set time interval is reached. If so, the sliding window can be slid. The value of the corresponding data item can be updated each time the sliding window slides.

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

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

[0117] When not in the preset scenario, process the request information;

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

[0119] If it is determined by the traffic rate limit system that the request volume of the application process within the set duration is not greater than the second traffic rate limit threshold, it is determined that the current is not in the preset scenario. When not in the preset scenario, process the request information.

[0120] There is no limitation on the order of processing the request information and updating the request volume within the set duration. They can be executed in parallel, or the request information can be processed first and then the request volume within the set duration can be updated; alternatively, the request volume within the set duration can be updated first and then the request information can be processed.

[0121] The second time window can be considered as the 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 respectively. The second time window realizes the counting of requests through the corresponding second counter.

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

[0123] In the case of processing the second request information, this embodiment can update the current second counter and the second count value. For example, increment the current second counter by 1. Increment the second count value by 1 to display the counting of the request information, so as to be used as a basis for judging whether to process subsequent request information.

[0124] The following is an exemplary description of the present disclosure. The request information processing method provided by the present disclosure can be regarded as an interface flow limiting scheme that differentiates business priorities. If the flow limiting thresholds of each interface are maintained separately, in the case of a large number of interfaces, the maintenance cost is relatively high. For different requests of the same interface, the priorities are not necessarily the same. In order to ensure the normal operation of certain functions of the application program process, this embodiment can set different priorities for different request information to determine the technical means of responding to the request information.

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

[0126] The priority determination service is also called the request priority marking service. By based on the interface of the request information or the resource parameters of the request information, the priority of the request information is marked, and the levels are divided into the first priority and the second priority.

[0127] The traffic rate limiting system is also called the rate limiting system that supports priorities. When the request volume exceeds the first traffic rate limiting threshold, it ensures that at least the second traffic rate limiting threshold of the first priority requests can pass.

[0128] The solution for processing request information by this embodiment through a sliding window is as follows:

[0129] The sliding window limits that within each second, the second traffic rate limiting threshold normalLimit = 1000 ordinary requests are allowed to pass, and the first traffic rate limiting threshold hightLimit = 100 high-priority requests. Among the 1000 ordinary requests, high-priority requests can be included, that is, high-priority requests occupy the counting quota of ordinary requests.

[0130] 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 most recent 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.

[0131] 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.

[0132] 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 rate limiting system. Determine whether the priority corresponding to the request information is the first priority.

[0133] 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.

[0134] If it is a high-priority request, check whether the borrowed request quantity N' within the most recent 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 rate limiting threshold). That is, when the priority corresponding to the request information is the first priority, determine the request volume corresponding to the first priority.

[0135] If N' < hightLimit, then 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 rate limiting threshold, process the request corresponding to the request information and update the request volume within the set duration.

[0136] 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.

[0137] 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.

[0138] Figure 3 It is a schematic flowchart of another request information processing method provided by an embodiment of the present disclosure. Refer to Figure 3 :

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

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

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

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

[0143] Check whether the request volume S within 1s (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;

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

[0145] 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:

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

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

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

[0149] 2. If the number of high-priority requests exceeds the limit, reject the requests.

[0150] Figure 4 It is a schematic structural diagram of a request information processing device provided by an embodiment of the present disclosure. As Figure 4 shown, the device includes:

[0151] An acquisition module 410, configured to acquire request information;

[0152] A first determination module 420, configured 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;

[0153] A second determination module 430, configured to determine the request volume corresponding to the first priority when the priority corresponding to the request information is the first priority;

[0154] A response module 440, configured to respond to the request information according to the request volume corresponding to the first priority and a first traffic rate limit threshold.

[0155] The technical solution provided by the embodiment of the present disclosure sets a first traffic rate limit threshold for the request volume corresponding to the first priority, avoiding maintaining a traffic rate limit threshold for all interfaces and reducing the cost of interface maintenance. In a preset scenario, the response method of the request information with the first priority is determined based on the request volume corresponding to the first priority and the first traffic rate limit threshold, improving the effectiveness of request information processing.

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

[0157] In one embodiment, the first determination module 420 includes:

[0158] A determination unit, configured to determine whether the request volume of the application process within a set duration is greater than a second traffic rate limit threshold;

[0159] A trigger unit, configured to trigger entering the preset scenario if so;

[0160] A query unit, configured to obtain the priority corresponding to the request information in the preset scenario.

[0161] In one embodiment, the determination unit is specifically configured to:

[0162] Determine the interface information corresponding to the request information, where the interface information includes an interface identifier and / or resource parameters of a resource associated with the interface;

[0163] 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.

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

[0165] A rejection 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,

[0166] A processing unit, configured to process the request corresponding to the request information and update the request volume within a set duration when the request volume corresponding to the first priority is less than or equal to the first traffic rate limit threshold.

[0167] In one embodiment, the processing unit updates the request volume within a set duration, including:

[0168] Updating the current first counter of the current first time window corresponding to the request information and the first count value within the sliding window, where the sliding window includes a plurality of first time windows, each first time window corresponds to a first counter for counting requests with 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 value of the first counters corresponding to all first time windows within the sliding window in the preset scenario;

[0169] Determine the sum of the first count value and the second count value not in the preset scenario as the updated request volume within the set duration, where the second count value is the number of processed requests within the sliding window not in the preset scenario.

[0170] In one embodiment, the request information processing device further includes: an update module, configured to

[0171] Process the request information when not in the preset scenario;

[0172] Update the current second counter of the current second time window corresponding to the request information and the second count value within the sliding window, where the sliding window includes a plurality of 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 when not in the preset scenario.

[0173] In one embodiment, the request volume corresponding to the first priority is the number of requests corresponding to the first priority within a set duration in a preset scenario.

[0174] It should be noted 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 division, as long as the corresponding functions can be realized; in addition, the specific names of the functional units are only for the convenience of mutual distinction and do not limit the protection scope of the embodiments of the present disclosure.

[0175] Figure 5 is a schematic structural diagram of an electronic device provided by an embodiment of the present disclosure. The following refers to Figure 5 , which shows a schematic structural diagram of an electronic device (such as a terminal device or a server in Figure 5 ) 500 suitable for implementing the embodiments of the present disclosure.

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

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

[0178] 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 by the embodiments of the present disclosure.

[0179] The terminal device in the embodiments of the present disclosure may include, but is 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 (such as in-vehicle navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The electronic device shown is only an example and should not impose any limitation on the functions and usage scope of the embodiments of the present disclosure.

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

[0181] Typically, the following devices can be connected to the I / O interface 505: input devices 506 including, for example, a touch screen, a touch pad, a keyboard, a mouse, a camera, a microphone, an accelerometer, a gyroscope, etc.; output devices 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 508 including, for example, magnetic tapes, hard disks, etc.; and a communication device 509. The communication device 509 can allow the electronic device 500 to communicate with other devices wirelessly or wiredly to exchange data. Although Figure 5 the electronic device 500 with various devices is shown, it should be understood that it is not required to implement or have all the shown devices. Instead, more or fewer devices can be implemented or had.

[0182] Specifically, 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 that includes a computer program carried on a non-transitory computer-readable medium, and the computer program contains program codes for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a 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 executed.

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

[0184] 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. Technical details not described in detail in this embodiment can be referred to the above embodiment, and this embodiment has the same beneficial effects as the above embodiment.

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

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

[0187] The computer storage medium can be a storage medium for computer-executable instructions, and the computer-executable instructions are used to execute the method provided by the present disclosure when executed by a computer processor.

[0188] A computer-readable storage medium may, for example, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the above. More specific examples of the computer-readable storage medium may include, but are not limited to, an electrical connection with one or more wires, 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 above. In the present disclosure, the 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, apparatus, or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries computer-readable program code. Such a propagated data signal may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. The computer-readable signal medium may also be any computer-readable medium other than the computer-readable storage medium, which can send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0189] In some embodiments, the client and the server may communicate using any currently known or future-developed network protocol such as HTTP (HyperText Transfer Protocol), and may be interconnected with digital data communication in any form or medium (e.g., a communication network). Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future-developed networks.

[0190] The above computer-readable medium may be included in the above electronic device; or may exist separately without being assembled into the electronic device.

[0191] The above computer-readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device is caused to:

[0192] The above computer-readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device is caused to: obtain request information;

[0193] Under a preset scenario, determine the 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 that of the second priority;

[0194] When the priority corresponding to the request information is the first priority, determine the request volume corresponding to the first priority;

[0195] Respond to the request information according to the request volume corresponding to the first priority and the first traffic speed limit threshold.

[0196] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages or combinations thereof. The above-mentioned programming languages include, but are not limited to, object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, executed 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 the case of 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 (for example, by using an Internet service provider to connect through the Internet).

[0197] The flowcharts and block diagrams in the accompanying drawings illustrate the possible architectures, functions, and operations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagram may represent a module, a program segment, or a part of code that contains one or more executable instructions for implementing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than marked in the accompanying drawings. For example, two consecutive blocks shown may actually be executed substantially in parallel, and they may sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and / or flowchart, and the combination of blocks in the block diagram and / or flowchart, may be implemented by a dedicated hardware-based system for performing the specified functions or operations, or may be implemented by a combination of dedicated hardware and computer instructions.

[0198] The modules or units involved in the embodiments of the present disclosure can be implemented in software or in hardware. Among them, the name of the module or unit does not constitute a limitation to the unit itself in some cases. For example, the acquisition module can also be described as a "request information acquisition module".

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

[0200] 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 connection with an instruction execution system, apparatus, or device. 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, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

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

[0202] Obtain request information;

[0203] In a preset scenario, determine the 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;

[0204] In the case where the priority corresponding to the request information is the first priority, determine the request volume corresponding to the first priority;

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

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

[0207] Determine whether the request volume of the application process within the set duration is greater than the second traffic throttling threshold;

[0208] If so, trigger to enter a preset scenario;

[0209] In the preset scenario, obtain the priority corresponding to the request information.

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

[0211] Determine the interface information corresponding to the request information, where the interface information includes an interface identifier and / or resource parameters of a resource associated with the interface;

[0212] 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.

[0213] According to one or more embodiments of the present disclosure, [Example 4] provides the method described in Example 1. The responding to the request information according to the request volume corresponding to the first priority and the first traffic throttling threshold includes:

[0214] In the case where the request volume corresponding to the first priority is greater than the first traffic throttling threshold, reject the request corresponding to the request information; and / or,

[0215] In the case where the request volume corresponding to the first priority is less than or equal to the first traffic throttling threshold, process the request corresponding to the request information and update the request volume within the set duration.

[0216] According to one or more embodiments of the present disclosure, [Example 5] provides the method described in Example 4. Updating the request volume within the set duration includes:

[0217] Update the current first counter of the current first time window corresponding to the request information and the first count value within the sliding window. The sliding window includes a plurality of first time windows, and each first time window corresponds to a first counter for counting requests with the first priority. The current first time window is the time window corresponding to the request information in the preset scenario, and the first count value is the sum value of the count values of the first counters corresponding to all the first time windows within the sliding window in the preset scenario;

[0218] Determine the sum of the first count value and the second count value not in the preset scenario as the updated request volume within the set duration. The second count value is the number of processed requests within the corresponding sliding window not in the preset scenario.

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

[0220] processing the request information when not in a preset scenario;

[0221] updating the current second counter of the current second time window corresponding to the request information and the second count value within the sliding window, the sliding window includes a plurality of second time windows, each second time window corresponds to a second counter for counting requests respectively, and the current second time window is the time window corresponding to the request information when not in the preset scenario.

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

[0223] According to one or more embodiments of the present disclosure, [Example 8] provides a request information processing apparatus, comprising:

[0224] an acquisition module, configured to acquire request information;

[0225] a first determination module, configured to determine the priority corresponding to the request information in 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;

[0226] a second determination module, configured to determine the request volume corresponding to the first priority when the priority corresponding to the request information is the first priority;

[0227] a response module, configured to respond to the request information according to the request volume corresponding to the first priority and a first traffic rate limiting threshold.

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

[0229] one or more processing devices;

[0230] a storage device, configured to store one or more programs,

[0231] 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.

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

[0233] The above description is only a preferred embodiment of the present disclosure and an explanation of the applied technical principles. 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 technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosure concept. For example, the technical solutions formed by mutually replacing the above features with the technical features (but not limited to) having similar functions disclosed in the present disclosure.

[0234] In addition, although the operations are depicted in a particular order, this should not be construed as requiring that the operations be performed in the particular order shown or in sequential order. In certain circumstances, multitasking and parallel processing may be advantageous. Similarly, although several specific implementation details are included in the above discussion, these should not be construed as limiting the scope of the present disclosure. Certain features described in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, the various features described in the context of a single embodiment may also be implemented separately or in any suitable sub-combination in multiple embodiments.

[0235] 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. On the contrary, the specific features and acts described above are merely example forms of implementing the claims.

Claims

1. A method for processing request information, characterized in that, it includes: Obtain request information; In a preset scenario, determine the 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; When the priority corresponding to the request information is the first priority, determine the request volume corresponding to the first priority; Respond to the request information according to the request volume corresponding to the first priority and the first traffic rate limit threshold.

2. The method according to claim 1, characterized in that, the determining the priority corresponding to the request information in the preset scenario includes: Determine whether the request volume of the application process within a set duration is greater than the second traffic rate limit threshold; If so, trigger to enter the preset scenario; In the preset scenario, determine the priority corresponding to the request information.

3. The method according to claim 2, characterized in that, the determining the priority corresponding to the request information includes: Determine the interface information corresponding to the request information, where the interface information includes an interface identifier and / or resource parameters of a resource associated with the interface; 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.

4. The method according to claim 1, characterized in that, the responding to the request information according to the request volume corresponding to the first priority and the first traffic rate limit threshold includes: When 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 rate limit threshold, process the request corresponding to the request information and update the request volume within the set duration.

5. The method according to claim 4, characterized in that, updating the request volume within the set duration includes: Update the current first counter of the current first time window corresponding to the request information and the first count value within the sliding window. The sliding window includes multiple first time windows, and each first time window corresponds to a first counter for counting requests with the first priority. The current first time window is the time window corresponding to the request information in the preset scenario, and the first count value is the sum value of the count values of the first counters corresponding to all the first time windows within the sliding window in the preset scenario; Determine the sum of the first count value and the second count value not in the preset scenario as the updated request volume within the set duration, where the second count value is the number of processed requests within the corresponding sliding window not in the preset scenario.

6. The method according to claim 1, characterized in that, it further includes: When not in the preset scenario, process the request information; Update the current second counter corresponding to the current second time window of the request information and the second count values within the sliding window. The sliding window includes multiple second time windows, and each second time window corresponds to a second counter for counting requests. The current second time window is the time window corresponding to the request information when not in a preset scenario.

7. The method according to claim 1, wherein, the request volume corresponding to the first priority is the number of requests corresponding to the first priority within a set duration in a preset scenario.

8. A request information processing device, wherein, it includes: an acquisition module for acquiring request information; a first determination module for determining the priority corresponding to the request information in 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; a second determination module for determining the request volume corresponding to the first priority when the priority corresponding to the request information is the first priority; a response module for responding to the request information according to the request volume corresponding to the first priority and a first traffic rate limit threshold.

9. An electronic device, wherein, the electronic device includes: 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, enabling the one or more processing devices to implement the request information processing method according to any one of claims 1-7.

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

Images