CN117834715A

CN117834715A - Service access processing method, device, computer equipment and storage medium

Info

Publication number: CN117834715A
Application number: CN202211179686.6A
Authority: CN
Inventors: 袁两胜
Original assignee: Tencent Technology Beijing Co Ltd
Current assignee: Tencent Technology Beijing Co Ltd
Priority date: 2022-09-27
Filing date: 2022-09-27
Publication date: 2024-04-05

Abstract

The application relates to a service access processing method, a device, a computer apparatus, a storage medium and a computer program product. The embodiment of the application can be applied to various scenes such as cloud technology, artificial intelligence, intelligent traffic, auxiliary driving and the like. The method comprises the following steps: if the system load reaches a system load critical threshold, acquiring a service request structure to be processed; acquiring a plurality of history service request structures and a processable service request list corresponding to each history service request structure; matching the service request structure to be processed with each history service request structure, determining a target history service request structure matched with the service request structure to be processed, and determining a target processable service request list corresponding to the target history service request structure; and selecting a target service request from the service request structure to be processed based on the target processable service request list, and performing service access processing on the target service request. The method can improve the flexibility of service access processing.

Description

Service access processing method, device, computer equipment and storage medium

Technical Field

The present invention relates to the field of internet technologies, and in particular, to a service access processing method, device, and computer device.

Background

With the development of computer internet technology, the coverage area of the internet is larger and larger, and the number of client terminals served by a server is increased, so that the load of the server is also higher and higher. For various service scenes such as video service, image service and the like, the access request quantity is greatly increased in a certain time period, so that the server cannot bear such a large instantaneous concurrency quantity, the problem of server overload is caused, the operation processing efficiency of the server is influenced, even the problem of downtime occurs, and the server needs to be optimized according to the load condition.

Currently, a general overload protection scheme can evenly disperse an accessed request to different server modules for processing by increasing the number scale of servers. Or when the server receives the access request, the server detects that the load exceeds the load processing capacity of the server, suspends the access request, pauses the processing of the request, or directly refuses the request. However, when the service requests of different objects are processed, different processing modes of service access failure may occur, and the flexibility of the overload protection scheme is low. Therefore, how to improve the flexibility of service access processing is a problem to be solved.

Disclosure of Invention

In view of the foregoing, it is desirable to provide a service access processing method, apparatus, computer device, and storage medium that can improve the flexibility of service access processing.

In a first aspect, the present application provides a service access processing method. The method comprises the following steps:

if the system load reaches a system load critical threshold, acquiring a service request structure to be processed;

acquiring a plurality of history service request structures and a processable service request list corresponding to each history service request structure;

matching the service request structure to be processed with each history service request structure, determining a target history service request structure matched with the service request structure to be processed, and determining a target processable service request list corresponding to the target history service request structure;

and selecting a target service request from the service request structure to be processed based on the target processable service request list, performing service access processing on the target service request, wherein the system load of the target service request when processed is less than or equal to a system overload threshold value, the system overload threshold value is greater than a system load critical threshold value, and the forward feedback data of the target service request is greater than the forward feedback data of each unselected service request to be processed in the service request structure to be processed.

In one embodiment, the method for acquiring the forward feedback data of the target service request includes:

and determining forward feedback data of the target service request according to the service consumption resource for processing the target service request and the object feedback data of the target object for the target service requested by the target service request.

In one embodiment, the service consumption resource is calculated according to the service consumption resource of each service interface in the service interface call chain of the target service request; wherein, the service consumption resources of the service interface are: network resources and computing resources required to process the target service request;

the object feedback data is calculated according to service use information and processing priority information of the target service requested by the target service request by the target object; wherein the service usage information includes at least one of: the use time of the target object for using the target service is long, the activity of the target object for using the target service and the time interval of the target object for using the target service are long; the processing priority information is related to an object type of the target object and a service type of the target service.

In one embodiment, matching the service request structure to be processed with each history service request structure includes:

Determining the number of service requests to be processed of each service information in a service request structure to be processed and the number of historical service requests of each service information in each historical service request structure, wherein the service information has relevance to the service type or the service information has relevance to the service type and the object type;

and carrying out matching processing based on the number of the service requests to be processed of each service information and the number of the history service requests of each service information in each history service request structure.

In one embodiment, determining a target historical service request structure that matches the pending service request structure includes:

determining a matching result between the to-be-processed service request structure and each history service request structure, wherein the matching result is used for describing the similarity between the to-be-processed service request structure and each history service request structure;

and determining the historical service request structure with the highest similarity with the service request structure to be processed as a target historical service request structure.

In one embodiment, selecting a target service request from a pending service request structure based on a target processable service request list comprises:

Determining the number of processable service requests of each service information in a target processable service request list;

a target service request is selected from the pending service request structure based on the number of processable service requests for each service information in the target processable service request list.

In one embodiment, the obtaining manner of the processable service request list corresponding to each history service request structure includes:

acquiring a historical service request structure, selecting N first to-be-selected service request lists from the historical service request structure, determining forward feedback data of each first to-be-selected service request list, wherein the system load of each to-be-selected service request in the first to-be-selected service request list is smaller than or equal to a system overload threshold value when the to-be-selected service request is processed, and N is a positive integer larger than 1;

and determining a processable service request list corresponding to the historical service request structure based on the forward feedback data of each first to-be-selected service request list, wherein the forward feedback data of the processable service request list is larger than the forward feedback data of each first to-be-selected service request list.

In one embodiment, the method further comprises:

acquiring initial forward feedback data of each service interface, and carrying out normalization processing on the initial forward feedback data of each service interface to obtain forward feedback data of each service interface;

Determining forward feedback data of each first to-be-selected service request list, including:

determining a service interface call chain of each history service request in each first to-be-selected service request list based on the service information of each history service request in each first to-be-selected service request list, wherein the service interface call chain comprises at least one service interface;

based on the forward feedback data of each service interface and the service interface call chains of each history service request in each first to-be-selected service request list, the forward feedback data of each history service request in each first to-be-selected service request list is calculated, and the forward feedback data of each first to-be-selected service request list is determined.

In one embodiment, selecting N first to-be-selected service request lists from the history service request structure includes:

acquiring forward feedback data of each historical service request in a historical service request structure, and sequencing each historical service request from large to small based on the forward feedback data of each historical service request to obtain a first sequencing result;

a history service request is selected from a history service request structure based on the first ordering result to generate a first list of service requests to be selected.

the history service request is randomly selected from the history service request structure to generate a first list of service requests to be selected.

In one embodiment, determining a processable service request list corresponding to the historical service request structure based on forward feedback data of each first to-be-selected service request list includes:

at least one historical service request in each first service request list to be selected is adjusted, N second service request lists to be selected are generated, forward feedback data of each second service request list to be selected are determined, and the system load of each historical service request in each second service request list to be selected when processed is smaller than or equal to a system overload threshold value;

and determining a processable service request list based on the forward feedback data of each first service request list to be selected and the forward feedback data of each second service request list to be selected.

In one embodiment, the method further comprises:

performing wheel disc operation on each first to-be-selected service request list and each unselected service request list based on forward feedback data of each first to-be-selected service request list;

And selecting the adjusted first to-be-selected service request list from the first to-be-selected service request lists based on the wheel disc operation result.

In one embodiment, adjusting at least one historical service request in each first service request list to generate N second service request lists includes:

and determining a third service request list to be selected from the first service request lists, and randomly deleting at least one historical service request in the third service request list to be selected so as to generate a second service request list to be selected.

In one embodiment, at least one historical service request in each first service request list to be selected is adjusted to generate N second service request lists to be selected, including

Determining a third service request list to be selected from the first service request lists to be selected, and sequencing forward feedback data of each historical service request in the third service request list to be selected to obtain a second sequencing result;

and deleting at least one historical service request in the third service request list to be selected based on the second sorting result so as to generate a second service request list to be selected.

In one embodiment, the method further comprises:

determining a list of unselected service requests from a historical service request structure;

adjusting at least one historical service request in each first service request list to generate N second service request lists, wherein the N second service request lists comprise:

and determining a fourth service request list to be selected from the first service request lists to be selected, and randomly replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list to generate a second service request list to be selected.

determining a fourth service request list to be selected from the first service request lists to be selected, and sequencing forward feedback data of each historical service request in the fourth service request list to be selected to obtain a third sequencing result;

and replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list based on the third sorting result to generate a second service request list to be selected.

In one embodiment, when generating the N second service request lists to be selected, the method further includes:

recording the number of neighborhood search cycles, wherein the number of neighborhood search cycles is used for describing: the times of generating corresponding N second service request lists to be selected are adjusted to each first service request list to be selected;

determining a processable service request list based on the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list comprises:

the N first to-be-selected service request lists are redetermined based on the forward feedback data of the first to-be-selected service request lists and the forward feedback data of the second to-be-selected service request lists;

adjusting at least one historical service request in each redetermined first service request list to generate N redetermined second service request lists to be selected, and updating the neighborhood search cycle times;

and if the updated neighborhood searching cycle number reaches the preset neighborhood searching number, determining the service request list to be selected with the largest forward feedback data as a processable service request list from the forward feedback data of each redetermined first service request list to be selected and the forward feedback data of each redetermined second service request list to be selected.

In a second aspect, the present application further provides a service access processing apparatus. The device comprises:

the acquisition module is used for acquiring a service request structure to be processed if the system load reaches a system load critical threshold; acquiring a plurality of history service request structures and a processable service request list corresponding to each history service request structure;

the matching processing module is used for carrying out matching processing on the service request structure to be processed and each history service request structure, determining a target history service request structure matched with the service request structure to be processed, and determining a target processable service request list corresponding to the target history service request structure;

the service processing module selects a target service request from the service request structure to be processed based on the target processable service request list, performs service access processing on the target service request, wherein the system load when the target service request is processed is smaller than or equal to a system overload threshold value, the system overload threshold value is larger than a system load critical threshold value, and the forward feedback data of the target service request is larger than the forward feedback data of each unselected service request to be processed in the service request structure to be processed.

In a third aspect, the present application also provides a computer device. The computer device comprises a memory storing a computer program and a processor which when executing the computer program performs the steps of:

In a fourth aspect, the present application also provides a computer-readable storage medium. The computer readable storage medium having stored thereon a computer program which when executed by a processor performs the steps of:

In a fifth aspect, the present application also provides a computer program product. The computer program product comprises a computer program which, when executed by a processor, implements the steps of:

The service access processing method, the device, the computer equipment, the storage medium and the computer program product acquire the service request structure to be processed and acquire a plurality of history service request structures and the processable service request list corresponding to each history service request structure if the system load reaches the system load critical threshold. Based on the above, the service request structure to be processed is matched with each history service request structure, a target history service request structure matched with the service request structure to be processed is determined, and a target processable service request list corresponding to the target history service request structure is determined. And selecting a target service request from the service request structure to be processed based on the target processable service request list, performing service access processing on the target service request, wherein the system load of the target service request when processed is less than or equal to a system overload threshold value, the system overload threshold value is greater than a system load critical threshold value, and the forward feedback data of the target service request is greater than the forward feedback data of each unselected service request to be processed in the service request structure to be processed. Under the condition that the system load reaches a system load critical threshold value smaller than a system overload threshold value, carrying out matching processing on the basis of a to-be-processed service request structure and a plurality of historical service request structures, and determining a target service request which can be subjected to service access processing from the to-be-processed service request structure according to the processable service requests contained in a processable service request list corresponding to the historical service request structure obtained through matching, so that the system load is not overloaded when the selected target service request is processed, and forward feedback data of the target service request is larger than forward feedback data of unselected to-be-processed service requests, namely, the plurality of to-be-processed service requests can be selected and processed on the basis of considering the forward feedback data brought, thereby improving the flexibility of service access processing.

Drawings

FIG. 1 is an application environment diagram of a service access processing method in one embodiment;

FIG. 2 is a flow diagram of a method of service access processing in one embodiment;

FIG. 3 is a diagram of an embodiment of a service interface call chain in one embodiment;

FIG. 4 is a flow diagram of matching a service request structure to be processed with each history service request structure in one embodiment;

FIG. 5 is a flow diagram of a process for determining a target historical service request structure that matches a pending service request structure in one embodiment;

FIG. 6 is a flow diagram of selecting a target service request from a pending service request structure based on a target processable service request list in one embodiment;

FIG. 7 is a schematic flow diagram of a portion of an acquisition of a list of processable service requests corresponding to an acquisition history service request structure in one embodiment;

FIG. 8 is a schematic diagram of an embodiment of a first list of pending service requests in one embodiment;

FIG. 9 is a flowchart of a service access processing method according to another embodiment;

FIG. 10 is a flow chart of selecting N first service request lists from a history service request structure according to one embodiment;

FIG. 11 is a diagram of an embodiment of generating a first list of pending service requests in one embodiment;

FIG. 12 is a schematic diagram of another embodiment of generating a first list of pending service requests;

FIG. 13 is a flow diagram of determining a list of processable service requests corresponding to a history service request structure in one embodiment;

FIG. 14 is a flowchart of a method for processing service access according to yet another embodiment;

FIG. 15 is a flow diagram of generating N second service request lists to be selected in one embodiment;

FIG. 16 is a diagram of an embodiment of generating a second list of service requests to be selected in one embodiment;

FIG. 17 is a schematic diagram of an embodiment of generating a second list of service requests to be selected in another embodiment;

FIG. 18 is a flowchart of generating N second service request lists to be selected according to another embodiment;

FIG. 19 is a schematic diagram of an embodiment of generating a second list of service requests to be selected in yet another embodiment;

FIG. 20 is a schematic diagram of an embodiment of generating a second list of service requests to be selected in yet another embodiment;

FIG. 21 is a flow diagram of determining a list of processable service requests in one embodiment;

FIG. 22 is a flow diagram illustrating a complete process of a service access processing method in one embodiment;

FIG. 23 is a block diagram of a service access processing apparatus in one embodiment;

fig. 24 is an internal structural view of a computer device in one embodiment.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail with reference to the accompanying drawings and examples. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the present application.

Cloud technology (Cloud technology) refers to a hosting technology for integrating hardware, software, network and other series resources in a wide area network or a local area network to realize calculation, storage, processing and sharing of data. The cloud technology is based on the general names of network technology, information technology, integration technology, management platform technology, application technology and the like applied by the cloud computing business mode, can form a resource pool, and is flexible and convenient as required. Cloud computing technology will become an important support. Background services of technical networking systems require a large amount of computing, storage resources, such as video websites, picture-like websites, and more portals. Along with the high development and application of the internet industry, each article possibly has an own identification mark in the future, the identification mark needs to be transmitted to a background system for logic processing, data with different levels can be processed separately, and various industry data needs strong system rear shield support and can be realized only through cloud computing.

The solution provided by the embodiment of the application relates to cloud computing (cloud computing) in cloud technology, wherein the cloud computing refers to a delivery and use mode of an information technology (Information Technology, IT) infrastructure, and refers to obtaining required resources in an on-demand and easily-expandable manner through a network; generalized cloud computing refers to the delivery and usage patterns of services, meaning that the required services are obtained in an on-demand, easily scalable manner over a network. Such services may be IT, software, internet related, or other services. Cloud Computing is a product of fusion of traditional computer and network technology developments such as Grid Computing (Grid Computing), distributed Computing (distributed Computing), parallel Computing (Parallel Computing), utility Computing (Utility Computing), network storage (Network Storage Technologies), virtualization (Virtualization), load balancing (Load balancing), and the like. With the development of the internet, real-time data flow and diversification of connected devices, and the promotion of demands of search services, social networks, mobile commerce, open collaboration and the like, cloud computing is rapidly developed. Unlike the previous parallel distributed computing, the generation of cloud computing will promote the revolutionary transformation of the whole internet mode and enterprise management mode in concept. Based on this, the following examples are specifically described:

The service access processing method provided by the embodiment of the application can be applied to an application environment shown in fig. 1. The terminal 102 may be directly or indirectly connected to the server 104 through wired or wireless communication, which is not limited herein. The data storage system may store data that the server 104 needs to process. The data storage system may be integrated on the server 104 or may be located on the cloud or other servers.

Specifically, to illustrate with application to the server 104, if the server 104 determines that the system load reaches the system load critical threshold, a service request structure to be processed is obtained, and a plurality of history service request structures and a list of processable service requests corresponding to each history service request structure are obtained. Based on this, the server 104 performs matching processing on the service request structure to be processed and each history service request structure, determines a target history service request structure that matches the service request structure to be processed, and determines a target processable service request list that corresponds to the target history service request structure, whereby the server 104 selects a target service request from the service request structure to be processed based on the target processable service request list, performs service access processing on the target service request, a system load when the selected target service request is processed is less than or equal to a system overload threshold value, the system overload threshold value is greater than a system load threshold value, and forward feedback data of the target service request is greater than forward feedback data of each service request to be processed that is not selected in the service request structure to be processed.

The terminal 102 may be, but not limited to, various personal computers, notebook computers, smart phones, tablet computers, internet of things devices and portable wearable devices, and the internet of things devices may be smart speakers, smart televisions, smart air conditioners, smart vehicle devices, aircrafts, etc. The portable wearable device may be a smart watch, smart bracelet, headset, or the like. The server 104 may be implemented as a stand-alone server or as a server cluster of multiple servers. And the embodiments of the present application may be applied to various scenarios including, but not limited to, cloud technology, artificial intelligence, intelligent transportation, assisted driving, and the like.

In one embodiment, as shown in fig. 2, a service access processing method is provided, where the method is applied to the server 104 in fig. 1 for illustration, it is understood that the method may also be applied to a system including the terminal 102 and the server 104, and implemented through interaction between the terminal 102 and the server 104. In this embodiment, the method includes the steps of:

step 202, if the system load reaches the system load critical threshold, obtaining the service request structure to be processed.

The system Load may be determined based on a central processing unit (Central Processing Unit, CPU) usage calculation, or based on a service access amount calculation, or directly defined using a CPU Load, which is not limited herein. Based on this, the system load critical threshold is a preset threshold that is close to the system overload threshold, i.e. the system load critical threshold is used to describe the state of the system load about to overload. For example, the system overload threshold is 90%, then the system load critical threshold may be 80% or 85%, etc.

Secondly, the service request to be processed initiated by the object is used for indicating to access and process the target service, so that the service request to be processed has corresponding service information, each service information has a corresponding service interface call chain, and the service interface call chain comprises at least one service interface, and therefore, the service interface call chain of the service request specifically comprises the service interfaces as follows: and a service interface which is called for carrying out access processing on the target service indicated by the service request. In this embodiment, the service information also has an association with the service type, or the service information has an association with the service type and the object type. Based on the above, the service request structure to be processed specifically includes: the specific service interface call chain corresponding to each service request to be processed, for example, the service request A1 to be processed corresponds to the service interface call chain 1, the service request A2 to be processed corresponds to the service interface call chain 2, the service interface call chain 1 specifically includes the service interface B and the service interface C, and the service interface call chain 2 specifically includes the service interface D.

For further understanding of the service interface call chain, as shown in fig. 3, the service requests sent by different objects (objects 301 to 303) are forwarded to the servers 304 to 306 corresponding to the service requests through the access layer, under the micro service architecture, each service information corresponds to only one service function module, and the service function module can provide a plurality of service interfaces to the outside, and provide corresponding service capabilities through the service interfaces, so that the service interface call chain for the service request can be formed by the service interfaces required to be called by completing one service request.

For example, server 304 is used to provide service a, server 305 is used to provide service B, and server 306 is used to provide service C. If the service request is for requesting to process the service a, and the service a specifically needs to be processed together with the service B, and therefore, the service interface of the server 304 and the service interface of the server 305 need to be specifically called for the service request, the service interface call chain corresponding to the service request specifically includes the service interface of the server 304 and the service interface of the server 305.

Specifically, when the server determines that the system load reaches the system load critical threshold, at least one service request to be processed initiated by the object is acquired, and a service interface call chain of each service request to be processed is determined based on service information corresponding to each service request to be processed, so that a service request structure to be processed is obtained.

Further, in this embodiment, the service interface call chain of each service request may also be described by an array. For example: the service interface call chain of service requests includes a first service interface of server 1, a first service interface of server 2, and a second service interface of server 3. If the service interface call chain of the service request is SL _i Then SL (S) _i ＝[SL ₁₁ ，SL ₂₁ ，SL ₃₂ ]Wherein SL is ₁₁ For representing the first service interface, SL, of the server 1 ₂₁ A first service interface for representing a server 2, and SL ₃₂ A second service interface for representing the server 3.

It will be appreciated that processing of call requests in service requests by each service interface consumes system load capacity and therefore the system load consumed by each service interface is denoted SCCij, where i is used to denote the particular server and j is used to denote the number of service interfaces on server i. It follows that, further described in the foregoing examples, the service interface call chain of the service request is SL _i ＝[SL ₁₁ ，SL ₂₁ ，SL ₃₂ ]The system load required to process the service request is then: [ SCC ₁₁ ，SCC ₂₁ ，SCC ₃₂ ]。

Step 204, obtaining a plurality of history service request structures and a list of processable service requests corresponding to each history service request structure.

The history service request structure is similar to the structure of the pending service request, and is: the specific service interface call chain corresponding to each history service request, where the history service request has corresponding service information, and each service information has a corresponding service interface call chain, which is not described herein again.

Secondly, the list of the processable service requests is obtained based on the historical service request structure, the system load of each processable service request in the list of the processable service requests is smaller than or equal to the system overload threshold value, and the system overload threshold value is larger than the system load critical threshold value according to the embodiment. And the forward feedback data of each processable service request in the processable service request list is larger than the total forward feedback data of the unselected historical service requests in the historical service request structure.

Specifically, the server may first obtain the history service requests received in the preset time interval, and determine a service interface call chain of each history service request based on the service information corresponding to each history service request, so as to obtain the history service request structure based on the service interface call chain of each history service request. And obtaining a processable service request list corresponding to each history service request structure through offline calculation.

It should be understood that the plurality of history service request structures may be obtained by dividing the history service requests within a predetermined time interval into a plurality of copies. For example, the preset time interval is 3 days, and 1000 history service requests are acquired within 3 days, at this time, the server may divide the 1000 history service requests into 10 sets of history service request sets, and then perform the foregoing similar processing on each history service request set, so as to obtain a history service request structure of each history service request set, that is, obtain 10 history service request structures. Second, the plurality of history service request structures may also be derived based on history service requests within a succession of a plurality of preset time intervals. For example, if the preset time interval is 3 days, then 5 history service requests within 3 days may be continuously collected, that is, the history service requests within 15 days may be collected, and the obtained history service requests within 3 days may be similarly processed to obtain a history service request structure of each history service request set, where 5 history service request structures may be obtained.

Step 206, matching the service request structure to be processed with each history service request structure, determining a target history service request structure matched with the service request structure to be processed, and determining a target processable service request list corresponding to the target history service request structure.

The matching process is used for calculating the similarity between the service request structure to be processed and each history service request structure, namely the matching process is specifically used for calculating the similarity between the service information of each service request to be processed in the service request structure to be processed and the service information of each history service request in each history service request structure.

Specifically, the server performs matching processing on the to-be-processed service request structure and each history service request structure, so as to obtain a matching result between the to-be-processed service request structure and each history service request structure, and determines a target history service request structure matched with the to-be-processed service request structure based on the matching result, that is, the server may determine the history service request structure with higher similarity between the to-be-processed service request structures as the target history service request structure, and then determine a target processable service request list corresponding to the target history service request structure based on the processable service request list corresponding to each history service request structure.

For example, the history service request structure L1 corresponds to the processable service request list M1, the history service request structure L2 corresponds to the processable service request list M2, and the history service request structure L3 corresponds to the processable service request list M3. If it is determined that the target history service request structure matched with the pending service request structure is the history service request structure L2, it may further be determined that the processable service request list M2 corresponding to the history service request structure L2 is the target processable service request list.

Step 208, selecting a target service request from the service request structure to be processed based on the target processable service request list, and performing service access processing on the target service request, wherein the system load when the target service request is processed is less than or equal to a system overload threshold, the system overload threshold is greater than a system load critical threshold, and the forward feedback data of the target service request is greater than the forward feedback data of each unselected service request to be processed in the service request structure to be processed.

Wherein, the forward feedback data of the service request is specifically the forward benefit obtained by processing the service request, and the dimension to be considered in calculating the forward feedback data of the service request specifically includes: feedback data from the service requested by the object access service request, and the resource consumption required to process the service request. Accordingly, the server determines forward feedback data of the service request based on the service consumption resource for processing the service request and the object feedback data of the object for the service requested by the service request. The service consumption resource is a network resource and a computing resource required for processing the service request.

And secondly, the object feedback data is obtained by calculating service use information and processing priority information of the service requested by the service request by the object, and the calculation is specifically required based on weight parameters corresponding to the service use information and the processing priority information respectively, wherein the weight parameters are used for describing the importance degree of the information on the object feedback data, and the determination of the weight parameters requires the flexible determination of the service requirement or a large amount of experimental data. The service usage information is information that the object requests the service by initiating a service request, that is, the number of times the object requests the service, the service usage time period and the service time interval are requested, and the processing priority information is used for describing the processing priority corresponding to the object under the requested service, where the processing priority information of the object is higher, that is, the server can process the service request initiated by the object more preferentially. It should be understood that how the object feedback data is calculated from the service usage information and the processing priority information is described in detail in the following embodiments.

It can be seen that, since the service information corresponding to the service request may be related to the service type, when service requests of different service types of the same object are processed, the obtained feed-forward data may be different due to different service consumption resources. Secondly, the service information corresponding to the service request can also be related to the service type and the object type, when the service type is the same but the object type of the request is different, the service consumption resources can be the same but the object feedback data is different, and thus the obtained forward feedback data can also be different.

Second, the target service request may be one service request to be processed in the service request structure to be processed, and may be a plurality of service requests to be processed in the service request structure to be processed, which is not limited herein. And the system load when the selected target service request is processed is less than or equal to the system overload threshold value to avoid the system overload problem, based on the foregoing embodiment, the system overload threshold value is greater than the system load critical threshold value, for example, the system load critical threshold value is 80%, then the system overload threshold value is 90% or 85%, etc., it should be understood that when considering the system load when the target service request is processed, the system load when the target service request is processed should be based on the system load when the system load reaches the system load critical threshold value, and the corresponding range of the system load when the target service request is processed is between the system load critical threshold value and the system overload threshold value. And considering the forward feedback data of each service request, that is, the forward feedback data of the selected target service request is larger than the forward feedback data of each non-selected service request in the service request structure.

Specifically, the server selects a target service request from a pending service request structure based on the determined target processable service request list. Based on this, the server may specifically perform matching calculation again with the service request to be processed of each service information in the service request to be processed structure based on the determined processable service request of each service information in the target processable service request list, thereby selecting the target service request from the service request to be processed structure.

Further, the server performs service access processing on the target service indicated by the target service request. For example, the target service request is the pending service request A1 in the pending service request structure, and then the server specifically performs service access processing on the target service indicated by the pending service request A1. Next, if the target service request includes: the server specifically performs service access processing on the target service indicated by the service request to be processed A1 and performs service access processing on the target service indicated by the service request to be processed A2 in the service request to be processed structure of the service request to be processed A1 and the service request to be processed A2.

Secondly, in practical application, when selecting the target service request, on the basis of considering the forward feedback data of the service request, further consideration can be given to: object latency to handle service requests, bandwidth consumption to handle service requests, etc. I.e. selecting the pending service request with larger forward feedback data, shorter object waiting time and smaller bandwidth consumption as the target service request. It should be understood that the foregoing examples are provided for the understanding of the present aspects and are not to be construed as limiting the present aspects.

In the service access processing method, under the condition that the system load reaches a system load critical threshold smaller than the system overload threshold, matching processing is performed on the basis of the to-be-processed service request structure and the plurality of history service request structures, and the processable service requests contained in the processable service request list corresponding to the history service request structure obtained through matching, and the target service request which can be subjected to service access processing is determined from the to-be-processed service request structure, so that the system load is not overloaded when the selected target service request is processed, and forward feedback data of the target service request is larger than forward feedback data of unselected to-be-processed service requests, namely, the plurality of to-be-processed service requests can be selected and processed on the basis of considering the forward feedback data brought, thereby improving flexibility of service access processing.

In the foregoing embodiments, the matching processing of the service request structure is mentioned, and how to match the service request structure to be processed with each history service request structure will be described in detail below:

in one embodiment, as shown in fig. 4, matching the service request structure to be processed with each history service request structure includes:

Step 402, determining the number of service requests to be processed of each service information in the service request structure to be processed, and the number of historical service requests of each service information in each historical service request structure, where the service information has an association with the service type, or the service information has an association with the service type and the object type.

Wherein the service information has an association with the service type. For example, taking application to a video service scenario as an example, in the video service scenario, service information corresponding to a service request may include, but is not limited to: an online viewing type, an offline download type, a background viewing type, and the like. Different service interface call chains can be corresponding to different service interface call chains based on different service information, for example, the service interface call chain of the service request of the online viewing type comprises a service interface a, the service interface call chain of the service request of the offline download type comprises a service interface a and a service interface B, and the service interface call chain of the service request of the offline download type comprises a service interface a, a service interface B and a service interface C, and different service interfaces are used for providing different services.

Second, the service information may also have an association with the service type and the object type. I.e. different object types may have different service information for the same service type, i.e. there is a division of object types between objects, different object types may have different processing priorities. For example: again, taking a video service scenario as an example, in the video service scenario, service information corresponding to a service request may be: an online view type of the first object type, or an online view type of the second object type, or an online view type of the third object type. If the processing priority of the first object type is higher than that of the second object type, and the processing priority of the second object type is higher than that of the object type, in practical application, the server will preferentially process the service request of the online viewing type of the first object type if receiving the service request of the online viewing type of the first object type, and the service request of the online viewing type of the third object type. It is to be understood that the foregoing examples are provided merely for the understanding of the present invention and are not to be construed as limiting thereof.

Specifically, the server counts the number of the service requests to be processed of each service information in the service request structure to be processed based on the service information corresponding to each service request to be processed in the service request structure to be processed, that is, counts the number of the service requests to be processed corresponding to the same service information in the service request structure to be processed.

For example, in the pending service request structure, the service information F1 corresponding to the pending service request A1, the service information F2 corresponding to the pending service request A2, the service information F2 corresponding to the pending service request A3, the service information F3 corresponding to the pending service request A4, the service information F1 corresponding to the pending service request A5, and the service information F1 corresponding to the pending service request A6 may be obtained statistically, the pending service request A1, the pending service request A5, and the pending service request A6 may exist corresponding to the service information F1, the pending service request A2 and the pending service request A3 may exist corresponding to the service information F2, and the pending service request A4 may exist corresponding to the service information F3, so that the pending service request structure may be obtained: the number of service requests to be processed of the service information F1 is 3, the number of service requests to be processed of the service information F2 is 2, and the number of service requests to be processed of the service information F3 is 1.

Further, the server may calculate, in a similar manner, the number of history service requests of each service information in each history service request structure based on the service information corresponding to each history service request in each history service request structure, which is not described herein.

Step 404, performing matching processing based on the number of service requests to be processed of each service information and the number of history service requests of each service information in each history service request structure.

The matching process may calculate a similarity between service information of each pending service request in the pending service request structure and service information of each history service request in each history service request structure. The matching process can specifically calculate the similarity between the number of service information of each service request to be processed in the service request structure to be processed and the number of service information of each history service request in the history service request structure.

Specifically, the matching process is performed based on the number of service requests to be processed for each service information and the number of history service requests for each service information in each history service request structure. And specifically, performing matching processing calculation by the formula (1):

Wherein Total is _{Pending service requests for the same service information} For representing the Total number of service requests to be processed in a service request structure to be processed having the same service information as in a history service request structure _{Historical service request} For representing the total number of history service requests in the history service request structure.

In this embodiment, by considering the service information of the service request, the service requests belonging to the same service information in the service request structure to be processed and each history service request structure are counted, and the service information is related to the service type or the service type and the user type, so that the similarity of the service requests belonging to the same service information is higher. Based on the above, the matching process can distinguish the service requests by the service information, that is, the number of service requests of different service information is included, and the similarity between the service request structures is described, so that the similarity between the service request structures is more accurately judged, and the reliability and feasibility of the matching process are ensured.

Further, the foregoing describes in detail how to match the service request structure to be processed with each history service request structure, and the method of determining the target history service request structure after the matching process will be described in detail below:

In one embodiment, as shown in FIG. 5, determining a target historical service request structure that matches the pending service request structure includes:

step 502, determining a matching result between the pending service request structure and each history service request structure, where the matching result is used to describe a similarity between the pending service request structure and each history service request structure.

The matching result is used for describing the similarity between the service request structure to be processed and each history service request structure. Based on the description of the foregoing embodiment, the matching result is specifically used to describe the similarity between the number of service information of each pending service request in the pending service request structure and the number of service information of each history service request in each history service request structure.

Specifically, after the server performs the matching process, the matching result between the pending service request structure and each history service request structure can be determined. For example, if there are 5 pending service requests with service information F1 in the pending service request structure, the 5 pending service requests with service information F2 are provided. And the history service request structure has 10 history service requests with F1 service information and 10 history service requests with F2 service information. Namely, 5 service requests to be processed with the same service information F1 and 5 service requests to be processed with the same service information F2 are provided between the service request structure to be processed and the history service request structure, and the history service request structure specifically includes 20 (10+10) history service requests, then based on the foregoing formula (1), the matching result between the service request structure to be processed and the history service request structure is as follows:

Or if the pending service request structure has 4 pending service requests with service information F1 and 8 pending service requests with service information F2. And the history service request structure has 10 history service requests with F1 service information and 10 history service requests with F2 service information. Namely, 4 service requests to be processed with the same service information F1 and 8 service requests to be processed with the same service information F2 are arranged between the service request structure to be processed and the history service request structure, and the history service request structure specifically includes 20 (10+10) history service requests, then based on the foregoing formula (1), the matching result between the service request structure to be processed and the history service request structure is as follows:

in step 504, the historical service request structure with the highest similarity with the service request structure to be processed is determined as the target historical service request structure.

Specifically, the server determines a history service request structure having the highest similarity with the service request structure to be processed as a target history service request structure. For example, the similarity between the pending service request structure and the history service request structure D1 is 60%, the similarity between the pending service request structure and the history service request structure D2 is 80%, and the similarity between the pending service request structure and the history service request structure D3 is 50%, then the history service request structure D2 may be determined as the target history service request structure.

It should be understood that the examples in this embodiment are only for understanding the present scheme, and should not be construed as limiting the present scheme.

In this embodiment, the similarity between the to-be-processed service request structure and each history service request structure is considered, and the target history service request structure with the highest similarity to the to-be-processed service request structure is determined from each history service request structure, so that it can be ensured that the subsequent processable service request list corresponding to the similar target history service request structure is selected to obtain the target service request with higher accuracy.

In one embodiment, as shown in FIG. 6, selecting a target service request from a pending service request structure based on a target processable service request list, comprises:

step 602, determining the number of processable service requests of each service information in the target processable service request list.

Specifically, the server may determine the number of processable service requests of each service information in the target processable service request list in a similar manner as described in step 402, which is not described herein.

Step 604 selects a target service request from the pending service request structure based on the number of processable service requests for each service information in the target processable service request list.

Specifically, the server selects the target service request from the pending service request structures based on the number of processable service requests of the service information in the target processable service request list, and again in combination with considering the matching result between the pending service request structures and the history service request structures. Based on this, when the server performs matching processing on the service request structure to be processed and each history service request structure, the obtained matching result can also be described: the number ratio between the pending service requests and the historical service requests of the same service information between the pending service request structure and each historical service request structure.

Further, the server selects the target service request from the pending service request structure based on a ratio of a number of processable service requests of each service information in the target processable service request list to a number of pending service requests and historical service requests of the same service information between the pending service request structure and the target historical service request structure.

For example, if the pending service request structure has 6 pending service requests with service information F1 and 8 pending service requests with service information F2. The determined target history service request structure has 10 history service requests with service information F1 and 10 history service requests with service information F2, where it may be determined that: for a pending service request with service information F1, the number ratio between the pending service request structure and the target historical service request structure is And for a pending service request with service information F2, the number ratio between the pending service request structure and the target historical service request structure is +.>

Based on this, if the target processable service request list corresponding to the target history service request structure includes 5 processable service requests with service information F1Find and 5 service information F2 of the processable service requests. The server may select from the pending service request structures based on the number ratio between the pending service request structures and the target historical service request structures and the number of processable service requests for each service information in the target processable service request listPending service request with service information F1 +.>The individual service information is the pending service request of F2.

In this embodiment, since the structure of the target history service request with the highest similarity in the foregoing embodiment is used as the target history service request structure, it is ensured that the corresponding target processable service request list can more accurately select processable service requests in the target history service request structure, and at this time, the ratio of the number of service requests of the same service information in the target history service request structure to the number of service requests of the same service information in the to-be-processed service request structure is considered, so that based on the number ratio, the target service request with the similarity to the target processable service request list can be obtained based on the number information of the processable service requests of each service information in the target processable service request list, and therefore, the selected target service request can meet the requirement of the system load, and also forward feedback data is considered, thereby improving the reliability and accuracy of the target service request.

In step 204, the server may obtain the list of processable service requests corresponding to each history service request structure through offline calculation, and how to obtain the list of processable service requests corresponding to the history service request structure will be described in detail below. It should be understood that, in the following description, only one history service request structure is described to obtain a corresponding processable service request list, and all history service request structures can be processed in a similar manner, which is not repeated here:

in one embodiment, as shown in fig. 7, the obtaining manner of the processable service request list corresponding to each history service request structure includes:

step 702, obtaining a history service request structure, selecting N first to-be-selected service request lists from the history service request structure, and determining forward feedback data of each first to-be-selected service request list, where a system load of each to-be-selected service request in the first to-be-selected service request list is less than or equal to a system overload threshold when the to-be-selected service request is processed, and N is a positive integer greater than 1.

Specifically, similar to the pending service request structure described in the foregoing embodiment, the history service request structure is: the specific service interface call chain corresponding to each history service request, where the history service request has corresponding service information, and each service information has a corresponding service interface call chain, which is not described herein again. Secondly, specifically, the server may first obtain the history service requests received in the preset time interval, and determine a service interface call chain of each history service request based on the service information corresponding to each history service request, so as to obtain a history service request structure based on the service interface call chain of each history service request. It should be understood that the plurality of history service request structures may be obtained by dividing the history service requests within a predetermined time interval into a plurality of copies. Second, the plurality of history service request structures may also be derived based on history service requests within a succession of a plurality of preset time intervals. The specific description of the history service request structure is similar to that of the previous embodiment, and will not be repeated here.

Further, the server selects a plurality of first to-be-selected service request lists from the historical service request structure from the view of system load, and the system load when each to-be-selected service request in each first to-be-selected service request list is processed is smaller than or equal to a system overload threshold value, so that the overload of the system in processing each to-be-selected service request is avoided. It should be understood that the number of service requests to be selected included in each first service request list may be the same or different, which is not limited herein, and specifically needs to be determined based on the total load of the system load when the service requests to be selected in each first service request list are processed.

It may be understood that the first to-be-selected service request list may be a service request list directly selected from the history service request structure, or may be a service request list redetermined by forward feedback data of each first to-be-selected service request list and forward feedback data of each second to-be-selected service request list, which is not limited herein. The second service request list to be selected is obtained after at least one service to be selected in the first service request list is adjusted, where the adjustment may be deletion or replacement, and detailed description of the specific embodiment is described in the following embodiments.

Further, the forward feedback data of each first to-be-selected service request list is determined. The server calculates forward feedback data of each to-be-selected service request in each first to-be-selected service request list, and then sums the forward feedback data of each to-be-selected service request in each first to-be-selected service request list, so that the forward feedback data of each first to-be-selected service request list can be obtained. For example, if a first list of service requests to be selected includes P service requests to be selected, the forward feedback data of the first list of service requests to be selected may be obtained based on equation (2):

RUS _{first list of service requests to be selected} ＝Sum(RUS ₁ ，RUS ₂ ，...，RUS _P )； (2)

Wherein, RUS _{First list of service requests to be selected} Forward feedback data representing a first list of service requests to be selected, RUS ₁ Forward feedback data for representing 1 st service request to be selected in first service request list, RUS ₂ Forward feedback data for representing the 2 nd service request to be selected in the first list of service requests to be selected, and RUS _P Forward feedback data for representing the P-th service request to be selected in the first service request list, and Sum for representing the forward direction of each service request to be selected And (5) summing the feedback data.

For ease of understanding, as shown in fig. 8, the history service request structure 802 specifically includes history service requests 1 to 10, from which history service request 1, history service request 6, history service request 7, and history service request 8 are selected to form a first to-be-selected service request list 804, and from which history service request 2, history service request 5, history service request 9, and history service request 10 are selected to form a first to-be-selected service request list 806.

Step 704, determining a processable service request list corresponding to the history service request structure based on the forward feedback data of each first to-be-selected service request list, wherein the forward feedback data of the processable service request list is larger than the forward feedback data of each first to-be-selected service request list.

Specifically, the server determines a processable service request list corresponding to the acquired history service request structure based on forward feedback data of each first to-be-selected service request list on the basis of considering the forward feedback data, and at this time, the acquired forward feedback data of the processable service request list is greater than the forward feedback data of each first to-be-selected service request list.

It should be understood that in practical applications, there may be a case where a service request list to be selected with the forward feedback data maximized from the selected multiple first service request lists to be selected is determined as a processable service request list. And determining the first to-be-selected service request list with the largest forward feedback data in the first to-be-selected service request lists of the server as a processable service request list.

Secondly, in order to avoid local positive feedback data optimization, the problem of global optimization is ignored. The server may also adjust at least one service request to be selected in each first service request list to generate a corresponding number of second service request lists to be selected, and then reselect new N first service request lists based on forward feedback data of each first service request list to be selected and forward feedback data of each second service request list to be selected, and then determine a processable service request list with maximum forward feedback data based on the reselected first service request list to be selected.

In this embodiment, a plurality of first to-be-selected service request lists are selected from the historical service request structure based on the dimension of the system load, and then a processable service request list with larger forward feedback data is determined based on the dimension of the forward feedback data of each first to-be-selected service request list, so that the corresponding processable service request list selected from the historical service request structure is ensured, and the forward feedback request of each service request can be further considered on the basis of considering the system load, so that the forward feedback benefit of the service is improved, and the reliability and the practicability of service access processing are further improved.

As can be seen from the foregoing embodiments, one service request corresponds to one service information, one service information corresponds to one service interface call chain, and the service interface call chain includes at least one service interface, based on which, the essence of calculating the forward feedback data of the first to-be-selected service request list is: calculating forward feedback data of each service request to be selected in the first service request list, wherein the calculation of the forward feedback data of the service request to be selected specifically needs to be determined: and forward feedback data of the service interface is included in a service interface call chain corresponding to the service information of the service request to be selected.

Specifically, the forward feedback data of the service request may be determined according to the service consumption resource processing the service request and the object feedback data of the object for the service requested by the service request. The service consumption resource is a network resource and a computing resource required for processing the service request, and the object feedback data is obtained by computing the service usage information and the processing priority information of the service requested by the service request according to the object. And the service interface call chain of the service request specifically comprises the following service interfaces: and a service interface which is called for carrying out access processing on the service indicated by the service request. Therefore, the forward feedback data of the service request is specifically: the service interface of the service request invokes the sum of the forward feedback data of each service interface in the chain.

Based on this, the forward feedback data of the service interface is calculated specifically by formula (3):

CSC _kij ＝FU(i)-C(j)； (3)

wherein, the CSCk _ij Forward feedback data representing that the service requested by object i of the k objects invokes service interface j, FU (i) representing that object i is feedback data for the service requested by the service request, and C (j) representing that service interface j is service consuming.

Based on the formula (3), the forward feedback data of the service interface is determined specifically according to the service consumption resources of each service interface in the service interface call chain and the object feedback data of the object for the service requested by the service request. The service consumption resources of the service interface are: the network resources required for processing the service request may be bandwidth, and the computing resources may be memory occupancy, central processing unit (Central Processing Unit, CPU) occupancy, and the like.

The object feedback data is calculated according to the service use information and the processing priority information of the target service requested by the target object to the target service request. Wherein the service usage information includes at least one of: the use time of the target object using the target service is long, the activity of the target object using the target service and the time interval of the target object using the target service. The using time length of the target object using the target service is as follows: the time interval between the start of the use of the target service by the target object and the last issue of the service request, for example, the time of the target object from the start of the use of the target service is 2022, 1 month, 1 day, and the time of the last issue of the service request is 2022, 9 months, 1 day, then the use duration of the target use target service may be determined to be 9 months.

Secondly, the activity of using the target service by the target object is as follows: the ratio between the use duration of the target object using the target service and the number of times the target object uses the target service, for example, 270 times the target object uses the target service within 9 months of using the target service, may be calculated to have the activity of using the target object using the target service of 1 day/1 time. Again, the time interval for the target object to use the target service is specifically: the time interval from the last time the service request was issued to the statistical time, for example, the last time the service request was issued is 2022, 9 months, 1 day, and the statistical time is 2022, 9 months, 3 days, then the time interval for the target object to use the target service is 2 days.

Further, the processing priority information is related to the object type of the target object and the service type of the target service, as in the foregoing embodiment, the higher the processing priority information, that is, the higher the priority of the service request sent by the target object is processed, and the same object may have different processing priority information for different service types.

For ease of understanding, since the object feedback data needs to be calculated from information of at least one dimension of the service usage information and the processing priority information. For example, the application to video applications, there is at least one of the following that makes the object feedback data higher: the object type has higher processing priority, longer use time of the target object using the target service, higher activity of the target object using the target service and shorter time interval of the target object using the target service.

In practical application, the object feedback data can be calculated according to the formula (4):

FU(i)＝a*T(i)+b*A(i)+c*D(i)+d*K(i)； (4)

wherein FU (i) is used for representing object feedback data of the object i on the service requested by the service request, T (i) is used for representing the duration of use of the object i on the service requested by the service request, a (i) is used for representing the liveness of the object i on the service requested by the service request, D (i) is used for representing the processing priority information of the object i, K (i) is used for representing the time interval of the object i on the service requested by the service request, and the weight parameter a, the weight parameter b, the weight parameter c and the weight parameter D are preset weight parameters belonging to [0,1], and are flexibly determined according to service requirements, experimental data and historical experience data.

The server determines the forward feedback data of the target service request according to the service consumption resources for processing the target service request and the object feedback data of the target object for the target service requested by the target service request, and the service consumption resources are calculated according to the service consumption resources of each service interface in the service interface call chain of the target service request. Wherein, the service consumption resources of the service interface are: network resources and computing resources required to process the target service request.

And secondly, the object feedback data is calculated according to the service use information and the processing priority information of the target service requested by the target object to the target service request. Wherein the service usage information includes at least one of: the use time of the target object using the target service is long, the activity of the target object using the target service and the time interval of the target object using the target service. And the processing priority information is related to the object type of the target object and the service type of the target service. In particular in a manner similar to that described in the previous embodiments. It is to be understood that the foregoing examples are provided merely for the understanding of the present invention and are not to be construed as limiting thereof.

Based on this, in order to ensure the uniformity of the distribution of the forward feedback data of each service interface, the unification of the forward feedback data of each service interface needs to be considered, and the forward feedback data of each first to-be-selected service request list will be determined based on the description below:

in one embodiment, as shown in fig. 9, the service access processing method further includes:

step 902, collecting initial forward feedback data of each service interface, and performing normalization processing on the initial forward feedback data of each service interface to obtain forward feedback data of each service interface.

Wherein, the initial forward feedback data is: and after the historical service requests of different service information are processed, the acquired forward feedback data of each service interface is called in a service interface call chain based on the service information. Thus, the initial positive feedback data of the service interface is specifically: the historical service requests of different service information call the set of forward feedback data generated by the same service interface, and the forward feedback data of the service interface is specifically: and the historical service requests of different service information call the set of forward feedback data after normalization processing, which is generated by the same service interface.

Specifically, the server collects initial forward feedback data of each service interface, namely, collects and processes historical service requests of different service information, and calls the obtained forward feedback data of each service interface in a service interface call chain based on the service information, so that the obtained historical service requests of different service information call a set of forward feedback data generated by the same service interface.

Further, the initial forward feedback data of each service interface is normalized to obtain the forward feedback data of each service interface. And for the initial forward feedback data of each service interface, specifically, carrying out normalization processing according to a formula (5):

CSC _kij ＝[CSC‘ _kij -min(CSC)]×[max(CSC)-min(CSC)] (5)；

Wherein CSC _kij Forward feedback data for representing service interfaces, CSC' _kij For representing initial forward feedback data of the service interfaces, min (CSC) for representing minimum forward feedback data of the forward feedback data of each service interface, and max (CSC) for representing maximum forward feedback data of the forward feedback data of each service interface.

Based on this, determining forward feedback data of each first to-be-selected service request list includes:

step 904, determining a service interface call chain of each history service request in each first to-be-selected service request list based on the service information of each history service request in each first to-be-selected service request list, wherein the service interface call chain comprises at least one service interface.

Wherein the service information has an association with the service type, or the service information has an association with the service type and the object type. And each service information has a corresponding service interface call chain, the service interface call chain includes at least one service interface, so the service interface call chain of the service request specifically includes the service interface as follows: and a service interface which is called for carrying out access processing on the target service indicated by the service request. The detailed description of the service interface call chain and the service information is similar to that of the previous embodiment, and will not be repeated here.

Specifically, as described in the foregoing embodiment, each service request has corresponding service information, and each service information has a corresponding service interface call chain. Therefore, the server may first obtain the service information of each history service request in each first to-be-selected service request list, and then further determine the service interface call chain of each history service request in each first to-be-selected service request list based on the corresponding relationship between each service information and the service interface call chain.

For example, the service information F1 corresponds to the service interface call chain 1, the service information F2 corresponds to the service interface call chain 2, the service information F3 corresponds to the service interface call chain 3, based on which, if the history service request A1 corresponds to the service information F1, the history service request A2 corresponds to the service information F2, and the history service request A3 corresponds to the service information F2, based on the correspondence between the foregoing service information and the service interface call chain, the history service request A1 corresponds to the service interface call chain F1, the history service request A2 corresponds to the service interface call chain F2, and the history service request A3 corresponds to the service interface call chain F2 can be determined.

Step 906, calculating forward feedback data of each history service request in each first to-be-selected service request list based on forward feedback data of each service interface and service interface call chains of each history service request in each first to-be-selected service request list, and determining forward feedback data of each first to-be-selected service request list.

Specifically, the server may obtain, through step 902, forward feedback data of each service interface after normalization processing, and may obtain, according to step 904, a service interface call chain of each history service request in each first to-be-selected service request list. Because the service interface call chain comprises at least one service interface, the forward feedback data of each service interface in the service interface call chain of each history service request is determined based on the service interfaces included in the service interface call chain of each history service request, and then summation processing is carried out to obtain the forward feedback data of the service interface call chain of each history service request, wherein the forward feedback data of the service interface call chain of each history service request is the forward feedback data of each history service request.

Further, since each first to-be-selected service request list is selected from each history service request, after the forward feedback data of each history service request is obtained, the forward feedback data of each first to-be-selected service request list can be determined based on the history service request included in each first to-be-selected service request list.

For ease of understanding, the example shown in step 904 is again described, and service interface call chain 1 specifically includes service interface B and service interface C, and service interface call chain 2 specifically includes service interface D. Based on this, if the first to-be-selected service request list includes the history service request A1 and the history service request A2, the forward feedback data of the history service request A1 is specifically: the sum of the forward feedback data of the corresponding service interface included in the service interface call chain F1 is similar to the sum, and the forward feedback data of the history service request A2 specifically includes: the corresponding service interface invokes the sum of the positive feedback data of the service interfaces included in chain F2.

Since the service interface call chain 1 specifically includes the service interface B and the service interface C, and the service interface call chain 2 specifically includes the service interface D, the forward feedback data of the history service request A1 is: the forward feedback data of the service interface B and the forward feedback data of the service interface C, the forward feedback data of the history service request A2 are: the service interface D feeds back data in the forward direction. Based on the forward feedback data of the first to-be-selected service request list is: forward feedback data for service interface B, forward feedback data for service interface C, and forward feedback data for service interface D. It is to be understood that the foregoing examples are provided merely for the understanding of the present invention and are not to be construed as limiting the present invention.

In this embodiment, the normalization processing is performed on the initial forward feedback data of each service interface, so as to ensure the uniformity of the distribution of the forward feedback data of each service interface, and also facilitate the accuracy and uniformity of subsequent computation. Based on the corresponding relation between the service request and the service information and the corresponding relation between the service information and the service interface call chain, the service interface required to be called for completing one historical service request is determined, and the forward feedback data of the historical service request is determined based on the forward feedback data of each service interface, so that the reliability and accuracy of calculation are ensured.

Based on the description of the foregoing embodiment, a method of how to select N first list of service requests to be selected from the history service request structure will be described below:

in one embodiment, as shown in fig. 10, N first lists of service requests to be selected from the history service request structure include at least one of:

step 1002, obtain forward feedback data of each history service request in the history service request structure, and sort each history service request from big to small based on the forward feedback data of each history service request, so as to obtain a first sorting result.

The first ordering result is a result of ordering forward feedback data of the historical service request from big to small.

Specifically, the forward feedback data of each history service request in the history service request structure is obtained in a similar manner as described in the foregoing embodiment, which is not described herein. Based on the forward feedback data of each history service request, each history service request is ranked from big to small to obtain a first ranking result. For example, the forward feedback data of the history service request A1 is 0.8, the forward feedback data of the history service request A2 is 0.6, the forward feedback data of the history service request A3 is 0.9, and the forward feedback data of the history service request A4 is 0.5, and then the first sorting result is that after sorting the forward feedback data based on the history service requests from large to small: history service request A3, history service request A1, history service request A2, history service request A4.

Step 1004, selecting a history service request from a history service request structure based on the first ordering result to generate a first list of to-be-selected service requests.

Specifically, the server may select, from the history service request structure, a history service request with a front ranking result based on the first ranking result, to generate a first list of to-be-selected service requests. Based on this, the number of history service requests in the first to-be-selected service request list may be a preset number, for example: 4 history service requests, 6 history service requests, etc. Alternatively, the number of history service requests in the first list of to-be-selected service requests may be a proportion of the number of history service requests in the history service request structure, for example, 20% of the number of history service requests is selected as the selected number, that is, the number of history service requests is 20, and then the first 4 history service requests with the selection ordering result generate the first list of to-be-selected service requests.

Alternatively, the number of the history service requests in the first list of the to-be-selected service requests may be determined in consideration of the system load when the selected history service request is processed, and it should be understood that, when the system load when the selected history service request is processed is considered, the system load when the selected history service request is processed, that is, the corresponding range of the system load when the selected history service request is processed, should be within: the system load critical threshold value is between the system overload threshold value and the system load critical threshold value. For example, after the 5 historical service requests with the top ranking result before selection, when the system load when the 5 historical service requests are processed reaches the system overload threshold, the historical service requests will stop being selected continuously, and a first to-be-selected service request list is generated based on the 5 selected historical service requests.

For easy understanding, taking a preset number of 4 as an example, as shown in fig. 11, each history service request in the history service request structure 1102 is sequenced based on forward feedback data of each history service request, then a first sequencing result 1104 corresponding to the history service request structure 1102 is obtained, and then 4 history service requests with the front sequence are selected from the first sequencing result 1104 to generate a first to-be-selected service request list 1106. And, when the first 4 history service requests are selected based on fig. 11, the system load when the selected history service requests are processed should be considered, if the system load when the selected history service requests are processed exceeds the system overload threshold, one of the history service requests may be replaced by the history service request of rank 5, or one of the history service requests may be deleted directly, so as to ensure that the system load when the selected history service requests are processed does not exceed the system overload threshold, which is not limited herein.

In practical application, when selecting N first to-be-selected service request lists, on the basis of considering forward feedback data of historical service requests, further consideration may be given to: object waiting time of the history processing service request, bandwidth consumption of the history processing service request, and the like, and then selecting based on the sorting result considered by the plurality of dimensions, which will not be described in detail herein.

And it can be understood that the server may also select, based on the specific scenario requirement and the service requirement, the history service request with the last sorting result from the history service request structure to generate the first list of service requests to be selected, which is not limited herein. Also, the examples of steps 1002 to 1004 are only for understanding the present solution, and examples of how to generate the first list of service requests to be selected by sequentially picking the history service requests with higher forward feedback data should not be construed as limiting the present solution.

In another alternative embodiment, the first list of to-be-selected service requests may also be randomly generated, specifically: step 1006, randomly selecting a history service request from a history service request structure to generate a first list of service requests to be selected.

Specifically, the server randomly selects a history service request from a history service request structure to generate a first list of service requests to be selected. Similar to the description in step 1004, the number of historical service requests in the first list of service requests to be selected may be a preset number, for example: randomly selecting 4 history service requests, randomly selecting 6 history service requests, etc. Alternatively, the number of history service requests in the first list of to-be-selected service requests may be a proportion of the number of history service requests in the history service request structure. Alternatively, the number of history service requests in the first list of to-be-selected service requests may be determined in consideration of the system load when the selected history service request is processed.

To facilitate understanding, again, a preset number of 4 is illustrated as an example, as shown in fig. 12, 4 history service requests are selected directly from the history service request structure 1202. To generate a first list of to-be-selected service requests 1204. And, similar to fig. 11, when 4 history service requests are randomly selected, the system load when the selected history service requests are processed should be considered, if the system load when the selected history service requests are processed exceeds the system overload threshold, one history service request may be replaced by an unselected history service request, or one history service request may be directly deleted, so as to ensure that the system load when the selected history service requests are processed does not exceed the system overload threshold, which is not limited herein.

In this embodiment, the first to-be-selected service request list is generated by sequentially selecting the historical service requests with higher forward feedback data, so that the generated first to-be-selected service request list can be ensured to have higher forward feedback data, and then, the first to-be-selected service request list can be generated in a random selection manner, so that the flexibility of the selected first to-be-selected service request list is improved.

In one embodiment, as shown in fig. 13, determining a processable service request list corresponding to the history service request structure based on forward feedback data of each first to-be-selected service request list includes:

Step 1302, adjusting at least one historical service request in each first service request list to generate N second service request lists to be selected, and determining forward feedback data of each second service request list to be selected, where a system load when each historical service request in the second service request list to be selected is less than or equal to a system overload threshold.

The method for adjusting the historical service request in the first service request list to be selected at least comprises the following steps: at least one history service request in the first list of service requests to be selected is deleted or replaced. Therefore, the adjustment manner of the first to-be-selected service request list may be the same or different, which is not limited herein.

And secondly, the number of the second service request lists to be selected generated after adjustment is consistent with that of the first service request lists to be selected, and the system load when each history service request in the second service request lists to be selected is processed is smaller than or equal to a system overload threshold value.

Specifically, after the server selects N first to-be-selected service request lists, an adjusted first to-be-selected service request list is selected from the N first to-be-selected service request lists, and then the adjustment processing is performed on the selected adjusted first to-be-selected service request list. It may be appreciated that the adjustment to the N first to-be-selected service request lists may be: and respectively adjusting the N first to-be-selected service request lists to obtain second to-be-selected service request lists obtained after each first to-be-selected service request list is adjusted.

Or selecting a first to-be-selected service request list from the N first to-be-selected service request lists for adjustment to obtain a second to-be-selected service request list, then selecting a first to-be-selected service request list from the N first to-be-selected service request lists for adjustment to obtain a second to-be-selected service request list again until N second to-be-selected service request lists are obtained. The adjusted first list of service requests to be selected for each selection may be the same or different, and is not limited herein.

In step 1304, a processable service request list is determined based on the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list.

Specifically, the server determines a processable service request list corresponding to the acquired history service request structure based on forward feedback data of each first to-be-selected service request list and forward feedback data of each second to-be-selected service request list, taking forward feedback data of a plurality of to-be-selected service request lists into consideration, wherein the acquired forward feedback data of the processable service request list is larger than the forward feedback data of each first to-be-selected service request list.

Further, the server may specifically determine, as the processable service request list, the service request list to be selected with the largest forward feedback data among the forward feedback data of each first service request list to be selected and the forward feedback data of each second service request list to be selected. Or, to further avoid the problem of local positive feedback data optimization, so as to ignore global optimization, the server can also reselect new N first to-be-selected service request lists based on the positive feedback data of each first to-be-selected service request list and the positive feedback data of each second to-be-selected service request list, and then determine the processable service request list with the largest positive feedback data based on the reselected first to-be-selected service request list. The specific examples are not limited herein.

In this embodiment, on the basis of considering the system load, the forward feedback request of each service request can be further considered, and based on the forward feedback data of each first to-be-selected service request list and the forward feedback data of the second to-be-selected service request list obtained by adjusting each first to-be-selected service request list, the problem that the local forward feedback data is optimal is avoided, the reliability of the determined processable service request list is ensured from the global consideration perspective, and the forward feedback benefit of the processing service request list is improved, so that the reliability and the practicability of service access processing are further improved.

Referring to the adjustment operation in the embodiment of fig. 13, in order to obtain a processable service request list with better forward feedback data from multiple service request lists to be selected, a neighborhood search may be performed on the multiple service request lists to mine more service request lists to be selected, and a method of how to perform the adjustment operation to obtain multiple second service request lists is first received:

in one embodiment, as shown in fig. 14, the service access processing method further includes:

step 1402, performing a roulette operation on each of the first to-be-selected service request list and the unselected service request list based on the forward feedback data of each of the first to-be-selected service request lists.

Secondly, the operation of the wheel is specifically based on the wheel algorithm, which is a common random selection method. The wheel algorithm is specifically based on the feature conversion of the individual to the selected probability, and then the individual corresponding to the pointer stopping sector after the disc stops after each rotation of the disc is proportionally divided on a disc according to the ratio occupied by the individual (namely the selected probability), so that in the wheel algorithm, the larger the ratio occupied by the individual (namely the selected probability), the larger the occupied area of the individual in the disc, and the larger the selected opportunity.

Specifically, the server converts the forward feedback data of each first to-be-selected service request list into the probability of each first to-be-selected service request list being selected, and then performs the wheel disc operation based on the probability. For example, the forward feedback data of the first to-be-selected service request list G1 is 1.2, and the forward feedback data of the first to-be-selected service request list G2 is 0.8, and after the conversion, the probability that the first to-be-selected service request list G1 is selected is:and the probability that the first to-be-selected service request list G2 is selected is: />And then carrying out wheel disc operation on the first to-be-selected service request list G1 and the first to-be-selected service request list G2 based on the probability.

In step 1404, an adjusted first list of service requests to be selected from the first list of service requests to be selected based on the wheel disc operation result.

The operation result of the wheel disc is used for describing a first service request list to be selected, which corresponds to the pointer stopping sector after the disc stops every time after the disc rotates for N times.

Specifically, the server can determine the first to-be-selected service request list corresponding to the pointer parking sector after each disc stop based on the disc operation result, that is, can obtain the selected N first to-be-selected service request lists from the first to-be-selected service request lists. It can be understood that, because the larger the forward feedback data of the first to-be-selected request list is, the larger the probability that the first to-be-selected request list is selected, the selected N first to-be-selected request lists may be the same first to-be-selected request list or different first to-be-selected request lists. And then the server determines the first to-be-selected service request list corresponding to the pointer stopping sector after each round of disc stopping as the adjusted first to-be-selected service request list.

For example, by the method of the foregoing embodiment, the first to-be-selected service request list G1, the first to-be-selected service request list G2, the first to-be-selected service request list G3, and the first to-be-selected service request list G4 are selected, and then 4 wheel disc operations should be performed, where the wheel disc operation result is: the first to-be-selected service request list G1 is selected after the disc is rotated for the 1 st time, the first to-be-selected service request list G2 is selected after the disc is rotated for the 2 nd time, the first to-be-selected service request list G2 is selected after the disc is rotated for the 3 rd time, and the first to-be-selected service request list G4 is selected after the disc is rotated for the 4 th time. The adjusted first list of service requests to be selected is: the first to-be-selected service request list G1, the first to-be-selected service request list G2, and the first to-be-selected service request list G4, and specifically needs to be adjusted 1 time based on the first to-be-selected service request list G1, 2 times based on the first to-be-selected service request list G2, and 1 time based on the first to-be-selected service request list G4.

In this embodiment, the first to-be-selected service request list that is adjusted is selected through the wheel disc operation, and the first to-be-selected service request list with better forward feedback data can be obtained from the plurality of first to-be-selected service request lists through searching for adjustment, so that a selection basis is provided for subsequently selecting the processable service request list with better forward feedback data, and the reliability of the selected processable service request list is further ensured.

As can be seen from the foregoing embodiments, the adjustment may be performed by deleting at least one history service request or replacing at least one history service request, and the two different adjustment modes are described below, where the adjustment mode of deleting at least one history service request is described first:

in one embodiment, as shown in fig. 15, at least one historical service request in each first service request list to be selected is adjusted, and N second service request lists to be selected are generated, which at least includes one of the following:

in step 1502, a third service request list to be selected is determined from the first service request lists to be selected, and at least one historical service request in the third service request list to be selected is deleted randomly, so as to generate a second service request list to be selected.

The third service request list to be selected is: the method of selecting the third service request list to be selected may be a method based on the wheel disc operation described in fig. 14, which needs to be adjusted for the first service request list to be selected. Or, one of the first to-be-selected service request lists may be selected randomly, where the random selection manner needs to be adjusted for each first to-be-selected service request list.

Specifically, the server determines the third to-be-selected service request list from the respective first to-be-selected service request lists, and the manner in which the third to-be-selected service request list is determined is not limited herein. Based on this, at least one historical service request in the third service request to be selected list is randomly deleted to generate a second service request to be selected list.

For ease of understanding, as shown in fig. 16, fig. 16 (a) illustrates: the third service request to be selected list 1601 is determined, and 1 history service request is randomly deleted from the third service request to be selected list 1601 to generate the second service request to be selected list 1602, so that the second service request to be selected list 1602 includes only the history service request 1, the history service request 7, and the history service request 8. Next, fig. 16 (B) illustrates: the third service request to be selected list 1601 is determined, and 2 history service requests are randomly deleted from the third service request to be selected list 1601 to generate the second service request to be selected list 1603, so that the second service request to be selected list 1603 is only the history service request 1 and the history service request 7.

Alternatively, in another embodiment, the selection deletion may be based on the positive feedback data of each historical service request:

Step 1504, determining a third to-be-selected service request list from the first to-be-selected service request lists, and sorting forward feedback data of each history service request in the third to-be-selected service request list to obtain a second sorting result.

The second sorting result is a result of sorting forward feedback data of the historical service requests in the third service request list to be selected from big to small. The result of sorting the positive feedback data of the historical service requests in the third service request to be selected from small to large may also be obtained.

Specifically, the forward feedback data of each history service request in the history service request structure in the third to-be-selected service request list is obtained in a similar manner as described in the foregoing embodiment, which is not described herein. Based on the forward feedback data of each historical service request in the third service request to be selected list, sequencing each historical service request to obtain a second sequencing result. The specific ordering mode is not limited herein, and the actual situation can be flexibly determined.

At step 1506, at least one historical service request in the third list of service requests to be selected is deleted based on the second ordering result to generate a second list of service requests to be selected.

Specifically, the server may delete at least one historical service request in the third list of service requests to be selected based on the second ordering result to generate the second list of service requests to be selected. If the second sorting result sorts the forward feedback data of the historical service requests in the third service request list to be selected from big to small, the server may delete at least one historical service request with the front sorting in the third service request list to be selected, that is, delete the historical service request with the larger forward feedback data. Similarly, if the second sorting result sorts the forward feedback data of the historical service requests in the third service request list to be selected from small to large, the server may delete at least one historical service request with the front sorted historical service request in the third service request list to be selected, that is, delete the historical service request with smaller forward feedback data.

For ease of understanding, taking the second sorting result as an example of the result of sorting the forward feedback data of the history service requests in the third service request to be selected from large to small, as shown in fig. 17, fig. 17 (a) illustrates that: the third service request list 1701 to be selected is determined, and then the second sorting result 1702 is obtained by sorting from large to small based on the forward feedback data of each history service request in the third service request list 1701 to be selected, based on which the history service request 1 with the largest forward feedback data is determined by the second sorting result 1702, and the history service request 1 with the largest forward feedback data is deleted from the third service request list 1701 to be selected to generate the second service request list 1703, so that the second service request list 1703 to be selected only includes the history service request 6, the history service request 7 and the history service request 8.

Similarly, fig. 17 (B) illustrates: a third service request list 1701 to be selected is determined, and then the forward feedback data of each history service request in the third service request list 1701 to be selected is sorted from large to small, so as to obtain a second sorting result 1702, based on this, the history service request 1 and the history service request 6 with forward feedback data being front are determined through the second sorting result 1702, and the history service request 1 and the history service request 6 with forward feedback data being front are deleted from the third service request list 1701 to be selected, so as to generate a second service request list 1704, and therefore the second service request list 1704 to be selected only includes the history service request 7 and the history service request 8.

It should be understood that the examples shown in the present embodiment are for understanding the present solution, and should not be construed as limiting the present solution.

In this embodiment, the second to-be-selected service request list may be generated by randomly deleting the history service request in the adjusted first to-be-selected service request list, or may be generated by deleting the history service request in consideration of the forward feedback data, thereby improving flexibility of the second to-be-selected service request list. And secondly, by deleting a plurality of historical service requests, the service request structure in the first to-be-selected service request list can be adjusted more, the difference between the first to-be-selected service request list and the second to-be-selected service request list is enlarged, the local optimal solution is avoided better, and the reliability and the practicability of the subsequent determination selectable service request list are further improved.

The way in which the at least one history service request is replaced is adjusted will be described as follows:

in one embodiment, as shown in fig. 18, the service access processing method further includes:

step 1802, determining an unselected service request list from a historical service request structure.

Wherein the list of unselected service requests is: the history service requests not selected in the history service request structure, i.e. the history service requests not included in each first list of the requests to be selected.

Specifically, when the server selects N first lists of service requests to be selected from the history service request structure through the foregoing embodiment, the server is further capable of generating a list of unselected service requests based on the unselected history service requests. For example, the history service request structure specifically includes the history service requests A1 to a10, and one of the first to-be-selected service request lists includes the history service requests A1 to A4, and the other first to-be-selected service request list includes the history service requests A5 to A8, so that the unselected service request list includes the history service request A9 and the history service request a10.

Based on the above, at least one historical service request in each first service request list to be selected is adjusted, and N second service request lists to be selected are generated, wherein the N second service request lists to be selected at least comprise one of the following:

Step 1804, determining a fourth service request list to be selected from the first service request lists to be selected, and randomly replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list to generate a second service request list to be selected.

The fourth service request list to be selected is similar to the third service request list to be selected, and will not be described herein.

In particular, the server determines the fourth list of service requests to be selected from the respective first lists of service requests to be selected, and the manner in which the fourth list of service requests to be selected is determined is not limited. Based on this, the server randomly replaces at least one historical service request in the fourth list of service requests to be selected with at least one historical service request in the list of unselected service requests to generate a second list of service requests to be selected. It should be understood that the number of history service requests to be replaced may be the same or may be different, i.e. the server may select 1 history service request from the fourth list of service requests to be selected for replacement, then select 1 history service request from the list of unselected service requests for replacement, or may select a plurality of history service requests from the list of unselected service requests for replacement. It should be appreciated that the system load when historical service requests are processed should still be considered after the selection of the replacement.

For ease of understanding, description will be given taking an equivalent number of substitutions as an example, as shown in fig. 19, the diagram in fig. 19 (a) is: the unselected service request list 1901 is determined, and the fourth to-be-selected service request list 1902 is determined, and the history service request 2 is selected as a history service request for replacement from the unselected service request list 1901, and the history service request 1 is selected as a history service request for replacement from the fourth to-be-selected service request list 1902 to generate the second to-be-selected service request list 1903, at which time the second to-be-selected service request list 1903 includes the history service request 2, the history service request 6, the history service request 7, and the history service request 8.

Similarly, fig. 19 (B) illustrates: a non-selected service request list 1901 is determined, and a fourth to-be-selected service request list 1902 is determined, and history service request 2 and history service request 3 are selected as alternative history service requests from the non-selected service request list 1901, and history service request 1 and history service request 6 are selected as alternative history service requests from the fourth to-be-selected service request list 1902 to generate a second to-be-selected service request list 1905, where the second to-be-selected service request list 1905 includes history service request 2, history service request 3, history service request 7, and history service request 8.

Alternatively, in another embodiment, the selection replacement may be made in consideration of forward feedback data for each historical service request:

step 1806, determining a fourth to-be-selected service request list from the first to-be-selected service request lists, and sorting forward feedback data of each history service request in the fourth to-be-selected service request list to obtain a third sorting result.

The third sorting result is a result of sorting forward feedback data of the historical service requests in the fourth service request list to be selected from big to small. The result of sorting the positive feedback data of the historical service requests in the fourth service request list to be selected from small to large may also be obtained.

Specifically, the forward feedback data of each history service request in the history service request structure in the fourth to-be-selected service request list is obtained in a similar manner as described in the foregoing embodiment, which is not described herein. Based on the forward feedback data of each history service request in the fourth service request list to be selected, sequencing each history service request to obtain a third sequencing result. The specific ordering mode is not limited herein, and the actual situation can be flexibly determined.

Step 1808, based on the third sorting result, replacing at least one historical service request in the fourth list of service requests to be selected with at least one historical service request in the list of unselected service requests to generate a second list of service requests to be selected.

Specifically, the server may replace at least one history service request in the fourth list of service requests to be selected with at least one history service request in the list of unselected service requests based on the third sorting result, to generate the second list of service requests to be selected. If the third sorting result sorts the forward feedback data of the historical service requests in the fourth service request list to be selected from big to small, the server can select at least one historical service request with the front sorting in the fourth service request list to be selected for replacement, namely replace the historical service request with the larger forward feedback data. Similarly, if the third sorting result sorts the forward feedback data of the historical service requests in the fourth service request list to be selected from small to large, the server may select at least one historical service request with the front sorting in the fourth service request list to be selected to perform replacement, that is, replace the historical service request with smaller forward feedback data.

Based on this, the server can further sort based on the forward feedback data of the history service requests in the unselected service request list, and then select at least one history service request from the unselected service request list to replace based on the sorting result, and similar to the foregoing embodiment, the number of history service requests to replace may be the same or different, which is not limited herein.

For ease of understanding, the description will be given taking the third sorting result as an example of the result of sorting the forward feedback data of the history service requests in the fourth to-be-selected service request list from large to small, as shown in fig. 20, the unselected service request list 2001 is determined first, and the fourth to-be-selected service request list 2002 is determined, then sorting is performed from large to small based on the forward feedback data of each history service request in the fourth to-be-selected service request list 2002, thereby obtaining the third sorting result 2003, based on which the history service request 1 with the largest forward feedback data is determined by the second sorting result 2003, and the history service request 4 is selected from the unselected service request list 2001 as the history service request to be replaced, so as to generate the second to-be-selected service request list 2004, and at this time, the second to-be-selected service request list 2004 includes the history service request 4, the history service request 6, the history service request 7, and the history service request 8. The manner in which the plurality of historical service requests are selected for replacement is similar and is not illustrated herein, and the foregoing examples are merely for understanding the present solution and should not be limiting.

In this embodiment, the second service request list to be selected may be generated by randomly replacing the historical service request in the first service request list to be selected, or by replacing by considering the forward feedback data of the historical service request, so as to further improve the flexibility of the second service request list to be selected.

In one embodiment, as shown in fig. 21, when generating N second service request lists to be selected, the service access processing method further includes:

step 2102, recording a neighborhood search cycle number, wherein the neighborhood search cycle number is used for describing: and adjusting the times of generating the corresponding N second service request lists to be selected for each first service request list to be selected.

Wherein, the neighborhood search cycle number is used for description: and adjusting the times of generating the corresponding N second service request lists to be selected for each first service request list to be selected.

Specifically, the server updates the neighborhood search cycle number once when adjusting each first to-be-selected service request list and generating N corresponding second to-be-selected service request lists. For example, the first adjustment, i.e., the number of neighbor search cycles is 1, the next (i.e., second adjustment) adjustment updates the number of neighbor search cycles from 1 to 2, and the next (i.e., third adjustment) adjustment updates the number of neighbor search cycles from 2 to 3.

Based on this, determining a processable service request list based on the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list includes:

step 2104, redetermining N first to-be-selected service request lists based on the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list.

Specifically, the server selects, from the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list, the to-be-selected service request list corresponding to the forward feedback data belonging to the first N forward feedback data as N first to-be-selected service request lists to be redetermined. For example, the forward feedback data of the first to-be-selected service request list G1 is 0.8, the forward feedback data of the first to-be-selected service request list G2 is 1.2, the forward feedback data of the second to-be-selected service request list H1 is 1.0, and the forward feedback data of the second to-be-selected service request list H2 is 0.7. 2 newly determined first to be selected request lists need to be selected from the two forward feedback data of the first to be selected request list G2 and the forward feedback data of the second to be selected request list H1 are the first 2 forward feedback data, and then the first to be selected request list G2 and the second to be selected request list H1 are newly determined as the new first to be selected request list.

Step 2106, at least one historical service request in each redetermined first service request list to be selected is adjusted, N redetermined second service request lists to be selected are generated, and the neighborhood search cycle number is updated.

Specifically, the server adjusts at least one historical service request in each redetermined first service request list to generate N redetermined second service request lists. Further, the server updates the neighborhood search cycle number based on this.

Further, updating the neighborhood search cycle number includes: determining the times of adjusting each first to-be-selected service request list to generate corresponding N second to-be-selected service request lists, determining whether the neighborhood search cycle times exist or not, if the neighborhood search cycle times do not exist, determining that the operation is executed after the first to-be-selected service request lists are adjusted to generate the corresponding N second to-be-selected service request lists, and recording the neighborhood search cycle times as 1. If there is a neighborhood search cycle number, the neighborhood search cycle number is updated, i.e., based on the neighborhood search cycle number +1.

Based on this, the server needs to determine whether the updated number of neighborhood search cycles reaches the preset number of neighborhood searches, if not, execute a similar implementation method as step 2104, if yes, execute step 2108.

Step 2108, if the updated neighborhood search cycle number reaches the preset neighborhood search number, determining the service request list to be selected with the largest forward feedback data as the processable service request list from the forward feedback data of each redetermined first service request list to be selected and the forward feedback data of each redetermined second service request list to be selected.

Specifically, the server determines that the updated neighborhood search cycle number reaches the preset neighborhood search number, and at this time, determines the service request list to be selected with the largest forward feedback data as the processable service request list from the forward feedback data of each redetermined first service request list to be selected and the forward feedback data of each redetermined second service request list to be selected.

For example, the forward feedback data of the first to-be-selected service request list G1 is determined to be 1.8, the forward feedback data of the first to-be-selected service request list G2 is determined to be 1.4, the forward feedback data of the second to-be-selected service request list H1 is determined to be 1.2, the forward feedback data of the second to-be-selected service request list H2 is determined to be 1.5, the forward feedback data of the first to-be-selected service request list G1 is determined to be the processable service request list at the moment, and the forward feedback data of the first to-be-selected service request list G1 is determined to be the processable service request list.

Based on this, the server executes the similar manner of the foregoing embodiment for each history service request structure, so as to obtain a processable service request list corresponding to each history service request structure, and then stores the processable service request list corresponding to each history service request structure, so as to call the processable service request list corresponding to each history service request structure in the process of specific service access processing.

In this embodiment, by redetermining the cyclic manner of the service request list to be selected multiple times, a processable service request list with globally optimal forward feedback data can be obtained, so that accuracy and global performance of determining the target service request in the dimension of the forward feedback data for subsequent service access processing are further ensured, and reliability of service access processing is further improved.

The foregoing embodiments respectively describe the detailed processing flows of the service access processing method, and the complete flow of the service access processing method will be described below, as shown in fig. 22, and the method is described by taking the application of the method to the server 104 in fig. 1 as an example, it will be understood that the method may also be applied to a system including the terminal 102 and the server 104, and implemented through interaction between the terminal 102 and the server 104. In this embodiment, the method includes the steps of:

Step 2201, collecting initial forward feedback data of each service interface, and normalizing the initial forward feedback data of each service interface to obtain forward feedback data of each service interface.

Further, the initial forward feedback data of each service interface is normalized to obtain the forward feedback data of each service interface. And for the initial forward feedback data of each service interface, the normalization processing is specifically performed through the foregoing formula (5).

Step 2202, obtain a history service request structure, and select N first to-be-selected service request lists from the history service request structure.

Specifically, the history service request structure is: the specific service interface call chain corresponding to each history service request, where the history service request has corresponding service information, and each service information has a corresponding service interface call chain, which is not described herein again. Secondly, specifically, the server may first obtain the history service requests received in the preset time interval, and determine a service interface call chain of each history service request based on the service information corresponding to each history service request, so as to obtain a history service request structure based on the service interface call chain of each history service request.

Further, the server selects a plurality of first to-be-selected service request lists from the historical service request structure from the view of system load, and the system load when each to-be-selected service request in each first to-be-selected service request list is processed is smaller than or equal to a system overload threshold value, so that the overload of the system in processing each to-be-selected service request is avoided. And selecting N first service request lists to be selected from the history service request structure, including at least one of: and the forward feedback data of each historical service request in the historical service request structure is obtained, the historical service requests are ordered from large to small based on the forward feedback data of each historical service request to obtain a first ordering result, and then the historical service requests are selected from the historical service request structure based on the first ordering result to generate a first to-be-selected service request list. Or, randomly selecting the historical service request from the historical service request structure to generate a first list of service requests to be selected.

Step 2203 determines a service interface call chain of each history service request in each first list of service requests to be selected based on the service information of each history service request in each first list of service requests to be selected.

Specifically, each service request has corresponding service information, and each service information has a corresponding service interface call chain. Therefore, the server may first obtain the service information of each history service request in each first to-be-selected service request list, and then further determine the service interface call chain of each history service request in each first to-be-selected service request list based on the corresponding relationship between each service information and the service interface call chain.

Step 2204 calculates the forward feedback data of each history service request in each first to-be-selected service request list based on the forward feedback data of each service interface and the service interface call chain of each history service request in each first to-be-selected service request list, and determines the forward feedback data of each first to-be-selected service request list.

Specifically, since the service interface call chain includes at least one service interface, the server can determine forward feedback data of each service interface in the service interface call chain of each history service request based on the service interfaces included in the service interface call chain of each history service request, and then perform summation processing to obtain the forward feedback data of the service interface call chain of each history service request, where the forward feedback data of the service interface call chain of each history service request is the forward feedback data of each history service request.

Step 2205, adjust at least one history service request in each first service request list to generate N second service request lists to be selected, and record the number of neighbor search cycles.

Second, the adjustment may be made by deleting at least one history service request or replacing at least one history service request. At least one historical service request in each first service request list to be selected is adjusted, and N second service request lists to be selected are generated, wherein the N second service request lists at least comprise one of the following items:

1. and determining a third service request list to be selected from the first service request lists, and randomly deleting at least one historical service request in the third service request list to be selected so as to generate a second service request list to be selected.

2. Determining a third service request list to be selected from the first service request lists to be selected, sequencing forward feedback data of historical service requests in the third service request list to be selected to obtain a second sequencing result, and deleting at least one historical service request in the third service request list to be selected based on the second sequencing result to generate a second service request list to be selected.

3. And determining a fourth service request list to be selected from the first service request lists to be selected, and randomly replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list to generate a second service request list to be selected.

4. Determining a fourth service request list to be selected from the first service request lists to be selected, sequencing forward feedback data of historical service requests in the fourth service request list to obtain a third sequencing result, and replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list based on the third sequencing result to generate a second service request list to be selected.

Step 2206, determining the forward feedback data of each second service request list to be selected.

Specifically, the server determines the forward feedback data of each second service request list to be selected based on the similar manner as described above.

Step 2207 redetermines the N first to-be-selected service request lists based on the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list.

Specifically, the server selects, from the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list, the to-be-selected service request list corresponding to the forward feedback data belonging to the first N forward feedback data as N first to-be-selected service request lists to be redetermined.

Step 2208, adjust at least one history service request in each redetermined first service request list to generate N redetermined second service request lists to be selected, and update the neighborhood search cycle number.

Step 2209, if the updated neighborhood search cycle number reaches the preset neighborhood search number, determining the service request list to be selected with the largest forward feedback data as the processable service request list from the forward feedback data of each redetermined first service request list to be selected and the forward feedback data of each redetermined second service request list to be selected.

It will be appreciated that the updated number of neighborhood search loops is less than the preset number of neighborhood searches, and a similar method as described in step 2207 is performed.

Step 2201 to step 2209 only describe a corresponding processable service request list obtained by one history service request structure, and can process all history service request structures in a similar manner, so as to obtain processable service request lists corresponding to each history service request structure, and the server stores the processable service request lists corresponding to each history service request structure, so that the processable service request lists corresponding to each history service request structure are conveniently called in the process of specific service access processing.

Step 2210, if the system load reaches the system load critical threshold, obtaining the service request structure to be processed.

Step 2211, a plurality of history service request structures and a list of processable service requests corresponding to each history service request structure are obtained.

Step 2212, determining the number of service requests to be processed for each service information in the service request structure to be processed, and the number of historical service requests for each service information in each historical service request structure.

Step 2213, performing matching processing based on the number of service requests to be processed of each service information and the number of history service requests of each service information in each history service request structure.

Specifically, the matching process is performed based on the number of service requests to be processed for each service information and the number of history service requests for each service information in each history service request structure. And specifically, the matching processing calculation is performed by the foregoing formula (1).

Step 2214, determining a matching result between the pending service request structure and each history service request structure.

Specifically, after the server performs the matching process, the matching result between the pending service request structure and each history service request structure can be determined.

Step 2215, determining the history service request structure with the highest similarity with the service request structure to be processed as the target history service request structure.

Specifically, the server determines a history service request structure having the highest similarity with the service request structure to be processed as a target history service request structure.

Step 2216 determines the number of processable service requests for each service information in the target processable service request list.

Specifically, the server may determine the number of processable service requests of each service information in the target processable service request list in a similar manner to the foregoing embodiments, which is not described herein.

Step 2217, selecting a target service request from the pending service request structure based on the number of processable service requests of each service information in the target processable service request list, and performing service access processing on the target service request.

Further, the server selects the target service request from the pending service request structure based on a ratio of a number of processable service requests of each service information in the target processable service request list to a number of pending service requests and historical service requests of the same service information between the pending service request structure and the target historical service request structure. Based on this, the server performs service access processing for the target service indicated by the target service request.

It should be understood that the specific implementation of steps 2201 to 2217 is described in detail in the foregoing embodiments, and will not be repeated here.

It should be understood that, although the steps in the flowcharts related to the embodiments described above are sequentially shown as indicated by arrows, these steps are not necessarily sequentially performed in the order indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in the flowcharts described in the above embodiments may include a plurality of steps or a plurality of stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of the steps or stages is not necessarily performed sequentially, but may be performed alternately or alternately with at least some of the other steps or stages.

Based on the same inventive concept, the embodiment of the application also provides a service access processing device for realizing the service access processing method. The implementation of the solution provided by the device is similar to the implementation described in the above method, so the specific limitation in the embodiments of the service access processing device or devices provided below may refer to the limitation of the service access processing method hereinabove, and will not be described herein.

In one embodiment, as shown in fig. 23, there is provided a service access processing apparatus including: an acquisition module 2302, a matching process module 2304 and a service process module 2306, wherein:

an acquiring module 2302, configured to acquire a service request structure to be processed if a system load reaches a system load critical threshold; acquiring a plurality of history service request structures and a processable service request list corresponding to each history service request structure;

a matching processing module 2304, configured to perform matching processing on the service request structure to be processed and each history service request structure, determine a target history service request structure matched with the service request structure to be processed, and determine a target processable service request list corresponding to the target history service request structure;

the service processing module 2306 selects a target service request from the service request structure to be processed based on the target processable service request list, performs service access processing on the target service request, wherein a system load when the target service request is processed is less than or equal to a system overload threshold, the system overload threshold is greater than a system load critical threshold, and forward feedback data of the target service request is greater than forward feedback data of each non-selected service request to be processed in the service request structure to be processed.

In one embodiment, the obtaining module 2302 is further configured to determine forward feedback data of the target service request according to the service consumption resource for processing the target service request and the object feedback data of the target object for the target service requested by the target service request.

In one embodiment, the matching processing module 2304 is further configured to determine a number of service requests to be processed for each service information in the service request structure to be processed, and a number of historical service requests for each service information in each historical service request structure, where the service information has an association with a service type, or the service information has an association with a service type and an object type; and performing matching processing based on the number of service requests to be processed of each service information and the number of history service requests of each service information in each history service request structure.

In one embodiment, the matching processing module 2304 is further configured to determine a matching result between the pending service request structure and each of the history service request structures, where the matching result is used to describe a similarity between the pending service request structure and each of the history service request structures; and determining the historical service request structure with the highest similarity with the service request structure to be processed as a target historical service request structure.

In one embodiment, the service processing module 2306 is further configured to determine a number of processable service requests for each service information in the target processable service request list; and selecting a target service request from the pending service request structure based on the number of processable service requests for each service information in the target processable service request list.

In one embodiment, the obtaining module 2302 is further configured to obtain a history service request structure, select N first to-be-selected service request lists from the history service request structure, and determine forward feedback data of each first to-be-selected service request list, where a system load of each to-be-selected service request in the first to-be-selected service request list when processed is less than or equal to a system overload threshold, and N is a positive integer greater than 1; and determining a processable service request list corresponding to the historical service request structure based on the forward feedback data of each first to-be-selected service request list, wherein the forward feedback data of the processable service request list is larger than the forward feedback data of each first to-be-selected service request list.

