CN113259182A - Communication path monitoring method and device based on autonomous decision - Google Patents
Communication path monitoring method and device based on autonomous decision Download PDFInfo
- Publication number
- CN113259182A CN113259182A CN202110748157.2A CN202110748157A CN113259182A CN 113259182 A CN113259182 A CN 113259182A CN 202110748157 A CN202110748157 A CN 202110748157A CN 113259182 A CN113259182 A CN 113259182A
- Authority
- CN
- China
- Prior art keywords
- node
- link
- uplink
- downlink
- source end
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/06—Management of faults, events, alarms or notifications
- H04L41/0654—Management of faults, events, alarms or notifications using network fault recovery
- H04L41/0659—Management of faults, events, alarms or notifications using network fault recovery by isolating or reconfiguring faulty entities
-
- 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/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
Abstract
The invention provides a communication path monitoring method and device based on autonomous decision. The method comprises the steps that nodes on a communication path detect link states between the nodes and adjacent nodes; when the link state is interrupted, if the link with the interrupted state is on the uplink of the node, the link connection between the node and the adjacent node of the downlink of the node is destroyed; and if the link with the interrupted state is on the downlink of the node, generating a link interruption message, and sending the link interruption message to the source end node through the uplink of the node, so that the source end node responds to the link interruption message to generate a destruction instruction, and the link connection between the source end node and the adjacent node is destroyed. In this way, when the link is abnormal, the source end node in the communication link only needs to destroy the adjacent node, and does not need to inform all nodes on the link; and each node on the link can make an autonomous decision without receiving other instructions, so that the communication link can be quickly converged in an abnormal state.
Description
Technical Field
Embodiments of the present invention relate generally to the field of communications, and in particular, to a method and an apparatus for monitoring a communication path based on autonomous decision.
Background
The communication link is a physical channel between two nodes in a network, the communication link is often composed of a plurality of nodes, and the normal state of the communication link is the basis for ensuring that the nodes at two ends of the link can realize communication. In reality, a communication link based on the internet is interrupted due to various reasons, and when the communication link is interrupted, nodes at two ends of the link cannot find the communication link in time and still send data to a target node at the other end of the interrupted link, so that the target cannot receive the data and occupies communication link resources. On the other hand, nodes in the communication link cannot autonomously perform detection and autonomously decide to execute destruction operation even when the link is interrupted, so that the link cannot be rapidly converged.
Disclosure of Invention
According to an embodiment of the present invention, a communication path monitoring scheme based on autonomous decision is provided.
In a first aspect of the invention, a method for communication path monitoring based on autonomous decision making is provided. The method comprises the following steps:
a node on the communication path detects a link state with its neighboring nodes on the uplink and/or downlink; when the node detects that the link state between the node and the adjacent node is interrupted, if the link with the interrupted state is on the uplink of the node, the link connection between the node and the adjacent node of the downlink of the node is destroyed; and if the link with the interrupted state is on the downlink of the node, generating a link interruption message, and sending the link interruption message to a source end node through the uplink of the node, so that the source end node responds to the link interruption message to generate a destruction instruction, wherein the destruction instruction is used for destroying the link connection between the source end node and the adjacent node.
Further, the communication path is generated by pre-construction, and includes a source end node and one or more intermediate nodes.
Further, the intermediate node is able to learn its neighbors in the communication path both in the uplink and in the downlink.
Further, communication is performed between every two adjacent nodes in the communication path through links.
Further, the uplink is a link between a node and the source end node; the downlink is a link between a node and an edge node of the intermediate nodes opposite the source end node.
Further, if the node detects that the link state with its neighboring node on the uplink and/or downlink is not interrupted, the node continuously detects the link state with its neighboring node on the uplink and/or downlink.
In a second aspect of the invention, an autonomous decision-based communication path monitoring apparatus is provided. The device includes:
a detection module for detecting a node on a communication path detecting a link state between a neighboring node on an uplink and/or a downlink;
a judging module, configured to, when the node detects that a link between the node and a neighboring node is in a broken state, judge that the broken link is on an uplink or a downlink of the node;
a destruction module, configured to destroy link connection between the node and a neighboring node of a downlink thereof when the link with the interrupted state is on an uplink of the node; the link interruption message is also used for responding to the link interruption message to generate a destruction instruction, and the destruction instruction is used for destroying the link connection between the source end node and the adjacent node;
a generating module, configured to generate a link interruption message when the link with the interrupted state is on a downlink of the node, and send the link interruption message to the destroying module through an uplink of the node.
In a third aspect of the invention, an electronic device is provided. The electronic device includes: a memory having a computer program stored thereon and a processor implementing the method as described above when executing the program.
In a fourth aspect of the invention, a computer-readable storage medium is provided, on which a computer program is stored which, when being executed by a processor, carries out the method as according to the first aspect of the invention.
The invention does not need manual intervention, when the link is abnormal, the source end node in the communication link only needs to destroy the adjacent node, and does not need to inform all nodes on the link; and each node on the link can make an autonomous decision without receiving other instructions, so that the communication link can be quickly converged in an abnormal state.
Drawings
The above and other features, advantages and aspects of various embodiments of the present invention will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, like or similar reference characters designate like or similar elements, and wherein:
FIG. 1 shows a flow diagram of an autonomous decision based communication path monitoring method according to an embodiment of the invention;
FIG. 2 shows a communication path structure diagram according to an embodiment of the invention;
FIG. 3 illustrates a block diagram of an autonomous decision-based communication path monitoring apparatus according to an embodiment of the present invention;
FIG. 4 illustrates a block diagram of an exemplary electronic device capable of implementing embodiments of the present invention;
wherein 1 is a source end node, 2 is a node 1, 3 is a node 2, 4 is a node 3, 5 is a target node.
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.
In addition, the term "and/or" herein is only one kind of association relationship describing an associated object, and means that there may be three kinds of relationships, for example, a and/or B, which may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
In the invention, manual intervention is not needed, when the link is abnormal, the source end node in the communication link only needs to destroy the adjacent node, and does not need to inform all nodes on the link; and each node on the link can make an autonomous decision without receiving other instructions, so that the communication link can be quickly converged in an abnormal state.
Fig. 1 shows a flow chart of an autonomous decision-based communication path monitoring method according to an embodiment of the invention.
As an embodiment of the present invention, the method includes:
the nodes on the communication path detect link states with their neighboring nodes on the uplink and/or downlink S101.
The communication path comprises a source end node and one or more intermediate nodes, and in the communication path, every two adjacent nodes communicate through a link. And the source end node and the intermediate node which is farthest relative to the source end node, namely an edge node, in the intermediate nodes are jointly used as two end nodes of the communication path. One or more intermediate nodes including the edge node can be arranged, and generally, the number of the intermediate nodes is larger.
In this embodiment, as shown in fig. 2, the communication path includes a source end node and 3 intermediate nodes; the 3 intermediate nodes are respectively nodes 1-3; the node 3 is a middle node farthest from the source end node in the central node, so the node 3 is an edge node. The node 1 is connected with the source end node and the node 2 and is responsible for detecting the state of a link between the source end node and the node 2; the node 2 is connected with the node 1 and the node 3 and is responsible for detecting the state of a link between the node 1 and the node 3; the node 3 is connected with the node 2 and the target node and is responsible for detecting the state of a link between the node 2 and the target node; the node 3, which is an edge node, is also responsible for communicating with the target node.
The uplink of the node is a link between the node and the source end node; for example, in this embodiment, the currently probed node is node 2, and the link between the currently probed node and the source end node is an uplink, that is, the link between node 2 and node 1 and the link between node 1 and the source end node are the uplinks of node 2. The downlink of a node is a link between the node and the edge node; for example, in the present embodiment, the currently probed node is node 2, and the link between the currently probed node and node 3 as the edge node is a downlink, that is, the link between node 2 and node 3 is a downlink of node 2. It can be seen that if a node is an intermediate node, i.e. not a source end node or an edge node, there are two nodes adjacent to the node, which are the adjacent nodes on its uplink and its downlink respectively. However, if an intermediate node is an edge node, the nodes adjacent to it in the communication path have only one of its uplink neighbors.
The node carries out bidirectional detection on the uplink and the downlink, so that the detection efficiency can be improved, and the broken link can be destroyed in time.
In this embodiment, the probe test packet may be sent by the node, and the link status between the node and the neighboring node may be determined according to the returned response packet. The specific detection mode comprises the following steps:
the node sends 1 time of activity detection packets at intervals of a period of time (10 s), detects whether a link between the node and an adjacent node is interrupted, and if the node receives an activity detection response packet returned by the corresponding adjacent node, the link between the current node and the adjacent node is considered to be normal; otherwise, if the node does not receive the activity detection response packet returned by the corresponding adjacent node for the first time, the node is sent again after 10s, and if the node does not receive the activity detection response packet returned by the corresponding adjacent node for 3 times continuously, the link between the node and the corresponding adjacent node is considered to be in an interrupted state.
The link state between the node and the adjacent node can be rapidly detected by the node detection method, and the efficiency is improved.
S102, judging that the node detects the link state between the node and the adjacent node, and executing S103 if the node detects that the link state between the node and the adjacent node is an interruption state; if the node detects that the link state with its neighboring node is a normal state, i.e., an uninterrupted state, the node continuously detects the link state with its neighboring node on the uplink and/or downlink.
In the above embodiment, if the node 2 detects that the link state with the node 1 or the node 3 is the interrupted state, S103 is performed. If the node 2 detects that the link state with the node 1 or the node 3 is normal, the link state with the node 1 and the node 3 is continuously detected. The method and the system ensure that the link state between each node and the adjacent node can be continuously detected by biopsy, and improve the accuracy and timeliness of detection.
S103, judging whether the link with the interrupted state is in the uplink or the downlink of the node; if the link with the interrupted state is on the uplink of the node, destroying the link connection between the node and the adjacent node of the downlink of the node; and if the link with the interrupted state is on the downlink of the node, generating a link interruption message, and sending the link interruption message to a source end node through the uplink of the node, so that the source end node responds to the link interruption message to generate a destruction instruction, wherein the destruction instruction is used for destroying the link connection between the source end node and the adjacent node.
As an implementation manner in this embodiment, as shown in fig. 2, if node 2 detects that the link state with node 1 is an interruption state, it continues to determine whether the link between node 1 and node 2 is an uplink or a downlink of node 2. As shown in fig. 2, the link between node 1 and node 2 is uplink to node 2, and at this time, the link connection between node 2 and node 3 and between node 3 and the target node needs to be destroyed. Meanwhile, when the node 1 detects that the link state with the node 2 is the interruption state, the node 1 continues to determine whether the link between the node 1 and the node 2 is in the uplink or the downlink of the node 1. As shown in fig. 2, a link between a node 1 and a node 2 is a downlink of the node 1, at this time, a link interruption message needs to be generated and sent to a source end node by the node 1, and after receiving the link interruption message, the source end node generates a destruction instruction to destroy a link connection between the source end node and the node 1. So far, the source end node, node 1, node 2 and node 3 originally on the communication path are changed from the sequential connection when the link is normal to the non-connection among the nodes.
As another implementation manner in this embodiment, as shown in fig. 2, if the node 2 detects that the link state with the node 3 is the interruption state, it continues to determine whether the link between the node 3 and the node 2 is the uplink or the downlink of the node 2. As shown in fig. 2, if the link between the node 3 and the node 2 is on the downlink of the node 2, a link interruption message is generated at this time, and the link interruption message is sent to the node 1 through the node 2, and then sent to the source end node by the node 1, so that the source end node generates a destruction instruction in response to the link interruption message. And the destroying instruction is sent to the node 1 by the source end node, and the link connection between the source end node and the node 1 is destroyed. At this time, the node 1 detects the link between the node 1 and the source end node is broken, and since the link is the uplink of the node 1, the node 1 destroys the link connection with the node 2. When the node 2 detects that the link state with the node 3 is in the interruption state, and the node 3 also detects that the link state with the node 2 is in the interruption state, whether the link between the node 3 and the node 2 is in the uplink or the downlink of the node 3 is continuously judged. As shown in fig. 2, if the link between node 3 and node 2 is on the uplink of node 3, node 3 destroys the link connection with the target node. After the destruction process is finished, the source end node, the node 1, the node 2, and the node 3 on the communication path are changed from the sequential connection when the link is normal to the non-connection among the nodes.
Therefore, according to the embodiment of the invention, manual intervention is not needed, when the link is abnormal, the source end node in the communication link only needs to destroy the adjacent node, and all nodes on the link do not need to be informed; and each node on the link can make an autonomous decision without receiving other instructions, so that the communication link can be quickly converged in an abnormal state.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present invention is not limited by the order of acts, as some steps may occur in other orders or concurrently in accordance with the invention. Further, those skilled in the art should also appreciate that the embodiments described in the specification are exemplary embodiments and that the acts and modules illustrated are not necessarily required to practice the invention.
The above is a description of method embodiments, and the embodiments of the present invention are further described below by way of apparatus embodiments.
As shown in fig. 3, the apparatus 300 includes:
a detecting module 310, configured to detect a node on a communication path detecting a link status between a neighboring node and the node on an uplink and/or a downlink;
a determining module 320, configured to, when the node detects that a link between the node and its neighboring node is in a broken state, determine that the broken link is on an uplink or a downlink of the node;
a destruction module 330, configured to destroy link connections between the node and its downlink neighboring nodes when the link with the interrupted state is on the uplink of the node; the link interruption message is also used for responding to the link interruption message to generate a destruction instruction, and the destruction instruction is used for destroying the link connection between the source end node and the adjacent node;
a generating module 340, configured to generate a link failure message when the link with the failed state is on the downlink of the node, and send the link failure message to the destruction module 330 through the uplink of the node.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the described module may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.
As shown in fig. 4, the device includes a Central Processing Unit (CPU) that can perform various appropriate actions and processes according to computer program instructions stored in a Read Only Memory (ROM) or computer program instructions loaded from a storage unit into a Random Access Memory (RAM). In the RAM, various programs and data required for the operation of the device can also be stored. The CPU, ROM, and RAM are connected to each other via a bus. An input/output (I/O) interface is also connected to the bus.
A plurality of components in the device are connected to the I/O interface, including: an input unit such as a keyboard, a mouse, etc.; an output unit such as various types of displays, speakers, and the like; storage units such as magnetic disks, optical disks, and the like; and a communication unit such as a network card, modem, wireless communication transceiver, etc. The communication unit allows the device to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.
The processing unit performs the various methods and processes described above, such as methods S101-S103. For example, in some embodiments, methods S101-S103 may be implemented as a computer software program tangibly embodied in a machine-readable medium, such as a storage unit. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device via ROM and/or the communication unit. When the computer program is loaded into RAM and executed by the CPU, one or more of the steps of methods S101-S103 described above may be performed. Alternatively, in other embodiments, the CPU may be configured to perform methods S101-S103 by any other suitable means (e.g., by way of firmware).
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a load programmable logic device (CPLD), and the like.
Program code for implementing the methods of the present invention may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
Further, while operations are depicted in a particular order, this should be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Under certain circumstances, multitasking and parallel processing may be advantageous. Likewise, while several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the invention. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be implemented in multiple implementations separately or in any suitable subcombination.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
Claims (9)
1. A method for communication path monitoring based on autonomous decision making, the method comprising:
a node on the communication path detects a link state with its neighboring nodes on the uplink and/or downlink; when the node detects that the link state between the node and the adjacent node is interrupted, if the link with the interrupted state is on the uplink of the node, the link connection between the node and the adjacent node of the downlink of the node is destroyed; and if the link with the interrupted state is on the downlink of the node, generating a link interruption message, and sending the link interruption message to a source end node through the uplink of the node, so that the source end node responds to the link interruption message to generate a destruction instruction, wherein the destruction instruction is used for destroying the link connection between the source end node and the adjacent node.
2. The method of claim 1, wherein the communication path is generated by pre-construction and comprises a source end node and one or more intermediate nodes.
3. The method of claim 2, wherein the intermediate node is aware of its neighbors in the communication path both in the uplink and in the downlink.
4. A method according to any of claims 1-3, wherein communication is via a link between each two neighbouring nodes in the communication path.
5. A method according to claim 1 or 3, wherein the uplink is a link between a node and the source end node; the downlink is a link between a node and an edge node of the intermediate nodes opposite the source end node.
6. The method according to claim 1, characterized in that if the node detects that the link status with its neighboring nodes on uplink and/or downlink is not interrupted, the link status with its neighboring nodes on uplink and/or downlink is continuously detected.
7. An autonomous decision-based communication path monitoring apparatus, comprising:
a detection module for detecting a node on a communication path detecting a link state between a neighboring node on an uplink and/or a downlink;
a judging module, configured to, when the node detects that a link between the node and a neighboring node is in a broken state, judge that the broken link is on an uplink or a downlink of the node;
a destruction module, configured to destroy link connection between the node and a neighboring node of a downlink thereof when the link with the interrupted state is on an uplink of the node; the link interruption message is also used for responding to the link interruption message to generate a destruction instruction, and the destruction instruction is used for destroying the link connection between the source end node and the adjacent node;
a generating module, configured to generate a link interruption message when the link with the interrupted state is on a downlink of the node, and send the link interruption message to the destroying module through an uplink of the node.
8. An electronic device comprising a memory and a processor, the memory having stored thereon a computer program, wherein the processor, when executing the program, implements the method of any of claims 1-6.
9. A computer-readable storage medium, on which a computer program is stored, which program, when being executed by a processor, carries out the method of any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110748157.2A CN113259182B (en) | 2021-07-02 | 2021-07-02 | Communication path monitoring method and device based on autonomous decision |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110748157.2A CN113259182B (en) | 2021-07-02 | 2021-07-02 | Communication path monitoring method and device based on autonomous decision |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113259182A true CN113259182A (en) | 2021-08-13 |
| CN113259182B CN113259182B (en) | 2021-09-24 |
Family
ID=77190521
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110748157.2A Active CN113259182B (en) | 2021-07-02 | 2021-07-02 | Communication path monitoring method and device based on autonomous decision |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113259182B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060182128A1 (en) * | 2003-05-22 | 2006-08-17 | Tsuneo Nakata | Data communication system, communication device and communication program thereof |
| CN101083624A (en) * | 2007-07-10 | 2007-12-05 | 北京航空航天大学 | Tree structure based routing method |
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| CN101282569A (en) * | 2007-04-03 | 2008-10-08 | 中兴通讯股份有限公司 | Self-adaption management method for wireless transmission network containing base station and wireless relay station |
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN101800676A (en) * | 2010-02-20 | 2010-08-11 | 中兴通讯股份有限公司 | Link detection method, device and system |
| CN101841464A (en) * | 2010-03-08 | 2010-09-22 | 北京网康科技有限公司 | Network load balancing device and implementation method thereof |
| US20140044121A1 (en) * | 2010-02-23 | 2014-02-13 | Lg Electronics Inc. | Method and apparatus for session routing in home network system |
| CN105764106A (en) * | 2016-02-03 | 2016-07-13 | 宇龙计算机通信科技(深圳)有限公司 | Transmission path updating method, terminal and system |
| CN108322942A (en) * | 2018-01-17 | 2018-07-24 | 宇龙计算机通信科技(深圳)有限公司 | Data transmission method, device, terminal and computer readable storage medium |
| CN109981468A (en) * | 2019-03-29 | 2019-07-05 | 中国人民银行清算总中心 | Link state maintaining method and device |
| CN111937327A (en) * | 2018-04-10 | 2020-11-13 | 华为技术有限公司 | Transmission protocol based synchronization of peer-to-peer databases |
-
2021
- 2021-07-02 CN CN202110748157.2A patent/CN113259182B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060182128A1 (en) * | 2003-05-22 | 2006-08-17 | Tsuneo Nakata | Data communication system, communication device and communication program thereof |
| CN101282569A (en) * | 2007-04-03 | 2008-10-08 | 中兴通讯股份有限公司 | Self-adaption management method for wireless transmission network containing base station and wireless relay station |
| CN101083624A (en) * | 2007-07-10 | 2007-12-05 | 北京航空航天大学 | Tree structure based routing method |
| CN101102272A (en) * | 2007-07-13 | 2008-01-09 | 北京航空航天大学 | A routing update method |
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN101800676A (en) * | 2010-02-20 | 2010-08-11 | 中兴通讯股份有限公司 | Link detection method, device and system |
| US20140044121A1 (en) * | 2010-02-23 | 2014-02-13 | Lg Electronics Inc. | Method and apparatus for session routing in home network system |
| CN101841464A (en) * | 2010-03-08 | 2010-09-22 | 北京网康科技有限公司 | Network load balancing device and implementation method thereof |
| CN105764106A (en) * | 2016-02-03 | 2016-07-13 | 宇龙计算机通信科技(深圳)有限公司 | Transmission path updating method, terminal and system |
| CN108322942A (en) * | 2018-01-17 | 2018-07-24 | 宇龙计算机通信科技(深圳)有限公司 | Data transmission method, device, terminal and computer readable storage medium |
| CN111937327A (en) * | 2018-04-10 | 2020-11-13 | 华为技术有限公司 | Transmission protocol based synchronization of peer-to-peer databases |
| CN109981468A (en) * | 2019-03-29 | 2019-07-05 | 中国人民银行清算总中心 | Link state maintaining method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113259182B (en) | 2021-09-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10873622B2 (en) | Call chain-based concurrency control method and apparatus, and control node | |
| CN110752952B (en) | Network fault positioning method and device, network equipment and computer storage medium | |
| CN107332726B (en) | Communication link detection method and device | |
| US10095576B2 (en) | Anomaly recovery method for virtual machine in distributed environment | |
| CN110740072B (en) | Fault detection method, device and related equipment | |
| CN108418710B (en) | Distributed monitoring system, method and device | |
| CN106790723A (en) | The monitoring method of application service, load-balancing device and monitoring device | |
| CN107948063B (en) | Method for establishing aggregation link and access equipment | |
| CN103685501A (en) | Data processing method, device and system | |
| CN113259182B (en) | Communication path monitoring method and device based on autonomous decision | |
| CN102546304A (en) | BFD detection method, equipment and system | |
| CN108235800A (en) | A kind of network failure probing method and control centre's equipment | |
| CN115037653B (en) | Service flow monitoring method, device, electronic equipment and storage medium | |
| US20030009556A1 (en) | Network system, detection method and monitoring method of network entity faults, and storage medium | |
| TW202014011A (en) | Method for transmitting downlink control channel, terminal and network side device | |
| CN115623464A (en) | Fault processing method and device for Bluetooth module of electric energy meter and electric energy meter | |
| CN111934909B (en) | Main-standby machine IP resource switching method, device, computer equipment and storage medium | |
| US20180139113A1 (en) | Efficiently Calculating Per Service Impact Of Ethernet Ring Status Changes | |
| CN115495301A (en) | Fault processing method, device, equipment and system | |
| CN109803286B (en) | Processing method and device after beam failure and terminal | |
| CN110531646B (en) | FPGA-based power component system fault data acquisition method and system | |
| US20180102835A1 (en) | Transmission device and network system | |
| CN114189424B (en) | Intelligent device control method, intelligent device control device, electronic device, medium and program product | |
| CN104113449A (en) | Link detection method and apparatus | |
| CN115150401B (en) | Data transmission method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |