CN116781782A - Request processing method, request processing device, electronic equipment and storage medium - Google Patents

Abstract

The disclosure provides a request processing method, a request processing device, electronic equipment and a storage medium. The method comprises the following steps: acquiring a user access request, and analyzing and acquiring a destination address of the user access request; if the destination address does not belong to a preset address library, analyzing and obtaining request information of the user access request; judging whether the user access request belongs to a non-acceleration list or not according to the request information; and if the user access request does not belong to the non-acceleration list, carrying out acceleration processing on the user access request.

Description

Request processing methods, devices, electronic equipment and storage media

Technical field

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

Background technique

With the development of Internet technology and the expansion of network business, the cloud acceleration platform can provide users with services to access overseas resources. Users can use this service by opening an acceleration package. When users access overseas resources through the cloud acceleration platform, problems may occur. Access request processing efficiency is low and access speed is slow.

It should be noted that the information disclosed in the above background section is only used to enhance understanding of the background of the present disclosure, and therefore may include information that does not constitute prior art known to those of ordinary skill in the art.

Contents of the invention

The purpose of this disclosure is to provide a request processing method, device, electronic device and storage medium, which method can improve request processing efficiency, increase access speed, and rationally utilize computer resources.

Additional features and advantages of the disclosure will be apparent from the following detailed description, or, in part, may be learned by practice of the disclosure.

Embodiments of the present disclosure provide a request processing method, which method includes: obtaining a user access request, and parsing to obtain the destination address of the user access request; if the destination address does not belong to the default address library, parsing to obtain the user access request Request information of the access request; determine whether the user access request belongs to the non-accelerated list based on the request information; if the user access request does not belong to the non-accelerated list, accelerate the user access request.

In some exemplary embodiments of the present disclosure, the method further includes: obtaining a first access time obtained by accelerated processing of the user access request; performing non-accelerated processing of the user access request to obtain a second access time; If the first access time is greater than or equal to the second access time, the user access request is added to the non-accelerated list.

In some exemplary embodiments of the present disclosure, accelerating processing of the user access request includes: using the maximum currently available bandwidth to transmit access data corresponding to the user access request.

In some exemplary embodiments of the present disclosure, the method further includes: determining an initial transmission rate, performing an increase process on the basis of the initial transmission rate to obtain a candidate transmission rate; determining to use the candidate transmission rate for data transmission The packet loss rate at the time; if the packet loss rate reaches the preset threshold, the maximum currently available bandwidth is determined according to the candidate sending rate; if the packet loss rate does not reach the preset threshold, then the The increasing process continues based on the candidate sending rate.

In some exemplary embodiments of the present disclosure, determining the maximum currently available bandwidth according to the candidate transmission rate includes: when using the candidate transmission rate for data transmission, obtaining the receiving end's respective reception times within multiple preset time periods. the amount of data received; determine multiple currently available bandwidths based on the amount of data received in each preset time period and the length of the preset time period; determine the largest currently available bandwidth among the multiple currently available bandwidths is the maximum currently available bandwidth.

In some exemplary embodiments of the present disclosure, the method further includes: determining a first delay when using the initial transmission rate for data transmission, and a second delay when using the candidate transmission rate for data transmission; Wherein, if the packet loss rate reaches a preset threshold, determining the maximum currently available bandwidth according to the candidate transmission rate includes: if the packet loss rate reaches a preset threshold, and the second delay and the If the difference in the first delay is greater than the preset value, the maximum currently available bandwidth is determined based on the candidate transmission rate.

In some exemplary embodiments of the present disclosure, the method further includes: if the destination address belongs to a preset address library, non-accelerated processing of the user access request; if the user access request belongs to the non-accelerated list , perform non-accelerated processing on the user access request.

An embodiment of the present disclosure provides a request processing device, including: an acquisition module, used to acquire a user access request, and parse to obtain the destination address of the user access request; an acquisition module, used to obtain the destination address if the destination address does not belong to the default address library, then analyze and obtain the request information of the user access request; the judgment module is used to judge whether the user access request belongs to the non-accelerated list according to the request information; the processing module is used to determine if the user access request does not belong to the non-accelerated list; If the non-acceleration list is specified, the user access request will be accelerated.

Embodiments of the present disclosure provide an electronic device, including: at least one processor; a storage terminal device for storing at least one program. When the at least one program is executed by at least one processor, the at least one processor implements any of the above. Request handling method.

An embodiment of the present disclosure provides a computer-readable storage medium on which a computer program is stored. The feature is that when the computer program is executed by a processor, any one of the above request processing methods is implemented.

The request processing method provided by the embodiment of the present disclosure obtains the user access request, and parses to obtain the destination address of the user access request; determines whether the destination address belongs to the default address library, and when the destination address does not belong to the default address library, parses to obtain the user access The requested request information; determine whether the user access request belongs to the non-accelerated list based on the request information; when the user access request does not belong to the non-accelerated list, accelerate the user access request; this method uses the preset address library and the non-accelerated list to process the user access request The destination address and request information corresponding to the access request are distinguished to determine whether the user's access request is suitable for accelerated processing, which can improve request processing efficiency, increase access speed, and rationally utilize computer resources.

It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only, and do not limit 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. Obviously, the drawings in the following description are only some embodiments of the present disclosure. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without exerting creative efforts.

FIG. 1 is a flowchart of a request processing method according to an exemplary implementation.

FIG. 2 is a schematic diagram illustrating access times corresponding to accelerated processing and non-accelerated processing according to an example.

Figure 3 is a schematic diagram of a cloud acceleration platform according to an example.

Figure 4 is a block diagram of a request processing device according to an exemplary implementation.

FIG. 5 is a schematic structural diagram of an electronic device according to an exemplary embodiment.

Detailed ways

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in various forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concepts of the example embodiments. To those skilled in the art. The same reference numerals in the drawings represent the same or similar parts, and thus their repeated description will be omitted.

The features, structures, or characteristics described in this disclosure may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to provide a thorough understanding of embodiments of the 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 methods, apparatus, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the present disclosure.

The drawings are only schematic illustrations of the present disclosure, and the same reference numerals in the drawings represent the same or similar parts, and thus their repeated description will be omitted. Some of the block diagrams shown in the figures do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in software form, or in at least one hardware module or integrated circuit, or in different networks and/or processor devices and/or microcontroller devices.

The flowcharts shown in the drawings are only illustrative, and do not necessarily include all contents and steps, nor must they be executed in the order described. For example, some steps can be decomposed, and some steps can be merged or partially merged, so the actual order of execution may change according to the actual situation.

In addition, in the description of the present disclosure, the terms "a", "an", "the", "the" and "at least one" are used to indicate the presence of at least one element or component; the terms "include" and "include" and "having" are used to express an open-ended inclusion and mean that there may be additional elements or components in addition to those listed; the terms "first", "second" and " "Third" etc. are only used as markers and are not restrictions on the number of objects.

Below, each step of the request processing method in the exemplary embodiment of the present disclosure will be described in more detail with reference to the accompanying drawings and embodiments.

FIG. 1 is a flowchart of a request processing method according to an exemplary implementation. The methods provided by the embodiments of the disclosure can be executed by the cloud acceleration platform, but the disclosure is not limited thereto.

As shown in Figure 1, the request processing method provided by the embodiment of the present disclosure may include the following steps.

In step S102, the user access request is obtained, and the destination address of the user access request is obtained through analysis.

In this disclosed embodiment, the user terminal can activate the acceleration package service and initiate a user access request, and the cloud acceleration platform can obtain the user access request; the user terminal can be a computer, a mobile phone, a router, etc., and the user access request can be, for example, a user access URL Request for www.baidu.com.

In this disclosed embodiment, the cloud acceleration platform can parse the user access request and obtain the destination address corresponding to the user access request, where the destination address can be a destination IP (Internet Protocol) address.

In this disclosed embodiment, the cloud acceleration platform can determine whether the destination IP address belongs to a default address library, where the default address library can be an IP address library, and the IP address library can include IP addresses in a preset area for Determine whether the destination IP address corresponding to the user's access request belongs to a preset area, where the preset area may be a domestic area, for example.

In an exemplary embodiment, the method further includes: if the destination address belongs to a preset address library, non-accelerated processing of the user access request.

In this disclosed embodiment, non-accelerated processing of the user access request refers to normal access processing of the user access request.

In this disclosed embodiment, if the destination address belongs to the preset address library, it can mean that the destination IP is successfully matched and the traffic is traffic in the preset area (such as domestic). The user access request can be processed non-accelerated, for example, the user access request can be Directly forwarded to the public network for access.

In step S104, if the destination address does not belong to the default address library, the request information of the user access request is obtained through analysis.

In this disclosed embodiment, if the destination address does not belong to the default address library, it can mean that the destination IP has not been successfully matched and the traffic is from a non-preset area (such as abroad). The cloud acceleration platform can parse the user access request and obtain Request information corresponding to the user's access request, which may include domain name information, for example.

In step S106, it is determined according to the request information whether the user access request belongs to the non-accelerated list.

In this disclosed embodiment, the non-acceleration list may include multiple user access requests that do not require acceleration, and may also include request information corresponding to multiple user access requests that do not require acceleration. The requests in the list will be directly forwarded to the public network for non-acceleration. Accelerate access; the cloud acceleration platform can determine whether the current user access request belongs to the non-accelerated list, such as finding whether the current user access request is in the non-accelerated list, or finding whether the request information corresponding to the current user access request is in the non-accelerated list. .

In an exemplary embodiment, the method further includes: if the user access request belongs to the non-accelerated list, performing non-accelerated processing on the user access request.

In this disclosed embodiment, if the user access request is in the non-accelerated list, or the request information of the user access request is in the non-accelerated list, the user access request can be forwarded to the public network for normal access.

In step S108, if the user access request does not belong to the non-accelerated list, the user access request is accelerated.

In the embodiment of the present disclosure, if the user access request is not in the non-accelerated list, or the request information of the user access request is not in the non-accelerated list, the user access request can be accelerated.

In an exemplary embodiment, accelerating processing of the user access request includes: using the maximum currently available bandwidth to transmit access data corresponding to the user access request.

Among them, the maximum currently available bandwidth can be obtained through the bandwidth detection TCP (Transmission Control Protocol, Transmission Control Protocol) congestion algorithm. After determining the maximum currently available bandwidth, the maximum currently available bandwidth can be used to transmit access data corresponding to the user access request, where, access The data may be, for example, data returned by the URL visited by the user.

In an exemplary embodiment, the method further includes: determining an initial sending rate, performing an increase process on the basis of the initial sending rate to obtain a candidate sending rate; determining a packet loss rate when using the candidate sending rate for data transmission; if the packet loss rate is If the packet rate reaches the preset threshold, the maximum currently available bandwidth is determined based on the candidate sending rate; if the packet loss rate does not reach the preset threshold, the increase process continues on the basis of the candidate sending rate.

Specifically, the bandwidth detection algorithm can periodically detect the maximum currently available bandwidth of the current channel. The detection algorithm tries to continuously increase the amount of data sent, and obtains the maximum currently available bandwidth of the current channel based on the packet loss rate of the data packets. For example, when the data packet loss rate reaches a certain critical value by increasing the amount of data sent, the current sending bandwidth is marked as the maximum available bandwidth.

For example, the sending end first determines an initial sending rate, and then increases the sending rate based on the initial sending rate at an exponential rate (for example, 2 ⁿ ) to obtain a candidate sending rate; then uses the candidate sending rate for data transmission, and determines the use of the candidate sending rate. The packet loss rate during data transmission is determined by determining whether the packet loss rate at this time reaches the preset threshold. The preset threshold can be set according to the actual situation; if the packet loss rate at this time reaches the preset threshold, the candidate transmission rate is determined according to the candidate transmission rate. Determine the maximum currently available bandwidth; if the packet loss rate at this time does not reach the preset threshold, continue to increase the candidate transmission rate until the packet loss is obtained during data transmission based on the increased candidate transmission rate. rate reaches the preset threshold.

In an exemplary embodiment, determining the maximum currently available bandwidth based on the candidate transmission rate includes: when using the candidate transmission rate for data transmission, obtaining the amount of data received by the receiving end in multiple preset time periods; The amount of data received within the time period and the duration of the preset time period are used to determine multiple currently available bandwidths; the largest currently available bandwidth among the multiple currently available bandwidths is determined as the maximum currently available bandwidth.

In the embodiment of the present disclosure, when using the candidate transmission rate for data transmission, the amount of data Δdelivered received by the receiving end in each preset time period Δt within the time period t can be counted. According to the data amount Δdelivered received in each preset time period Δt The amount of data delivered Δdelivered calculates the current available bandwidth bw=Δdelivered/Δt in each preset time period. When the packet loss rate reaches the preset threshold, the largest current available bandwidth bwMax among multiple currently available bandwidths is determined as the time period. The maximum currently available bandwidth within t.

In this embodiment of the disclosure, the sending end can calculate the round-trip delay of each data packet: rtt=rt-st, where rt represents the response time and st represents the sending delay; and record the minimum round-trip delay within the time period t. rttMin.

In the embodiment of the present disclosure, the maximum transmission amount in time period t can be determined based on the maximum currently available bandwidth bwMax in time period t and the minimum round-trip delay rttMin in time period t: BDP=bwMax*rttMin.

In the embodiment of the present disclosure, after the maximum transmission amount is calculated, the maximum transmission amount can be used for data transmission.

In an exemplary embodiment, the method further includes: determining a first delay when using the initial sending rate for data transmission, and a second delay when using the candidate sending rate for data transmission; wherein, if the packet loss rate reaches a predetermined If a threshold is set, the maximum currently available bandwidth is determined based on the candidate sending rate, including: if the packet loss rate reaches the preset threshold and the difference between the second delay and the first delay is greater than the preset value, the maximum currently available bandwidth is determined based on the candidate sending rate. Current available bandwidth.

Specifically, the bandwidth detection algorithm will detect the maximum available bandwidth of the channel within a period. The detection algorithm tries to continuously increase the amount of data sent, and obtains the maximum available bandwidth of the current channel based on the delay changes and packet loss rate of the data packets. For example, when you increase the amount of data sent and observe that the packet delay return increases significantly, and the packet loss rate reaches a certain critical value, mark the current sending bandwidth as the maximum available bandwidth.

Specifically, when the initial transmission rate is used for data transmission, the determined round-trip delay is used as the first delay; when the candidate transmission rate is used for data transmission, the determined round-trip delay is used as the second delay; the first delay is determined Whether the difference between the delay and the second delay is greater than the preset value. If the difference between the second delay and the first delay is greater than the preset value, and the packet loss rate reaches the preset threshold, the maximum value is determined based on the candidate sending rate. Currently available bandwidth; if the difference between the second delay and the first delay is less than or equal to the preset value, or the packet loss rate does not reach the preset threshold, the increase process will continue based on the candidate sending rate.

In an exemplary embodiment, the method further includes: obtaining a first access time obtained by accelerated processing of the user access request; performing non-accelerated processing of the user access request to obtain a second access time; if the first access time is greater than or equal to During the second access time, the user access request will be added to the non-accelerated list.

