CN112437067A - Method, system, device and medium for reporting distributed cluster data - Google Patents
Method, system, device and medium for reporting distributed cluster data Download PDFInfo
- Publication number
- CN112437067A CN112437067A CN202011261986.XA CN202011261986A CN112437067A CN 112437067 A CN112437067 A CN 112437067A CN 202011261986 A CN202011261986 A CN 202011261986A CN 112437067 A CN112437067 A CN 112437067A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- data packet
- network
- adjacent
- 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
- 238000000034 method Methods 0.000 title claims abstract description 58
- 230000004044 response Effects 0.000 claims abstract description 23
- 230000002159 abnormal effect Effects 0.000 claims abstract description 14
- 238000004590 computer program Methods 0.000 claims description 6
- 238000004140 cleaning Methods 0.000 claims description 5
- 238000005538 encapsulation Methods 0.000 claims description 5
- 230000008569 process Effects 0.000 description 12
- 238000010586 diagram Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000002688 persistence Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
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/01—Protocols
- H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
- H04L67/025—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP] for remote control or remote monitoring of applications
-
- 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/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
-
- 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/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- 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/14—Session management
- H04L67/143—Termination or inactivation of sessions, e.g. event-controlled end of session
- H04L67/145—Termination or inactivation of sessions, e.g. event-controlled end of session avoiding end of session, e.g. keep-alive, heartbeats, resumption message or wake-up for inactive or interrupted session
-
- 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
Abstract
The invention discloses a method, a system, equipment and a storage medium for reporting distributed cluster data, wherein the method comprises the following steps: responding to the data report to be carried out, and judging whether the network between the current node and the target node is normal or not; responding to the abnormal network between the current node and the destination node, encapsulating the data through the current node, and sending an encapsulated data packet to a first non-adjacent node of the current node; responding to the first non-adjacent node receiving the data packet, analyzing the data packet to obtain a destination node, and judging whether the network between the first non-adjacent node and the destination node is normal or not; and reporting the data to the destination node through the first non-adjacent node in response to the network between the first non-adjacent node and the destination node being normal. The invention transmits the data to the non-adjacent node, the non-adjacent node tries to report to the main node, and the function use during the network failure is not influenced as much as possible by trying to report as much as possible.
Description
Technical Field
The present invention relates to the field of distributed clusters, and in particular, to a method, a system, a computer device, and a readable medium for reporting distributed cluster data.
Background
With the development of technology, whether computing power or data storage, a single computer cannot meet the requirements, and a plurality of computers are usually grouped. In order to monitor the cluster running state and load, performance collection needs to be performed on each node of the cluster. Usually, each node collects the hardware or service operation state of the node and reports the data to the master node. If the network from the node to the main node is suddenly disconnected, reporting of data fails, and at this time, the data is either discarded or cached and reported after the network is recovered, but both processing modes have some problems: the host node persistence pressure is caused by data loss or reporting of a large amount of data after network recovery.
Disclosure of Invention
In view of this, an object of the embodiments of the present invention is to provide a method, a system, a computer device, and a computer-readable storage medium for reporting distributed cluster data, in which data is forwarded to a non-adjacent node, the non-adjacent node attempts to report to a master node, and reporting is attempted as far as possible, so that functional usage during a network failure is not affected as much as possible.
Based on the above object, an aspect of the embodiments of the present invention provides a method for reporting distributed cluster data, including the following steps: responding to the data report to be carried out, and judging whether the network between the current node and the target node is normal or not; responding to the abnormal network between the current node and the destination node, encapsulating data through the current node, and sending an encapsulated data packet to a first non-adjacent node of the current node; responding to the first non-adjacent node to receive the data packet, analyzing the data packet to obtain a destination node, and judging whether the network between the first non-adjacent node and the destination node is normal or not; and reporting the data to the destination node through the first non-adjacent node in response to the network between the first non-adjacent node and the destination node being normal.
In some embodiments, the method further comprises: responding to the abnormal network between the first non-adjacent node and the destination node, and judging whether the number of the intermediate nodes recorded in the data packet reaches a threshold value; and returning the data packet to the current node in response to the number of intermediate nodes recorded in the data packet reaching a threshold.
In some embodiments, the method further comprises: and responding to the situation that the number of the intermediate nodes recorded in the data packet does not reach a threshold value, and sending the data packet to a second non-adjacent node of the first non-adjacent node except the current node for reporting.
In some embodiments, the method further comprises: and responding to the returned data packet received by the current node, storing the data packet into a cache and judging whether the network between the current node and the destination node is normal in real time.
In some embodiments, the method further comprises: judging whether the data amount in the cache reaches a threshold value; and in response to the amount of data in the cache reaching a threshold, cleaning the data stored in the cache earliest.
In some embodiments, the sending the encapsulated packet to the first non-neighboring node of the current node comprises: and determining a first non-adjacent node according to the size of the data packet.
In some embodiments, said determining a first non-neighboring node according to the size of the data packet comprises: dividing all non-adjacent nodes of the current node into two groups according to the distance, and judging whether the size of the data packet exceeds a first threshold value; in response to the size of the data packet exceeding a first threshold, a first non-neighboring node is selected among a set of non-neighboring nodes that are close to the current node.
In another aspect of the embodiments of the present invention, a distributed cluster data reporting system is further provided, including: the judging module is configured to respond to the data report to be carried out and judge whether the network between the current node and the destination node is normal or not; the encapsulation module is configured to respond to the abnormal network between the current node and the destination node, encapsulate data through the current node, and send an encapsulated data packet to a first non-adjacent node of the current node; the analysis module is configured to respond to the first non-adjacent node receiving the data packet, analyze the data packet to obtain a destination node, and judge whether a network between the first non-adjacent node and the destination node is normal; and a reporting module configured to report the data to the destination node through the first non-adjacent node in response to a network between the first non-adjacent node and the destination node being normal.
In another aspect of the embodiments of the present invention, there is also provided a computer device, including: at least one processor; and a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method as above.
In a further aspect of the embodiments of the present invention, a computer-readable storage medium is also provided, in which a computer program for implementing the above method steps is stored when the computer program is executed by a processor.
The invention has the following beneficial technical effects: and forwarding the data to the non-adjacent nodes, wherein the non-adjacent nodes attempt to report to the main node, and the function use during the network failure is not influenced as much as possible by attempting to report as much as possible.
Drawings
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 that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.
Fig. 1 is a schematic diagram of an embodiment of a method for reporting distributed cluster data provided in the present invention;
FIG. 2 is an architecture diagram of a distributed cluster provided by the present invention;
fig. 3 is a schematic hardware structure diagram of an embodiment of a computer device for reporting distributed cluster data provided in the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.
Based on the above purpose, a first aspect of the embodiments of the present invention provides an embodiment of a method for reporting distributed cluster data. Fig. 1 is a schematic diagram illustrating an embodiment of a method for reporting distributed cluster data provided by the present invention. As shown in fig. 1, the embodiment of the present invention includes the following steps:
s1, responding to the data report to be carried out, and judging whether the network between the current node and the destination node is normal;
s2, responding to the abnormal network between the current node and the destination node, encapsulating the data through the current node, and sending an encapsulated data packet to a first non-adjacent node of the current node;
s3, responding to the fact that the first non-adjacent node receives the data packet, analyzing the data packet to obtain a destination node, and judging whether the network between the first non-adjacent node and the destination node is normal or not; and
and S4, responding to the normal network between the first non-adjacent node and the destination node, and reporting the data to the destination node through the first non-adjacent node.
Fig. 2 shows an architecture diagram of a distributed cluster provided by the present invention. As shown in fig. 2, the distributed cluster includes a Master process and an Agent process, the Agent process collects performance data of the node and sends the performance data to the Master process, and the Master process receives and persists the data sent by the Agent process. An embodiment of the present invention will be described with reference to fig. 2.
And responding to the data report, and judging whether the network between the current node and the target node is normal. In this embodiment, the current node is node 2, and the Agent process of node 2 reports data to the Master process of node 1, so it is necessary to determine whether the network between node 2 and node 1 is normal.
And responding to the abnormal network between the current node and the destination node, encapsulating the data through the current node, and sending an encapsulated data packet to a first non-adjacent node of the current node. If the node's network to the master node is disconnected, it is reasonable to conclude that its neighbors have the same problem, and therefore choose to send to its non-neighboring nodes, which attempt to send data to the master node. If the network between the node 2 and the node 1 is abnormal, the Agent process of the node 2 encapsulates the data, the data packet carries information (source node and destination node), and the data packet is tried to be sent to a non-adjacent node (for example, the node 4).
And responding to the data packet received by the first non-adjacent node, analyzing the data packet to obtain a destination node, and judging whether the network between the first non-adjacent node and the destination node is normal. The Agent process of the node 4 receives the data packet sent by the node 2, analyzes the data packet, finds that the destination node of the data packet is not the node, and tries to send the data to the destination node (node 1).
And reporting the data to the destination node through the first non-adjacent node in response to the network between the first non-adjacent node and the destination node being normal. If the network between the node 4 and the node 1 is normal, the data can be reported to the node 1 through the node 4.
In some embodiments, the method further comprises: responding to the abnormal network between the first non-adjacent node and the destination node, and judging whether the number of the intermediate nodes recorded in the data packet reaches a threshold value; and returning the data packet to the current node in response to the number of intermediate nodes recorded in the data packet reaching a threshold. If the number of the analyzed nodes passed by the data packet reaches the threshold value, the cluster is considered to have large-scale network faults, the probability of failure of forwarding is high, the forwarding is not performed any more, and the data is directly returned to the source node (node 2).
In some embodiments, the method further comprises: and responding to the situation that the number of the intermediate nodes recorded in the data packet does not reach a threshold value, and sending the data packet to a second non-adjacent node of the first non-adjacent node except the current node for reporting. If the number of the intermediate nodes recorded in the data packet does not reach the threshold value, the data packet is encapsulated again, carries information (a source node, a destination node and a passing node), and sends the data packet to a second non-adjacent node (for example, the node 6).
In some embodiments, the method further comprises: and responding to the returned data packet received by the current node, storing the data packet into a cache and judging whether the network between the current node and the destination node is normal in real time. After receiving the data returned by other non-destination nodes, the node 2 stores the data into a cache, judges whether the network between the node 2 and the node 1 is normal in real time, and can report the data if the network is normal.
In some embodiments, the method further comprises: judging whether the data amount in the cache reaches a threshold value; and in response to the amount of data in the cache reaching a threshold, cleaning the data stored in the cache earliest. And if the amount of the cached data reaches a threshold value, clearing the data with earlier time and keeping the newer data.
In some embodiments, the sending the encapsulated packet to the first non-neighboring node of the current node comprises: and determining a first non-adjacent node according to the size of the data packet.
In some embodiments, said determining a first non-neighboring node according to the size of the data packet comprises: dividing all non-adjacent nodes of the current node into two groups according to the distance, and judging whether the size of the data packet exceeds a first threshold value; in response to the size of the data packet exceeding a first threshold, a first non-neighboring node is selected among a set of non-neighboring nodes that are close to the current node. For example, if only nodes 1-7 are included in the cluster of this embodiment, all non-adjacent nodes of the current node are divided into two groups, that is, nodes 4-7 are divided into two groups, one group is nodes 4 and 5, and the other group is nodes 6 and 7, if the data packet is too large (exceeds the first threshold), too much resources may be consumed if the transmission distance is too far away, and therefore, the first non-adjacent node may be selected from a group of non-adjacent nodes close to the current node, that is, one of nodes 4 and 5 is selected as the first non-adjacent node.
It should be particularly noted that, the steps in the embodiments of the method for reporting distributed cluster data described above may be mutually intersected, replaced, added, and deleted, and therefore, these methods for reporting distributed cluster data, which are transformed by reasonable permutation and combination, should also belong to the scope of the present invention, and should not limit the scope of the present invention to the embodiments.
Based on the above object, a second aspect of the embodiments of the present invention provides a system for reporting distributed cluster data, including: the judging module is configured to respond to the data report to be carried out and judge whether the network between the current node and the destination node is normal or not; the encapsulation module is configured to respond to the abnormal network between the current node and the destination node, encapsulate data through the current node, and send an encapsulated data packet to a first non-adjacent node of the current node; the analysis module is configured to respond to the first non-adjacent node receiving the data packet, analyze the data packet to obtain a destination node, and judge whether a network between the first non-adjacent node and the destination node is normal; and a reporting module configured to report the data to the destination node through the first non-adjacent node in response to a network between the first non-adjacent node and the destination node being normal.
In some embodiments, the system further comprises: a second determining module, configured to determine, in response to a network anomaly between the first non-adjacent node and the destination node, whether the number of intermediate nodes recorded in the data packet reaches a threshold; and returning the data packet to the current node in response to the number of intermediate nodes recorded in the data packet reaching a threshold.
In some embodiments, the system further comprises: and the sending module is configured to respond to the situation that the number of the intermediate nodes recorded in the data packet does not reach a threshold value, and send the data packet to a second non-adjacent node of the first non-adjacent node except the current node for reporting.
In some embodiments, the system further comprises: and the cache module is configured and used for responding to the data packet returned by the current node, storing the data packet into a cache and judging whether the network between the current node and the destination node is normal in real time.
In some embodiments, the system further comprises: the third judging module is configured to judge whether the data volume in the cache reaches a threshold value; and in response to the amount of data in the cache reaching a threshold, cleaning the data stored in the cache earliest.
In some embodiments, the encapsulation module is configured to: and determining a first non-adjacent node according to the size of the data packet.
In some embodiments, the encapsulation module is configured to: dividing all non-adjacent nodes of the current node into two groups according to the distance, and judging whether the size of the data packet exceeds a first threshold value; in response to the size of the data packet exceeding a first threshold, a first non-neighboring node is selected among a set of non-neighboring nodes that are close to the current node.
In view of the above object, a third aspect of the embodiments of the present invention provides a computer device, including: at least one processor; and a memory storing computer instructions executable on the processor, the instructions being executable by the processor to perform the steps of: s1, responding to the data report to be carried out, and judging whether the network between the current node and the destination node is normal; s2, responding to the abnormal network between the current node and the destination node, encapsulating the data through the current node, and sending an encapsulated data packet to a first non-adjacent node of the current node; s3, responding to the fact that the first non-adjacent node receives the data packet, analyzing the data packet to obtain a destination node, and judging whether the network between the first non-adjacent node and the destination node is normal or not; and S4, responding to the network between the first non-adjacent node and the destination node is normal, reporting the data to the destination node through the first non-adjacent node.
In some embodiments, the steps further comprise: responding to the abnormal network between the first non-adjacent node and the destination node, and judging whether the number of the intermediate nodes recorded in the data packet reaches a threshold value; and returning the data packet to the current node in response to the number of intermediate nodes recorded in the data packet reaching a threshold.
In some embodiments, the steps further comprise: and responding to the situation that the number of the intermediate nodes recorded in the data packet does not reach a threshold value, and sending the data packet to a second non-adjacent node of the first non-adjacent node except the current node for reporting.
In some embodiments, the steps further comprise: and responding to the returned data packet received by the current node, storing the data packet into a cache and judging whether the network between the current node and the destination node is normal in real time.
In some embodiments, the steps further comprise: judging whether the data amount in the cache reaches a threshold value; and in response to the amount of data in the cache reaching a threshold, cleaning the data stored in the cache earliest.
In some embodiments, the sending the encapsulated packet to the first non-neighboring node of the current node comprises: and determining a first non-adjacent node according to the size of the data packet.
In some embodiments, said determining a first non-neighboring node according to the size of the data packet comprises: dividing all non-adjacent nodes of the current node into two groups according to the distance, and judging whether the size of the data packet exceeds a first threshold value; in response to the size of the data packet exceeding a first threshold, a first non-neighboring node is selected among a set of non-neighboring nodes that are close to the current node.
Fig. 3 is a schematic hardware structural diagram of an embodiment of the computer device for reporting the distributed cluster data provided by the present invention.
Taking the apparatus shown in fig. 3 as an example, the apparatus includes a processor 301 and a memory 302, and may further include: an input device 303 and an output device 304.
The processor 301, the memory 302, the input device 303 and the output device 304 may be connected by a bus or other means, and fig. 3 illustrates the connection by a bus as an example.
The memory 302 is used as a non-volatile computer-readable storage medium, and can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions/modules corresponding to the method for reporting distributed cluster data in the embodiment of the present application. The processor 301 executes various functional applications of the server and data processing by running nonvolatile software programs, instructions and modules stored in the memory 302, that is, implements the method for distributed cluster data reporting of the above method embodiment.
The memory 302 may 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; the storage data area may store data created according to the use of the distributed cluster data reporting method, and the like. Further, the memory 302 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 non-volatile solid state storage device. In some embodiments, memory 302 optionally includes memory located remotely from processor 301, which may be connected to a local module via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The input device 303 may receive information such as a user name and a password that are input. The output means 304 may comprise a display device such as a display screen.
Program instructions/modules corresponding to one or more methods for distributed cluster data reporting are stored in the memory 302, and when executed by the processor 301, perform the method for distributed cluster data reporting in any of the above-described method embodiments.
Any embodiment of the computer device executing the method for reporting distributed cluster data may achieve the same or similar effects as any corresponding embodiment of the foregoing method.
The invention also provides a computer readable storage medium storing a computer program which, when executed by a processor, performs the method as above.
Finally, it should be noted that, as one of ordinary skill in the art can appreciate that all or part of the processes of the methods of the above embodiments can be implemented by instructing relevant hardware through a computer program, and the program of the method for reporting distributed cluster data can be stored in a computer readable storage medium, and when executed, the program can include the processes of the embodiments of the methods described above. The storage medium of the program may be a magnetic disk, an optical disk, a Read Only Memory (ROM), a Random Access Memory (RAM), or the like. The embodiments of the computer program may achieve the same or similar effects as any of the above-described method embodiments.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
It should be understood that, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.
The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also technical features in the above embodiment or in different embodiments may be combined and there are many other variations of the different aspects of the embodiments of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.
Claims (10)
1. A method for reporting distributed cluster data is characterized by comprising the following steps:
responding to the data report to be carried out, and judging whether the network between the current node and the target node is normal or not;
responding to the abnormal network between the current node and the destination node, encapsulating data through the current node, and sending an encapsulated data packet to a first non-adjacent node of the current node;
responding to the first non-adjacent node to receive the data packet, analyzing the data packet to obtain a destination node, and judging whether the network between the first non-adjacent node and the destination node is normal or not; and
reporting the data to the destination node through the first non-neighboring node in response to a network between the first non-neighboring node and the destination node being normal.
2. The method of claim 1, further comprising:
responding to the abnormal network between the first non-adjacent node and the destination node, and judging whether the number of the intermediate nodes recorded in the data packet reaches a threshold value; and
and returning the data packet to the current node in response to the number of intermediate nodes recorded in the data packet reaching a threshold value.
3. The method of claim 2, further comprising:
and responding to the situation that the number of the intermediate nodes recorded in the data packet does not reach a threshold value, and sending the data packet to a second non-adjacent node of the first non-adjacent node except the current node for reporting.
4. The method of claim 2, further comprising:
and responding to the returned data packet received by the current node, storing the data packet into a cache and judging whether the network between the current node and the destination node is normal in real time.
5. The method of claim 4, further comprising:
judging whether the data amount in the cache reaches a threshold value; and
and in response to the data amount in the cache reaching a threshold value, cleaning the data stored in the cache at the earliest time.
6. The method of claim 1, wherein sending the encapsulated packet to the first non-neighboring node of the current node comprises:
and determining a first non-adjacent node according to the size of the data packet.
7. The method of claim 6, wherein determining the first non-neighboring node according to the size of the data packet comprises:
dividing all non-adjacent nodes of the current node into two groups according to the distance, and judging whether the size of the data packet exceeds a first threshold value;
in response to the size of the data packet exceeding a first threshold, a first non-neighboring node is selected among a set of non-neighboring nodes that are close to the current node.
8. A system for distributed cluster data reporting, comprising:
the judging module is configured to respond to the data report to be carried out and judge whether the network between the current node and the destination node is normal or not;
the encapsulation module is configured to respond to the abnormal network between the current node and the destination node, encapsulate data through the current node, and send an encapsulated data packet to a first non-adjacent node of the current node;
the analysis module is configured to respond to the first non-adjacent node receiving the data packet, analyze the data packet to obtain a destination node, and judge whether a network between the first non-adjacent node and the destination node is normal; and
a reporting module configured to report the data to the destination node through the first non-adjacent node in response to a normal network between the first non-adjacent node and the destination node.
9. A computer device, comprising:
at least one processor; and
a memory storing computer instructions executable on the processor, the instructions when executed by the processor implementing the steps of the method of any one of claims 1 to 7.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011261986.XA CN112437067A (en) | 2020-11-12 | 2020-11-12 | Method, system, device and medium for reporting distributed cluster data |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011261986.XA CN112437067A (en) | 2020-11-12 | 2020-11-12 | Method, system, device and medium for reporting distributed cluster data |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112437067A true CN112437067A (en) | 2021-03-02 |
Family
ID=74699450
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011261986.XA Pending CN112437067A (en) | 2020-11-12 | 2020-11-12 | Method, system, device and medium for reporting distributed cluster data |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112437067A (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7330440B1 (en) * | 2003-05-20 | 2008-02-12 | Cisco Technology, Inc. | Method and apparatus for constructing a transition route in a data communications network |
-
2020
- 2020-11-12 CN CN202011261986.XA patent/CN112437067A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7330440B1 (en) * | 2003-05-20 | 2008-02-12 | Cisco Technology, Inc. | Method and apparatus for constructing a transition route in a data communications network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9717011B2 (en) | Event management in telecommunications networks | |
| CN111752799A (en) | Service link tracking method, device, equipment and storage medium | |
| CN106612199A (en) | Network monitoring data collection and analysis system and method | |
| CN114363144B (en) | Fault information association reporting method and related equipment for distributed system | |
| CN105589782A (en) | User behavior collection method based on browser | |
| CN110740072A (en) | fault detection method, device and related equipment | |
| CN108462598A (en) | A kind of daily record generation method, log analysis method and device | |
| CN109960634A (en) | A kind of method for monitoring application program, apparatus and system | |
| CN110048907B (en) | Global flow control method and device in cluster environment | |
| US8099489B2 (en) | Network monitoring method and system | |
| CN111835562A (en) | Log uploading method, log query method and log query system | |
| CN107204924B (en) | Link discovery method and device | |
| EP2634699B1 (en) | Application monitoring | |
| CN113760652B (en) | Method, system, device and storage medium for full link monitoring based on application | |
| CN113489149B (en) | Power grid monitoring system service master node selection method based on real-time state sensing | |
| CN112437067A (en) | Method, system, device and medium for reporting distributed cluster data | |
| CN112653569A (en) | Equipment management method, device and system | |
| CN102801569B (en) | Data driven Agent end Trap alarming method | |
| CN111654474A (en) | Safety detection method and device | |
| CN115361312B (en) | Link flow based method and device for monitoring link state between ring network nodes | |
| WO2019164428A1 (en) | Method and first node for managing transmission of probe messages | |
| CN117155937B (en) | Cluster node fault detection method, device, equipment and storage medium | |
| US9379993B1 (en) | Network control protocol | |
| CN117155938B (en) | Cluster node fault reporting method, device, equipment and storage medium | |
| Dong et al. | Research on Fault Management System based on Artificial Intelligence in Data Network |
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 |
Application publication date: 20210302 |
|
| RJ01 | Rejection of invention patent application after publication |