In one embodiment, the acquiring module 2302 is further configured to acquire initial forward feedback data of each service interface, and normalize the initial forward feedback data of each service interface to obtain forward feedback data of each service interface; determining a service interface call chain of each history service request in each first to-be-selected service request list based on the service information of each history service request in each first to-be-selected service request list, wherein the service interface call chain comprises at least one service interface; and based on the forward feedback data of each service interface and the service interface call chains of each history service request in each first to-be-selected service request list, calculating the forward feedback data of each history service request in each first to-be-selected service request list, and determining the forward feedback data of each first to-be-selected service request list.

In one embodiment, the obtaining module 2302 is further configured to obtain forward feedback data of each history service request in the history service request structure, and order each history service request from big to small based on the forward feedback data of each history service request, so as to obtain a first ordering result; and selecting a history service request from the history service request structure based on the first ordering result to generate a first list of service requests to be selected.

In one embodiment, the obtaining module 2302 is further configured to randomly select a history service request from a history service request structure to generate a first list of to-be-selected service requests.

In one embodiment, the obtaining module 2302 is further configured to adjust at least one historical service request in each first service request list to generate N second service request lists, and determine forward feedback data of each second service request list to be selected, where a system load when each historical service request in the second service request list is processed is less than or equal to a system overload threshold; and determining a processable service request list based on the forward feedback data of each first service request list to be selected and the forward feedback data of each second service request list to be selected.

In one embodiment, the obtaining module 2302 is further configured to perform a roulette operation on each of the first to-be-selected service request lists and the unselected service request lists based on forward feedback data of each of the first to-be-selected service request lists; and selecting the adjusted first to-be-selected service request list from the first to-be-selected service request lists based on the wheel disc operation result.

In one embodiment, the obtaining module 2302 is further configured to determine a third service request list from the first service request lists, and randomly delete at least one history service request in the third service request list to generate a second service request list.

In one embodiment, the obtaining module 2302 is further configured to determine a third service request list to be selected from the first service request lists to be selected, and sort forward feedback data of each history service request in the third service request list to be selected, so as to obtain a second sorting result; and deleting at least one historical service request in the third service request list to be selected based on the second sorting result to generate a second service request list to be selected.

In one embodiment, the obtaining module 2302 is further configured to determine a list of unselected service requests from the historical service request structure; and determining a fourth service request list to be selected from the first service request lists to be selected, and randomly replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list to generate a second service request list to be selected.

In one embodiment, the obtaining module 2302 is further configured to determine a list of unselected service requests from the historical service request structure; determining a fourth service request list to be selected from the first service request lists to be selected, and sequencing forward feedback data of each historical service request in the fourth service request list to be selected to obtain a third sequencing result; and based on the third sorting result, replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list to generate a second service request list to be selected.

In one embodiment, the obtaining module 2302 is further configured to record, when generating the N second service request lists to be selected, a neighborhood search cycle number, where the neighborhood search cycle number is used to describe: the times of generating corresponding N second service request lists to be selected are adjusted to each first service request list to be selected; the N first to-be-selected service request lists are redetermined based on the forward feedback data of the first to-be-selected service request lists and the forward feedback data of the second to-be-selected service request lists; adjusting at least one historical service request in each redetermined first service request list to generate N redetermined second service request lists to be selected, and updating the neighborhood search cycle times; and if the updated neighborhood searching cycle number reaches the preset neighborhood searching number, determining the service request list to be selected with the largest forward feedback data as a processable service request list from the forward feedback data of each redetermined first service request list to be selected and the forward feedback data of each redetermined second service request list to be selected.

The modules in the service access processing apparatus described above may be implemented in whole or in part by software, hardware, or a combination thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.

In one embodiment, a computer device is provided, which may be a server, and the internal structure of which may be as shown in fig. 24. The computer device includes a processor, a memory, an Input/Output interface (I/O) and a communication interface. The processor, the memory and the input/output interface are connected through a system bus, and the communication interface is connected to the system bus through the input/output interface. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, computer programs, and a database. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The database of the computer equipment is used for storing data such as the history service request structures and the processable service request list corresponding to each history service request structure. The input/output interface of the computer device is used to exchange information between the processor and the external device. The communication interface of the computer device is used for communicating with an external terminal through a network connection. The computer program, when executed by a processor, implements a service access handling method.

It will be appreciated by those skilled in the art that the structure shown in fig. 24 is merely a block diagram of a portion of the structure associated with the present application and is not limiting of the computer device to which the present application is applied, and that a particular computer device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.

In an embodiment, there is also provided a computer device comprising a memory and a processor, the memory having stored therein a computer program, the processor implementing the steps of the method embodiments described above when the computer program is executed.

In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored which, when executed by a processor, carries out the steps of the method embodiments described above.

In an embodiment, a computer program product is provided, comprising a computer program which, when executed by a processor, implements the steps of the method embodiments described above.

It should be noted that, the object information (including, but not limited to, object device information, object personal information, etc.) and the data (including, but not limited to, data for analysis, stored data, presented data, etc.) related to the present application are both information and data authorized by the object or sufficiently authorized by each party, and the collection, use, and processing of the related data are required to comply with the related laws and regulations and standards of the related countries and regions.

Those skilled in the art will appreciate that implementing all or part of the above described methods may be accomplished by way of a computer program stored on a non-transitory computer readable storage medium, which when executed, may comprise the steps of the embodiments of the methods described above. Any reference to memory, database, or other medium used in the various embodiments provided herein may include at least one of non-volatile and volatile memory. The nonvolatile Memory may include Read-Only Memory (ROM), magnetic tape, floppy disk, flash Memory, optical Memory, high density embedded nonvolatile Memory, resistive random access Memory (ReRAM), magnetic random access Memory (Magnetoresistive Random Access Memory, MRAM), ferroelectric Memory (Ferroelectric Random Access Memory, FRAM), phase change Memory (Phase Change Memory, PCM), graphene Memory, and the like. Volatile memory can include random access memory (Random Access Memory, RAM) or external cache memory, and the like. By way of illustration, and not limitation, RAM can be in the form of a variety of forms, such as static random access memory (Static Random Access Memory, SRAM) or dynamic random access memory (Dynamic Random Access Memory, DRAM), and the like. The databases referred to in the various embodiments provided herein may include at least one of relational databases and non-relational databases. The non-relational database may include, but is not limited to, a blockchain-based distributed database, and the like. The processors referred to in the embodiments provided herein may be general purpose processors, central processing units, graphics processors, digital signal processors, programmable logic units, quantum computing-based data processing logic units, etc., without being limited thereto.

The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.

The above examples only represent a few embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the present application. It should be noted that it would be apparent to those skilled in the art that various modifications and improvements could be made without departing from the spirit of the present application, which would be within the scope of the present application. Accordingly, the scope of protection of the present application shall be subject to the appended claims.

Claims

1. A service access processing method, the method comprising:

And selecting a target service request from the service request structure to be processed based on the target processable service request list, and performing service access processing on the target service request, wherein the system load of the target service request when processed is smaller than or equal to a system overload threshold value, the system overload threshold value is larger than the system load critical threshold value, and the forward feedback data of the target service request is larger than the forward feedback data of each unselected service request in the service request structure to be processed.

2. The method according to claim 1, wherein the method for acquiring the forward feedback data of the target service request comprises:

3. The method of claim 2, wherein the service consumption resources are calculated from service consumption resources of each service interface in a service interface call chain of the target service request; wherein, the service consumption resources of the service interface are: network resources and computing resources required to process the target service request;

The object feedback data is calculated according to service use information and processing priority information of the target object on the target service requested by the target service request; wherein the service usage information includes at least one of: the use duration of the target object using the target service, the activity of the target object using the target service and the time interval of the target object using the target service; the processing priority information is related to an object type of the target object and a service type of the target service.

4. The method of claim 1, wherein said matching the pending service request structure with each of the historical service request structures comprises:

determining the number of service requests to be processed of each service information in the service request structure to be processed and the number of historical service requests of each service information in each historical service request structure, wherein the service information has relevance to a service type or the service information has relevance to the service type and an object type;

5. The method of claim 4, wherein the determining a target historical service request structure that matches the pending service request structure comprises:

and determining the history service request structure with the highest similarity with the service request structure to be processed as the target history service request structure.

6. The method of claim 4, wherein selecting a target service request from the pending service request structure based on the target processable service request list comprises:

determining the number of processable service requests of each service information in the target processable service request list;

and selecting a target service request from the service request pending structure based on the number of processable service requests of each service information in the target processable service request list.

7. The method of claim 1, wherein the obtaining manner of the processable service request list corresponding to each history service request structure includes:

Acquiring the history service request structure, selecting N first to-be-selected service request lists from the history service request structure, and determining forward feedback data of each first to-be-selected service request list, wherein the system load of each to-be-selected service request in the first to-be-selected service request list is smaller than or equal to the system overload threshold value when being processed, and N is a positive integer larger than 1;

8. The method of claim 7, wherein the method further comprises:

the determining the forward feedback data of each first to-be-selected service request list includes:

determining a service interface call chain of each history service request in each first to-be-selected service request list based on service information of each history service request in each first to-be-selected service request list, wherein the service interface call chain comprises at least one service interface;

Based on the forward feedback data of each service interface and the service interface call chain of each history service request in each first to-be-selected service request list, forward feedback data of each history service request in each first to-be-selected service request list is calculated, and the forward feedback data of each first to-be-selected service request list is determined.

9. The method of claim 8, wherein selecting N first list of service requests to be selected from the history service request structure comprises at least one of:

selecting a history service request from the history service request structure based on the first ordering result to generate the first list of service requests to be selected;

or alternatively, the first and second heat exchangers may be,

and randomly selecting a historical service request from the historical service request structure to generate the first to-be-selected service request list.

10. The method of claim 8, wherein the determining a list of processable service requests corresponding to the historical service request structure based on the forward feedback data of each of the first list of pending service requests comprises:

Adjusting at least one historical service request in each first service request list to generate N second service request lists to be selected, and determining forward feedback data of each second service request list to be selected, wherein the system load of each historical service request in each second service request list to be selected when processed is smaller than or equal to the system overload threshold;

and determining the processable service request list based on the forward feedback data of each first service request list to be selected and the forward feedback data of each second service request list to be selected.

11. The method according to claim 10, wherein the method further comprises:

performing wheel disc operation on each first to-be-selected service request list based on forward feedback data of each first to-be-selected service request list;

12. The method according to claim 10 or 11, wherein said adjusting at least one historical service request in each of said first list of service requests to be selected generates N second lists of service requests to be selected, at least comprising one of:

Determining a third service request list to be selected from the first service request lists to be selected, and randomly deleting at least one historical service request in the third service request list to be selected to generate a second service request list to be selected;

or alternatively, the first and second heat exchangers may be,

determining a third service request list to be selected from the first service request lists to be selected, and sequencing forward feedback data of the historical service requests in the third service request list to be selected to obtain a second sequencing result;

and deleting at least one historical service request in the third service request list to be selected based on the second sorting result so as to generate the second service request list to be selected.

13. The method according to claim 10 or 11, characterized in that the method further comprises:

determining a list of unselected service requests from the historical service request structure;

the step of adjusting at least one historical service request in each first service request list to generate N second service request lists, which at least comprises one of the following:

determining a fourth service request list to be selected from the first service request lists to be selected, and randomly replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list to generate the second service request list to be selected;

Or alternatively, the first and second heat exchangers may be,

determining a fourth service request list to be selected from the first service request lists to be selected, and sequencing forward feedback data of the historical service requests in the fourth service request list to be selected to obtain a third sequencing result;

and replacing at least one historical service request in the fourth service request list to be selected with at least one historical service request in the unselected service request list based on the third sorting result to generate the second service request list to be selected.

14. The method according to claim 10 or 11, wherein in generating the N second list of service requests to be selected, the method further comprises:

recording the number of neighborhood search cycles, wherein the number of neighborhood search cycles is used for describing: the times of generating the corresponding N second service request lists to be selected are adjusted for each first service request list to be selected;

the determining the processable service request list based on the forward feedback data of each first to-be-selected service request list and the forward feedback data of each second to-be-selected service request list includes:

Determining N first to-be-selected service request lists again based on the forward feedback data of the first to-be-selected service request lists and the forward feedback data of the second to-be-selected service request lists;

and if the updated neighborhood searching cycle number reaches the preset neighborhood searching frequency, determining the service request list to be selected with the largest forward feedback data as the processable service request list in the forward feedback data of each redetermined first service request list to be selected and the forward feedback data of each redetermined second service request list to be selected.

15. A service access processing apparatus, the apparatus comprising:

the service processing module is used for selecting a target service request from the service request structure to be processed based on the target processable service request list, and carrying out service access processing on the target service request, wherein the system load of the target service request when being processed is smaller than or equal to a system overload threshold value, the system overload threshold value is larger than the system load critical threshold value, and the forward feedback data of the target service request is larger than the forward feedback data of each service request to be processed which is not selected in the service request structure to be processed.