In the embodiment of the present disclosure, the cloud acceleration platform may include a dynamic detection module, which can obtain user access requests in real time, detect user access requests, and directly route user access requests through the non-acceleration channel to obtain the second access time; The user's access request goes through the accelerated channel and the first access time is obtained; comparing the first access time and the second access time, if the access effect of non-accelerated processing is better (for example, the first access time is greater than or equal to the second access time), then the The user access request or the request information corresponding to the user access request is added to the non-accelerated list.

FIG. 2 is a schematic diagram illustrating access times corresponding to accelerated processing and non-accelerated processing according to an example.

Referring to Figure 2, the first polyline 201 shows the access time obtained by using accelerated processing, and the average access time is 9.61 seconds; the second polyline 202 shows the access time obtained by using non-accelerated processing, and the average access time is 9.61 seconds. The value is 32.4 seconds; it can be seen that using accelerated processing, the access efficiency can be improved by nearly 4 times.

Figure 3 is a schematic diagram of a cloud acceleration platform according to an example.

Referring to FIG. 3 , the cloud acceleration platform 310 may include an access system 311 , a traffic scheduling module 312 , an IP library 313 , a non-acceleration list 314 , a dynamic detection module 315 and an acceleration system 316 .

In this disclosed embodiment, the access system 311 is connected to the client 320, and the client 320 can be a computer, a mobile phone, a router, etc.; the access system 311 can obtain user access traffic (including user access requests) from the client 320, and respond to the user Access control is performed on access traffic; the traffic scheduling module 312 obtains user access traffic from the access system 311, schedules the user access traffic, and determines whether the user access traffic flows through the acceleration system based on the IP library 313 and the non-accelerated list 314; the IP library 313 contains domestic IP address, used to distinguish whether the traffic is domestic access; the non-acceleration list 314 includes request information that does not require acceleration, and requests in the list can be directly forwarded to the public network for non-accelerated access; specifically including: user access traffic based on the IP library 313 Make IP judgment, if the user's access traffic belongs to domestic IP traffic (for example, the destination IP address belongs to the IP library), then it will be processed without acceleration; if the user's access traffic belongs to overseas IP traffic (for example, the destination IP address does not belong to the IP library) , then the request is judged. If the request belongs to the non-accelerated list 314, the acceleration system 316 is used to process it; if the request does not belong to the non-accelerated list 314, the request is processed in a non-accelerated manner; the acceleration system 316 provides acceleration. channel to perform accelerated processing for user requests; the dynamic detection module 315 will obtain the user access request in real time from the access system 311, detect the request, and compare the access time directly through the non-accelerated channel with the access time processed using the acceleration system 316, If non-accelerated public network access is better, add the request to the non-accelerated list 314.

The request processing method provided by the embodiment of the present disclosure obtains the user access request, and parses to obtain the destination address of the user access request; determines whether the destination address belongs to the default address library, and when the destination address does not belong to the default address library, parses to obtain the user access The requested request information; determine whether the user access request belongs to the non-accelerated list based on the request information; when the user access request does not belong to the non-accelerated list, accelerate the user access request; this method uses the preset address library and the non-accelerated list to process the user access request The destination address and request information corresponding to the access request are distinguished to determine whether the user's access request is suitable for accelerated processing, which can improve request processing efficiency, increase access speed, and rationally utilize computer resources.

In addition, in some embodiments, the first access time obtained by accelerated processing of the user access request is obtained; the user access request is subjected to non-accelerated processing to obtain the second access time; if the first access time is greater than or equal to the second If the access time is determined, the user access request will be added to the non-accelerated list; this method can dynamically update the non-accelerated list based on the access time using accelerated processing and non-accelerated processing, thereby improving request processing efficiency and saving computer resources.

In addition, in some embodiments, based on the bandwidth detection algorithm, the maximum currently available bandwidth is determined according to the delay change and/or packet loss rate of the data packet, and the maximum currently available bandwidth is used to transmit the access data corresponding to the user access request. Improve data transmission efficiency.

It should also be understood that the above is only to help those skilled in the art better understand the embodiments of the present disclosure, but is not intended to limit the scope of the embodiments of the present disclosure. Those skilled in the art can obviously make various equivalent modifications or changes based on the above examples given. For example, some steps in the above method may be unnecessary, or some new steps may be added, etc. Or a combination of any two or more of the above embodiments. Such modified, changed or combined solutions also fall within the scope of the embodiments of the present disclosure.

It should also be understood that the above description of the embodiments of the present disclosure focuses on emphasizing the differences between the various embodiments. The similarities or similarities that are not mentioned can be referred to each other. For the sake of brevity, they will not be described again here.

It should also be understood that the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its functions and internal logic, and should not constitute any limitation on the implementation process of the embodiment of the present disclosure.

It should also be understood that in the various embodiments of the present disclosure, if there is no special explanation or logical conflict, the terms and/or descriptions between different embodiments are consistent and can be referenced to each other. The technical features in different embodiments New embodiments can be formed based on their internal logical relationships.

The above describes in detail an example of the method for determining the network anomaly detection model provided by the present disclosure. It can be understood that, in order to implement the above functions, the computer device includes corresponding hardware structures and/or software modules for performing each function. Those skilled in the art should easily realize that the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software with the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein. Whether a function is performed by hardware or computer software driving the hardware depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each specific application, but such implementations should not be considered to be beyond the scope of this disclosure.

The following are device embodiments of the present disclosure, which can be used to perform method embodiments of the present disclosure. For details not disclosed in the device embodiments of the disclosure, please refer to the method embodiments of the disclosure.

Figure 4 is a block diagram of a request processing device according to an exemplary implementation.

As shown in FIG. 4 , the request processing device 400 may include: an acquisition module 402 , an acquisition module 404 , a judgment module 406 and a processing module 408 .

Among them, the obtaining module 402 is used to obtain the user access request, and parse and obtain the destination address of the user access request; the obtaining module 404 is used to parse and obtain the destination address of the user access request if the destination address does not belong to the default address library. Request information; the judgment module 406 is used to judge whether the user access request belongs to the non-accelerated list according to the request information; the processing module 408 is used to determine whether the user access request belongs to the non-accelerated list if the user access request does not belong to the non-accelerated list. Request expedited processing.

In some exemplary embodiments of the present disclosure, the obtaining module 402 is also used to obtain the first access time obtained by accelerated processing of the user access request; the obtaining module 404 is also used to perform non-accelerated processing of the user access request, Obtain the second access time; the request processing device 400 further includes: a adding module, configured to add the user access request to the non-accelerated system if the first access time is greater than or equal to the second access time. in the list.

In some exemplary embodiments of the present disclosure, the processing module 408 is configured to use the maximum currently available bandwidth to transmit access data corresponding to the user access request.

In some exemplary embodiments of the present disclosure, the request processing device 400 further includes: a determining module, configured to: determine an initial sending rate, perform an increase process on the basis of the initial sending rate, and obtain a candidate sending rate; determine The packet loss rate when using the candidate transmission rate for data transmission; if the packet loss rate reaches a preset threshold, the maximum currently available bandwidth is determined based on the candidate transmission rate; if the packet loss rate does not reach the preset threshold If the preset threshold is determined, the increasing process will continue based on the candidate transmission rate.

In some exemplary embodiments of the present disclosure, the determination module is further configured to: when using the candidate transmission rate for data transmission, obtain the amount of data received by the receiving end in multiple preset time periods; according to each preset time The amount of data received in the segment and the duration of the preset time period are used to determine multiple currently available bandwidths; the largest currently available bandwidth among the multiple currently available bandwidths is determined as the maximum currently available bandwidth.

In some exemplary embodiments of the present disclosure, the determining module is further configured to: determine a first delay when using the initial transmission rate for data transmission, and a second delay when using the candidate transmission rate for data transmission; If the packet loss rate reaches a preset threshold and the difference between the second delay and the first delay is greater than the preset value, the maximum currently available bandwidth is determined based on the candidate transmission rate.

In some exemplary embodiments of the present disclosure, the processing module 408 is also configured to: if the destination address belongs to the preset address library, perform non-accelerated processing on the user access request; if the user access request belongs to the non-accelerated List, non-accelerated processing of user access requests.

It should be noted that the block diagrams shown in the above figures are functional entities and do not necessarily correspond to physically or logically independent entities. These functional entities may be implemented in software form, or implemented in one or more hardware modules or integrated circuits, or implemented in different networks and/or processor terminal equipment and/or microcontroller terminal equipment. entity.

FIG. 5 is a schematic structural diagram of an electronic device according to an exemplary embodiment. It should be noted that the electronic device shown in FIG. 5 is only an example and should not impose any restrictions on the functions and scope of use of the embodiments of the present disclosure.

As shown in FIG. 5 , the electronic device 500 includes a central processing unit (CPU) 501 that can operate according to a program stored in a read-only memory (ROM) 502 or loaded from a storage portion 508 into a random access memory (RAM) 503 And perform various appropriate actions and processing. In the RAM 503, various programs and data required for the operation of the electronic device 500 are also stored. The CPU 501, ROM 502, and RAM 503 are connected to each other through a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.

The following components are connected to the I/O interface 505: an input section 506 including a keyboard, a mouse, etc.; an output section 507 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., speakers, etc.; and a storage section 508 including a hard disk, etc. ; and a communication section 509 including a network interface card such as a LAN card, a modem, etc. The communication section 509 performs communication processing via a network such as the Internet. Driver 510 is also connected to I/O interface 505 as needed. Removable media 511, such as magnetic disks, optical disks, magneto-optical disks, semiconductor memories, etc., are installed on the drive 510 as needed, so that a computer program read therefrom is installed into the storage portion 508 as needed.

In particular, according to embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product including a computer program carried on a computer-readable medium, the computer program containing program code for performing the method illustrated in the flowchart. In such embodiments, the computer program may be downloaded and installed from the network via communication portion 509 and/or installed from removable media 511 . When the computer program is executed by the central processing unit (CPU) 501, the above-described functions defined in the system of the present disclosure are performed.

It should be noted that the computer-readable medium shown in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, terminal device or device, or any combination thereof. More specific examples of computer readable storage media may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard drive, random access memory (RAM), read only memory (ROM), removable Programmed read-only memory (EPROM or flash memory), fiber optics, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above. In this disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that may be used by or in connection with an instruction execution system, terminal device, or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code therein. Such propagated data signals may take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can be sent, propagated, or transmitted for use by or in connection with an instruction execution system, terminal device, or device program. Program code embodied on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical cable, RF, etc., or any suitable combination of the foregoing.

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operations of possible implementations of systems, methods, and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logic functions that implement the specified executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown one after another may actually execute substantially in parallel, or they may sometimes execute in the reverse order, depending on the functionality involved. It will also be noted that each block in the block diagram or flowchart illustration, and combinations of blocks in the block diagram or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or operations, or may be implemented by special purpose hardware-based systems that perform the specified functions or operations. Achieved by a combination of specialized hardware and computer instructions.

The units involved in the embodiments of the present disclosure can be implemented in software or hardware. The described unit may also be provided in a processor. For example, it may be described as follows: a processor includes a sending unit, an acquisition unit, a determining unit and a first processing unit. The names of these units do not constitute a limitation on the unit itself under certain circumstances. For example, the sending unit can also be described as "a unit that sends a picture acquisition request to the connected server."

As another aspect, the present disclosure also provides a computer-readable storage medium. The computer-readable storage medium may be included in the electronic device described in the above embodiments; it may also exist independently without being assembled into the electronic device. in electronic equipment. The computer-readable storage medium carries one or more programs. When the one or more programs are executed by an electronic device, the electronic device implements the method described in the following embodiments. For example, the electronic device can implement various steps as shown in Figure 1.

