CN114422259A - Internet resource monitoring and distributing method facing high concurrent data request - Google Patents
Internet resource monitoring and distributing method facing high concurrent data request Download PDFInfo
- Publication number
- CN114422259A CN114422259A CN202210092956.3A CN202210092956A CN114422259A CN 114422259 A CN114422259 A CN 114422259A CN 202210092956 A CN202210092956 A CN 202210092956A CN 114422259 A CN114422259 A CN 114422259A
- Authority
- CN
- China
- Prior art keywords
- data request
- encrypted data
- digital
- digital abstract
- request instruction
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
- H04L63/0414—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden during transmission, i.e. party's identity is protected against eavesdropping, e.g. by using temporary identifiers, but is known to the other party or parties involved in the communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/108—Network architectures or network communication protocols for network security for controlling access to devices or network resources when the policy decisions are valid for a limited amount of time
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0894—Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Storage Device Security (AREA)
Abstract
The invention discloses a high-concurrency data request-oriented internet resource monitoring and distributing method, and relates to the technical field of internet interaction. The method comprises the steps of obtaining a plurality of encrypted data request instructions sent by a client; temporarily storing the encrypted data request instruction in a preposed cache; screening out repeated encrypted data instructions in the preposed cache, and decrypting the repeated encrypted data instructions to obtain decrypted data request instructions; executing the data decryption request instruction to obtain return data; and returning the same return data to the client with the same encrypted data request instruction. The invention solves the problem of large delay of internet response under high concurrency state by carrying out partial decryption-free processing on the data request of the user, and improves the response speed of the user request.
Description
Technical Field
The invention belongs to the technical field of internet interaction, and particularly relates to a high concurrent data request-oriented internet resource monitoring and distributing method.
Background
In the internet interaction process, a user sends a data request instruction through a client, but for the privacy of the client, data needs to be encrypted, for example, when the user uses a browser, the data is transmitted by using an https Protocol (hypertext Transfer Protocol over Secure Socket Layer), but after the server obtains the encrypted data request instruction, decryption still needs to be performed. In the high concurrent data request state, even after global load balancing is used, the response speed of the user request is slow due to the bottleneck limit of decryption.
Disclosure of Invention
The invention aims to provide an internet resource monitoring and distributing method facing high concurrent data requests, which solves the problem of large delay of internet response in a high concurrent state by carrying out partial decryption-free processing on data requests of users.
In order to solve the technical problems, the invention is realized by the following technical scheme:
the invention provides an internet resource monitoring and distributing method facing high concurrent data requests, which comprises the steps of obtaining a plurality of encrypted data request instructions sent by a client;
temporarily storing the encrypted data request instruction in a pre-cache;
screening out the repeated encrypted data instructions in the preposed cache, and decrypting the repeated encrypted data instructions to obtain decrypted data request instructions;
executing the decryption data request instruction to obtain return data;
and returning the same return data to the client with the same encrypted data request instruction.
In an embodiment of the present invention, the step of obtaining the plurality of encrypted data request instructions sent by the client includes,
acquiring the type of the decryption data request instruction;
acquiring the type of the returned data;
and if the client side sending the encryption request instruction does not have the condition of browsing the corresponding returned data according to a set rule, the decryption data request instruction is not executed.
In an embodiment of the present invention, the step of obtaining the plurality of encrypted data request instructions sent by the client includes,
acquiring the type of the decryption data request instruction;
acquiring the content of the return data;
and if the content of the returned data comprises user privacy information according to a set rule, the data decryption request instruction is not executed.
In an embodiment of the present invention, the step of screening out the repeated encrypted data instructions in the pre-cache, and decrypting the repeated encrypted data instructions to obtain a decrypted data request instruction includes,
obtaining the mapping between the encrypted data command and the decrypted data request command;
extracting a digital abstract of the encrypted data instruction;
constructing a mapping database of the digital abstract and the corresponding decryption data request instruction;
identifying the encrypted data instruction with the same digital abstract as the decrypted encrypted data instruction with the same decrypted data request instruction;
acquiring the encrypted data instruction in real time, and extracting the digital abstract of the encrypted data instruction;
searching whether a mapping database of the digital abstract and the corresponding decryption data request instruction exists or not according to the digital abstract;
if yes, acquiring the decryption data request instruction corresponding to the digital abstract;
and if the digital abstract does not exist, decrypting the encrypted data request instruction corresponding to the digital abstract to obtain a decrypted data request instruction, and adding the digital abstract and the decrypted data request instruction to a mapping database of the digital abstract and the corresponding decrypted data request instruction.
In one embodiment of the present invention, the step of extracting the digital digest of the encrypted data instruction includes,
acquiring the number of the encrypted data request instructions in the pre-cache in real time;
acquiring the increasing or decreasing speed of the encrypted data request instruction in the pre-cache;
acquiring the set upper limit of the number of the encrypted data request instructions in the pre-cache;
taking the number of the encrypted data request instructions in the pre-cache as a lower limit of integral, and integrating the increasing or decreasing speed of the encrypted data request instructions in the pre-cache to obtain the number of the encrypted data request instructions in the expected pre-cache;
if the number of the encrypted data request instructions in the expected pre-cache exceeds the set upper limit of the number of the encrypted data request instructions in the pre-cache, reducing the number of bits of the digital summary;
if the number of the encrypted data request instructions in the expected pre-cache is lower than the set upper limit of the number of the encrypted data request instructions in the pre-cache, increasing the number of bits of the digital summary.
In one embodiment of the present invention, the step of extracting the digital digest of the encrypted data instruction includes,
acquiring the decrypted data request instruction corresponding to the encrypted data request instruction;
acquiring response time for executing the decrypted data request instruction to obtain the returned data;
acquiring the response time required for executing the encrypted data request instruction in the pre-cache in real time;
acquiring the increasing or decreasing speed of the response time;
acquiring set response time;
taking the response time required for executing the encrypted data request instruction in the pre-cache as a lower limit of integral, and integrating the increasing or decreasing speed of the response time to obtain the expected response time required for expecting to execute the encrypted data request instruction in the pre-cache;
if the expected response time exceeds the upper limit of the set response time, reducing the digit of the digital abstract;
if the expected response time is lower than the upper limit of the set response time, increasing the number of bits of the digital summary.
In an embodiment of the present invention, the number of bits of the digital digest is set within a predetermined range, so as to prevent the same digital digest from corresponding to multiple decrypted data request instructions.
In an embodiment of the present invention, the digital digests with different digits obtained by the same encrypted data request instruction are mapped one by one, so as to avoid that the number of the digital digests is too large, which affects the subsequent retrieval efficiency.
In one embodiment of the present invention, the step of retrieving, based on the digital digest, whether a mapping database exists between the digital digest and the corresponding decrypted data request instruction includes,
extracting the digital abstract and the digital abstract in a mapping database of the corresponding decryption data request instruction to serve as key values;
reordering the mapping databases of the digital digests and the corresponding decryption data request instructions in ascending or descending order of the digital digests to obtain a sequential mapping database;
comparing the digital abstract corresponding to the real-time acquired encrypted data instruction with the digital abstract key value column in the sequence mapping database to acquire a size comparison result of the digital abstract and the digital abstract key value column;
according to the size comparison result of the digital abstract and the digital abstract key value row, continuously comparing the digital abstract and the digital abstract key value row along the increasing or decreasing arrangement sequence of the digital abstract key value row;
until the decryption data request instruction corresponding to the digital abstract in a sequential mapping database is obtained, or the digital abstract is judged not to exist in the mapping database of the digital abstract and the corresponding decryption data request instruction.
In an embodiment of the present invention, the step of continuously comparing the digital summary with the key value column of the digital summary along the ascending or descending arrangement order of the key value column of the digital summary according to the comparison result of the sizes of the key value column of the digital summary and the digital summary comprises,
comparing the size of the digital abstract with the middle value in the key value column of the digital abstract;
if the digital abstract is the same as the middle value in the key value column of the digital abstract, taking the decryption data request instruction corresponding to the middle value in the key value column of the digital abstract as the decryption data request instruction corresponding to the digital abstract;
if the intermediate values in the digital abstract and the digital abstract key value row are different, the intermediate values in the digital abstract key value row are continuously selected along the increasing or decreasing arrangement sequence of the digital abstract key value row by taking the intermediate values in the digital abstract key value row as the starting points according to the comparison result of the intermediate values in the digital abstract and the digital abstract key value row, and the previous step is repeated.
The invention solves the problem of large delay of internet response under high concurrency state by carrying out partial decryption-free processing on the data request of the user, and improves the response speed of the user request.
Of course, it is not necessary for any product in which the invention is practiced to achieve all of the above-described advantages at the same time.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a flowchart illustrating a method for monitoring and allocating Internet resources for high concurrency data requests according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating steps of obtaining a plurality of encrypted data request commands sent by a client according to an embodiment of the present invention;
FIG. 3 is a flowchart illustrating steps for obtaining a plurality of encrypted data request commands sent by a client according to an embodiment;
FIG. 4 is a flowchart illustrating an embodiment of the steps of screening out duplicate encrypted data instructions in the pre-cache, and decrypting the duplicate encrypted data instructions to obtain decrypted data request instructions;
FIG. 5 is a flowchart of the steps for fetching a digital digest of an encrypted data instruction according to one embodiment;
FIG. 6 is a flowchart of the steps for extracting a digital digest of an encrypted data instruction according to one embodiment;
FIG. 7 is a flowchart of one embodiment of the step of retrieving the mapping database of the digital digest and the corresponding decrypted data request command according to the digital digest;
fig. 8 is a flowchart illustrating the steps of continuing to compare the digital abstract with the numeric abstract key value row according to the size comparison result of the numeric abstract and the numeric abstract key value row and along the increasing or decreasing arrangement order of the numeric abstract key value row.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the process of using the client by a user, in order to guarantee the privacy and the safety of the user, an interactive instruction sent by the client needs to be encrypted, a large amount of time is consumed in the process of decrypting by a server, and in order to improve the response speed of the server, please refer to fig. 1.
The decoding step S3 is executed to screen out the repeated encrypted data commands in the pre-buffer, and the repeated encrypted data commands are decrypted to obtain decrypted data request commands, and then the decoding step S4 is executed to obtain the returned data. Finally, step S5 is executed to return the same return data to the client that instructed the same encrypted data request.
Referring to fig. 2, in order to avoid that the user obtains content whose own right should not be obtained, in the above step S1, the step of obtaining several encrypted data request commands sent by the client may first execute step S1.11 to obtain the type of the decrypted data request command. Step S1.12 may be performed next to obtain the type of return data. And finally, executing the step S1.13 to the step S1.14, if the client side sending the encryption request instruction does not have the condition of browsing the corresponding returned data according to the set rule, not executing the decryption data request instruction.
Referring to fig. 3, in order to avoid the privacy information of the user from being leaked, in the above step S1, the step of obtaining several encrypted data request instructions sent by the client may first perform step S1.21 to obtain the type of the decrypted data request instruction. Step S1.22 is performed next to obtain the content of the return data. And finally, executing the step S1.23 to the step S1.24, if the content of the returned data comprises the user privacy information according to the set rule, not executing the data decryption request instruction.
Referring to fig. 4, since the byte space occupied by the encrypted data command may be relatively large, the efficiency of retrieval comparison is reduced, and in order to increase the response speed, in step S3, the repeated encrypted data commands in the pre-buffer are screened out, and the repeated encrypted data commands are decrypted to obtain the decrypted data request command, step S31 may be first executed to obtain the mapping between the encrypted data commands and the decrypted data request command, step S32 is then executed to extract the digital digest of the encrypted data command, and step S33 is then executed to construct a mapping database of the digital digest and the corresponding decrypted data request command. Then, the step S34 is executed to identify the encrypted data command with the same digital digest as the decrypted data request command with the same decrypted data, and then the step S35 is executed to obtain the encrypted data command in real time to extract the digital digest of the encrypted data command. Finally, steps S36 to S39 are executed to search whether a mapping database exists between the digital digest and the corresponding decrypted data request command according to the digital digest. And if so, acquiring a decryption data request instruction corresponding to the digital abstract. And if the digital abstract does not exist, the encrypted data request instruction corresponding to the digital abstract is decrypted to obtain a decrypted data request instruction, and the digital abstract and the decrypted data request instruction are added to a mapping database of the digital abstract and the corresponding decrypted data request instruction.
The step numbers in this embodiment are not intended to limit the steps, and may be performed in the following order, for example, in step S3. The step S32 may be executed to extract the digital digest of the encrypted data command, the step S31 is executed to obtain the mapping between the encrypted data command and the decrypted data request command, and the step S33 is executed to construct a mapping database between the digital digest and the corresponding decrypted data request command. Then, the step S34 is executed to identify the encrypted data command with the same digital digest as the decrypted data request command with the same decrypted data, and then the step S35 is executed to obtain the encrypted data command in real time to extract the digital digest of the encrypted data command. Finally, steps S36 to S39 are executed to search whether a mapping database exists between the digital digest and the corresponding decrypted data request command according to the digital digest. And if so, acquiring a decryption data request instruction corresponding to the digital abstract. And if the digital abstract does not exist, the encrypted data request instruction corresponding to the digital abstract is decrypted to obtain a decrypted data request instruction, and the digital abstract and the decrypted data request instruction are added to a mapping database of the digital abstract and the corresponding decrypted data request instruction.
Referring to fig. 5, in order to avoid the accumulation of the encrypted data request commands in the pre-cache from reducing the response speed, in the step 32 of extracting the digital digest of the encrypted data command, step S32.11 may be first executed to obtain the number of encrypted data request commands in the pre-cache in real time, and then step S32.12 may be executed to obtain the increasing or decreasing speed of the encrypted data request commands in the pre-cache. Then, step S32.13 is executed to obtain the set upper limit of the number of the encrypted data request commands in the pre-buffer, and then step S32.14 is executed to take the number of the encrypted data request commands in the pre-buffer as the lower limit of the integral, and integrate the increasing or decreasing speed of the encrypted data request commands in the pre-buffer to obtain the number of the encrypted data request commands in the expected pre-buffer. Finally, step S32.15 to step S32.17 are executed to reduce the number of bits of the digital digest if the number of the encrypted data request instructions in the pre-cache is expected to exceed the set upper limit of the number of the encrypted data request instructions in the pre-cache. If the number of the encrypted data request instructions in the pre-cache is expected to be lower than the set upper limit of the number of the encrypted data request instructions in the pre-cache, the number of bits of the digital summary is increased.
Referring to fig. 6, in order to further avoid the accumulation of the encrypted data request command in the pre-buffer to reduce the response speed, in the step 32 of extracting the digital digest of the encrypted data command, step S32.21 may be first executed to obtain the decrypted data request command corresponding to the encrypted data request command, and then step S32.22 is executed to obtain the response time for executing the decrypted data request command to obtain the returned data. Then step S32.23 is executed to obtain the response time required for executing the encrypted data request instruction in the pre-cache in real time, and step S32.24 is executed to obtain the increasing or decreasing speed of the response time. Then, step S32.25 is executed to obtain the set response time, and step S32.26 is executed to take the response time required for executing the encrypted data request instruction in the pre-buffer as the lower limit of the integral, and integrate the increasing or decreasing speed of the response time to obtain the expected response time required for executing the encrypted data request instruction in the pre-buffer. Finally, step S32.27 to step S32.29 are executed to reduce the number of digits of the digital summary if the expected response time exceeds the upper limit of the set response time. If the expected response time is below the upper limit of the set response time, the number of bits of the digital summary is increased.
Referring to fig. 6, in order to avoid that one digital digest corresponds to multiple decrypted data request commands, the number of bits of the digital digest may be set within a predetermined range.
Referring to fig. 6, in order to avoid that the number of digital digests is too large and affects the subsequent retrieval efficiency, the digital digests with different numbers of bits obtained by the same encrypted data request instruction may be mapped one by one.
Referring to fig. 7, in order to increase the retrieval comparison speed of the digital digests in the key value column of the digital digests, in the step S36, the step of retrieving whether the digital digests exist in the mapping database of the digital digests and the corresponding decrypted data request commands according to the digital digests may first perform step S361 to extract the digital digests in the mapping database of the digital digests and the corresponding decrypted data request commands as key values, and then may perform step S362 to reorder the mapping database of the digital digests and the corresponding decrypted data request commands in ascending order or descending order of the digital digests to obtain a sequential mapping database. Then, step S363 may be executed to compare the digital digest corresponding to the real-time encrypted data instruction with the key value column of the digital digest in the sequential mapping database, so as to obtain a size comparison result between the digital digest and the key value column of the digital digest. Then, step S364 is executed to continue to compare the digital abstract with the key value column of the digital abstract along the ascending or descending arrangement sequence of the key value column of the digital abstract according to the comparison result of the sizes of the key value column of the digital abstract and the digital abstract. Finally, step S365 is executed until the decryption data request command corresponding to the digital digest in the sequential mapping database is obtained, or it is determined that the digital digest does not exist in the mapping database of the digital digest and the corresponding decryption data request command.
Referring to fig. 8, in order to further increase the speed of retrieving and comparing the digital summary in the key value column of the digital summary, in the step S364, the step of comparing the digital summary with the key value column of the digital summary is continued along the ascending or descending order of the key value column of the digital summary according to the comparison result of the sizes of the digital summary and the key value column of the digital summary, and step S3641 may be first executed to compare the sizes of the intermediate values in the key value column of the digital summary with the sizes of the intermediate values in the key value column of the digital summary. Then, step S3642 to step S3644 are executed to use the decrypted data request command corresponding to the middle value in the key value column of the digital digest as the decrypted data request command corresponding to the digital digest if the digital digest is the same as the middle value in the key value column of the digital digest. If the intermediate values in the key value rows of the digital abstract and the digital abstract are different, the intermediate values in the key value rows of the digital abstract are continuously selected along the increasing or decreasing arrangement sequence of the key value rows of the digital abstract by taking the intermediate values in the key value rows of the digital abstract as starting points according to the comparison result of the intermediate values in the key value rows of the digital abstract and the digital abstract, and the previous step is repeated.
In summary, by matching and retrieving the encrypted data request instruction sent by the client with the digital abstract thereof, partial decryption-free processing of the data request of the user is realized, the problem of great delay of internet response in a high concurrency state is solved, and the response speed of the user request is improved.
The above description of illustrated embodiments of the invention, including what is described in the abstract of the specification, is not intended to be exhaustive or to limit the invention to the precise forms disclosed herein. While specific embodiments of, and examples for, the invention are described herein for illustrative purposes only, various equivalent modifications are possible within the spirit and scope of the present invention, as those skilled in the relevant art will recognize and appreciate. As indicated, these modifications may be made to the present invention in light of the foregoing description of illustrated embodiments of the present invention and are to be included within the spirit and scope of the present invention.
The systems and methods have been described herein in general terms as the details aid in understanding the invention. Furthermore, various specific details have been given to provide a general understanding of the embodiments of the invention. One skilled in the relevant art will recognize, however, that an embodiment of the invention can be practiced without one or more of the specific details, or with other apparatus, systems, assemblies, methods, components, materials, parts, and/or the like. In other instances, well-known structures, materials, and/or operations are not specifically shown or described in detail to avoid obscuring aspects of embodiments of the invention.
Thus, although the present invention has been described herein with reference to particular embodiments thereof, a latitude of modification, various changes and substitutions are intended in the foregoing disclosures, and it will be appreciated that in some instances some features of the invention will be employed without a corresponding use of other features without departing from the scope and spirit of the invention as set forth. Thus, many modifications may be made to adapt a particular situation or material to the essential scope and spirit of the present invention. It is intended that the invention not be limited to the particular terms used in following claims and/or to the particular embodiment disclosed as the best mode contemplated for carrying out this invention, but that the invention will include any and all embodiments and equivalents falling within the scope of the appended claims. Accordingly, the scope of the invention is to be determined solely by the appended claims.
Claims (10)
1. A method for monitoring and distributing Internet resources facing to high concurrent data requests is characterized by comprising the following steps,
acquiring a plurality of encrypted data request instructions sent by a client;
temporarily storing the encrypted data request instruction in a pre-cache;
screening out the repeated encrypted data instructions in the preposed cache, and decrypting the repeated encrypted data instructions to obtain decrypted data request instructions;
executing the decryption data request instruction to obtain return data;
and returning the same return data to the client with the same encrypted data request instruction.
2. The method according to claim 1, wherein the step of obtaining a plurality of encrypted data request commands sent by the client comprises,
acquiring the type of the decryption data request instruction;
acquiring the type of the returned data;
and if the client side sending the encryption request instruction does not have the condition of browsing the corresponding returned data according to a set rule, the decryption data request instruction is not executed.
3. The method according to claim 1, wherein the step of obtaining a plurality of encrypted data request commands sent by the client comprises,
acquiring the type of the decryption data request instruction;
acquiring the content of the return data;
and if the content of the returned data comprises user privacy information according to a set rule, the data decryption request instruction is not executed.
4. The method according to any one of claims 1 to 3, wherein the step of screening out the repeated encrypted data instructions in the pre-cache to decrypt the repeated encrypted data instructions therein to obtain a decrypted data request instruction comprises,
obtaining the mapping between the encrypted data command and the decrypted data request command;
extracting a digital abstract of the encrypted data instruction;
constructing a mapping database of the digital abstract and the corresponding decryption data request instruction;
identifying the encrypted data instruction with the same digital abstract as the decrypted encrypted data instruction with the same decrypted data request instruction;
acquiring the encrypted data instruction in real time, and extracting the digital abstract of the encrypted data instruction;
searching whether a mapping database of the digital abstract and the corresponding decryption data request instruction exists or not according to the digital abstract;
if yes, acquiring the decryption data request instruction corresponding to the digital abstract;
and if the digital abstract does not exist, decrypting the encrypted data request instruction corresponding to the digital abstract to obtain a decrypted data request instruction, and adding the digital abstract and the decrypted data request instruction to a mapping database of the digital abstract and the corresponding decrypted data request instruction.
5. The method of claim 4, wherein said step of extracting a digital digest of said encrypted data instruction comprises,
acquiring the number of the encrypted data request instructions in the pre-cache in real time;
acquiring the increasing or decreasing speed of the encrypted data request instruction in the pre-cache;
acquiring the set upper limit of the number of the encrypted data request instructions in the pre-cache;
taking the number of the encrypted data request instructions in the pre-cache as a lower limit of integral, and integrating the increasing or decreasing speed of the encrypted data request instructions in the pre-cache to obtain the number of the encrypted data request instructions in the expected pre-cache;
if the number of the encrypted data request instructions in the expected pre-cache exceeds the set upper limit of the number of the encrypted data request instructions in the pre-cache, reducing the number of bits of the digital summary;
if the number of the encrypted data request instructions in the expected pre-cache is lower than the set upper limit of the number of the encrypted data request instructions in the pre-cache, increasing the number of bits of the digital summary.
6. The method of claim 4, wherein said step of extracting a digital digest of said encrypted data instruction comprises,
acquiring the decrypted data request instruction corresponding to the encrypted data request instruction;
acquiring response time for executing the decrypted data request instruction to obtain the returned data;
acquiring the response time required for executing the encrypted data request instruction in the pre-cache in real time;
acquiring the increasing or decreasing speed of the response time;
acquiring set response time;
taking the response time required for executing the encrypted data request instruction in the pre-cache as a lower limit of integral, and integrating the increasing or decreasing speed of the response time to obtain the expected response time required for expecting to execute the encrypted data request instruction in the pre-cache;
if the expected response time exceeds the upper limit of the set response time, reducing the digit of the digital abstract;
if the expected response time is lower than the upper limit of the set response time, increasing the number of bits of the digital summary.
7. The method according to claim 5 or 6, wherein the number of bits of the digital abstract is inserted into a set range.
8. The method according to claim 5 or 6, wherein the digital digests with different numbers of bits obtained by the same encrypted data request instruction are mapped one-to-one.
9. The method of claim 4, wherein said step of retrieving, based on said digital digest, whether a mapping database exists between said digital digest and a corresponding one of said decrypted data request instructions, comprises,
extracting the digital abstract and the digital abstract in a mapping database of the corresponding decryption data request instruction to serve as key values;
reordering the mapping databases of the digital digests and the corresponding decryption data request instructions in ascending or descending order of the digital digests to obtain a sequential mapping database;
comparing the digital abstract corresponding to the real-time acquired encrypted data instruction with the digital abstract key value column in the sequence mapping database to acquire a size comparison result of the digital abstract and the digital abstract key value column;
according to the size comparison result of the digital abstract and the digital abstract key value row, continuously comparing the digital abstract and the digital abstract key value row along the increasing or decreasing arrangement sequence of the digital abstract key value row;
until the decryption data request instruction corresponding to the digital abstract in a sequential mapping database is obtained, or the digital abstract is judged not to exist in the mapping database of the digital abstract and the corresponding decryption data request instruction.
10. The method of claim 9, wherein the step of continuing to compare the digital abstract with the numeric abstract key value column according to the size comparison result of the numeric abstract and the numeric abstract key value column along the ascending or descending arrangement order of the numeric abstract key value column comprises,
comparing the size of the digital abstract with the middle value in the key value column of the digital abstract;
if the digital abstract is the same as the middle value in the key value column of the digital abstract, taking the decryption data request instruction corresponding to the middle value in the key value column of the digital abstract as the decryption data request instruction corresponding to the digital abstract;
if the intermediate values in the digital abstract and the digital abstract key value row are different, the intermediate values in the digital abstract key value row are continuously selected along the increasing or decreasing arrangement sequence of the digital abstract key value row by taking the intermediate values in the digital abstract key value row as the starting points according to the comparison result of the intermediate values in the digital abstract and the digital abstract key value row, and the previous step is repeated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210092956.3A CN114422259B (en) | 2022-01-26 | 2022-01-26 | Internet resource monitoring and distributing method facing high concurrent data request |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210092956.3A CN114422259B (en) | 2022-01-26 | 2022-01-26 | Internet resource monitoring and distributing method facing high concurrent data request |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114422259A true CN114422259A (en) | 2022-04-29 |
| CN114422259B CN114422259B (en) | 2022-10-28 |
Family
ID=81276816
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210092956.3A Active CN114422259B (en) | 2022-01-26 | 2022-01-26 | Internet resource monitoring and distributing method facing high concurrent data request |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114422259B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105893862A (en) * | 2015-09-14 | 2016-08-24 | 乐视致新电子科技（天津）有限公司 | Browser cache data protection method and device |
| US9843590B1 (en) * | 2016-06-10 | 2017-12-12 | Cloudflare, Inc. | Method and apparatus for causing a delay in processing requests for internet resources received from client devices |
| CN112436943A (en) * | 2020-10-29 | 2021-03-02 | 南阳理工学院 | Request deduplication method, device, equipment and storage medium based on big data |
| CN113595925A (en) * | 2021-07-06 | 2021-11-02 | 中企云链（北京）金融信息服务有限公司 | Intelligent gateway dynamic current limiting implementation method |
| CN113922952A (en) * | 2021-09-30 | 2022-01-11 | 平安普惠企业管理有限公司 | Access request response method, device, computer equipment and storage medium |
-
2022
- 2022-01-26 CN CN202210092956.3A patent/CN114422259B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105893862A (en) * | 2015-09-14 | 2016-08-24 | 乐视致新电子科技（天津）有限公司 | Browser cache data protection method and device |
| US9843590B1 (en) * | 2016-06-10 | 2017-12-12 | Cloudflare, Inc. | Method and apparatus for causing a delay in processing requests for internet resources received from client devices |
| CN112436943A (en) * | 2020-10-29 | 2021-03-02 | 南阳理工学院 | Request deduplication method, device, equipment and storage medium based on big data |
| CN113595925A (en) * | 2021-07-06 | 2021-11-02 | 中企云链（北京）金融信息服务有限公司 | Intelligent gateway dynamic current limiting implementation method |
| CN113922952A (en) * | 2021-09-30 | 2022-01-11 | 平安普惠企业管理有限公司 | Access request response method, device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114422259B (en) | 2022-10-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11775492B2 (en) | Query-as-a-service system that provides query-result data to remote clients | |
| WO2019095416A1 (en) | Information pushing method and apparatus, and terminal device and storage medium | |
| CN104104717B (en) | Deliver channel data statistical approach and device | |
| US10509772B1 (en) | Efficient locking of large data collections | |
| US10169455B2 (en) | Systems and methods for addressing a media database using distance associative hashing | |
| US10366053B1 (en) | Consistent randomized record-level splitting of machine learning data | |
| US9298775B2 (en) | Changing the compression level of query plans | |
| US11128606B2 (en) | Client fingerprinting for information system security | |
| US11553196B2 (en) | Media storage | |
| US20170078361A1 (en) | Method and System for Collecting Digital Media Data and Metadata and Audience Data | |
| CN110620657A (en) | Webpage word processing method, system and device | |
| US20220121652A1 (en) | Parallel Stream Processing of Change Data Capture | |
| US20240095170A1 (en) | Multi-cache based digital output generation | |
| WO2017093990A1 (en) | A method and system for securing a client's access to a drm agent's services for a video player | |
| US11119996B2 (en) | System and method of bloom filter for big data | |
| US9338220B1 (en) | System and method to anonymize data transmitted to a destination computing device | |
| CN114422259B (en) | Internet resource monitoring and distributing method facing high concurrent data request | |
| US20220107931A1 (en) | Storing an ordered associative array of pairs using an append-only storage medium | |
| WO2020192012A1 (en) | Data processing method and apparatus, and storage medium | |
| Park et al. | A Study on the Link Server Development Using B-Tree Structure in the Big Data Environment | |
| CN111651425A (en) | Data extraction method and device for data mart, terminal and storage medium | |
| US10235432B1 (en) | Document retrieval using multiple sort orders | |
| KR102236521B1 (en) | Method and apparatus for processing data | |
| JP2015088089A (en) | Recommendation server and recommendation method | |
| CN104504156B (en) | A kind of textstream methods of sampling based on compressive sensing theory |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |