CN112491996A - Method and device for generating service request - Google Patents
Method and device for generating service request Download PDFInfo
- Publication number
- CN112491996A CN112491996A CN202011292146.XA CN202011292146A CN112491996A CN 112491996 A CN112491996 A CN 112491996A CN 202011292146 A CN202011292146 A CN 202011292146A CN 112491996 A CN112491996 A CN 112491996A
- Authority
- CN
- China
- Prior art keywords
- timestamp
- node
- service request
- service
- random number
- 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
- 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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/133—Protocols for remote procedure calls [RPC]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
-
- 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/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
The embodiment of the invention provides a method and a device for generating a service request. The current timestamp is intercepted according to the effective digit of the timestamp, so that the digit of the intercepted current timestamp is smaller than the digit of the current timestamp, that is, the method does not select all timestamps to generate the RS, but only selects the effective part of the timestamp to generate the RS, so that the method can help to reduce the length of the RS, and further can reduce the transmission bandwidth and the storage resources wasted by the RS during transmission and storage.
Description
Technical Field
The embodiment of the invention relates to the field of financial technology (Fintech) and block chains, in particular to a method and a device for generating a service request.
Background
With the development of computer technology, more and more technologies (Blockchain, distributed, big data, etc.) are applied in the financial field, and the traditional financial industry is gradually changing to financial technology, but due to the requirements of security and real-time performance of the financial industry, higher requirements are also put forward on the technologies.
In the prior art, when filtering the repeated request, the client typically generates an RS (Random String) when sending the request. And when the server receives the request, extracting the time stamp from the RS, and determining a time difference value based on the time stamp and the current time stamp of the server. And then when the time difference is determined to be smaller than the overtime, judging whether the RS exists at the server side, if so, determining that the request is a repeated request, and not processing the request. However, the RS generated by this processing method carries redundant information, so that the length of the RS is too long, and thus more transmission bandwidth and storage resources are wasted on transmission and storage of the RS.
In summary, there is a need for a method for generating a service request to reduce the transmission bandwidth and the storage resources wasted by the RS during transmission and storage.
Disclosure of Invention
The embodiment of the invention provides a method and a device for generating a service request, which are used for reducing the transmission bandwidth and the storage resource wasted by RS during transmission and storage.
In a first aspect, an embodiment of the present invention provides a method for generating a service request, including:
the client node generates a current timestamp and a random number corresponding to the service request;
the client node intercepts the current timestamp based on the timestamp effective digit indicated by the server node to obtain a first timestamp; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request;
the client node generates a random character string RS according to the length indication of the first time stamp, the first time stamp and the random number;
the client node sends a service request carrying the RS to the server node; the RS is for the server end node to determine whether the service request is executable.
In the technical scheme, the current timestamp is intercepted and processed through the timestamp effective digit indicated by the server end node, and the first timestamp is obtained. And generating a random string RS according to the length indication of the first time stamp, the first time stamp and the random number. And then sending a service request carrying an RS to the service end node, wherein the RS is used for determining whether the service request is executable or not by the service end node. The current timestamp is intercepted according to the effective digit of the timestamp, so that the digit of the intercepted current timestamp is smaller than the digit of the current timestamp, that is, the method does not select all timestamps to generate the RS, but only selects the effective part of the timestamp to generate the RS, so that the method can help to reduce the length of the RS, and further can reduce the transmission bandwidth and the storage resources wasted by the RS during transmission and storage.
Optionally, the generating, by the client node, a random number includes:
the client node generates the random number based on the significand of the random number indicated by the server node; the number of significant digits of the random number is determined by the service end node based on the concurrency of service requests within a set time duration.
In the above technical solution, since the significant digit of the random number is determined by the service end node based on the concurrency of the service requests in the set time length, and the concurrency of the service requests in the set time length is dynamically changed, based on this, the significant digit of the random number is also dynamically changed and is not fixed or unchanged, so that it can be avoided that the RS wastes more transmission bandwidth and storage resources in transmission and storage due to the fixed bit of the random number in the prior art.
Optionally, the client node generates a random string RS according to the length indication of the first timestamp, the first timestamp and the random number, including:
the client node carries out conversion processing on the first timestamp according to a binary conversion rule to obtain a first character string, and carries out conversion processing on the random number to obtain a second character string; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits occupied by the second character string is less than that occupied by the random number;
the client node determines a length indication of the first timestamp from the first string;
and the client node sequentially splices the length indication of the first timestamp, the first character string and the second character string to obtain the RS.
In the above technical solution, the first timestamp is converted according to the binary conversion rule to obtain the first character string, and the random number is converted to obtain the second character string. And splicing the length indication of the first timestamp, the first character string and the second character string in sequence to obtain the RS. Because the number of bits occupied by the first character string is less than the number of bits occupied by the first time stamp and the number of bits occupied by the second character string is less than the number of bits occupied by the random number, the first time stamp and the random number are converted, which can help to further compress the length of the character, so that the length of the generated RS can be further reduced, and the transmission bandwidth and the storage resource which are wasted when the RS is transmitted and stored can be reduced.
Optionally, before the client node generates the current timestamp and the random number corresponding to the service request, the method further includes:
the client node obtains the timestamp significand and the random number significand from the server node.
In the above technical solution, before the current timestamp corresponding to the service request is generated, the timestamp significant digit and the random number significant digit are acquired from the server side node, which can help the client side node to generate the valid part of the corresponding timestamp and the random number in time according to the timestamp significant digit and the random number significant digit, so as to provide support for the subsequent timely generation of the RS.
Optionally, the client node obtaining the nonce significand from the server node, comprising:
the client node periodically obtains the random number significand from the server end node.
In the technical scheme, the client node can update the local effective digit of the random number in time based on the changed effective digit of the random number by periodically acquiring the effective digit of the random number from the server node, and can accurately generate the RS in time based on the changed effective digit of the random number.
In a second aspect, an embodiment of the present invention provides a method for generating a service request, including:
a service end node receives a service request sent by a client end node; the service request carries a random character string RS; the RS is generated by the client node according to the length indication of the first timestamp, the first timestamp and the random number; the first timestamp is obtained by intercepting the current timestamp by the client node based on the timestamp effective digit indicated by the server node; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; the current timestamp and the nonce are generated by the client node based on the service request;
the service end node determines whether the service request is executable.
In the technical scheme, the service end node receives the service request sent by the client end node and determines whether the service request can be executed or not. The first timestamp in the RS is obtained by intercepting the current timestamp by the client node based on the timestamp effective digit indicated by the server node, so that the digit of the intercepted current timestamp is less than that of the current timestamp, that is, not all timestamps are selected for generating the RS, but only the effective part of the timestamp is selected for generating the RS, which can help to reduce the length of the RS, thereby reducing the transmission bandwidth and the storage resources wasted by the RS during transmission and storage.
Optionally, the determining, by the service end node, whether the service request is executable comprises:
the server-side node analyzes the RS to obtain a first character string, converts the first character string according to a system conversion rule to obtain a first time stamp, and determines the digit of the first time stamp; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits of the first timestamp is the same as the timestamp significance;
the server-side node intercepts a local current timestamp based on the number of bits of the first timestamp to obtain a second timestamp, and processes the first timestamp and the second timestamp to obtain a time difference value; the local current timestamp is generated when the service end node receives the service request sent by the client node;
the service end node determines whether the time difference value is less than or equal to the effective time length of the service request;
after the service end node determines that the time difference is less than or equal to the effective duration of the service request, determining whether the RS is cached locally;
and if so, the service end node determines the service request to be an unexecutable request, otherwise, the service request is determined to be an executable request.
In the technical scheme, the local current timestamp is intercepted and processed through the digit based on the first timestamp to obtain the second timestamp, and the first timestamp and the second timestamp are processed to obtain the time difference value. Determining whether the RS is cached locally or not after the time difference is determined to be less than or equal to the effective duration of the service request, and if the RS is cached locally, determining that the service request is an unexecutable request; if not, the service request is determined to be an executable request. As such, whether the service request is a repetitive request can be determined quickly and accurately based on the RS. In addition, the length of the RS is greatly reduced, so that the waste of storage resources of the service end node can be avoided, and the storage pressure of the service end node can be relieved.
Optionally, before the server end node receives the service request sent by the client node, the method further includes:
the service end node sets the effective duration of the service request;
the service end node processes the effective duration of the service request, determines a time value corresponding to the effective duration of the service request and determines the digit of the time value;
and the server node adds the digit of the time value with 1 to determine the effective digit of the timestamp.
According to the technical scheme, the effective duration of the service request is set based on the service end node, the effective digit of the timestamp is calculated, and support can be provided for the follow-up client node to timely and accurately determine the effective part of the timestamp based on the effective digit of the timestamp. In addition, since not all the time stamps are selected for generating the RS, only a valid portion of the time stamps are selected for generating the RS, which can help to reduce the length of the RS.
Optionally, the analyzing, by the server end node, the RS to obtain a first character string includes:
the server end node obtaining an indication of the length of the first timestamp;
and the server end node processes the RS based on the length indication of the first timestamp to determine the first character string.
Optionally, after the server end node receives the service request sent by the client node, the method further includes:
the service end node counts service requests sent by the client end node within a set time length based on a request timer;
the server end node periodically determines the significance of the random number based on the statistic value of the request timer; the random number significand is used for the client node to generate a second character string according with the random number significand; the number of bits occupied by the second character string is less than the number of bits occupied by the random number.
In the above technical solution, by setting the request timer, the service request sent by the client node is counted in real time, and the number of significant digits of the random number can be calculated in real time based on the real-time statistical value of the request timer, that is, the number of significant digits of the random number is dynamically changed and is not fixed or unchanged, so that it is possible to avoid that the RS wastes more transmission bandwidth and storage resources in transmission and storage due to the fact that the number of significant digits of the random number is fixed or unchanged in the prior art.
Optionally, the determining, by the serving end node, a significand of a random number based on the value of the request timer includes:
the server-end node acquires the current statistic value of the request timer;
the server node determines the ratio of the current statistic value of the request timer to a set duration as a first request value;
the server node determines the ratio of the first request value to a preset conflict probability as a second request value;
the server-side node converts the second request value into a third character string according to a system conversion rule and determines the digit of the third character string; the number of bits of the third string is the random number significand.
In the technical scheme, the value of the request timer is counted in real time, the second request value can be dynamically calculated based on the current statistic value, the set duration and the preset collision probability of the request timer, the second request value is processed according to the system conversion rule, the effective digit of the dynamically-changed random number can be timely and accurately determined, and the support for subsequent timely adjustment of the length of the RS is facilitated, so that more transmission bandwidth and storage resources are prevented from being wasted on transmission and storage of the RS due to the fact that the digit of the random number is fixed in the prior art.
In a third aspect, an embodiment of the present invention provides an apparatus for generating a service request, including:
the generating unit is used for generating a current timestamp and a random number corresponding to the service request;
the first processing unit is used for intercepting the current timestamp based on the timestamp effective digit indicated by the service end node to obtain a first timestamp; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; generating a random string RS according to the length indication of the first timestamp, the first timestamp and the random number; sending a service request carrying the RS to the service end node; the RS is for the server end node to determine whether the service request is executable.
Optionally, the first processing unit is specifically configured to:
generating the random number based on the significand of the random number indicated by the service end node; the number of significant digits of the random number is determined by the service end node based on the concurrency of service requests within a set time duration.
Optionally, the first processing unit is specifically configured to:
according to a binary conversion rule, performing conversion processing on the first timestamp to obtain a first character string, and performing conversion processing on the random number to obtain a second character string; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits occupied by the second character string is less than that occupied by the random number;
determining a length indication of the first timestamp according to the first character string;
and splicing the length indication of the first timestamp, the first character string and the second character string in sequence to obtain the RS.
Optionally, the first processing unit is further configured to:
and acquiring the timestamp significand and the random number significand from the service end node.
Optionally, the first processing unit is further configured to:
periodically obtaining the nonce significand from the serving end node.
In a fourth aspect, an embodiment of the present invention provides an apparatus for generating a service request, including:
the receiving unit is used for receiving a service request sent by a client node; the service request carries a random character string RS; the RS is generated by the client node according to the length indication of the first timestamp, the first timestamp and the random number; the first timestamp is obtained by intercepting the current timestamp by the client node based on the timestamp effective digit indicated by the server node; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; the current timestamp and the nonce are generated by the client node based on the service request;
a second processing unit to determine whether the service request is executable.
Optionally, the second processing unit is specifically configured to:
analyzing the RS to obtain a first character string, converting the first character string according to a system conversion rule to obtain a first time stamp, and determining the digit of the first time stamp; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits of the first timestamp is the same as the timestamp significance;
intercepting a local current timestamp based on the number of bits of the first timestamp to obtain a second timestamp, and processing the first timestamp and the second timestamp to obtain a time difference value; the local current timestamp is generated when the service end node receives the service request sent by the client node;
determining whether the time difference is less than or equal to the effective duration of the service request;
after the time difference is determined to be less than or equal to the effective duration of the service request, determining whether the RS is cached locally;
if so, determining that the service request is a non-executable request, otherwise, determining that the service request is an executable request.
Optionally, the second processing unit is further configured to:
setting the effective duration of the service request;
processing the effective duration of the service request, determining a time value corresponding to the effective duration of the service request, and determining the digit of the time value;
and adding the digit of the time value and 1 to determine the effective digit of the timestamp.
Optionally, the second processing unit is specifically configured to:
obtaining an indication of a length of the first timestamp;
and processing the RS based on the length indication of the first timestamp to determine the first character string.
Optionally, the second processing unit is further configured to:
counting service requests sent by the client nodes within a set time length based on a request timer;
periodically determining a random number significand based on the statistics of the request timer; the random number significand is used for the client node to generate a second character string according with the random number significand; the number of bits occupied by the second character string is less than the number of bits occupied by the random number.
Optionally, the second processing unit is further configured to:
acquiring the current statistic value of the request timer;
determining the ratio of the current statistic value of the request timer to the set duration as a first request value;
determining the ratio of the first request value to a preset conflict probability as a second request value;
converting the second request value into a third character string according to a system conversion rule, and determining the digit of the third character string; the number of bits of the third string is the random number significand.
In a fifth aspect, an embodiment of the present invention provides a computing device, including:
a memory for storing a computer program;
and the processor is used for calling the computer program stored in the memory and executing the method for generating the service request according to the obtained program.
In a sixth aspect, an embodiment of the present invention provides a computer-readable storage medium storing a computer-executable program for causing a computer to execute a method of generating a service request.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be 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 to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic diagram of a system architecture according to an embodiment of the present invention;
fig. 2 is a flowchart illustrating a method for generating a service request according to an embodiment of the present invention;
FIG. 3 is a diagram of an RS according to an embodiment of the present invention;
fig. 4 is a schematic structural diagram of an apparatus for generating a service request according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of another apparatus for generating a service request according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention clearer, the present invention will be described in further detail with reference to the accompanying drawings, and it is apparent that the described embodiments are only a part of the embodiments of the present invention, 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 following, some terms related to the embodiments of the present invention are first explained to facilitate understanding by those skilled in the art.
Requesting: a Client node (Client) initiates an RPC (Remote Procedure Call) Call to a Server node (Server), i.e. a system initiates a request Call to another system.
Request number: total amount requested over a period of time.
Repeating the request: the same request, the server node, receives multiple times. Typically due to network instability, code logic errors, retry mechanisms of the underlying communication framework, etc.
Time difference value: the absolute value of the difference between the local time of the server-end node and the Timestamp in the request.
Time-out time: a time threshold (e.g., 5 minutes) configured by the service end node. Wherein the service end node only processes the request with the time difference value of the service end node within the configuration time range.
And (3) expiration time: the server-side node sets an expiration time when it saves the RS (Random String, Random String transmitted upon request, typically Timestamp + Nonce concatenation). And after the expiration time is reached, the RS stored by the server can be deleted, so that the storage resources of the server are saved. The expiration time, typically by default, is equal to the timeout time. Wherein Timestamp represents a Timestamp, also called Timestamp, in milliseconds (Millisecond); nonce denotes a random or pseudo-random number used to filter repeat requests.
Random character string: when sending a request, the client node carries an RS, and the server node judges whether the current request is a repeated request according to the RS.
High concurrency: the value of QPS (measures per second, requests per second, in meters/sec) in the system is large, usually exceeding ten thousand meters per second, e.g., 10000000 meters/sec.
Concurrent maximum peak: refers to the maximum value of QPS in a system.
Conflict: when data is randomly generated, different random generators generate the same result.
And (3) collision probability: when data is randomly generated, the probability of the same result is generated. Such as one in ten thousandth.
Number of bits: the length of one character data.
As described above, some terms related to the embodiments of the present invention are described, and the technical features related to the embodiments of the present invention are described below.
To facilitate understanding of the embodiments of the present invention, fig. 1 is a system architecture provided in the embodiments of the present invention. As shown in fig. 1, the system architecture may be a server 100 including a processor 110, a communication interface 120, and a memory 130.
The communication interface 120 is used for communicating with a terminal device, and transceiving information transmitted by the terminal device to implement communication. The terminal equipment can be a mobile phone, a notebook computer, a tablet computer and the like; the user may initiate a request to the server using a client node on the terminal device.
The processor 110 is a control center of the server 100, connects various parts of the entire server 100 using various interfaces and lines, performs various functions of the server 100 and processes data by running or executing software programs and/or modules stored in the memory 130 and calling data stored in the memory 130. Alternatively, processor 110 may include one or more processing units.
The memory 130 may be used to store software programs and modules, and the processor 110 executes various functional applications and data processing by operating the software programs and modules stored in the memory 130. The memory 130 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to a business process, and the like. Further, the memory 130 may include high speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device.
It should be noted that the structure shown in fig. 1 is only an example, and the embodiment of the present invention is not limited thereto.
Based on the above description, fig. 2 exemplarily shows a flow of a method for generating a service request according to an embodiment of the present invention, and the flow may be performed by an apparatus for generating a service request.
As shown in fig. 2, the process specifically includes:
And step 202, the service end node processes the effective duration of the service request and determines the effective digit of the timestamp.
Step 203, the service end node sends the timestamp valid bit to the client end node.
Step 204, the client node generates a current timestamp and a random number corresponding to the service request.
And step 205, the client node intercepts the current timestamp based on the timestamp effective digit indicated by the server node to obtain a first timestamp.
In step 206, the client node generates a random string RS according to the length indication of the first timestamp, the first timestamp and the random number.
Step 207, the client node sends the service request carrying the RS to the server node.
At step 208, the service end node determines if the service request is executable.
In the above steps 201, 202 and 203, before the service end node receives the service request sent by the client end node, the client end node needs to obtain the time stamp significant digit from the service end node and periodically obtain the random number significant digit from the service end node, so that the client end node can generate the corresponding valid part of the time stamp and the random number according to the time stamp significant digit and the random number significant digit in time, so as to provide support for the subsequent generation of the RS in time. Specifically, the service end node sets the effective duration of the service request, processes the effective duration of the service request, determines a time value corresponding to the effective duration of the service request, and determines the bit number of the time value. And adding the digit of the time value and 1 to determine the effective digit of the time stamp. And then setting a request timer, counting the service request sent by the client node in real time, and calculating the effective digit of the random number in real time based on the real-time counting value of the request timer. Therefore, the effective duration of the service request is set based on the service end node, the effective digit of the timestamp is calculated, and support can be provided for the follow-up client node to timely and accurately determine the effective part of the timestamp based on the effective digit of the timestamp. In addition, since not all the time stamps are selected for generating the RS, only a valid portion of the time stamps are selected for generating the RS, which can help to reduce the length of the RS. The effective duration of the service request set by the server-side node may be regarded as the timeout time set by the server-side node, and in an actual application scenario, the effective duration may be set according to an actual requirement.
In step 204, the client node generates a corresponding service request according to actual requirements after being started. When generating a service request, it is necessary to generate a current timestamp and a random number corresponding to the service request. Wherein the random number is generated by the client node based on the significand of the random number indicated by the server node; the number of significant digits of the random number is determined by the serving end node based on the amount of concurrency of service requests within a set duration.
Based on this, the specific process of determining the significant digit of the random number according to the concurrency of the service requests in the set time length is as follows:
a. and the service end node counts the service requests sent by the client end node within the set time length based on the request timer.
b. The server end node obtains the current statistics of the request timer.
c. And the server node determines the ratio of the current statistic value of the request timer to the set time length as a first request value.
d. And the server node determines the ratio of the first request value to the preset conflict probability as a second request value.
e. And the service end node converts the second request value into a third character string according to the system conversion rule and determines the digit of the third character string. Wherein the digit of the third string is the significant digit of the random number.
In the above step 205, step 206 and step 207, the client node intercepts the current timestamp based on the valid number of the timestamp indicated by the server node, so as to obtain the first timestamp. And then according to the scale conversion rule, carrying out conversion processing on the first time stamp to obtain a first character string, carrying out conversion processing on the random number to obtain a second character string, and determining the length indication of the first time stamp according to the first character string. And then splicing the length indication of the first timestamp, the first character string and the second character string in sequence to obtain the RS. And after the RS is generated, sending a service request carrying the RS to the service end node. Wherein, the number of bits occupied by the first character string is less than that occupied by the first time stamp; the number of bits occupied by the second character string is less than the number of bits occupied by the random number. Therefore, the number of bits occupied by the first character string is less than that of the first time stamp, and the number of bits occupied by the second character string is less than that of the random number, so that the first time stamp and the random number are converted, the length of the character can be further compressed, the length of the generated RS can be further reduced, and the transmission bandwidth and the storage resource which are wasted by the RS during transmission and storage can be reduced.
In the step 208, after receiving the service request sent by the client node, the server node performs parsing on the RS to obtain the first character string. That is, the length indication of the first timestamp is obtained, and based on the length indication of the first timestamp, the RS is processed to determine the first character string. And then, converting the first character string according to a system conversion rule to obtain a first time stamp, and determining the digit of the first time stamp. Then, intercepting the local current timestamp based on the digit of the first timestamp to obtain a second timestamp, processing the first timestamp and the second timestamp to obtain a time difference value, determining whether the time difference value is less than or equal to the effective duration of the service request, and if the time difference value is greater than the effective duration of the service request, returning request timeout to the client node; and if the time difference is less than or equal to the effective duration of the service request, determining whether the RS is cached locally. If so, determining the service request as a non-executable request, otherwise determining the service request as an executable request. Wherein the local current timestamp is generated by the server node when receiving the service request sent by the client node. Therefore, the first timestamp in the RS is obtained by intercepting the current timestamp by the client node based on the timestamp effective digit indicated by the server node, so that the digit of the intercepted current timestamp is less than that of the current timestamp, that is, not all timestamps are selected for generating the RS, but only the effective part of the timestamp is selected for generating the RS, which can help to reduce the length of the RS, thereby reducing the transmission bandwidth and the storage resources wasted by the RS during transmission and storage.
In view of this, the following describes an implementation procedure for generating a service request in the embodiment of the present invention.
In the prior art, when a client node sends a service request, an RS is generated, and the RS is composed of a Timestamp and a Nonce. However, since the Timestamp generated by the user end has 13 bits, the Timestamp in the RS also uses the entire 13 bits when storing and transmitting the service request. Meanwhile, the Nonce generated by the client node is a random number in 10 systems, and in a high concurrency scenario, the number of bits of the Nonce generated is relatively long in order to reduce the collision probability. It should be noted that, since the length of Nonce is a fixed length obtained by the service end node according to the concurrent maximum peak and collision probability, the service end node cannot dynamically modify the length of Nonce based on the dynamic change of the concurrent QPS, and thus the number of bits of Nonce is long. Based on this, the length of the RS generated in the prior art is too long, which results in that the RS wastes more transmission bandwidth and storage resources in transmission and storage. In view of this problem, in the embodiment of the present invention, the Timestamp generated by the client node is intercepted based on the Timestamp significant bit determined by the server node, so as to remove invalid information in the Timestamp, so that the valid information in the Timestamp is reserved, which is beneficial to reducing the memory and transmission bandwidth occupied by the Timestamp in the RS during storage and transmission. And dynamically adjusting the digit of the Nonce based on the dynamic change of the QPS, and simultaneously, converting the intercepted effective information in the Timestamp and the random number generated based on the changed Nonce according to a conversion system rule, so that the length of the generated RS is further reduced, and the transmission bandwidth and the storage resource wasted by the RS during transmission and storage can be reduced.
Step 1: the service end node configures the effective time (timeout) to be V minutes and configures the initial digit of the Nonce to be L.
Illustratively, the server end node in the embodiment of the present invention configures the timeout time to be 5 minutes, and configures the initial digit of the Nonce to be 3. Wherein, the digit of Nonce is automatically adjusted according to the value of concurrent QPS.
Step 2: and the service end node determines the effective digit of the Timestamp according to the effective time.
Illustratively, the service end node calculates the valid bit of the Timestamp according to the number of milliseconds corresponding to the valid time V, namely, the number of bits of the number of milliseconds corresponding to V60 × 1000 is added by 1. For example, if V is 5 minutes, and the corresponding number of milliseconds is V (ms) 5 60 1000 300000ms, the number of significant digits TLen of the Timestamp is 6+1 7.
Step 3: before sending a service request, a client node judges whether the valid bit TLen of Timestamp and the initial bit L of Nonce exist locally.
In the embodiment of the present invention, after the client node is started, it needs to determine whether the valid digit TLen of the Timestamp and the initial digit L of the Nonce exist in the local database. If so, generating the service request according to the significant digit TLen of the Timestamp and the initial digit L of the Nonce. And if the number of the significant digits TLen of the Timestamp and the initial digit L of the Nonce does not exist, a request is sent to the server node once to request the obtaining of the significant digits TLen of the Timestamp and the initial digit L of the Nonce, and the service request is generated after the obtaining of the significant digits TLen of the Timestamp and the initial digit L of the Nonce. It should be noted that, because the number of bits of Nonce in the embodiment of the present invention is dynamically changed, that is, the serving end node may count the number of requests sent by the client end node in real time, dynamically calculate the current QPS of the serving end node based on the number of requests counted in real time, and dynamically adjust the number of bits of Nonce based on the current QPS, the client end node may periodically obtain the number of bits of Nonce from the serving end node according to a preset duration, so that the client end node may generate the RS accurately in time based on the number of bits of Nonce. For example, the client node may request a number of bits of Nonce once per minute from the server node and update the locally stored number of bits of Nonce based on the number of bits of Nonce requested. In an actual application scenario, the preset time duration may be set according to an actual requirement, for example, the preset time duration is set to 30 seconds, 1 minute, 2 minutes, and the like, which is not limited in the embodiment of the present invention.
Step 4: the client node generates a service request.
In the embodiment of the invention, a client node generates a current Timestamp T corresponding to a service request, intercepts the current Timestamp T according to the significant number TLen of a Timestamp to obtain a first Timestamp, and converts the first Timestamp according to a binary conversion rule to obtain a first character string; and then randomly generating a random number based on the initial digit L of the Nonce, and converting the random number to obtain a second character string. Illustratively, after the current timestamp T is intercepted, the TLen bit is the CTime, and then the CTime is converted into the 62-ary system, so as to obtain the TReq, and the TReq is processed, so as to obtain the TReq bit number TLen 62. And then, randomly generating a 62-system random number with the length of L based on the initial digit number L of the Nonce. For example, the client node generates a service request with a current timestamp T of 1600503179621, TLen of 7, and L of 3. Then, the CTime of the last 7 bits of the current timestamp T is taken as 3179621, and the CTime is converted into a 62-system character string, so as to obtain the TReq, i.e., the TReq is dlad. Where the length tled TLen62 is 4. Then, based on the initial number L of nonces being 3, a 62-ary character string of length 3, i.e., nonces being Cd2, is randomly generated. And finally, sequentially splicing the TLen62, the TReq and the Nonce to generate a random character string RS, namely RS 4+ dlad + Cd2 4dladCd2, and generating a service request carrying the RS according to the RS. The schematic form of RS can be shown in fig. 3. In this way, since the number of bits of Nonce dynamically changes with the change of QPS and the current timestamp is intercepted based on the timestamp significance of the service end node, the length of the generated RS is reduced, and the random number and the CTime are converted into the 62-ary system, the character length can be further compressed, the length of the generated RS is further reduced, and the transmission bandwidth and the storage resource wasted by the RS during transmission and storage are reduced.
Step 5: the client node sends a service request to the server node.
When the client node sends a service request to the server-side node, the client node sends the service request carrying the RS to the server-side node.
Step 6: and the service end node receives the service request sent by the client end node and acquires the RS based on the service request. Wherein, when the service end node receives the service request sent by the client node, the RC value of the request timer of the service end node is increased by 1.
Illustratively, in the embodiment of the present invention, the service end node sets a request timer, and sets the request timer to periodically calculate the number of bits of the Nonce once according to a preset time length. That is, in the implementation, the service end node first divides the RC value by 60 to obtain the QPS. And dividing the value of the QPS by the preset conflict probability to obtain a new value of the QPS, and converting the new value of the QPS into a 62-system character string, namely obtaining the length of the 62-system character string. Wherein, the length of the 62-system character string is the number of digits of Nonce; in an actual application scenario, the preset time duration or the preset collision probability may be set according to an actual requirement, for example, the preset time duration is set to 30 seconds, 1 minute, 2 minutes, and the like, which is not limited in the embodiment of the present invention. For example, if the current RC value of the request timer is 600000000, the current RC value is divided by 60 to obtain QPS, i.e., QPS 600000000/60 10000000 latches/sec. Assuming that the preset collision probability is one ten thousandth, dividing QPS by the preset collision probability, that is, 10000000/(1/10000) ═ 1000000000000000, and converting 1000000000000000 into 62-ary, so as to obtain a 62-ary character string 1L9zO 9O. Then, based on 1L9zO9O, it can be found that the length of 1L9zO9O is 7, that is, the number of bits of Nonce is also 7 at this time. Therefore, the client node can conveniently acquire the digit of the changed Nonce in time, and can accurately generate the RS in time based on the digit of the changed Nonce. In addition, since the number of bits of Nonce dynamically changes with the change of QPS, this can help to avoid the RS wasting more transmission bandwidth and storage resources on transmission and storage due to the fixed number of bits of Nonce in the prior art.
Step 7: the service end node determines whether the service request sent by the client node is a repeated request based on the RS.
In the embodiment of the invention, the service end node analyzes the RS and judges whether the service request is a repeated request. The process of judging whether the service request is a repeated request specifically comprises the following steps:
a. the server end node reads the first bit TLen62 of the RS.
b. The server end node reads TLen62 from bit 2 consecutively as TReq based on TLen 62.
c. And the server node converts the TReq in the 62 system into the 10 system, namely, the CTime obtained from the client node is restored, and the digit LenCTime of the CTime is obtained.
d. And the server-side node acquires the local current Timestamp, and the number of LenCTime bits is STime. And then calculating the time difference TDiffabs of the CTime and the STime. And if the value of the TDifAbs is larger than the timeout time V, directly returning the request timeout to the client node, and not processing the service request. If the value of TDifAbs is less than or equal to a timeout time V, determining whether the RS is cached locally, if so, determining that the service request is a repeated request and rejecting the service request, if not, adding the RS to a service request processing queue of the service end node, setting an expiration time for the RS, wherein the expiration time can be V, and then processing the service request. On one hand, the expiration time of the RS is set so as to ensure that the service request is processed in time and no memory is occupied; on the other hand, the RS stored by the service end node is deleted in time after the expiration time of the RS is reached, so that the storage resource of the service end node can be prevented from being wasted, and the storage resource of the service end node can be saved.
It should be noted that, for the server-side node obtaining the local current Timestamp, the local current Timestamp may be directly obtained when the server-side node receives a service request sent by the client-side node, or the local current Timestamp may be obtained when the server-side node performs analysis processing on the RS or when the analysis processing on the RS is completed.
Illustratively, the RS received by the server is 4dladCd2, the 1 st bit TLen62 of the RS is read to be 4, that is, the bits from 2 nd to 6 th represent the CTime requested by the client node, the TReq is obtained as dlad, dlad is converted into 10-ary system, and the CTime is obtained, that is, the CTime is 3179621, and LenCTime is 7. Then, the current Timestamp is obtained as 1600503180621, and if the last 7(LenCTime is 7) bits are STime, the STime is obtained as 3180621. Then, the time difference TDiffAbs between the CTime and the STime is calculated, that is, TDiffAbs | STime-CTime |3180621 | 3179621| 1000ms, so it can be seen that 1000ms is less than the timeout time v (ms) — (300000 ms) configured by the service end node, and it is determined that the service request is within the valid time range. And if the TDifAbs is larger than the timeout time V, directly returning the request timeout to the client node. Then, it is determined whether the RS, i.e., RS 4dladCd2, is cached locally at the serving end node. If so, determining that the service request is a repeated request; if not, the RS is added to a service request processing queue of the service end node, and an expiration time V of 5 minutes is set for the RS.
The above embodiment shows that the current timestamp is intercepted based on the timestamp significant digit indicated by the service end node, so as to obtain the first timestamp. And generating a random string RS according to the length indication of the first time stamp, the first time stamp and the random number. And then sending a service request carrying an RS to the service end node, wherein the RS is used for determining whether the service request is executable or not by the service end node. The current timestamp is intercepted according to the effective digit of the timestamp, so that the digit of the intercepted current timestamp is smaller than the digit of the current timestamp, that is, the method does not select all timestamps to generate the RS, but only selects the effective part of the timestamp to generate the RS, so that the method can help to reduce the length of the RS, and further can reduce the transmission bandwidth and the storage resources wasted by the RS during transmission and storage.
Based on the same technical concept, fig. 4 exemplarily shows an apparatus for generating a service request, which may perform the flow of the method for generating a service request according to an embodiment of the present invention.
As shown in fig. 4, the apparatus includes:
a generating unit 401, configured to generate a current timestamp and a random number corresponding to the service request;
a first processing unit 402, configured to intercept the current timestamp based on a timestamp significant digit indicated by the server node, to obtain a first timestamp; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; generating a random string RS according to the length indication of the first timestamp, the first timestamp and the random number; sending a service request carrying the RS to the service end node; the RS is for the server end node to determine whether the service request is executable.
Optionally, the first processing unit 402 is specifically configured to:
generating the random number based on the significand of the random number indicated by the service end node; the number of significant digits of the random number is determined by the service end node based on the concurrency of service requests within a set time duration.
Optionally, the first processing unit 402 is specifically configured to:
according to a binary conversion rule, performing conversion processing on the first timestamp to obtain a first character string, and performing conversion processing on the random number to obtain a second character string; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits occupied by the second character string is less than that occupied by the random number;
determining a length indication of the first timestamp according to the first character string;
and splicing the length indication of the first timestamp, the first character string and the second character string in sequence to obtain the RS.
Optionally, the first processing unit 402 is further configured to:
and acquiring the timestamp significand and the random number significand from the service end node.
Optionally, the first processing unit 402 is further configured to:
periodically obtaining the nonce significand from the serving end node.
Based on the same technical concept, fig. 5 exemplarily shows an apparatus for generating a service request, which may perform the flow of the method for generating a service request according to an embodiment of the present invention.
As shown in fig. 5, the apparatus includes:
a receiving unit 501, configured to receive a service request sent by a client node; the service request carries a random character string RS; the RS is generated by the client node according to the length indication of the first timestamp, the first timestamp and the random number; the first timestamp is obtained by intercepting the current timestamp by the client node based on the timestamp effective digit indicated by the server node; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; the current timestamp and the nonce are generated by the client node based on the service request;
a second processing unit 502 for determining whether the service request is executable.
Optionally, the second processing unit 502 is specifically configured to:
analyzing the RS to obtain a first character string, converting the first character string according to a system conversion rule to obtain a first time stamp, and determining the digit of the first time stamp; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits of the first timestamp is the same as the timestamp significance;
intercepting a local current timestamp based on the number of bits of the first timestamp to obtain a second timestamp, and processing the first timestamp and the second timestamp to obtain a time difference value; the local current timestamp is generated when the service end node receives the service request sent by the client node;
determining whether the time difference is less than or equal to the effective duration of the service request;
after the time difference is determined to be less than or equal to the effective duration of the service request, determining whether the RS is cached locally;
if so, determining that the service request is a non-executable request, otherwise, determining that the service request is an executable request.
Optionally, the second processing unit 502 is further configured to:
setting the effective duration of the service request;
processing the effective duration of the service request, determining a time value corresponding to the effective duration of the service request, and determining the digit of the time value;
and adding the digit of the time value and 1 to determine the effective digit of the timestamp.
Optionally, the second processing unit 502 is specifically configured to:
obtaining an indication of a length of the first timestamp;
and processing the RS based on the length indication of the first timestamp to determine the first character string.
Optionally, the second processing unit 502 is further configured to:
counting service requests sent by the client nodes within a set time length based on a request timer;
periodically determining a random number significand based on the statistics of the request timer; the random number significand is used for the client node to generate a second character string according with the random number significand; the number of bits occupied by the second character string is less than the number of bits occupied by the random number.
Optionally, the second processing unit 502 is further configured to:
acquiring the current statistic value of the request timer;
determining the ratio of the current statistic value of the request timer to the set duration as a first request value;
determining the ratio of the first request value to a preset conflict probability as a second request value;
converting the second request value into a third character string according to a system conversion rule, and determining the digit of the third character string; the number of bits of the third string is the random number significand.
Based on the same technical concept, an embodiment of the present invention provides a computing device, including:
a memory for storing a computer program;
and the processor is used for calling the computer program stored in the memory and executing the method for generating the service request according to the obtained program.
Based on the same technical concept, embodiments of the present invention provide a computer-readable storage medium storing a computer-executable program for causing a computer to execute a method of generating a service request.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present application and their equivalents, the present invention is also intended to include such modifications and variations.
Claims (15)
1. A method of generating a service request, comprising:
the client node generates a current timestamp and a random number corresponding to the service request;
the client node intercepts the current timestamp based on the timestamp effective digit indicated by the server node to obtain a first timestamp; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request;
the client node generates a random character string RS according to the length indication of the first time stamp, the first time stamp and the random number;
the client node sends a service request carrying the RS to the server node; the RS is for the server end node to determine whether the service request is executable.
2. The method of claim 1, wherein the client node generating a random number comprises:
the client node generates the random number based on the significand of the random number indicated by the server node; the number of significant digits of the random number is determined by the service end node based on the concurrency of service requests within a set time duration.
3. The method of claim 1, wherein the client node generating a random string RS based on the indication of the length of the first timestamp, and the random number comprises:
the client node carries out conversion processing on the first timestamp according to a binary conversion rule to obtain a first character string, and carries out conversion processing on the random number to obtain a second character string; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits occupied by the second character string is less than that occupied by the random number;
the client node determines a length indication of the first timestamp from the first string;
and the client node sequentially splices the length indication of the first timestamp, the first character string and the second character string to obtain the RS.
4. The method of claim 1, prior to the client node generating a current timestamp and a nonce for the service request, further comprising:
the client node obtains the timestamp significand and the random number significand from the server node.
5. The method of claim 4 wherein said client node obtaining said random number significand from said server node comprises:
the client node periodically obtains the random number significand from the server end node.
6. A method of generating a service request, comprising:
a service end node receives a service request sent by a client end node; the service request carries a random character string RS; the RS is generated by the client node according to the length indication of the first timestamp, the first timestamp and the random number; the first timestamp is obtained by intercepting the current timestamp by the client node based on the timestamp effective digit indicated by the server node; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; the current timestamp and the nonce are generated by the client node based on the service request;
the service end node determines whether the service request is executable.
7. The method of claim 6, wherein the service end node determining whether the service request is executable comprises:
the server-side node analyzes the RS to obtain a first character string, converts the first character string according to a system conversion rule to obtain a first time stamp, and determines the digit of the first time stamp; the number of bits occupied by the first character string is less than that occupied by the first timestamp; the number of bits of the first timestamp is the same as the timestamp significance;
the server-side node intercepts a local current timestamp based on the number of bits of the first timestamp to obtain a second timestamp, and processes the first timestamp and the second timestamp to obtain a time difference value; the local current timestamp is generated when the service end node receives the service request sent by the client node;
the service end node determines whether the time difference value is less than or equal to the effective time length of the service request;
after the service end node determines that the time difference is less than or equal to the effective duration of the service request, determining whether the RS is cached locally;
and if so, the service end node determines the service request to be an unexecutable request, otherwise, the service request is determined to be an executable request.
8. The method of claim 6, wherein prior to said server end node receiving a service request sent by a client node, further comprising:
the service end node sets the effective duration of the service request;
the service end node processes the effective duration of the service request, determines a time value corresponding to the effective duration of the service request and determines the digit of the time value;
and the server node adds the digit of the time value with 1 to determine the effective digit of the timestamp.
9. The method of claim 7, wherein the server end node parsing the RS to obtain a first string, comprising:
the server end node obtaining an indication of the length of the first timestamp;
and the server end node processes the RS based on the length indication of the first timestamp to determine the first character string.
10. The method of claim 6, wherein after the server end node receives the service request sent by the client node, further comprising:
the service end node counts service requests sent by the client end node within a set time length based on a request timer;
the server end node periodically determines the significance of the random number based on the statistic value of the request timer; the random number significand is used for the client node to generate a second character string according with the random number significand; the number of bits occupied by the second character string is less than the number of bits occupied by the random number.
11. The method of claim 10, wherein said serving end node determining a random number significand based on the value of said request timer, comprising:
the server-end node acquires the current statistic value of the request timer;
the server node determines the ratio of the current statistic value of the request timer to a set duration as a first request value;
the server node determines the ratio of the first request value to a preset conflict probability as a second request value;
the server-side node converts the second request value into a third character string according to a system conversion rule and determines the digit of the third character string; the number of bits of the third string is the random number significand.
12. An apparatus for generating a service request, comprising:
the generating unit is used for generating a current timestamp and a random number corresponding to the service request;
the first processing unit is used for intercepting the current timestamp based on the timestamp effective digit indicated by the service end node to obtain a first timestamp; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; generating a random string RS according to the length indication of the first timestamp, the first timestamp and the random number; sending a service request carrying the RS to the service end node; the RS is for the server end node to determine whether the service request is executable.
13. An apparatus for generating a service request, comprising:
the receiving unit is used for receiving a service request sent by a client node; the service request carries a random character string RS; the RS is generated by the client node according to the length indication of the first timestamp, the first timestamp and the random number; the first timestamp is obtained by intercepting the current timestamp by the client node based on the timestamp effective digit indicated by the server node; the effective digit of the timestamp is determined by the service end node according to the set effective duration of the service request; the current timestamp and the nonce are generated by the client node based on the service request;
a second processing unit to determine whether the service request is executable.
14. A computing device, comprising:
a memory for storing a computer program;
a processor for calling a computer program stored in said memory and executing the method of any one of claims 1 to 11 in accordance with the obtained program.
15. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer-executable program for causing a computer to execute the method of any one of claims 1 to 11.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011292146.XA CN112491996B (en) | 2020-11-18 | 2020-11-18 | Method and device for generating service request |
| PCT/CN2021/126990 WO2022105566A1 (en) | 2020-11-18 | 2021-10-28 | Method and apparatus for generating service request |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011292146.XA CN112491996B (en) | 2020-11-18 | 2020-11-18 | Method and device for generating service request |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112491996A true CN112491996A (en) | 2021-03-12 |
| CN112491996B CN112491996B (en) | 2022-08-12 |
Family
ID=74931276
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011292146.XA Active CN112491996B (en) | 2020-11-18 | 2020-11-18 | Method and device for generating service request |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112491996B (en) |
| WO (1) | WO2022105566A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113536060A (en) * | 2021-06-23 | 2021-10-22 | 上海市计算技术研究所 | Data acquisition device and method, electronic device, and computer storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106484787A (en) * | 2016-09-19 | 2017-03-08 | 北京集奥聚合科技有限公司 | A kind of computational methods of UUID in Map Reduce distributed arithmetic |
| CN111030812A (en) * | 2019-12-16 | 2020-04-17 | Oppo广东移动通信有限公司 | Token verification method, device, storage medium and server |
| CN111158637A (en) * | 2019-12-30 | 2020-05-15 | 山东爱城市网信息技术有限公司 | Block chain-based random number generation method, equipment and storage medium |
| US20200167333A1 (en) * | 2018-11-26 | 2020-05-28 | Palantir Technologies Inc. | Module expiration management |
| CN111930343A (en) * | 2020-06-09 | 2020-11-13 | 山东浪潮质量链科技有限公司 | Method, device and medium for acquiring random number and generating random number |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20080059897A (en) * | 2006-12-26 | 2008-07-01 | 한국정보통신대학교 산학협력단 | Method for measuring end-to-end available bandwidth using time stamp message and delay variance in ip packet network |
| EP3357187B1 (en) * | 2015-09-30 | 2020-10-21 | Nokia Technologies Oy | Message verification |
| CN106657216B (en) * | 2016-09-19 | 2020-07-24 | 腾讯征信有限公司 | Serial number generation method and device |
| CN106789004A (en) * | 2016-12-15 | 2017-05-31 | 国云科技股份有限公司 | A kind of network communication method of highly effective and safe |
| CN110505306B (en) * | 2019-08-30 | 2021-12-21 | 公安部交通管理科学研究所 | Data ID generation method capable of specifying digit |
-
2020
- 2020-11-18 CN CN202011292146.XA patent/CN112491996B/en active Active
-
2021
- 2021-10-28 WO PCT/CN2021/126990 patent/WO2022105566A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106484787A (en) * | 2016-09-19 | 2017-03-08 | 北京集奥聚合科技有限公司 | A kind of computational methods of UUID in Map Reduce distributed arithmetic |
| US20200167333A1 (en) * | 2018-11-26 | 2020-05-28 | Palantir Technologies Inc. | Module expiration management |
| CN111030812A (en) * | 2019-12-16 | 2020-04-17 | Oppo广东移动通信有限公司 | Token verification method, device, storage medium and server |
| CN111158637A (en) * | 2019-12-30 | 2020-05-15 | 山东爱城市网信息技术有限公司 | Block chain-based random number generation method, equipment and storage medium |
| CN111930343A (en) * | 2020-06-09 | 2020-11-13 | 山东浪潮质量链科技有限公司 | Method, device and medium for acquiring random number and generating random number |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113536060A (en) * | 2021-06-23 | 2021-10-22 | 上海市计算技术研究所 | Data acquisition device and method, electronic device, and computer storage medium |
| CN113536060B (en) * | 2021-06-23 | 2024-04-16 | 上海市计算技术研究所有限公司 | Data acquisition device and method, electronic device and computer storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112491996B (en) | 2022-08-12 |
| WO2022105566A1 (en) | 2022-05-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8621074B2 (en) | Intelligent work load manager | |
| CN107205248B (en) | Resource allocation method and system | |
| CN112256523B (en) | Service data processing method and device | |
| CN111277639A (en) | Method and device for maintaining data consistency | |
| CN112367268A (en) | Current limiting method and device for micro-service | |
| CN112491996B (en) | Method and device for generating service request | |
| CN108900314B (en) | Request number charging method and device for network acceleration service | |
| CN111427551A (en) | User code operation method of programming platform, equipment and storage medium | |
| CN111866101A (en) | Access request processing method and device, storage medium and electronic equipment | |
| CN113328906B (en) | Flow real-time monitoring method and device, storage medium and electronic equipment | |
| CN113395671B (en) | Message pushing rate adjusting method and device and server | |
| CN111046245A (en) | Multi-source heterogeneous data source fusion calculation method, system, equipment and storage medium | |
| CN111294377A (en) | Network request sending method of dependency relationship, terminal device and storage medium | |
| CN109032779B (en) | Task processing method and device, computer equipment and readable storage medium | |
| CN112968788A (en) | Network slice capacity setting method, control method, device, equipment and medium | |
| CN116226178A (en) | Data query method and device, storage medium and electronic device | |
| CN114245173B (en) | Image compression method, device, terminal equipment and storage medium | |
| CN111817890B (en) | Data synchronization processing method and device, computer equipment and storage medium | |
| CN110134547B (en) | Middleware-based repeated data deleting method and related device | |
| CN112737896A (en) | Bandwidth data checking method, device, medium and electronic equipment | |
| CN115002514B (en) | Spark video transcoding system and video transcoding method based on cloud native controller | |
| CN116347467B (en) | Method and system for managing user data by UDR in 5G network | |
| CN114785711B (en) | Performance monitoring method, device and storage medium of network equipment | |
| CN117076057B (en) | AI service request scheduling method, device, equipment and medium | |
| CN112860519B (en) | Monitoring method and device for distributed system |
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 |