According to one aspect of the present disclosure, a computer program product or computer program is provided, the computer program product or computer program including computer instructions stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device performs the methods provided in various optional implementations of the above embodiments.

It should be understood that any number of elements in the drawings of the present disclosure is for illustration rather than limitation, and any naming is only for differentiation without any limiting meaning.

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. The present disclosure is intended to cover any variations, uses, or adaptations of the disclosure that follow the general principles of the disclosure and include common common sense or customary technical means in the technical field that are not disclosed in the disclosure. . It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It is to be understood that the present disclosure is not limited to the precise structures described above and illustrated in the accompanying drawings, and various modifications and changes may be made without departing from the scope thereof. The scope of the disclosure is limited only by the appended claims.

Claims (10)

1. A method of processing a request, comprising:

acquiring a user access request, and analyzing and acquiring a destination address of the user access request;

if the destination address does not belong to a preset address library, analyzing and obtaining request information of the user access request;

judging whether the user access request belongs to a non-acceleration list or not according to the request information;

and if the user access request does not belong to the non-acceleration list, carrying out acceleration processing on the user access request.

2. The method as recited in claim 1, further comprising:

acquiring a first access time obtained by performing acceleration processing on the user access request;

non-acceleration processing is carried out on the user access request, and a second access time is obtained;

and if the first access time is greater than or equal to the second access time, adding the user access request into the non-acceleration list.

3. The method of claim 1, wherein accelerating the user access request comprises:

and transmitting the access data corresponding to the user access request by using the maximum current available bandwidth.

4. A method according to claim 3, further comprising:

determining an initial sending rate, and performing increasing processing on the basis of the initial sending rate to obtain a candidate sending rate;

determining a packet loss rate when the candidate sending rate is used for data transmission;

if the packet loss rate reaches a preset threshold, determining the maximum current available bandwidth according to the candidate sending rate;

and if the packet loss rate does not reach the preset threshold, continuing to increase the candidate sending rate.

5. The method of claim 4, wherein determining the maximum current available bandwidth from the candidate transmission rate comprises:

when the candidate sending rate is used for data transmission, the data quantity respectively received by the receiving end in a plurality of preset time periods is obtained;

determining a plurality of current available bandwidths according to the data quantity respectively received in each preset time period and the duration of the preset time period;

and determining the largest current available bandwidth in the plurality of current available bandwidths as the largest current available bandwidth.

6. The method as recited in claim 4, further comprising:

determining a first time delay when data transmission is performed by using the initial sending rate, and a second time delay when data transmission is performed by using the candidate sending rate;

if the packet loss rate reaches a preset threshold, determining the maximum current available bandwidth according to the candidate sending rate includes:

and if the packet loss rate reaches a preset threshold value and the difference value between the second time delay and the first time delay is larger than a preset value, determining the maximum current available bandwidth according to the candidate sending rate.

7. The method as recited in claim 1, further comprising:

if the destination address belongs to a preset address library, performing non-acceleration processing on the user access request;

and if the user access request belongs to the non-acceleration list, performing non-acceleration processing on the user access request.

8. A request processing apparatus, comprising:

the acquisition module is used for acquiring a user access request and analyzing and acquiring a destination address of the user access request;

the obtaining module is used for analyzing and obtaining the request information of the user access request if the destination address does not belong to a preset address library;

the judging module is used for judging whether the user access request belongs to a non-acceleration list according to the request information;

and the processing module is used for carrying out acceleration processing on the user access request if the user access request does not belong to the non-acceleration list.

9. An electronic device, comprising:

at least one processor;

storage means for storing at least one program which, when executed by the at least one processor, causes the at least one processor to implement the method of any one of claims 1 to 7.

10. A computer readable storage medium, on which a computer program is stored, which computer program, when being executed by a processor, implements the method according to any of claims 1 to 7.