CN111866101B - Access request processing method and device, storage medium and electronic equipment - Google Patents

Abstract

The disclosure provides an access request processing method, an access request processing device, a storage medium and electronic equipment, and relates to the technical field of computers. The access request processing method includes: responding to the access request for the interface, obtaining the current accumulated access times, the current time, the last interface access times, and the time when the last access times were cleared; the last interface access times and the last access times clearing The time of zero is a static variable; determine the time interval between the current time and the time when the number of visits was reset to zero last time, compare the time interval with the time threshold, and obtain the first comparison result. Based on the first comparison result, the above Add 1 to the number of secondary interface visits, and assign it to the current cumulative number of visits to obtain the flow control parameter value; compare the flow control parameter value with the flow control threshold to obtain the second comparison result, and process the access request according to the second comparison result . The present disclosure implements a lightweight interface flow control scheme.

Description

Access request processing method and device, storage medium and electronic device

technical field

The present disclosure relates to the field of computer technology, and in particular, to an access request processing method, an access request processing device, a storage medium, and electronic equipment.

Background technique

In human society, the application of flow control can be seen everywhere, such as flow control of people, vehicle flow control, water flow control of dams, etc. Using flow control can not only ensure security, but also improve efficiency. In the Internet industry, flow control is also very important. For example, flow control on servers can ensure that the server is more secure, and it can also ensure that the server will not be overloaded.

At present, there are some flow control strategies for interface services, however, these interface flow control strategies all have the problem of complex implementation methods.

Contents of the invention

The purpose of the present disclosure is to provide an access request processing method, an access request processing device, a storage medium, and an electronic device, so as to overcome the problem of complex implementation of interface flow control at least to a certain extent.

According to the first aspect of the present disclosure, an access request processing method is provided, including: responding to an interface access request, obtaining the current accumulated access times, the current time, the last interface access times, and the time when the last access times were cleared ;Among them, the last interface access times and the time when the last access times were cleared are both static variables; determine the time interval between the current time and the last time when the access times are cleared, and compare the time interval with the time threshold , to get the first comparison result, based on the first comparison result, add 1 to the last interface visit times, and assign it to the current accumulated visit times, to get the flow control parameter value; compare the flow control parameter value with the flow control threshold, get The second comparison result, the access request is processed according to the second comparison result.

According to the second aspect of the present disclosure, there is provided an access request processing device, including: a request response module, configured to respond to an interface access request, and obtain the current accumulated access times, the current time, the last interface access times, and the last The time when the number of visits is cleared; wherein, the number of last interface visits and the time when the number of visits were last cleared are static variables; the parameter value determination module is used to determine the time between the current time and the time when the number of visits was last cleared The time interval between, compare the time interval with the time threshold to obtain the first comparison result, based on the first comparison result, add 1 to the last interface access times, and assign it to the current accumulated access times, to obtain the flow control parameter value; The request processing module is configured to compare the flow control parameter value with the flow control threshold to obtain a second comparison result, and process the access request according to the second comparison result.

According to a third aspect of the present disclosure, a storage medium is provided, on which a computer program is stored, and when the program is executed by a processor, the above access request processing method is implemented.

According to a fourth aspect of the present disclosure, there is provided an electronic device, including a processor; a memory for storing executable instructions of the processor; wherein the processor is configured to perform the above-mentioned access request processing by executing the executable instructions method.

In the technical solution provided by some embodiments of the present disclosure, the time interval between the current time and the last time when the number of visits was reset to zero is determined, the time interval is compared with the time threshold, and the last interface Add 1 to the number of visits and assign it to the current cumulative number of visits to obtain the flow control parameter value, then compare the flow control parameter value with the flow control threshold, and then process the access request of the interface according to the comparison result. On the one hand, the disclosed solution has a simple implementation method, a small amount of code, can be used across platforms, and can be implemented in different programming languages, and is a lightweight access request control solution; on the other hand, due to the lightweight attribute of the solution , can be integrated into the front-end, client, and server, and is suitable for different architectures, and has little loss to system performance and will not increase the burden on the system; on the other hand, this solution can adjust the time threshold and/or Or the flow control threshold can be adjusted, which can improve the flexibility of solution configuration and make the application scenarios of the solution wider; on the other hand, since the last interface access times and the time when the last access times were reset to zero are static variables , which can ensure that the life cycle of the variable is consistent with the process, and ensure the effectiveness of the implementation of the scheme.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure.

Description of drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the disclosure and together with the description serve to explain the principles of the disclosure. Apparently, the drawings in the following description are only some embodiments of the present disclosure, and those skilled in the art can obtain other drawings according to these drawings without creative efforts. In the attached picture:

FIG. 1 shows a schematic diagram of an exemplary system architecture applying the access request processing solution of an embodiment of the present disclosure;

Fig. 2 schematically shows a flowchart of an access request processing method according to an exemplary embodiment of the present disclosure;

FIG. 3 schematically shows a flow chart of the entire process of access request processing according to an embodiment of the present disclosure;

Fig. 4 schematically shows a block diagram of an access request processing device according to an exemplary embodiment of the present disclosure;

FIG. 5 schematically shows a block diagram of an electronic device according to an exemplary embodiment of the present disclosure.

Detailed ways

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided in order to give a thorough understanding of embodiments of the present disclosure. However, those skilled in the art will appreciate that the technical solutions of the present disclosure may be practiced without one or more of the specific details being omitted, or other methods, components, devices, steps, etc. may be adopted. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus repeated descriptions thereof will be omitted. Some of the block diagrams shown in the drawings are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software, or in one or more hardware modules or integrated circuits, or in different network and/or processor means and/or microcontroller means.

The flowcharts shown in the figures are illustrative only and do not necessarily include all steps. For example, some steps can be decomposed, and some steps can be combined or partly combined, so the actual execution sequence may be changed according to the actual situation. In addition, all the following terms "first" and "second" are for the purpose of distinction only, and should not be taken as a limitation of the present disclosure.

The traffic control strategy for the interface service can be implemented by means such as leaky bucket algorithm, token bucket algorithm, and algorithm based on the counting function of Redis (Remote Dictionary Server, remote dictionary service).

However, these strategies all have the problem of complex implementation methods. Moreover, for the leaky bucket algorithm, its processing efficiency is low in the case of burst traffic; for the token bucket algorithm, it is aimed at flow control at the entire system level, and cannot be controlled for a single service or process; for Redis-based The algorithm of the counting function depends on the construction of the Redis cluster, which is more complicated to implement.

In view of this, the present disclosure provides a new access request processing solution, which can achieve the purpose of controlling interface traffic, and has simple logic and is easy to implement.

Fig. 1 shows a schematic diagram of an exemplary system architecture applying the access request processing solution of the embodiment of the present disclosure.

As shown in FIG. 1 , a system architecture 1000 may include one or more of terminal devices 1001 , 1002 , and 1003 , a network 1004 and a server 1005 . The network 1004 is used as a medium for providing communication links between the terminal devices 1001 , 1002 , 1003 and the server 1005 . Network 1004 may include various connection types, such as wire, wireless communication links, or fiber optic cables, among others.

It should be understood that the numbers of terminal devices, networks and servers in Fig. 1 are only illustrative. According to the implementation needs, there can be any number of terminal devices, networks and servers. For example, the server 1005 may be a server cluster composed of multiple servers.

Users can use terminal devices 1001, 1002, 1003 to interact with server 1005 through network 1004 to receive or send messages and the like. The terminal devices 1001, 1002, and 1003 may be various electronic devices with display screens, including but not limited to smart phones, tablet computers, portable computers, desktop computers, and the like.

The server 1005 may be a server providing various services, specifically a web server. For example, the server 1005 may respond to the interface access requests sent by the terminal devices 1001, 1002, and 1003 via the network 1004 to obtain the current accumulated access times, the current time, the last interface access times, and the time when the last access times were cleared, Wherein, the last interface access times and the last time when the number of accesses were cleared can be defined as static variables in advance; next, the server 1005 can determine the time interval between the current time and the last time when the number of accesses was cleared, Comparing the time interval with the time threshold to obtain a first comparison result, based on the first comparison result, adding 1 to the last interface access times, and assigning a value to the current cumulative access times, to obtain the flow control parameter value; then, the server 1005 can The flow control parameter value is compared with the flow control threshold to obtain a second comparison result, and the access request is processed according to the second comparison result.

In addition, if the second comparison result is that the flow control parameter value is greater than the flow control threshold, no further processing is performed on the access request, so as to implement flow control on the interface.

It should be noted that the access request processing method in the exemplary embodiment of the present disclosure is generally executed by the server 1005 , and accordingly, the access request processing apparatus described below is generally configured in the server 1005 .

The access request processing method in the exemplary embodiment of the present disclosure will be described below.

Fig. 2 schematically shows a flowchart of an access request processing method in an exemplary embodiment of the present disclosure. Referring to Figure 2, the access request processing method may include the following steps:

S22. Respond to the access request for the interface, and obtain the current cumulative number of visits, the current time, the last number of interface visits, and the time when the last time the number of visits was cleared; where the last time the number of interface visits and the last time the number of visits was cleared to zero Time is a static variable.

In an exemplary embodiment of the present disclosure, the targeted interface may be any interface that provides web services (such as querying, invoking, downloading, modifying information, etc.), and the present disclosure does not limit the type of the interface.

When the interface caller has a web service processing requirement, the terminal device can send an access request to the server. Wherein, the interface caller may be a terminal device or other server, which is not limited in the present disclosure.

In an exemplary embodiment of the present disclosure, in response to the access request, the server may obtain the current accumulative access times (marked as num), the current time (marked as now), the last interface access times (marked as count) and the last The time when the number of visits is cleared (recorded as lastTime). Wherein, when the class or structure is defined in advance, the last interface access times and the time when the last access times are cleared are defined as static variables. In addition, the current cumulative access count can be defined as a local variable.

It can be understood that the current accumulative number of visits represents the cumulative number of access requests received from the time when the visit times were reset last time to the current time, except for the access requests received this time.

The last interface access count indicates the accumulative number of access requests received last time compared to the current one.

With respect to the solutions of the embodiments of the present disclosure, it can be seen that before an access request is obtained or after an access request is processed, the values corresponding to the variables of the current accumulative access times and the last interface access times are the same.

S24. Determine the time interval between the current time and the time when the number of visits was last cleared, compare the time interval with the time threshold, obtain the first comparison result, and add 1 to the number of interface visits last time based on the first comparison result , and assign it to the current accumulative number of visits to obtain the flow control parameter value.

First, after obtaining the current time and the time when the number of visits was reset to zero last time, the server can calculate the time interval between the two.

Next, the server can compare the calculated time interval with a time threshold, where the time threshold can be determined by the scene processed by the interface, can be pre-agreed by the interface caller, or can be set on the server side. The specific value of the time threshold is not limited. In addition, it should be noted that as the interface processing scene changes, the time threshold may also change.

After comparing the calculated time interval with a time threshold, a first comparison result is obtained.

If the result of the first comparison is that the time interval is greater than the time threshold, the last interface access count may be increased by 1 and assigned to the current accumulated access count. That is, num=++count. For example, if the number of interface accesses last time was 99998, it becomes 99999 after adding 1, then the current accumulative access times after assignment is 99999.

In addition, the time when the number of visits was cleared last time is updated to the current time, that is, lastTime=now. For example, if the last time the number of visits was cleared was 2020-07-01 19:35, and the current time is 2020-07-02 15:30, then the updated time of the last time the number of visits was cleared is 2020-07 -02 15:30.

After the result of adding 1 to the last interface visit times is assigned to the current accumulative visit times, the last interface orientation times can be set to 0, that is, count=0. That is to say, the operation of clearing the number of visits is performed.

If the result of the first comparison is that the time interval is greater than the time threshold, only the operation of adding 1 to the last interface access count and assigning it to the current accumulated access count is performed.

After the assigned current accumulative access times are obtained, the flow control parameter value may be determined by using the assigned current accumulative access times.

According to some embodiments of the present disclosure, the current accumulative number of visits after assignment may be directly determined as the flow control parameter value. That is to say, the number of visits is directly used as the basis for judging whether to perform flow control.

According to other embodiments of the present disclosure, firstly, the current accumulative number of visits after assignment is determined as the intermediate number of visits; next, the intermediate number of visits can be divided by the time interval calculated above, and the result of the division can be used as Flow control parameter value. In this case, QPS (Queries-Per-Second, query rate per second) can be used as a basis for judging whether to perform flow control.

S26. Compare the flow control parameter value with the flow control threshold to obtain a second comparison result, and process the access request according to the second comparison result.

In the embodiment that directly uses the number of visits as the basis for judging whether to perform flow control, the flow control parameter value can be compared with the flow control threshold, wherein the flow control threshold is a threshold representing the cumulative number of visits. The value of is not limited.

In one embodiment, the flow control threshold may be obtained by dividing the access times of the interface within the above time threshold by the number of processes. For example, if a cluster needs to control the interface to only allow 500 times within 1 minute, and 10 processes are deployed, the flow control threshold is 50.

In the embodiment that uses QPS as the basis for judging whether to perform flow control, the flow control threshold represents a threshold of access times per second. The present disclosure does not limit the specific value. For example, the flow control threshold can be set to 100.

It should be understood that this solution can adjust the above-mentioned time threshold and/or flow control threshold according to the needs of the scenarios, thereby improving the flexibility of configuration of the solution and making the application scenarios of the solution wider.

After comparing the flow control parameter value with the flow control threshold, a second comparison result is obtained.

If the second comparison result is that the flow control parameter value is greater than the flow control threshold, the server may send a prompt message indicating that the access request processing fails to the interface caller. Wherein, the prompt information may include a reason for processing failure, that is, flow control is performed. In addition, the prompt information may also be empty information or information containing other content, which may be determined according to the configuration of the interface caller, which is not limited in the present disclosure.

In addition, the interface caller may also be prompted that the access request needs to be queued. That is to say, first, the server can calculate the waiting time in the queue, and write the time into the prompt information; next, the server sends the prompt information to the interface caller. Wherein, the prompt information may include the information that needs to be waited in line and the time for waiting in line.

If the second comparison result is that the flow control parameter value is less than or equal to the flow control threshold, the server may process the access request and execute a corresponding web service. In addition, the processed result can be fed back to the interface caller.

In addition, in other embodiments of the present disclosure, if the program is executed by multiple threads, a variable may be added during the process of defining the class or structure, that is, a correct lock configured for reading and writing by threads.

The whole process of processing the access request in the embodiment of the present disclosure will be described below with reference to FIG. 3 .

In step S302, the server receives the access request; in step S304, the server acquires the current accumulative access times, the current time, the last interface access times, and the time when the last access times were cleared.

In step S306, the server determines the time interval between the current time and the time when the number of visits was reset to zero last time; in step S308, the server compares the time interval with a time threshold; in step S310, the server judges the time interval Whether it is greater than the time threshold, if greater, execute step S312, and if not, execute step S314.

In step S312, on the one hand, the server updates the time when the number of visits was cleared last time to the current time; on the other hand, the server adds 1 to the number of interface visits last time, and assigns the value to the current cumulative number of visits to obtain flow control parameter value; on the other hand, after the assignment operation, the server sets the last interface access times to 0.

In step S314, the server adds 1 to the last interface access times, and assigns the value to the current accumulative access times, so as to obtain the flow control parameter value.

In step S316, the server judges whether the flow control parameter value is greater than the flow control threshold, if so, executes step S318, and if not, executes step S320.

In step S318, the server may send a prompt message indicating that the access request processing fails to the interface caller.

In step S320, the server processes the access request, and feeds back the processing result to the interface caller.

Through the above exemplary description, it should be understood that this disclosure uses the characteristics of static variables to integrate the flow control scheme in the service, without the need to implement an independent flow controller, thereby reducing the amount of development for developers , and can be cross-platform, cross-language, lightweight and efficient features so that users do not need to consider performance issues. In addition, it can be seen that the granularity of interface traffic control in the disclosed solution is finer, not only at the system level, but also in a single process.

It should be noted that although the various steps of the methods of the present disclosure are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in that particular order, or that all illustrated steps must be performed to achieve the desired the result of. Additionally or alternatively, certain steps may be omitted, multiple steps may be combined into one step for execution, and/or one step may be decomposed into multiple steps for execution, etc.

Further, this example implementation also provides an access request processing apparatus.

Fig. 4 schematically shows a block diagram of an access request processing apparatus according to an exemplary embodiment of the present disclosure. Referring to FIG. 4 , the access request processing device 4 according to an exemplary embodiment of the present disclosure may include a request response module 41 , a parameter value determination module 43 and a request processing module 45 .

Specifically, the request response module 41 can be used to respond to the access request for the interface, and obtain the current accumulative access times, the current time, the last interface access times, and the time when the last access times were cleared; wherein, the last interface access times and The time when the number of visits was cleared last time is a static variable; the parameter value determination module 43 can be used to determine the time interval between the current time and the time when the number of visits was cleared last time, and compare the time interval with the time threshold, Obtain the first comparison result, based on the first comparison result, add 1 to the last interface access times, and assign it to the current accumulated access times, to obtain the flow control parameter value; the request processing module 45 can be used to compare the flow control parameter value with the flow rate The control threshold is compared to obtain a second comparison result, and the access request is processed according to the second comparison result.

According to an exemplary embodiment of the present disclosure, the parameter value determination module 43 may be configured to execute: when the first comparison result is that the time interval is greater than the time threshold, update the time when the access count was last cleared to the current time.

According to an exemplary embodiment of the present disclosure, the parameter value determination module 43 may also be configured to perform: when the first comparison result is that the time interval is greater than the time threshold, after assigning the value to the current accumulated access times, the last interface access The count is set to 0.

According to an exemplary embodiment of the present disclosure, the request processing module 45 may be configured to execute: when the second comparison result is that the flow control parameter value is greater than the flow control threshold, send a prompt message that the access request processing fails to the interface caller; Among them, the access request is sent by the interface caller.

According to an exemplary embodiment of the present disclosure, the request processing module 45 may also be configured to execute: when the second comparison result is that the flow control parameter value is less than or equal to the flow control threshold, process the access request, and send the processed The result is fed back to the interface caller.

According to an exemplary embodiment of the present disclosure, the current accumulative number of visits after assignment is determined as the flow control parameter value.

According to an exemplary embodiment of the present disclosure, the process of determining the flow control parameter value by the parameter value determining module 43 may also be configured to perform: determining the current accumulated access times after assignment as the intermediate access times; dividing the intermediate access times by the time interval , and the result of the division is used as the flow control parameter value.

Since each functional module of the access request processing apparatus in the embodiment of the present invention is the same as that in the embodiment of the above-mentioned method invention, it will not be repeated here.

In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium on which a program product capable of implementing the above-mentioned method in this specification is stored. In some possible implementations, various aspects of the present invention can also be implemented in the form of a program product, which includes program code, and when the program product is run on a terminal device, the program code is used to make the The terminal device executes the steps according to various exemplary embodiments of the present invention described in the "Exemplary Method" section above in this specification.

The program product for implementing the above method according to the embodiment of the present invention may adopt a portable compact disk read-only memory (CD-ROM) and include program codes, and may run on a terminal device such as a personal computer. However, the program product of the present invention is not limited thereto. In this document, a readable storage medium may be any tangible medium containing or storing a program, and the program may be used by or in combination with an instruction execution system, apparatus or device.

The program product may reside on any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any combination thereof. More specific examples (non-exhaustive list) of readable storage media include: electrical connection with one or more conductors, portable disk, hard disk, random access memory (RAM), read only memory (ROM), erasable Programmable read-only memory (EPROM or flash memory), optical disk, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above.

A computer readable signal medium may include a data signal carrying readable program code in baseband or as part of a carrier wave. Such propagated data signals may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium other than a readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages—such as Java, C++, etc., as well as conventional procedural programming languages. Programming language - such as "C" or a similar programming language. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server to execute. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (for example, using an Internet service provider). business to connect via the Internet).

In an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.

Those skilled in the art can understand that various aspects of the present invention can be implemented as systems, methods or program products. Therefore, various aspects of the present invention can be embodied in the following forms, that is: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software implementations, which can be collectively referred to herein as "circuit", "module" or "system".

An electronic device 500 according to this embodiment of the present invention, corresponding to the server described above, is described below with reference to FIG. 5 . The electronic device 500 shown in FIG. 5 is only an example, and should not limit the functions and scope of use of this embodiment of the present invention.

As shown in FIG. 5, electronic device 500 takes the form of a general-purpose computing device. The components of the electronic device 500 may include, but are not limited to: at least one processing unit 510, at least one storage unit 520, a bus 530 connecting different system components (including the storage unit 520 and the processing unit 510), and a display unit 540.

Wherein, the storage unit stores program codes, and the program codes can be executed by the processing unit 510, so that the processing unit 510 executes various exemplary methods according to the present invention described in the "Exemplary Methods" section of this specification. Implementation steps. For example, the processing unit 510 may execute steps S12 to S26 as shown in FIG. 2 .

The storage unit 520 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 5201 and/or a cache storage unit 5202 , and may further include a read-only storage unit (ROM) 5203 .

Storage unit 520 may also include a program/utility 5204 having a set (at least one) of program modules 5205, such program modules 5205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, Implementations of networked environments may be included in each or some combination of these examples.

Bus 530 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local area using any of a variety of bus structures. bus.

The electronic device 500 can also communicate with one or more external devices 600 (such as keyboards, pointing devices, Bluetooth devices, etc.), and can also communicate with one or more devices that enable the user to interact with the electronic device 500, and/or communicate with Any device (eg, router, modem, etc.) that enables the electronic device 500 to communicate with one or more other computing devices. Such communication may occur through input/output (I/O) interface 550 . Moreover, the electronic device 500 can also communicate with one or more networks (such as a local area network (LAN), a wide area network (WAN) and/or a public network such as the Internet) through the network adapter 560 . As shown, the network adapter 560 communicates with other modules of the electronic device 500 through the bus 530 . It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with electronic device 500, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives And data backup storage system, etc.

Through the description of the above implementations, those skilled in the art can easily understand that the example implementations described here can be implemented by software, or by combining software with necessary hardware. Therefore, the technical solutions according to the embodiments of the present disclosure can be embodied in the form of software products, and the software products can be stored in a non-volatile storage medium (which can be CD-ROM, U disk, mobile hard disk, etc.) or on the network , including several instructions to make a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) execute the method according to the embodiments of the present disclosure.

In addition, the above-mentioned figures are only schematic illustrations of the processes included in the method according to the exemplary embodiments of the present invention, and are not intended to be limiting. It is easy to understand that the processes shown in the above figures do not imply or limit the chronological order of these processes. In addition, it is also easy to understand that these processes may be executed synchronously or asynchronously in multiple modules, for example.

It should be noted that although several modules or units of the device for action execution are mentioned in the above detailed description, this division is not mandatory. Actually, according to the embodiment of the present disclosure, the features and functions of two or more modules or units described above may be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided to be embodied by a plurality of modules or units.

Other embodiments of the disclosure will be readily apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the present disclosure, and these modifications, uses or adaptations follow the general principles of the present disclosure and include common knowledge or conventional technical means in the technical field not disclosed in the present disclosure . The specification and examples are to be considered exemplary only, with the true scope and spirit of the disclosure indicated by the appended claims.

It should be understood that the present disclosure is not limited to the precise constructions which have been described above and shown in the drawings, and various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is limited only by the appended claims.

Claims (6)

1. An access request processing method, comprising:

responding to an access request aiming at an interface, and acquiring the current accumulated access times, the current time, the last interface access times and the last time of clearing the access times; the last time the interface access times and the last time the access times were cleared are static variables, the current accumulated access times are the number of the received access requests except the access requests received this time from the last time the access times were cleared to the current time, the last time the interface access times are the number of the access requests accumulated and received when the access requests were received last time, and the last time the access times were cleared is the time of assigning a result of adding 1 to the last time the interface access times to the current accumulated access times;

determining a time interval between the current time and the time for clearing the last time of the access times, comparing the time interval with a time threshold, adding 1 to the last time of the interface access times and assigning the current accumulated access times when the time interval is larger than the time threshold, updating the time for clearing the last time of the access times to the current time, setting the last time of the interface access times to 0, and determining a flow control parameter value by using the assigned current accumulated access times;

comparing the flow control parameter value with a flow control threshold value, and sending prompt information of failure in processing an access request to an interface calling party under the condition that the flow control parameter value is larger than the flow control threshold value, wherein the access request is sent by the interface calling party; and under the condition that the flow control parameter value is smaller than or equal to the flow control threshold value, processing the access request, and feeding back the processed result to the interface calling party.

2. The access request processing method according to claim 1, wherein the assigned current cumulative number of accesses is determined as a flow control parameter value.

3. The access request processing method according to claim 1, wherein obtaining the flow control parameter value includes:

determining the assigned current accumulated access times as intermediate access times;

dividing the intermediate access times by the time interval, and taking the result obtained by the division as the flow control parameter value.

4. An access request processing apparatus, comprising:

the request response module is used for responding to the access request aiming at the interface, and acquiring the current accumulated access times, the current time, the last time of the interface access times and the last time of clearing the access times; the last time the interface access times and the last time the access times were cleared are static variables, the current accumulated access times are the number of the received access requests except the access requests received this time from the last time the access times were cleared to the current time, the last time the interface access times are the number of the access requests accumulated and received when the access requests were received last time, and the last time the access times were cleared is the time of assigning a result of adding 1 to the last time the interface access times to the current accumulated access times;

the parameter value determining module is used for determining a time interval between the current time and the time for clearing the access times last time, comparing the time interval with a time threshold value, adding 1 to the last time interface access times and assigning the current accumulated access times under the condition that the time interval is larger than the time threshold value, updating the time for clearing the access times last time to the current time, setting the last time interface access times to 0, and determining a flow control parameter value by using the assigned current accumulated access times;

the request processing module is used for comparing the flow control parameter value with a flow control threshold value, and sending prompt information of failure in processing an access request to an interface calling party under the condition that the flow control parameter value is larger than the flow control threshold value, wherein the access request is sent by the interface calling party; and under the condition that the flow control parameter value is smaller than or equal to the flow control threshold value, processing the access request, and feeding back the processed result to the interface calling party.

5. A storage medium having stored thereon a computer program, which when executed by a processor implements the access request processing method of any of claims 1 to 3.

6. An electronic device, comprising:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the access request processing method of any one of claims 1 to 3 via execution of the executable instructions.

Images