CN112104521A - Request timeout monitoring method and device, computer equipment and storage medium - Google Patents
Request timeout monitoring method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN112104521A CN112104521A CN202010934277.7A CN202010934277A CN112104521A CN 112104521 A CN112104521 A CN 112104521A CN 202010934277 A CN202010934277 A CN 202010934277A CN 112104521 A CN112104521 A CN 112104521A
- Authority
- CN
- China
- Prior art keywords
- request
- node
- overtime
- value
- response
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0852—Delays
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention relates to a request timeout monitoring method, a request timeout monitoring device, computer equipment and a storage medium, wherein the method comprises the following steps: acquiring a request sent to a response server; acquiring the overtime length of the request; storing the request in an overtime queue according to the overtime duration of the request; judging whether the request in the overtime queue is overtime or not; if the request is overtime, processing the request according to a request overtime strategy; the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server. The method of the embodiment of the invention can monitor whether all the sent requests are overtime.
Description
Technical Field
The present invention relates to the field of communications, and in particular, to a request timeout monitoring method and apparatus, a computer device, and a storage medium.
Background
In a communication system, when a large number of requests are processed, an asynchronous communication mode is generally adopted in order to improve resource utilization. In the asynchronous communication mode, the communication between the micro-services adopts a long-connection pushing mode, and after the request pushing of the server initiating the request is completed, the server does not wait for the response server to return the response result of the request, and can continue to process other services. And after the response server receives and processes the request, pushing a processing result to the server initiating the request through the long connection. After the server initiating the request monitors the response result, a new thread is started to process the response result, and then the server continues to monitor the response transmitted by the long connection pipeline until the connection is disconnected.
In the above asynchronous communication mode, after the request server initiating the request sends each request, the state of each request cannot be tracked, that is, whether the request is sent successfully, whether the response server receives the request successfully, whether the response server processes the request successfully, and whether the response server returns the processing result as a response. The server initiating the request can only process the request after monitoring that a response result is returned. For requests that do not receive a result of the response, the requesting server that initiated the request cannot retry and/or log, resulting in the request being missed.
Disclosure of Invention
To solve the above technical problem or at least partially solve the above technical problem, the present invention provides a request timeout monitoring method, apparatus, computer device and storage medium.
In a first aspect, the present invention provides a request timeout monitoring method, applied to a request server, where the method includes:
acquiring a request sent to a response server;
acquiring the overtime length of the request;
storing the request in an overtime queue according to the overtime duration of the request;
judging whether the request in the overtime queue is overtime or not;
if the request is overtime, processing the request according to a request overtime strategy;
the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server.
In the embodiment of the present invention, the data structure of the timeout queue is a small top heap, each node of the small top heap corresponds to one request, and the value of each node is the timeout duration of the corresponding request.
In the embodiment of the present invention, the storing the request in the timeout queue according to the timeout duration of the request includes:
and writing the node corresponding to the request into the timeout queue according to the timeout duration of the request.
In this embodiment of the present invention, writing the node corresponding to the request into the timeout queue according to the timeout duration of the request includes:
and determining the position of the node corresponding to the request in the overtime queue according to the overtime duration of the request from the tail of the overtime queue.
In this embodiment of the present invention, the determining, according to the timeout duration of the request, the position of the node corresponding to the request in the timeout queue includes:
comparing the value of the current node corresponding to the current request with the value of the father node of the current node;
if the value of the current node is larger than or equal to the value of the father node of the current node, keeping the position of the current node in the overtime queue unchanged;
if the value of the current node is less than the value of the parent node of the current node, exchanging the position of the current node and the parent node of the current node in the overtime queue,
and comparing the value of the current node after the exchange position with the value of the father node of the current node after the exchange position until the value of the current node is smaller than the value of the father node of the current node.
In this embodiment of the present invention, the determining whether the request in the timeout queue is timeout includes:
acquiring a root node corresponding request in the overtime queue as a target request;
acquiring a difference value between the current time and the sending time of the target request;
comparing the difference value with the timeout duration of the target request;
if the difference is larger than or equal to the overtime length of the target request, judging whether a response corresponding to the target request exists in a response queue;
and if the corresponding response exists in the response queue, judging that the corresponding request of the root node is not overtime.
In this embodiment of the present invention, after determining that the request corresponding to the root node is not time out if there is a corresponding response in the response queue, the method further includes:
deleting the root node from the timeout queue.
In the embodiment of the invention, if no corresponding response exists in the response queue, the corresponding request of the root node is judged to be overtime.
In the embodiment of the present invention, if the request is overtime, processing the request according to the request overtime policy includes:
generating a request overtime alarm;
acquiring a request timeout strategy corresponding to the corresponding request of the root node;
processing the corresponding request of the root node according to the request timeout strategy;
deleting the root node from the timeout queue.
In the embodiment of the present invention, if the difference is smaller than the timeout duration of the target request, it is determined that the corresponding request of the root node is not timeout.
In this embodiment of the present invention, if the difference is smaller than the timeout duration of the target request, after determining that the request corresponding to the root node is not timeout, the method further includes:
keeping the root node unchanged.
In this embodiment of the present invention, after deleting the root node, the method further includes:
placing the last node in the overtime queue at the position of a root node, taking the updated root node as a reference node, and keeping the value of the reference node unchanged;
comparing the value of the reference node to the values of the left child node and the right child node of the reference node;
if the value of the reference node is larger than the value of the left child node and larger than the value of the right child node, the reference node exchanges the position with the node with the smaller value of the left child node and the right child node,
if the value of the reference node is larger than the value of the left child node and smaller than or equal to the value of the right child node, exchanging the position of the reference node and the left child node,
if the value of the reference node is smaller than or equal to the value of the left node and larger than the value of the right child node, exchanging the position of the reference node and the right child node;
and comparing the value of the reference node after the switching position with the value of the left child node and the value of the right child node of the reference node after the switching position until the reference node has no left child node.
In the embodiment of the present invention, the method further includes:
acquiring a response sent by the response server, and adding the response into a response queue, wherein the response comprises a request identifier corresponding to the response;
the judging whether a response corresponding to the target request exists in the response queue includes:
and judging whether a response corresponding to the target request exists in the response queue according to the identifier of the request.
In the embodiment of the present invention, the method further includes:
sending a request to the response server;
before sending the request to the response server, the method further comprises:
classifying the request sent to the response server;
setting corresponding timeout duration for the different types of requests;
and setting corresponding request timeout strategies for the requests of different types.
In a second aspect, there is provided a request timeout monitoring apparatus, disposed in a request server, the apparatus including:
a request acquisition unit for acquiring a request sent to the response server;
an overtime length obtaining unit, configured to obtain an overtime length of the request;
the request storage unit is used for storing the request in an overtime queue according to the overtime length of the request;
the request monitoring unit is used for judging whether the requests in the overtime queue are overtime or not;
the processing unit is used for processing the request according to a request timeout strategy if the request is overtime;
the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server.
In a third aspect, a computer device is provided, comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of any of the above methods when executing the computer program.
In a fourth aspect, a computer-readable storage medium is provided, having stored thereon a computer program which, when being executed by a processor, carries out the steps of the method of any of the above.
The request timeout monitoring method, the request timeout monitoring device, the computer equipment and the storage medium comprise the following steps:
the method comprises the following steps: acquiring a request sent to a response server; acquiring the overtime length of the request; storing the request in an overtime queue according to the overtime duration of the request; judging whether the request in the overtime queue is overtime or not; if the request is overtime, processing the request according to a request overtime strategy; the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server. The method of the embodiment of the invention can monitor whether all the sent requests are overtime. In other words, in the embodiment of the present invention, whether a request sent to a response server is overtime is determined according to the timeout duration, so that the problem of request omission caused by lack of timeout monitoring for the request sent to the response server in the prior art is solved, and whether the sent request is overtime can be monitored.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive exercise.
FIG. 1 is a diagram of an application environment of a request timeout monitoring method according to an embodiment of the present invention;
FIG. 2 is a flowchart illustrating a request timeout monitoring method according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a complete binary tree;
fig. 4 is a schematic diagram illustrating a node corresponding to a request inserted into a timeout queue according to an embodiment of the present invention;
fig. 5 and fig. 6 are schematic diagrams illustrating a small top heap after a root node is deleted according to an embodiment of the present invention;
FIG. 7 is a diagram illustrating a request timeout monitoring apparatus according to an embodiment of the present invention;
fig. 8 is an internal structural diagram of a computer device in an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, 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 some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
FIG. 1 is a diagram of an application environment for a request timeout monitoring method in one embodiment. Referring to fig. 1, the request timeout monitoring method is applied to a request timeout monitoring system. The request timeout monitoring system includes a request server 110 and a response server 120. The request server 110 and the response server 120 are connected via a network. The request server 110 and the response server 120 may be implemented as separate servers or as a server cluster composed of a plurality of servers.
In one embodiment, as shown in FIG. 2, a request timeout monitoring method is provided. The embodiment is mainly illustrated by applying the method to the terminal request server 110 in fig. 1. Referring to fig. 2, the request timeout monitoring method specifically includes the following steps:
in the embodiment of the present invention, the timeout duration is used to indicate that the request is timeout if a duration between a sending time and a receiving time is greater than the timeout duration, where the sending time is a time when a request server sends the request to a response server, and the receiving time is a time when the request server receives a response corresponding to the request sent by the response server.
For example, the timeout duration corresponding to a request is 5 seconds, if the time when the request server sends the request is 00:00:00 (hour: minute: second), after receiving the request, the response server performs corresponding processing according to the request, sends a response to the request server according to the processing result, the time when the request server receives the response is 00:00:04, and the difference between the two times is 4 seconds, then the request is not timeout; if the time at which the response is received is 00:00:08, the difference between the two times is 8 seconds, then the request times out; this request also times out if no corresponding response is received, corresponding to an infinite difference between the two moments.
In the embodiment of the invention, the request is stored in the timeout queue according to the timeout duration of the request, and whether the request in the timeout queue is overtime is judged, namely, in the embodiment of the invention, the request sent to the response server by the request server is judged whether to be overtime according to the timeout duration, so that the problem of request omission caused by lack of timeout monitoring on the request sent by the request server in the prior art is solved.
In the embodiment of the present invention, the data structure of the timeout queue is a small top heap, each node of the small top heap corresponds to one request, and the value of each node is the timeout duration of the corresponding request.
In the embodiment of the present invention, the small top heap is a complete binary tree with special properties, and the value of each node of the small top heap is less than or equal to the values of the left child node and the right child node thereof, so that the value of the root node of the small top heap is minimum, that is, the value of the first data after the small top heap is mapped to the data group, that is, the timeout duration of the first request in the timeout queue is minimum, and the request can be regarded as the most likely timeout request.
Fig. 3 is a schematic diagram of a complete binary tree. A complete binary tree is a data structure, and the complete binary tree is derived from a full binary tree. For a binary tree with a depth of K, with n nodes, a complete binary tree is said if and only if each of its nodes corresponds one-to-one with the nodes numbered from 1 to n in the full binary tree with a depth of K. As shown in fig. 3, the depth of the complete binary tree is 3, 301 is the root node, 302 is the left child node of 301, and 303 is the right child node of 302.
Each node of the complete binary tree has a number, which may be expressed in the form of a subscript. The index of the root node is 1, if the index of the current node is i, the index of the left child node of the node is 2i, the index of the right child node of the node is 2i +1, and the index of the parent node of the node is i/2. Such as 302 in fig. 3, the index may be 3, the parent node of the node is 301, and the index is 1. And mapping the complete binary tree into a data set, namely, outputting the data set after sorting according to the subscripts of the complete binary tree from small to large.
Taking the complete binary tree as the timeout queue, that is, taking the subscripts of the nodes of the complete binary tree as the sequence, taking the complete binary tree as the example shown in fig. 3, the timeout queue is 301, 302, 303, 304 … … 309.
In the embodiment of the invention, the overtime queue is the small top heap, and the value of the root node of the small top heap is the minimum, so that whether the request is overtime is judged according to the small top heap, the most possible overtime request can be timely and accurately found, and whether the request is overtime is known without traversing all the requests, thereby improving the efficiency of monitoring the overtime of the request.
In the embodiment of the present invention, the method further includes:
sending a request to the response server;
before sending the request to the response server, the method further comprises:
classifying the request sent to the response server;
setting corresponding timeout duration for the different types of requests;
and setting corresponding request timeout strategies for the requests of different types.
Different requests may have different data volumes, different processing times of the response servers, different link lengths and different link qualities between the sending server and the response servers, and thus different timeout durations may also be used. The number of requests sent by the request server is huge, so in the embodiment of the invention, the requests sent by the request server are firstly classified, and the acquisition efficiency of the timeout duration can be properly improved. The timeout duration corresponding to each type of request can be adjusted according to actual requirements, network actual conditions, historical response results and the like.
In step 230, in the embodiment of the present invention, the storing the request in the timeout queue according to the timeout duration of the request includes:
and writing the node corresponding to the request into the timeout queue according to the timeout duration of the request.
In this embodiment of the present invention, writing the node corresponding to the request into the timeout queue according to the timeout duration of the request includes:
and determining the position of the node corresponding to the request in the overtime queue according to the overtime duration of the request from the tail of the overtime queue.
In this embodiment of the present invention, the determining, according to the timeout duration of the request, the position of the node corresponding to the request in the timeout queue includes:
comparing the value of the current node corresponding to the current request with the value of the father node of the current node;
if the value of the current node is larger than or equal to the value of the father node of the current node, keeping the position of the current node in the overtime queue unchanged;
if the value of the current node is less than the value of the parent node of the current node, exchanging the position of the current node and the parent node of the current node in the overtime queue,
and comparing the value of the current node after the exchange position with the value of the father node of the current node after the exchange position until the value of the current node is smaller than the value of the father node of the current node.
Fig. 4 is a schematic diagram illustrating a node corresponding to a request inserted into a timeout queue according to an embodiment of the present invention. In the embodiment shown in fig. 4, the value of each node is the value in the circle, and the value outside the circle is the subscript (number) of each node. The value of the inserted node is 5.
As shown in fig. 4(a), node a is inserted from the end of the queue as the left node of node 5, and node a is numbered 10. Comparing the value of node a with the value of node 5, the value of node a being less than the value of node 4, node a and node 5 are swapped locations as shown in fig. 4 (b). After the exchange position, the number of the node A is changed to 5, and the number of the original node 5 is 10.
In fig. 4, the swap position is indicated by a dashed arc, and the node a is indicated by a circle with a gray bottom.
The value of node a is smaller than that of node 2, and node a and node 2 are switched in position, as shown in fig. 4(c), the value of node a is smaller than that of node 1, and node a and node 1 are switched in position.
After the node exchange position, the numbers of the nodes are also exchanged, for example, in fig. 4(a), the number of the node a is 10, in fig. 4(b), the number of the node a is 5, in fig. 4(c), the number of the node a is 2, and in fig. 4(d), the number of the node a is 1.
As can be seen from fig. 4, in the small top heap, the value of the root node is the smallest among all the nodes, i.e., the timeout duration of the request corresponding to the root node is the smallest.
In this embodiment of the present invention, in step 240, the determining whether the request in the timeout queue is timeout includes:
acquiring a root node corresponding request in the overtime queue as a target request;
acquiring a difference value between the current time and the sending time of the target request;
comparing the difference value with the timeout duration of the target request;
if the difference is larger than or equal to the overtime length of the target request, judging whether a response corresponding to the target request exists in a response queue;
and if the corresponding response exists in the response queue, judging that the corresponding request of the root node is not overtime.
In this embodiment of the present invention, after determining that the request corresponding to the root node is not time out if there is a corresponding response in the response queue, the method further includes:
deleting the root node from the timeout queue.
In the embodiment of the invention, if no corresponding response exists in the response queue, the corresponding request of the root node is judged to be overtime.
In the embodiment of the present invention, if the difference is smaller than the timeout duration of the target request, it is determined that the corresponding request of the root node is not timeout.
In this embodiment of the present invention, if the difference is smaller than the timeout duration of the target request, after determining that the request corresponding to the root node is not timeout, the method further includes:
keeping the root node unchanged.
In the embodiment of the present invention, if the request is overtime, processing the request according to the request overtime policy includes:
generating a request overtime alarm;
acquiring a request timeout strategy corresponding to the corresponding request of the root node;
processing the corresponding request of the root node according to the request timeout strategy;
deleting the root node from the timeout queue.
In this embodiment of the present invention, the request timeout policy may include, but is not limited to: maximum number of retransmission requests, and/or retransmission path, etc.;
the processing the corresponding request of the root node according to the request timeout strategy comprises the following steps:
judging the total number of times that the corresponding request of the root node has been retransmitted;
if the total times is less than or equal to the maximum times of the retransmission requests, retransmitting the requests;
and a retransmission path and a retransmission response server for retransmitting the request.
If the requesting server sends a request to the responding server, the timeout of the request may mean that the link is down, or the responding server is down, or other problems exist, and if there is no limit to the number of retransmissions, the requesting server continuously retransmits the request, which wastes bandwidth and system resources. The retransmission path and the retransmission response server are also set so that the service carried by the request of the system can be processed correspondingly, and the downtime of the whole system caused by the failure of the individual response server or the failure of the link can be avoided.
In this embodiment of the present invention, after deleting the root node, the method further includes:
placing the last node in the overtime queue at the position of a root node, taking the updated root node as a reference node, and keeping the value of the reference node unchanged;
comparing the value of the reference node to the values of the left child node and the right child node of the reference node;
if the value of the reference node is larger than the value of the left child node and larger than the value of the right child node, the reference node exchanges the position with the node with the smaller value of the left child node and the right child node,
if the value of the reference node is larger than the value of the left child node and smaller than or equal to the value of the right child node, exchanging the position of the reference node and the left child node,
if the value of the reference node is smaller than or equal to the value of the left node and larger than the value of the right child node, exchanging the position of the reference node and the right child node;
and comparing the value of the reference node after the switching position with the value of the left child node and the value of the right child node of the reference node after the switching position until the reference node has no left child node.
Fig. 5 is a schematic diagram of a small top heap after a root node is deleted according to an embodiment of the present invention, and fig. 5(a) shows an original small top heap; after the root node is deleted, the node with the last value of 45 and the original label of 9 is placed at the position of the root node, and the node with the original label of 9 is marked as B, as shown in FIG. 5 (B); the value of node B is greater than the value of its left child node 2 and greater than the value of its right child node 3, and the value of node 3 is less than the value of node 2, then node B and node 3 are swapped locations, as shown in fig. 5 (c). After the value of node B is compared with node 6 and node 7, the node 6 exchanges location with node B, as shown in fig. 5 (d). Node B has no left child node, so node B has the last label of 6.
In fig. 5, the exchange positions are indicated by dashed arcs, and the node bs are indicated by circles with gray undertones.
Fig. 6 is a schematic diagram of a small top heap after deleting a root node according to an embodiment of the present invention, and fig. 6(a) shows an original small top heap; after the root node is deleted, the node with the last value of 17 and the original label of 9 is placed at the position of the root node, and the node with the original label of 9 is marked as C, as shown in fig. 5 (b); the value of node C is less than its left child node 2 and greater than its right child node 3, and node C is swapped in position with its right child node 3, as shown in fig. 5 (C). Node C has a value less than its left 6 and right 7 child nodes, and is therefore last numbered 3.
In fig. 5, the exchange position is indicated by a dotted arc, and the node C is indicated by a circle with a gray bottom.
In the embodiments shown in fig. 5 and fig. 6, after the nodes exchange positions, their subscripts also exchange positions, which is not described herein again.
In the embodiment of the present invention, whether a node is inserted or deleted in the timeout queue, the data characteristics of the timeout queue are maintained, that is, the small top heap structure, specifically, the value of the root node is the minimum, and the value of any node is less than or equal to the values of the left and right child nodes. Therefore, the method of the embodiment of the invention can position the most possible overtime request in time by judging whether the root node is overtime, and has higher efficiency.
In the embodiment of the present invention, the method further includes:
acquiring a response sent by the response server, and adding the response into a response queue, wherein the response comprises a request identifier corresponding to the response;
the judging whether a response corresponding to the target request exists in the response queue includes:
and judging whether a response corresponding to the target request exists in the response queue according to the identifier of the request.
In the embodiment of the present invention, the identifier of the request may be an ID of the request; the data structure of the response queue has no special requirement, and only needs to record, but in order to increase the search speed, the data structure may be arranged according to the type of the request, or may be arranged according to the time for receiving the response, or may be arranged according to the identifier of the request, and the like, and will not be described herein again.
In the embodiment of the invention, the requests are stored in the timeout queue according to the timeout duration of the requests, and whether the requests in the timeout queue are overtime is judged, namely, in the embodiment of the invention, the requests sent to the response server by the request server are judged whether to be overtime according to the timeout duration, so that the problem of request omission caused by lack of timeout monitoring on the requests sent by the request server in the prior art is solved, and whether all the sent requests are overtime can be monitored. In addition, in the method of the embodiment of the invention, the data structure of the overtime queue is the small top heap, and the most possible overtime request can be positioned in time by judging whether the root node of the small top heap is overtime, so that the efficiency is higher, all the requests do not need to be traversed, and the system resources are saved.
FIG. 2 is a flow diagram of a request monitoring method in one embodiment. It should be understood that, although the steps in the flowchart of fig. 2 are shown in order as indicated by the arrows, the steps are not necessarily performed in order as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least a portion of the steps in fig. 2 may include multiple sub-steps or multiple stages that are not necessarily performed at the same time, but may be performed at different times, and the order of performance of the sub-steps or stages is not necessarily sequential, but may be performed in turn or alternately with other steps or at least a portion of the sub-steps or stages of other steps.
Corresponding to the above method, an embodiment of the present invention further provides a request timeout monitoring apparatus, as shown in fig. 7, including:
a request acquisition unit 710 for acquiring a request sent to the response server;
a timeout duration obtaining unit 720, configured to obtain a timeout duration of the request;
a request storage unit 730, configured to store the request in an overtime queue according to the timeout duration of the request;
a request monitoring unit 740, configured to determine whether a request in the timeout queue is timeout;
a processing unit 750, configured to, if the request is overtime, process the request according to a request overtime policy;
the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server.
In the embodiment of the present invention, the data structure of the timeout queue is a small top heap, each node of the small top heap corresponds to one request, and the value of each node is the timeout duration of the corresponding request.
In this embodiment of the present invention, the request storage unit 730 is further configured to:
and writing the node corresponding to the request into the timeout queue according to the timeout duration of the request.
In this embodiment of the present invention, the request storage unit 730 is further configured to:
and determining the position of the node corresponding to the request in the overtime queue according to the overtime duration of the request from the tail of the overtime queue.
In this embodiment of the present invention, the request storage unit 730 is further configured to:
comparing the value of the current node corresponding to the current request with the value of the father node of the current node;
if the value of the current node is larger than or equal to the value of the father node of the current node, keeping the position of the current node in the overtime queue unchanged;
if the value of the current node is less than the value of the parent node of the current node, exchanging the position of the current node and the parent node of the current node in the overtime queue,
and comparing the value of the current node after the exchange position with the value of the father node of the current node after the exchange position until the value of the current node is smaller than the value of the father node of the current node.
In this embodiment of the present invention, the request monitoring unit 740 is further configured to:
acquiring a root node corresponding request in the overtime queue as a target request;
acquiring a difference value between the current time and the sending time of the target request;
comparing the difference value with the timeout duration of the target request;
if the difference is larger than or equal to the overtime length of the target request, judging whether a response corresponding to the target request exists in a response queue;
and if the corresponding response exists in the response queue, judging that the corresponding request of the root node is not overtime.
In this embodiment of the present invention, if there is a corresponding response in the response queue, after determining that the request corresponding to the root node is not time out, the processing unit 750 is further configured to:
deleting the root node from the timeout queue.
In this embodiment of the present invention, the request monitoring unit 740 is further configured to: and if the corresponding response does not exist in the response queue, judging that the corresponding request of the root node is overtime.
In this embodiment of the present invention, the processing unit 750 is further configured to:
generating a request overtime alarm;
acquiring a request timeout strategy corresponding to the corresponding request of the root node;
processing the corresponding request of the root node according to the request timeout strategy;
deleting the root node from the timeout queue.
In this embodiment of the present invention, the request monitoring unit 740 is further configured to: and if the difference is smaller than the overtime duration of the target request, judging that the corresponding request of the root node is not overtime.
In this embodiment of the present invention, if the difference is smaller than the timeout duration of the target request, after determining that the request corresponding to the root node is not timeout, the processing unit 750 is further configured to:
keeping the root node unchanged.
In this embodiment of the present invention, after the root node is deleted, the processing unit 750 is further configured to:
placing the last node in the overtime queue at the position of a root node, taking the updated root node as a reference node, and keeping the value of the reference node unchanged;
comparing the value of the reference node to the values of the left child node and the right child node of the reference node;
if the value of the reference node is larger than the value of the left child node and larger than the value of the right child node, the reference node exchanges the position with the node with the smaller value of the left child node and the right child node,
if the value of the reference node is larger than the value of the left child node and smaller than or equal to the value of the right child node, exchanging the position of the reference node and the left child node,
if the value of the reference node is smaller than or equal to the value of the left node and larger than the value of the right child node, exchanging the position of the reference node and the right child node;
and comparing the value of the reference node after the switching position with the value of the left child node and the value of the right child node of the reference node after the switching position until the reference node has no left child node.
In this embodiment of the present invention, the request obtaining unit 710 is further configured to: acquiring a response sent by the response server, and adding the response into a response queue, wherein the response comprises a request identifier corresponding to the response;
the request monitoring unit 740 is further configured to: and judging whether a response corresponding to the target request exists in the response queue according to the identifier of the request.
In the embodiment of the present invention, the apparatus further includes:
a request sending unit, configured to send a request to the response server;
a policy setting unit to:
categorizing the request sent to the response server,
setting corresponding time-out duration for different types of requests,
and setting corresponding request timeout strategies for the requests of different types.
The request monitoring device of the embodiment of the invention can solve the problem of request omission caused by lack of overtime monitoring on the request sent by the request server in the prior art, and can monitor whether the sent request is overtime or not. In addition, the most possible overtime requests can be positioned in time, the efficiency is high, all the requests do not need to be traversed, and system resources are saved.
FIG. 8 is a diagram illustrating an internal structure of a computer device in one embodiment. The computer device may specifically be the request server 110 (or the response server 120) in fig. 1. As shown in fig. 8, the computer apparatus includes a processor, a memory, a network interface, an input device, and a display screen connected through a system bus. Wherein the memory includes a non-volatile storage medium and an internal memory. The non-volatile storage medium of the computer device stores an operating system and may also store a computer program that, when executed by the processor, causes the processor to implement a request timeout monitoring method. The internal memory may also have stored therein a computer program that, when executed by the processor, causes the processor to perform a request timeout monitoring method. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, a key, a track ball or a touch pad arranged on the shell of the computer equipment, an external keyboard, a touch pad or a mouse and the like.
Those skilled in the art will appreciate that the architecture shown in fig. 8 is merely a block diagram of some of the structures associated with the inventive arrangements and is not intended to limit the computing devices to which the inventive arrangements may be applied, as a particular computing device may include more or less components than those shown, or may combine certain components, or have a different arrangement of components.
In one embodiment, the request timeout monitoring apparatus provided by the present invention can be implemented in the form of a computer program, and the computer program can be run on a computer device as shown in fig. 8. The memory of the computer device may store various program modules constituting the request timeout monitoring apparatus, such as the request acquisition unit 710, the timeout duration acquisition unit 720, the request storage unit 730, the request monitoring unit 740 module, and the processing unit 750 shown in fig. 7. The program modules constitute computer programs that cause the processors to perform the steps of the request timeout monitoring methods of the various embodiments of the present invention described in this specification.
In one embodiment, a computer device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the following steps when executing the computer program: acquiring a request sent to a response server; acquiring the overtime length of the request; storing the request in an overtime queue according to the overtime duration of the request; judging whether the request in the overtime queue is overtime or not; if the request is overtime, processing the request according to a request overtime strategy; the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server.
In one embodiment, the processor, when executing the computer program, further performs the steps of: the data structure of the overtime queue is a small top heap, each node of the small top heap corresponds to one request, and the value of each node is the overtime duration of the corresponding request.
In one embodiment, the processor, when executing the computer program, further performs the steps of: the storing the request in the timeout queue according to the timeout duration of the request includes: and writing the node corresponding to the request into the timeout queue according to the timeout duration of the request.
In one embodiment, the processor, when executing the computer program, further performs the steps of: writing the node corresponding to the request into an overtime queue according to the overtime duration of the request, wherein the writing comprises the following steps: and determining the position of the node corresponding to the request in the overtime queue according to the overtime duration of the request from the tail of the overtime queue.
In one embodiment, the processor, when executing the computer program, further performs the steps of: the determining the position of the node corresponding to the request in the timeout queue according to the timeout duration of the request includes: comparing the value of the current node corresponding to the current request with the value of the father node of the current node; if the value of the current node is larger than or equal to the value of the father node of the current node, keeping the position of the current node in the overtime queue unchanged; if the value of the current node is smaller than the value of the father node of the current node, exchanging the position of the current node and the father node of the current node in the overtime queue, and comparing the value of the current node after exchanging the position with the value of the father node of the current node after exchanging the position until the value of the current node is smaller than the value of the father node of the current node.
In one embodiment, the processor, when executing the computer program, further performs the steps of: the judging whether the request in the overtime queue is overtime includes: acquiring a root node corresponding request in the overtime queue as a target request; acquiring a difference value between the current time and the sending time of the target request; comparing the difference value with the timeout duration of the target request; if the difference is larger than or equal to the overtime length of the target request, judging whether a response corresponding to the target request exists in a response queue; and if the corresponding response exists in the response queue, judging that the corresponding request of the root node is not overtime.
In one embodiment, the processor, when executing the computer program, further performs the steps of: if the corresponding response exists in the response queue, after the request corresponding to the root node is judged not to be overtime, the method further comprises the following steps: deleting the root node from the timeout queue.
In one embodiment, the processor, when executing the computer program, further performs the steps of: and if the corresponding response does not exist in the response queue, judging that the corresponding request of the root node is overtime.
In one embodiment, the processor, when executing the computer program, further performs the steps of: if the request is overtime, processing the request according to a request overtime strategy, comprising: generating a request overtime alarm; acquiring a request timeout strategy corresponding to the corresponding request of the root node; processing the corresponding request of the root node according to the request timeout strategy; deleting the root node from the timeout queue.
In one embodiment, the processor, when executing the computer program, further performs the steps of: and if the difference is smaller than the overtime duration of the target request, judging that the corresponding request of the root node is not overtime.
In one embodiment, the processor, when executing the computer program, further performs the steps of: if the difference is smaller than the timeout duration of the target request, after the request corresponding to the root node is judged not to be timeout, the method further comprises the following steps: keeping the root node unchanged.
In one embodiment, the processor, when executing the computer program, further performs the steps of: after the deleting the root node, the method further comprises: placing the last node in the overtime queue at the position of a root node, taking the updated root node as a reference node, and keeping the value of the reference node unchanged; comparing the value of the reference node to the values of the left child node and the right child node of the reference node; if the value of the reference node is greater than the value of the left child node and greater than the value of the right child node, exchanging the position of the reference node with a smaller value of the left child node and the right child node, if the value of the reference node is greater than the value of the left child node and less than or equal to the value of the right child node, exchanging the position of the reference node with the left child node, and if the value of the reference node is less than or equal to the value of the left node and greater than the value of the right child node, exchanging the position of the reference node with the right child node;
and comparing the value of the reference node after the switching position with the value of the left child node and the value of the right child node of the reference node after the switching position until the reference node has no left child node.
In one embodiment, the processor, when executing the computer program, further performs the steps of: acquiring a response sent by the response server, and adding the response into a response queue, wherein the response comprises a request identifier corresponding to the response; the judging whether a response corresponding to the target request exists in the response queue includes: and judging whether a response corresponding to the target request exists in the response queue according to the identifier of the request.
In one embodiment, the processor, when executing the computer program, further performs the steps of: sending a request to the response server; before sending the request to the response server, the method further comprises: classifying the request sent to the response server; setting corresponding timeout duration for the different types of requests; and setting corresponding request timeout strategies for the requests of different types.
In one embodiment, a computer-readable storage medium is provided, having a computer program stored thereon, which when executed by a processor, performs the steps of: acquiring a request sent to a response server; acquiring the overtime length of the request; storing the request in an overtime queue according to the overtime duration of the request; judging whether the request in the overtime queue is overtime or not; if the request is overtime, processing the request according to a request overtime strategy; the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server.
In one embodiment, the computer program when executed by the processor further performs the steps of: the data structure of the overtime queue is a small top heap, each node of the small top heap corresponds to one request, and the value of each node is the overtime duration of the corresponding request.
In one embodiment, the computer program when executed by the processor further performs the steps of: the storing the request in the timeout queue according to the timeout duration of the request includes: and writing the node corresponding to the request into the timeout queue according to the timeout duration of the request.
In one embodiment, the computer program when executed by the processor further performs the steps of: writing the node corresponding to the request into an overtime queue according to the overtime duration of the request, wherein the writing comprises the following steps: and determining the position of the node corresponding to the request in the overtime queue according to the overtime duration of the request from the tail of the overtime queue.
In one embodiment, the computer program when executed by the processor further performs the steps of: the determining the position of the node corresponding to the request in the timeout queue according to the timeout duration of the request includes: comparing the value of the current node corresponding to the current request with the value of the father node of the current node; if the value of the current node is larger than or equal to the value of the father node of the current node, keeping the position of the current node in the overtime queue unchanged; if the value of the current node is smaller than the value of the father node of the current node, exchanging the position of the current node and the father node of the current node in the overtime queue, and comparing the value of the current node after exchanging the position with the value of the father node of the current node after exchanging the position until the value of the current node is smaller than the value of the father node of the current node.
In one embodiment, the computer program when executed by the processor further performs the steps of: the judging whether the request in the overtime queue is overtime includes: acquiring a root node corresponding request in the overtime queue as a target request; acquiring a difference value between the current time and the sending time of the target request; comparing the difference value with the timeout duration of the target request; if the difference is larger than or equal to the overtime length of the target request, judging whether a response corresponding to the target request exists in a response queue; and if the corresponding response exists in the response queue, judging that the corresponding request of the root node is not overtime.
In one embodiment, the computer program when executed by the processor further performs the steps of: if the corresponding response exists in the response queue, after the request corresponding to the root node is judged not to be overtime, the method further comprises the following steps: deleting the root node from the timeout queue.
In one embodiment, the computer program when executed by the processor further performs the steps of: and if the corresponding response does not exist in the response queue, judging that the corresponding request of the root node is overtime.
In one embodiment, the computer program when executed by the processor further performs the steps of: if the request is overtime, processing the request according to a request overtime strategy, comprising: generating a request overtime alarm; acquiring a request timeout strategy corresponding to the corresponding request of the root node; processing the corresponding request of the root node according to the request timeout strategy; deleting the root node from the timeout queue.
In one embodiment, the computer program when executed by the processor further performs the steps of: and if the difference is smaller than the overtime duration of the target request, judging that the corresponding request of the root node is not overtime.
In one embodiment, the computer program when executed by the processor further performs the steps of: if the difference is smaller than the timeout duration of the target request, after the request corresponding to the root node is judged not to be timeout, the method further comprises the following steps: keeping the root node unchanged.
In one embodiment, the computer program when executed by the processor further performs the steps of: after the deleting the root node, the method further comprises: placing the last node in the overtime queue at the position of a root node, taking the updated root node as a reference node, and keeping the value of the reference node unchanged; comparing the value of the reference node to the values of the left child node and the right child node of the reference node; if the value of the reference node is greater than the value of the left child node and greater than the value of the right child node, exchanging the position of the reference node with a smaller value of the left child node and the right child node, if the value of the reference node is greater than the value of the left child node and less than or equal to the value of the right child node, exchanging the position of the reference node with the left child node, and if the value of the reference node is less than or equal to the value of the left node and greater than the value of the right child node, exchanging the position of the reference node with the right child node; and comparing the value of the reference node after the switching position with the value of the left child node and the value of the right child node of the reference node after the switching position until the reference node has no left child node.
In one embodiment, the computer program when executed by the processor further performs the steps of: acquiring a response sent by the response server, and adding the response into a response queue, wherein the response comprises a request identifier corresponding to the response; the judging whether a response corresponding to the target request exists in the response queue includes: and judging whether a response corresponding to the target request exists in the response queue according to the identifier of the request.
In one embodiment, the computer program when executed by the processor further performs the steps of: sending a request to the response server; before sending the request to the response server, the method further comprises: classifying the request sent to the response server; setting corresponding timeout duration for the different types of requests; and setting corresponding request timeout strategies for the requests of different types.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, databases, or other media used in embodiments provided herein may include non-volatile and/or volatile memory. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
It is noted that, in this document, relational terms such as "first" and "second," and the like, may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
The foregoing are merely exemplary embodiments of the present invention, which enable those skilled in the art to understand or practice the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (17)
1. A request timeout monitoring method is applied to a request server, and comprises the following steps:
acquiring a request sent to a response server;
acquiring the overtime length of the request;
storing the request in an overtime queue according to the overtime duration of the request;
judging whether the request in the overtime queue is overtime or not;
if the request is overtime, processing the request according to a request overtime strategy;
the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server.
2. The method of claim 1, wherein the data structure of the timeout queue is a mini-heap, each node of the mini-heap corresponds to a request, and the value of each node is the timeout duration of the corresponding request.
3. The method of claim 1 or 2, wherein storing the request in a timeout queue according to a timeout duration of the request comprises:
and writing the node corresponding to the request into the timeout queue according to the timeout duration of the request.
4. The method of claim 3, wherein writing the node corresponding to the request into a timeout queue according to the timeout duration of the request comprises:
and determining the position of the node corresponding to the request in the overtime queue according to the overtime duration of the request from the tail of the overtime queue.
5. The method of claim 4, wherein determining the position of the node corresponding to the request in the timeout queue according to the timeout duration of the request comprises:
comparing the value of the current node corresponding to the current request with the value of the father node of the current node;
if the value of the current node is larger than or equal to the value of the father node of the current node, keeping the position of the current node in the overtime queue unchanged;
if the value of the current node is less than the value of the parent node of the current node, exchanging the position of the current node and the parent node of the current node in the overtime queue,
and comparing the value of the current node after the exchange position with the value of the father node of the current node after the exchange position until the value of the current node is smaller than the value of the father node of the current node.
6. The method of claim 1, wherein said determining whether a request in the timeout queue has timed out comprises:
acquiring a root node corresponding request in the overtime queue as a target request;
acquiring a difference value between the current time and the sending time of the target request;
comparing the difference value with the timeout duration of the target request;
if the difference is larger than or equal to the overtime length of the target request, judging whether a response corresponding to the target request exists in a response queue;
and if the corresponding response exists in the response queue, judging that the corresponding request of the root node is not overtime.
7. The method of claim 6, wherein if there is a corresponding response in the response queue, after determining that the request corresponding to the root node has not timed out, the method further comprises:
deleting the root node from the timeout queue.
8. The method of claim 6, wherein if there is no corresponding response in the response queue, determining that the root node corresponds to a request timeout.
9. The method of claim 8, wherein processing the request according to the request timeout policy if the request is timed out comprises:
generating a request overtime alarm;
acquiring a request timeout strategy corresponding to the corresponding request of the root node;
processing the corresponding request of the root node according to the request timeout strategy;
deleting the root node from the timeout queue.
10. The method of claim 6, wherein if the difference is less than a timeout duration of the target request, determining that the root node corresponding request is not timed out.
11. The method of claim 10, wherein if the difference is smaller than the timeout duration of the target request, after determining that the request corresponding to the root node is not timed out, the method further comprises:
keeping the root node unchanged.
12. The method of claim 7 or 9, wherein after the deleting the root node, the method further comprises:
placing the last node in the overtime queue at the position of a root node, taking the updated root node as a reference node, and keeping the value of the reference node unchanged;
comparing the value of the reference node to the values of the left child node and the right child node of the reference node;
if the value of the reference node is larger than the value of the left child node and larger than the value of the right child node, the reference node exchanges the position with the node with the smaller value of the left child node and the right child node,
if the value of the reference node is larger than the value of the left child node and smaller than or equal to the value of the right child node, exchanging the position of the reference node and the left child node,
if the value of the reference node is smaller than or equal to the value of the left node and larger than the value of the right child node, exchanging the position of the reference node and the right child node;
and comparing the value of the reference node after the switching position with the value of the left child node and the value of the right child node of the reference node after the switching position until the reference node has no left child node.
13. The method of claim 6, wherein the method further comprises:
acquiring a response sent by the response server, and adding the response into a response queue, wherein the response comprises a request identifier corresponding to the response;
the judging whether a response corresponding to the target request exists in the response queue includes:
and judging whether a response corresponding to the target request exists in the response queue according to the identifier of the request.
14. The method of claim 1, wherein the method further comprises:
sending a request to the response server;
before sending the request to the response server, the method further comprises:
classifying the request sent to the response server;
setting corresponding timeout duration for the different types of requests;
and setting corresponding request timeout strategies for the requests of different types.
15. A request timeout monitoring apparatus, provided in a request server, the apparatus comprising:
a request acquisition unit for acquiring a request sent to the response server;
an overtime length obtaining unit, configured to obtain an overtime length of the request;
the request storage unit is used for storing the request in an overtime queue according to the overtime length of the request;
the request monitoring unit is used for judging whether the requests in the overtime queue are overtime or not;
the processing unit is used for processing the request according to a request timeout strategy if the request is overtime;
the timeout duration is used for indicating that the request is overtime if the duration between the sending time and the receiving time is greater than the timeout duration, the sending time is the time when the request server sends the request to the response server, and the receiving time is the time when the request server receives the response of the corresponding request sent by the response server.
16. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the steps of the method of any of claims 1 to 14 are implemented by the processor when executing the computer program.
17. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method of any one of claims 1 to 14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010934277.7A CN112104521A (en) | 2020-09-08 | 2020-09-08 | Request timeout monitoring method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010934277.7A CN112104521A (en) | 2020-09-08 | 2020-09-08 | Request timeout monitoring method and device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112104521A true CN112104521A (en) | 2020-12-18 |
Family
ID=73751112
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010934277.7A Pending CN112104521A (en) | 2020-09-08 | 2020-09-08 | Request timeout monitoring method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112104521A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113590236A (en) * | 2021-08-03 | 2021-11-02 | 聚好看科技股份有限公司 | Server and micro-service declarative interface timeout configuration method |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105574624A (en) * | 2014-10-09 | 2016-05-11 | 阿里巴巴集团控股有限公司 | Abnormal data processing method and device and monitoring system |
| CN106817389A (en) * | 2015-11-30 | 2017-06-09 | 五八同城信息技术有限公司 | Method, device and the terminal being managed collectively to the network request of application program |
| CN110688532A (en) * | 2019-09-03 | 2020-01-14 | 视联动力信息技术股份有限公司 | Transaction management method and device |
| US20200021665A1 (en) * | 2016-12-26 | 2020-01-16 | China Unionpay Co., Ltd. | Method and device for timeout monitoring |
| CN110740103A (en) * | 2019-09-02 | 2020-01-31 | 深圳壹账通智能科技有限公司 | Service request processing method and device, computer equipment and storage medium |
| CN111614714A (en) * | 2020-04-01 | 2020-09-01 | 视联动力信息技术股份有限公司 | Data processing method and device of service system |
-
2020
- 2020-09-08 CN CN202010934277.7A patent/CN112104521A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105574624A (en) * | 2014-10-09 | 2016-05-11 | 阿里巴巴集团控股有限公司 | Abnormal data processing method and device and monitoring system |
| CN106817389A (en) * | 2015-11-30 | 2017-06-09 | 五八同城信息技术有限公司 | Method, device and the terminal being managed collectively to the network request of application program |
| US20200021665A1 (en) * | 2016-12-26 | 2020-01-16 | China Unionpay Co., Ltd. | Method and device for timeout monitoring |
| CN110740103A (en) * | 2019-09-02 | 2020-01-31 | 深圳壹账通智能科技有限公司 | Service request processing method and device, computer equipment and storage medium |
| CN110688532A (en) * | 2019-09-03 | 2020-01-14 | 视联动力信息技术股份有限公司 | Transaction management method and device |
| CN111614714A (en) * | 2020-04-01 | 2020-09-01 | 视联动力信息技术股份有限公司 | Data processing method and device of service system |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113590236A (en) * | 2021-08-03 | 2021-11-02 | 聚好看科技股份有限公司 | Server and micro-service declarative interface timeout configuration method |
| CN113590236B (en) * | 2021-08-03 | 2023-10-31 | 聚好看科技股份有限公司 | Server and microservice declarative interface timeout configuration method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10439937B2 (en) | Service addressing in distributed environment | |
| US11614867B2 (en) | Distributed storage system-based data processing method and storage device | |
| CN111475376B (en) | Method, apparatus, computer device and storage medium for processing test data | |
| US10579595B2 (en) | Method and device for calling a distributed file system | |
| CN109462631B (en) | Data processing method, data processing device, storage medium and electronic device | |
| CN112153170B (en) | Method, device and equipment for accessing server and storage medium | |
| CN112118315A (en) | Data processing system, method, device, electronic equipment and storage medium | |
| CN112732756B (en) | Data query method, device, equipment and storage medium | |
| US10642585B1 (en) | Enhancing API service schemes | |
| CN108519987A (en) | A kind of data persistence method and apparatus | |
| CN113886496A (en) | Data synchronization method and device of block chain, computer equipment and storage medium | |
| CN112104521A (en) | Request timeout monitoring method and device, computer equipment and storage medium | |
| CN113722114A (en) | Data service processing method and device, computing equipment and storage medium | |
| CN111400051B (en) | Resource scheduling method, device and system | |
| CN112148508B (en) | Information processing method and related device | |
| CN117061072B (en) | Message transmission method, device, equipment and storage medium | |
| CN110995828B (en) | Network resource caching method, device and system | |
| CN111125168B (en) | Data processing method and device, electronic equipment and storage medium | |
| CN111294553B (en) | Method, device, equipment and storage medium for processing video monitoring service signaling | |
| CN109660589B (en) | Request processing method and device and electronic equipment | |
| CN111241069A (en) | Data flattening method and system based on block chain | |
| CN117407159A (en) | Memory space management method and device, equipment and storage medium | |
| CN115510161A (en) | Data synchronization method, device, equipment and storage medium | |
| CN113407562A (en) | Communication method and device of distributed database system | |
| CN113961372B (en) | MQ multi-instance message sending method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20201218 |