CN116781782A - Request processing method, request processing device, electronic equipment and storage medium - Google Patents
Request processing method, request processing device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN116781782A CN116781782A CN202310898041.6A CN202310898041A CN116781782A CN 116781782 A CN116781782 A CN 116781782A CN 202310898041 A CN202310898041 A CN 202310898041A CN 116781782 A CN116781782 A CN 116781782A
- Authority
- CN
- China
- Prior art keywords
- user access
- access request
- acceleration
- request
- processing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000012545 processing Methods 0.000 title claims abstract description 76
- 238000003672 processing method Methods 0.000 title abstract description 12
- 230000001133 acceleration Effects 0.000 claims abstract description 119
- 238000000034 method Methods 0.000 claims abstract description 46
- 230000005540 biological transmission Effects 0.000 claims description 47
- 238000004590 computer program Methods 0.000 claims description 13
- 230000001965 increasing effect Effects 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 15
- 238000001514 detection method Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 10
- 230000006870 function Effects 0.000 description 9
- 238000004891 communication Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 230000003252 repetitive effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002708 enhancing effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L61/00—Network arrangements, protocols or services for addressing or naming
- H04L61/45—Network directories; Name-to-address mapping
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
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
Technical Field
The disclosure relates to the technical field of communication, and in particular relates to a request processing method, a request processing device, electronic equipment and a storage medium.
Background
With the development of internet technology and the expansion of network business, the cloud acceleration platform can provide a service for accessing overseas resources for users, and the users can use the service by opening an acceleration package, so that when the users access the overseas resources through the cloud acceleration platform, the problems of low processing efficiency and low access speed of access requests can occur.
It should be noted that the information disclosed in the above background section is only for enhancing understanding of the background of the present disclosure and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The invention aims to provide a request processing method, a request processing device, electronic equipment and a storage medium.
Other features and advantages of the present disclosure will be apparent from the following detailed description, or may be learned in part by the practice of the disclosure.
The embodiment of the disclosure provides a request processing method, which 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.
In some exemplary embodiments of the present disclosure, the method further comprises: 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.
In some exemplary embodiments of the present disclosure, the accelerating the user access request includes: and transmitting the access data corresponding to the user access request by using the maximum current available bandwidth.
In some exemplary embodiments of the present disclosure, the method further comprises: 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.
In some exemplary embodiments of the present disclosure, determining the maximum current available bandwidth from the candidate transmission rate includes: 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.
In some exemplary embodiments of the present disclosure, the method further comprises: 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.
In some exemplary embodiments of the present disclosure, the method further comprises: 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.
The embodiment of the disclosure provides a request processing device, which comprises: 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.
An embodiment of the present disclosure provides an electronic device, including: at least one processor; and a storage terminal device for storing at least one program which, when executed by the at least one processor, causes the at least one processor to implement any one of the request processing methods described above.
The embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements any one of the above-described request processing methods.
The request processing method provided by the embodiment of the disclosure obtains the user access request and analyzes the destination address of the user access request; judging whether the destination address belongs to a preset address library, and analyzing and obtaining request information of a user access request when the destination address does not belong to the preset address library; judging whether the user access request belongs to a non-acceleration list according to the request information; when the user access request does not belong to the non-acceleration list, carrying out acceleration processing on the user access request; the method distinguishes the destination address and the request information corresponding to the user access request through the preset address library and the non-acceleration list so as to judge whether the user access request is suitable for acceleration processing, thereby improving the request processing efficiency, improving the access speed and reasonably utilizing the computer resources.
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 disclosure.
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. It will be apparent to those of ordinary skill in the art that the drawings in the following description are merely examples of the disclosure and that other drawings may be derived from them without undue effort.
FIG. 1 is a flow chart illustrating a method of request processing according to an exemplary embodiment.
Fig. 2 is a schematic diagram showing access times corresponding to acceleration processing and non-acceleration processing according to an example.
FIG. 3 is a schematic diagram of a cloud acceleration platform, shown according to one example.
Fig. 4 is a block diagram illustrating a request processing apparatus according to an example embodiment.
Fig. 5 is a schematic diagram of an electronic device according to an exemplary embodiment.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments can be embodied in many 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 concept of the example embodiments to those skilled in the art. The same reference numerals in the drawings denote the same or similar parts, and thus a repetitive description thereof will be omitted.
The described features, structures, or characteristics of the disclosure may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the present disclosure. However, those skilled in the art will recognize that the aspects of the present disclosure may be practiced with one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known methods, devices, implementations, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.
The drawings are merely schematic illustrations of the present disclosure, in which like reference numerals denote like or similar parts, and thus a repetitive description thereof 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 or in at least one hardware module or integrated circuit or in different networks and/or processor devices and/or microcontroller devices.
The flow diagrams depicted in the figures are exemplary only, and not necessarily all of the elements or steps are included or performed in the order described. For example, some steps may be decomposed, and some steps may be combined or partially combined, so that the order of actual execution may be changed according to actual situations.
Furthermore, in the description of the present disclosure, the terms "a," "an," "the," "said," and "at least one" are used to indicate the presence of at least one element or component; the terms "comprising," "including," and "having" are intended to be inclusive and mean that there may be additional elements or components other than the listed elements or components; the terms "first," "second," and "third," etc. are used merely as labels, and do not limit the number of their objects.
The steps of the request processing method in the exemplary embodiment of the present disclosure will be described in more detail below with reference to the accompanying drawings and embodiments.
FIG. 1 is a flow chart illustrating a method of request processing according to an exemplary embodiment. The method provided by the embodiment of the present disclosure may be performed by a cloud acceleration platform, but the present disclosure is not limited thereto.
As shown in fig. 1, the request processing method provided by the embodiment of the present disclosure may include the following steps.
In step S102, a user access request is acquired, and a destination address of the user access request is obtained by parsing.
In the embodiment of the disclosure, a user terminal can open an acceleration package service and send a user access request, and a cloud acceleration platform can acquire the user access request; the user terminal may be a computer, a mobile phone, a router, etc., and the user access request may be, for example, a request for the user to access the website www.baidu.com.
In the embodiment of the disclosure, the cloud acceleration platform may parse the user access request to obtain a destination address corresponding to the user access request, where the destination address may be a destination IP (Internet Protocol ) address.
In this embodiment of the present disclosure, the cloud acceleration platform may determine whether the destination IP address belongs to a preset address library, where the preset address library may be an IP address library, and the IP address library may include an IP address in a preset area, so as to determine whether the destination IP address corresponding to the user access request belongs to a preset area, where the preset area may be, for example, a domestic area.
In an exemplary embodiment, the method further comprises: if the destination address belongs to the preset address library, non-acceleration processing is carried out on the user access request.
In the embodiment of the disclosure, performing non-acceleration processing on a user access request refers to performing normal access processing on the user access request.
In the embodiment of the disclosure, if the destination address belongs to a preset address library, it may be indicated that the destination IP matching is successful, and the traffic is traffic in a preset area (for example, domestic), and the non-acceleration processing may be performed on the user access request, for example, the user access request is directly forwarded to the public network for access.
In step S104, if the destination address does not belong to the preset address library, the request information of the user access request is obtained by parsing.
In the embodiment of the present disclosure, if the destination address does not belong to the preset address library, it may be indicated that the destination IP is not successfully matched, the traffic is the traffic of a non-preset area (for example, abroad), and the cloud acceleration platform may analyze the user access request to obtain request information corresponding to the user access request, where the request information may include domain name information, for example.
In step S106, it is determined whether the user access request belongs to a non-acceleration list according to the request information.
In the embodiment of the disclosure, the non-acceleration list may include a plurality of user access requests without acceleration, or may include request information corresponding to a plurality of user access requests without acceleration, where the requests in the list may be directly forwarded to the public network for non-acceleration access; the cloud acceleration platform may determine whether the current user access request belongs to a non-acceleration list, for example, find whether the current user access request is in the non-acceleration list, or find whether request information corresponding to the current user access request is in the non-acceleration list.
In an exemplary embodiment, the method further comprises: and if the user access request belongs to the non-acceleration list, performing non-acceleration processing on the user access request.
In the embodiment of the disclosure, if the user access request is in the non-acceleration list, or if the request information of the user access request is in the non-acceleration list, the user access request may be forwarded to the public network for normal access.
In step S108, if the user access request does not belong to the non-acceleration list, the acceleration processing is performed on the user access request.
In the embodiment of the disclosure, if the user access request is not in the non-acceleration list, or the request information of the user access request is not in the non-acceleration list, the acceleration processing may be performed on the user access request.
In an exemplary embodiment, the acceleration processing of the user access request includes: and transmitting the access data corresponding to the user access request by using the maximum current available bandwidth.
The maximum current available bandwidth may be obtained through a bandwidth detection TCP (Transmission Control Protocol ) congestion algorithm, and after determining the maximum current available bandwidth, access data corresponding to a user access request may be transmitted using the maximum current available bandwidth, where the access data may be, for example, data returned by a website accessed by a user.
In an exemplary embodiment, the method further comprises: determining an initial sending rate, and performing increasing processing on the basis of the initial sending rate to obtain candidate sending rates; determining a packet loss rate 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; if the packet loss rate does not reach the preset threshold, continuing to increase the candidate transmission rate.
Specifically, the bandwidth detection algorithm can periodically detect the maximum current available bandwidth of the current channel, and the detection algorithm tries to continuously increase the transmitted data volume, and obtains the maximum current available bandwidth of the current channel according to the packet loss rate of the data packet. For example, when the packet loss rate of data reaches a certain critical value by increasing the amount of transmitted data, the current transmission bandwidth is marked as the maximum available bandwidth.
For example, the sender may determine an initial sending rate and then determine a transmission rate at an exponential rate (e.g., 2 n ) Increasing the transmission rate on the basis of the initial transmission rate to obtain candidate transmission rates; then using the candidate sending rate to carry out data transmission, determining the packet loss rate when the candidate sending rate is used for carrying out data transmission, and judging whether the packet loss rate at the moment reaches a preset threshold value or not, wherein the preset threshold value can be set according to actual conditions; if the packet loss rate at the moment reaches a preset threshold, determining the maximum current available bandwidth according to the candidate sending rate; if the packet loss rate at the moment does not reach the preset threshold, continuing to increase the candidate transmission rate until the packet loss rate obtained when the data transmission is performed according to the increased candidate transmission rate reaches the preset threshold.
In an exemplary embodiment, determining the maximum current available bandwidth from the candidate transmission rate includes: 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; the maximum current available bandwidth of the plurality of current available bandwidths is determined as the maximum current available bandwidth.
In the embodiment of the disclosure, when the candidate transmission rate is used for data transmission, the data amount Δextended received by the receiving end in each preset time period Δt in the time period t may be counted, the current available bandwidth bw=Δextended/Δt in each preset time period is calculated according to the data amount Δextended received in each preset time period Δt, and when the packet loss rate reaches a preset threshold, the maximum current available bandwidth bwMax in the plurality of current available bandwidths is determined as the maximum current available bandwidth in the time period t.
In the embodiment of the disclosure, the transmitting end may calculate the round trip delay of each data packet: rtt=rt-st, where rt represents response time and st represents transmission delay; and records the minimum round trip delay rttMin during the time period t.
In the embodiment of the present disclosure, the maximum transmission amount in the time period t may be determined according to the maximum current available bandwidth bwMax in the time period t and the minimum round trip delay rttMin in the time period t: bdp=bwmax rttMin.
In the embodiment of the disclosure, after the maximum transmission amount is calculated, data transmission can be performed using the maximum transmission amount.
In an exemplary embodiment, the method further comprises: determining a first delay when data transmission is performed using the initial transmission rate and a second delay when data transmission is performed using the candidate transmission rate; if the packet loss rate reaches a preset threshold, determining the maximum current available bandwidth according to the candidate sending rate includes: 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.
Specifically, the bandwidth detection algorithm can detect the maximum available bandwidth of the channel in a period, the detection algorithm tries to continuously increase the data transmission quantity, and the maximum available bandwidth of the current channel is obtained according to the time delay change and the packet loss rate of the data packet. For example, when the delay return of the observed data packet is obviously increased by increasing the amount of transmitted data and the packet loss rate reaches a certain critical value, the current transmission bandwidth is marked as the maximum available bandwidth.
Specifically, when data transmission is performed by using an initial sending rate, the determined round trip delay is taken as a first delay; when the candidate sending rate is used for data transmission, the determined round trip delay is used as a second delay; judging whether the difference value of the first time delay and the second time delay is larger than a preset value, if the difference value of the second time delay and the first time delay is larger than the preset value and the packet loss rate reaches a preset threshold, determining the maximum current available bandwidth according to the candidate transmission rate; if the difference value between the second time delay and the first time delay is smaller than or equal to a preset value, or the packet loss rate does not reach a preset threshold value, continuing to increase the candidate transmission rate.
In an exemplary embodiment, the method further comprises: acquiring a first access time obtained by performing acceleration processing on a 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.
In the embodiment of the disclosure, the cloud acceleration platform may include a dynamic detection module, where the dynamic detection module may acquire a user access request in real time, detect the user access request, and directly walk the user access request through a non-acceleration channel to obtain a second access time; the user access request is sent to an acceleration channel to obtain a first access time; and comparing the first access time with the second access time, and if the access effect of the non-acceleration processing is better (for example, the first access time is greater than or equal to the second access time), adding the user access request or the request information corresponding to the user access request into the non-acceleration list.
Fig. 2 is a schematic diagram showing access times corresponding to acceleration processing and non-acceleration processing according to an example.
Referring to fig. 2, a first fold line 201 shows an access time obtained using an acceleration process, the access time having an average value of 9.61 seconds; the second fold line 202 shows the access time obtained using the non-accelerated process, with an average of 32.4 seconds; it can be seen that the access efficiency can be improved by a factor of approximately 4 using the acceleration process.
FIG. 3 is a schematic diagram of a cloud acceleration platform, shown according to one example.
Referring to fig. 3, 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 the embodiment of the present disclosure, the access system 311 is connected to the client 320, and the client 320 may be a computer, a mobile phone, a router, etc.; the access system 311 may obtain user access traffic (including a user access request) from the user side 320, and perform access control on the user access traffic; the flow scheduling module 312 obtains the user access flow from the access system 311, schedules the user access flow, and judges whether the user access flow walks the acceleration system according to the IP library 313 and the non-acceleration list 314; the IP library 313 contains domestic IP addresses for distinguishing whether traffic is domestic access; the non-acceleration list 314 includes request information without acceleration, and the request in the list can be directly forwarded to the public network for non-acceleration access; the method specifically comprises the following steps: the IP judgment is carried out on the user access flow according to the IP library 313, and if the user access flow belongs to domestic IP flow (for example, the destination IP address belongs to the IP library), non-acceleration processing is carried out on the user access flow; if the user access traffic belongs to overseas IP traffic (e.g., the destination IP address does not belong to the IP library), then request judgment is performed, and if the request belongs to the non-acceleration list 314, then the acceleration system 316 is used to process the request; if the request does not belong to the non-acceleration list 314, performing non-acceleration processing on the request; the acceleration system 316 provides an acceleration channel for acceleration processing of the user request; the dynamic detection module 315 obtains the user access request from the access system 311 in real time, detects the request, and compares the access time of the direct non-acceleration channel with the access time processed by the acceleration system 316, if the non-acceleration public network access effect is better, adds the request to the non-acceleration list 314.
The request processing method provided by the embodiment of the disclosure obtains the user access request and analyzes the destination address of the user access request; judging whether the destination address belongs to a preset address library, and analyzing and obtaining request information of a user access request when the destination address does not belong to the preset address library; judging whether the user access request belongs to a non-acceleration list according to the request information; when the user access request does not belong to the non-acceleration list, carrying out acceleration processing on the user access request; the method distinguishes the destination address and the request information corresponding to the user access request through the preset address library and the non-acceleration list so as to judge whether the user access request is suitable for acceleration processing, thereby improving the request processing efficiency, improving the access speed and reasonably utilizing the computer resources.
In addition, in some embodiments, a first access time obtained by performing acceleration processing on a user access request is obtained; non-acceleration processing is carried out on the user access request, and a second access time is obtained; if the first access time is greater than or equal to the second access time, adding the user access request into a non-acceleration list; the method can dynamically update the non-acceleration list according to the access time of the acceleration processing and the non-acceleration processing, thereby improving the request processing efficiency and saving the computer resources.
In addition, in some embodiments, based on a bandwidth detection algorithm, according to the delay change and/or the packet loss rate of the data packet, the maximum current available bandwidth is determined, and the access data corresponding to the user access request is transmitted by using the maximum current available bandwidth, so that the data transmission efficiency can be improved.
It should also be understood that the above is only intended to assist those skilled in the art in better understanding the embodiments of the present disclosure, and is not intended to limit the scope of the embodiments of the present disclosure. It will be apparent to those skilled in the art from the foregoing examples that various equivalent modifications or variations can be made, for example, some steps of the methods described above may not be necessary, or some steps may be newly added, etc. Or a combination of any two or more of the above. Such modifications, variations, or combinations thereof are also within the scope of the embodiments of the present disclosure.
It should also be understood that the foregoing description of the embodiments of the present disclosure focuses on highlighting differences between the various embodiments and that the same or similar elements not mentioned may be referred to each other and are not repeated here for brevity.
It should also be understood that the sequence numbers of the above processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic thereof, and should not constitute any limitation on the implementation process of the embodiments of the present disclosure.
It is also to be understood that in the various embodiments of the disclosure, terms and/or descriptions of the various embodiments are consistent and may be referenced to one another in the absence of a particular explanation or logic conflict, and that the features of the various embodiments may be combined to form new embodiments in accordance with their inherent logic relationships.
Examples of the method for determining the network anomaly detection model provided by the present disclosure are described in detail above. It will be appreciated that the computer device, in order to carry out the functions described above, comprises corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
The following are device embodiments of the present disclosure that may be used to perform method embodiments of the present disclosure. For details not disclosed in the embodiments of the apparatus of the present disclosure, please refer to the embodiments of the method of the present disclosure.
Fig. 4 is a block diagram illustrating a request processing apparatus according to an example embodiment.
As shown in fig. 4, the request processing apparatus 400 may include: an acquisition module 402, an acquisition module 404, a determination module 406, and a processing module 408.
The acquiring module 402 is configured to acquire a user access request, and analyze and acquire a destination address of the user access request; the obtaining module 404 is configured to parse and obtain request information of the user access request if the destination address does not belong to a preset address library; the judging module 406 is configured to judge whether the user access request belongs to a non-acceleration list according to the request information; the processing module 408 is configured to perform acceleration processing on the user access request if the user access request does not belong to the non-acceleration list.
In some exemplary embodiments of the present disclosure, the obtaining module 402 is further configured to obtain a first access time obtained by performing an acceleration process on the user access request; the obtaining module 404 is further configured to perform non-acceleration processing on the user access request to obtain a second access time; the request processing apparatus 400 further includes: and the joining module is used for joining the user access request into the non-acceleration list if the first access time is greater than or equal to the second access time.
In some exemplary embodiments of the present disclosure, the processing module 408 is configured to: and transmitting the access data corresponding to the user access request by using the maximum current available bandwidth.
In some exemplary embodiments of the present disclosure, the request processing apparatus 400 further includes: a determining module for: 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.
In some exemplary embodiments of the present disclosure, the determining module is further configured to: 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.
In some exemplary embodiments of the present disclosure, the determining module is further configured to: 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; 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.
In some exemplary embodiments of the present disclosure, the processing module 408 is further configured to: 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.
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 separate entities. These functional entities may be implemented in software or in one or more hardware modules or integrated circuits or in different networks and/or processor terminals and/or microcontroller terminals.
Fig. 5 is a schematic 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 limitation on the functions and the 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, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic apparatus 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, and the like; an output portion 507 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The drive 510 is also connected to the I/O interface 505 as needed. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as needed so that a computer program read therefrom is mounted into the storage section 508 as needed.
In particular, according to embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flowcharts. In such an embodiment, the computer program may be downloaded and installed from a network via the communication portion 509, and/or installed from the removable media 511. The above-described functions defined in the system of the present disclosure are performed when the computer program is executed by a Central Processing Unit (CPU) 501.
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 two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, terminal device, or apparatus, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, terminal device, or apparatus. In the present disclosure, however, the computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, terminal device, or apparatus. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation 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, which comprises one or more executable instructions for implementing the specified logical function(s). 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 in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units involved in the embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The described units may also be provided in a processor, for example, described as: a processor includes a transmitting unit, an acquiring unit, a determining unit, and a first processing unit. The names of these units do not constitute a limitation on the unit itself in some cases, and for example, the transmitting unit may also be described as "a unit that transmits a picture acquisition request to a connected server".
As another aspect, the present disclosure also provides a computer-readable storage medium that may be included in the electronic device described in the above embodiments; or may exist alone without being incorporated into the electronic device. The computer-readable storage medium carries one or more programs which, when executed by the electronic device, cause the electronic device to implement the methods described in the embodiments below. For example, the electronic device may implement the steps shown in fig. 1.
According to one aspect of the present disclosure, there is provided a computer program product or computer program comprising 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 the various alternative implementations of the above-described embodiments.
It should be understood that any number of elements in the drawings of the present disclosure are for illustration and not limitation, and that any naming is used for distinction only and not for limitation.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This disclosure is intended to cover any adaptations, uses, or adaptations of the disclosure following the general principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. 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 arrangements and instrumentalities shown in the drawings, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the present 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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310898041.6A CN116781782A (en) | 2023-07-20 | 2023-07-20 | Request processing method, request processing device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310898041.6A CN116781782A (en) | 2023-07-20 | 2023-07-20 | Request processing method, request processing device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN116781782A true CN116781782A (en) | 2023-09-19 |
Family
ID=87989613
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310898041.6A Pending CN116781782A (en) | 2023-07-20 | 2023-07-20 | Request processing method, request processing device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116781782A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117640189A (en) * | 2023-11-27 | 2024-03-01 | 中国电信国际有限公司 | Access method, device, equipment and storage medium |
-
2023
- 2023-07-20 CN CN202310898041.6A patent/CN116781782A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117640189A (en) * | 2023-11-27 | 2024-03-01 | 中国电信国际有限公司 | Access method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109152095B (en) | Wireless network connection method for terminal | |
| US20060036764A1 (en) | Priority control device | |
| CN109246741B (en) | Wireless network connection method for terminal | |
| CN112039796B (en) | Data packet transmission method and device, storage medium and electronic equipment | |
| CN107690149B (en) | Method for triggering network policy update, management function entity and core network equipment | |
| CN110191200A (en) | Network Access Method, device, electronic equipment and computer-readable medium | |
| CN111885190B (en) | Service request processing method and system | |
| CN116781782A (en) | Request processing method, request processing device, electronic equipment and storage medium | |
| CN110489474A (en) | A kind of method, apparatus of data processing, medium and electronic equipment | |
| CN107222403A (en) | A kind of data transmission method, system and electronic equipment | |
| CN114980064B (en) | Information association method, device, electronic equipment and storage medium | |
| CN116633823A (en) | Different-network broadband user identification method, device, equipment and storage medium | |
| CN113890858B (en) | PMTU detection method and device | |
| CN112242937B (en) | Network speed measuring method and device, electronic equipment and computer readable medium | |
| CN113238808B (en) | Message pushing method and device | |
| CN115544324A (en) | User data analysis method and device and storage medium | |
| CN111371675B (en) | Intelligent addressing method, device, equipment and storage medium thereof | |
| CN110120895B (en) | Method, device, medium and electronic equipment for testing communication of mobile terminal | |
| CN112306791B (en) | Performance monitoring method and device | |
| CN113452754A (en) | CoAP protocol-based power distribution Internet of things network communication system | |
| CN107222299A (en) | A kind of data transmission method, system and electronic equipment | |
| CN113691462B (en) | Response method and device of Internet group management protocol | |
| CN114651236A (en) | Resource deleting method, device, equipment and storage medium | |
| CN113691545B (en) | Routing control method and device, electronic equipment and computer readable medium | |
| CN112306701A (en) | Service fusing method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |