WO2011124178A2 - Fault detection method, route node and system - Google Patents

Fault detection method, route node and system Download PDF

Info

Publication number
WO2011124178A2
WO2011124178A2 PCT/CN2011/074003 CN2011074003W WO2011124178A2 WO 2011124178 A2 WO2011124178 A2 WO 2011124178A2 CN 2011074003 W CN2011074003 W CN 2011074003W WO 2011124178 A2 WO2011124178 A2 WO 2011124178A2
Authority
WO
WIPO (PCT)
Prior art keywords
node
fault
routing
neighbor
neighboring
Prior art date
Application number
PCT/CN2011/074003
Other languages
French (fr)
Chinese (zh)
Other versions
WO2011124178A3 (en
Inventor
刘小刚
闫刚
Original Assignee
华为技术有限公司
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to CN2011800005298A priority Critical patent/CN102204169A/en
Priority to PCT/CN2011/074003 priority patent/WO2011124178A2/en
Publication of WO2011124178A2 publication Critical patent/WO2011124178A2/en
Publication of WO2011124178A3 publication Critical patent/WO2011124178A3/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0631Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis
    • H04L41/065Management of faults, events, alarms or notifications using root cause analysis; using analysis of correlation between notifications, alarms or events based on decision criteria, e.g. hierarchy, tree or time analysis involving logical or physical relationship, e.g. grouping and hierarchies

Definitions

  • the present invention relates to the field of communication technologies, and in particular, to a fault detection method, a routing node, and a system. Background technique
  • the routing device needs to forward the IP packet to the outbound interface that reaches the destination address of the IP packet in the local IP routing table.
  • the message is sent from the outgoing interface and then forwarded by the routing device connected to the outgoing interface.
  • the IP packet is delivered to the destination network device, such as a personal computer (PC) or a server.
  • the routing device only perceives the address configured on its own interface. To know which interface of the network address other than a few hops is reachable, it needs to rely on the routing protocol.
  • the routing system uses a technical solution in which the control plane and the forwarding plane are separated, and the data packets sent by the user can be forwarded through the forwarding plane.
  • the data packet can be forwarded to the mail server through the routing node H, the routing node J, and the routing node K in sequence, and the routing path is as shown by the solid line in FIG. 2 .
  • the detection packet sent by the NMS is forwarded through the control plane.
  • the detection packet can be forwarded through the routing node M, the routing node L, and the routing node K in sequence.
  • the path is shown by the dotted line in Figure 2.
  • the inventors have found that at least the following problems exist in the prior art:
  • the forwarding path HJK fails, the data packet of the user plane cannot be forwarded to the user or the mail server, and the data packet is discarded.
  • the network management device does not need to forward the forwarding path HJK. Therefore, the network management system cannot detect the fault of the forwarding path HJK, and cannot notify the network operation and maintenance personnel of the fault location in time. It will be known, and it is very time-consuming to find faults, which greatly reduces the quality of the network, and the operation and maintenance efficiency is also affected. Great impact. Summary of the invention
  • the embodiments of the present invention provide a fault detection method, a routing node, and a system, which solve the problem of slow forwarding fault detection and time consuming in the prior art.
  • an embodiment of the present invention provides a fault detection method, including:
  • an embodiment of the present invention provides a routing node, including:
  • a packet sending module configured to send a detection packet to the neighboring neighbor NN node by using the neighboring node, where the fault determining module is configured to determine, if the NN node does not receive the response packet returned by the neighboring node, There is a fault in the forwarding path of the neighboring node to the NN node.
  • an embodiment of the present invention provides a fault detection system, including multiple routing nodes, where at least one routing node uses a routing node as described above.
  • the fault detection method, the routing node, and the system provided by the embodiment of the present invention use the routing node to actively send a detection packet to the neighboring neighbor NN node through the neighboring node, and if the NN node does not receive the response returned by the neighboring node.
  • the packet can be used to determine the technical problem that the forwarding path of the neighboring node to the NN node is faulty. Therefore, the embodiment of the present invention can solve the technical problem of slow forwarding fault detection and time consuming in the prior art, and further It can improve network operation and maintenance efficiency and reduce operation and maintenance costs.
  • FIG. 1 is an application scenario diagram of the prior art.
  • FIG. 2 is another application scenario diagram of the prior art.
  • FIG. 3 is a schematic diagram of a network topology structure of an application scenario according to an embodiment of the present invention.
  • Figure 3b is a schematic diagram of the SPF tree calculated by node A in Figure 3a.
  • Figure 3c is a schematic diagram of the SPF tree calculated by Node B in Figure 3a.
  • FIG. 4 is a schematic flowchart diagram of Embodiment 1 of a fault detection method according to the present invention.
  • FIG. 5 is a schematic flowchart of Embodiment 2 of a fault detection method according to the present invention.
  • FIG. 5b is a schematic diagram of a fault detection method according to Embodiment 2 of the present invention and a detection packet path of the node A of FIG. 3a.
  • FIG. 5c is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method and Node B of FIG. 3a.
  • FIG. 5 is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method provided by the present invention in combination with Node C of FIG. 3a.
  • FIG. 5e is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method and Node D of FIG. 3a.
  • FIG. 5f is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method and Node E of FIG. 3a.
  • FIG. 6 is a schematic structural diagram of Embodiment 1 of a routing node according to the present invention.
  • FIG. 7 is a schematic structural diagram of Embodiment 2 of a routing node according to the present invention.
  • FIG. 8 is a schematic structural diagram of an embodiment of a fault detection system according to the present invention. detailed description
  • the IGP protocol includes a distance vector routing protocol and a link state routing protocol, wherein the link state routing protocol includes an intermediate system to an intermediate system routing protocol (IS-IS). ), Open Shortest Path First (OSPF) protocol.
  • OSPF Open Shortest Path First
  • the link state routing protocol also known as the Shortest Path First (SPF) protocol, is based on the SPF algorithm.
  • the information about the link state of the routing device is called the link state, and includes: the IP address and subnet mask of the interface, the network type, the cost of the link, and all neighboring routing devices on the link. For Ethernet links, serial point-to-point links, etc.
  • Each routing device receives the link status flooded by all routing devices on the network, and combines the collected link states with their own link states to form a topology map of the entire network.
  • each routing device can use the SPF algorithm to generate a network topology map that is the root node to reach other routing devices in the network, that is, the SPF tree, and then calculate the routing information to each IP address.
  • FIG. 3a is a schematic diagram of a network topology structure of an application scenario according to an embodiment of the present invention, where numbers represent path values between two adjacent nodes. Based on the network topology shown in Figure 3a, with A as the root node, according to the SPF algorithm, the SPF tree can be obtained as shown in Figure 3b, with B as the root node, and the SPF tree can be derived from the SPF algorithm as shown in Figure 3c. .
  • FIG. 4 is a schematic flowchart diagram of Embodiment 1 of a fault detection method according to the present invention. As shown in Figure 4, this embodiment includes:
  • Step 401 Send a detection packet to a Neighbor of Neighbor (NN) node by using a neighboring node.
  • the routing node may send a detection packet to the NN node through the neighbor node.
  • the neighbor node here refers to a routing device adjacent to the routing node
  • the NN node refers to a routing device adjacent to the neighbor node.
  • the address of the NN node can be determined according to the network topology map.
  • the network topology map can be any network topology map of any type in the prior art, which is not limited in this embodiment.
  • the detection packet here can be implemented by using various protocols in the prior art, such as a Packet Internet Grope (referred to as ping) command, and the destination node that receives the detection packet according to the protocol will respond to the detection.
  • the source node of the text can be.
  • the destination node of the detection message is an NN node
  • the source node is the routing node.
  • Step 402 If the response message returned by the neighboring node by the NN node is not received, it is determined that there is a fault in the forwarding path of the neighboring node to the NN node.
  • the neighboring node forwards the detection message to the NN node and forwards the response message returned by the NN node to the source node, and determines that the source node passes the neighboring node. There is no fault on this forwarding path from the node to the NN node.
  • the routing node H sends a detection packet to the NN node, that is, the routing node K through its neighbor node, that is, the routing node J, if the response packet returned by the routing node K through the routing node J is not received. Then, the routing node H can determine that the forwarding path HJK is faulty. In this way, when the control plane and the forwarding plane are separated, the fault of the forwarding path H-J-K can be discovered in time through the active detection of the routing node H. Further, other routing nodes, such as the routing node J, can perform similar active detection, and collect all the routing nodes in the network to detect all forwarding paths in the network, thereby locating the forwarding faults of the entire network. .
  • the routing node actively sends a detection packet to the neighboring NN node of the neighbor through the neighboring node, and if the NN node does not receive the response packet returned by the neighboring node, the neighboring node may be determined to pass the neighboring node.
  • the forwarding path to the NN node is technically faulty. Therefore, the embodiment of the present invention can solve the problem that the forwarding fault is slow and the search is time-consuming in the prior art.
  • Technical problems can improve network operation and maintenance efficiency and reduce operation and maintenance costs.
  • FIG. 5 is a schematic flowchart of Embodiment 2 of a fault detection method according to the present invention. As shown in Figure 5a, this embodiment includes:
  • Step 501 Calculating a shortest path SPF tree
  • each routing node in the network can generate an SPF tree with itself as the root node according to the SPF algorithm, which is not limited in this embodiment.
  • Step 502 Determine a neighbor node and an NN node according to the SPF tree.
  • the interface identifier of the ⁇ node and the neighbor node may also be determined.
  • Step 503 Send, by the neighboring node, an Internet Control Message Protocol (ICMP) to the NN node to detect a message;
  • ICMP Internet Control Message Protocol
  • the ICMP detection packet may be an Echo Request packet, a traceroute packet, or the like.
  • the network environment is frequently changed.
  • the detection message is periodically sent to the NN node connected through the neighbor node.
  • Step 504 Determine whether the ICMP response message returned by the NN node is received, and if the execution step 505 is received, if the step 506 is not received,
  • the ICMP response packet corresponds to the ICMP detection packet.
  • the ICMP detection packet is Echo.
  • the corresponding response message is an Echo Reply message.
  • Step 505 Determine that there is no fault in the forwarding path of the neighboring node to the NN node.
  • Step 506 Determine that there is a fault in the forwarding path of the neighboring node to the NN node.
  • Step 507 Output alarm information, where the alarm information includes identifier information of the forwarding path.
  • the identification information of the forwarding path includes identification information of the root node, the neighbor node, and the NN node, such as an address or a name.
  • the alarm information optionally further includes an interface identifier of the root node connected to the neighbor node, an interface identifier of the neighbor node connected to the NN node, and the like.
  • the forwarding path may be faulty, such as the root node to the neighbor node.
  • the detection message may be sent to the at least two NN nodes respectively.
  • step 504 it is determined whether the response message returned by each NN node is received, and if the response message returned by a certain NN node is not received, it is determined that the neighboring node passes the NN node that does not return the response message.
  • the forwarding path is faulty.
  • the alarm information outputted by step 507 optionally includes an interface identifier of the neighbor node connected to the NN node that does not return the response message.
  • the forwarding path of the fault may be highlighted in the network topology according to the forwarding path in the received alarm information, so as to fully display the state of the entire network forwarding path, and further accurately locate the fault. point.
  • each routing device (routing node) in the network may have multiple neighboring nodes, and steps 501 to 507 may be performed for each neighboring node to the NN node connected to the neighboring node through the neighboring node. Further, each routing node in the network can perform the detection process of the foregoing steps, and by collecting the detections of all the routing nodes, all the forwarding paths in the network can be detected, and then the forwarding failure of the entire network can be located. Specifically, in combination with the network topology of FIG. 3a, the path of the detection packet of the node A is shown by the dotted line in FIG. 5b, and the path of the detection packet of the node B is shown by the dotted line in FIG.
  • the path of the detection packet of the node C is as shown in the figure.
  • the detection packet path of node D is as shown by the dotted line in Figure 5e
  • the detection packet path of node E is shown by the dotted line in Figure 5f.
  • FIG. 6 is a schematic structural diagram of Embodiment 1 of a routing node according to the present invention. As shown in FIG. 6, this embodiment includes:
  • a message sending module 61 configured to send a detection message to the NN node by using the neighbor node, where the failure determining module 62 is configured to: if the response message returned by the NN node by the neighbor node is not received, determine There is a fault in the forwarding path of the neighbor node to the NN node.
  • the routing node may be a network device with routing function or a routing device.
  • Embodiment 1 of a fault detection method provided by the present invention refers to Embodiment 1 of a fault detection method provided by the present invention.
  • the routing node actively sends a detection packet to the NN node through the neighboring node, and if the NN node does not receive the response packet returned by the neighboring node, it determines that the neighboring node is to the NN node.
  • the technical problem of the fault that the forwarding path is faulty is solved. Therefore, the technical problem of slow forwarding fault detection and time-consuming searching in the prior art can be solved, thereby achieving the technical effect of improving network operation and maintenance efficiency and reducing operation and maintenance cost.
  • FIG. 7 is a schematic structural diagram of Embodiment 2 of a routing node according to the present invention. As shown in FIG. 7, this embodiment includes:
  • a calculation module 73 configured to calculate a shortest path SPF tree
  • a message sending module 71 configured to determine a neighboring node and an NN node according to the SPF tree, and send a detection packet to the NN node by using the neighboring node;
  • the fault judging module 72 is configured to determine that there is a fault in the forwarding path of the neighboring node to the NN node if the response message returned by the neighboring node by the NN node is not received.
  • the message sending module 71 is specifically configured to: periodically send an ICMP detection message to the NN node by using the neighboring node; the fault determining module 72 is specifically configured to: according to whether the ICMP returned by the NN node is received In response to the message, it is determined whether there is a fault in the forwarding path of the neighboring node to the NN node.
  • the message sending module 71 is specifically configured to: send an ICMP reflection request message to the NN node; the fault determining module 72 is specifically configured to: if not received the ICMP back returned by the NN node And responding to the message, determining that there is a fault in the forwarding path of the neighboring node to the NN node. Further, if the number of the NN nodes connected to the neighboring node is at least two, the packet is sent by the packet; the fault determining module 72 is specifically configured to: if the response packet returned by the NN node is not received, It is determined that there is a fault in the forwarding path of the NN node passing the neighboring node to the non-returning response message.
  • the alarm module 74 is configured to: when the fault determining module 72 determines that there is a fault in the forwarding path of the neighboring node to the NN node, the alarm information is output, where the alarm information includes the identifier of the forwarding path. information.
  • the specific implementation of this embodiment refers to the second embodiment of the fault detection method provided by the present invention.
  • the routing device actively determines the neighbor node and the NN node according to the calculated SPF tree, and sends an ICMP detection message to the NN node. If the ICMP response packet returned by the NN node is not received, the neighboring node is determined to pass the neighbor.
  • the technical problem that the forwarding path of the node to the NN node is faulty and the alarm information is output. Therefore, the embodiment of the present invention can solve the technical problem of slow forwarding fault detection and time-consuming searching in the prior art, thereby improving the network operation. Technical efficiency of reducing efficiency and reducing operation and maintenance costs.
  • FIG. 8 is a schematic structural diagram of an embodiment of a fault detection system according to the present invention. As shown in FIG. 8, the embodiment includes: a routing node 81, a routing node 82, and a routing node 83 that are sequentially connected, and the routing node 81 can adopt a map. 6 or the structure of the routing node in the embodiment shown in FIG.
  • the routing node 82 and the routing node 83 may also be the same as the routing node 81, and adopt the structure of the routing node in the embodiment shown in FIG. 6 or FIG.
  • the routing node 81 may also be adjacent to the routing node 83.
  • the system may also include other routing nodes connected to the routing node 81, the routing node 82, and the routing node 83, which is not limited in this embodiment.
  • the routing node actively sends a detection packet to the NN node through the neighboring node, and if the NN node does not receive the response packet returned by the neighboring node, it determines that the neighboring node is to the NN node.
  • the technical problem that the forwarding path has a fault is solved. Therefore, the embodiment of the present invention can solve the technical problem of slow forwarding fault detection and time-consuming searching in the prior art, thereby achieving The technical effect of high network operation and maintenance efficiency and low operation and maintenance cost.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

A fault detection method, route node and system are provided. The fault detection method includes: transmitting via a neighbor node a detection message to a neighbor of neighbor (NN) node; if a response message returned by the NN node via the neighbor node is not received, determining that there are faults in the forwarding path via the neighbor node to the NN node. The present embodiments can solve the technical problems of slow forwarding-fault awareness and time-consuming search, and therefore the efficiency of the network operation and maintenance can be improved and the cost of the operation and maintenance can be reduced.

Description

故障检测方法、 路由节点及系统  Fault detection method, routing node and system
技术领域 Technical field
本发明涉及通信技术领域, 尤其是一种故障检测方法、路由节点及系统。 背景技术  The present invention relates to the field of communication technologies, and in particular, to a fault detection method, a routing node, and a system. Background technique
在因特网协议(Internet Protocol, 简称 IP ) 网络中, 如图 1所示, 路由设 备要传递 IP报文,首先要在本地的 IP路由表中查询到达该 IP报文目的地址的出 接口, 然后将该报文从这个出接口中发出, 之后由和这个出接口相连接的路 由设备继续转发。 就这样一跳一跳的传递, 将该 IP报文传递到目的网络设备, 如个人计算机( Personal computer, 简称 PC )或服务器等。作为一个网络设备, 路由设备只感知到自己接口上配置的地址, 要想知道几跳以外的网络地址自 己的哪个接口可达, 就需要依靠路由协议。  In the Internet Protocol (IP) network, as shown in Figure 1, the routing device needs to forward the IP packet to the outbound interface that reaches the destination address of the IP packet in the local IP routing table. The message is sent from the outgoing interface and then forwarded by the routing device connected to the outgoing interface. In this way, the IP packet is delivered to the destination network device, such as a personal computer (PC) or a server. As a network device, the routing device only perceives the address configured on its own interface. To know which interface of the network address other than a few hops is reachable, it needs to rely on the routing protocol.
以现有技术中用户登录邮件服务器的报文路由过程举例来说, 如图 2所 示, 该路由系统采用控制平面和转发平面分离的技术方案, 用户发送的数据 报文可以通过转发面进行转发, 具体来说, 数据报文可以依次通过路由节点 H、 路由节点 J以及路由节点 K被转发到邮件服务器, 其路由路径如图 2中实线 所示。 网管发送的检测报文则通过控制面转发, 具体来说, 检测报文可以依 次通过路由节点M、 路由节点 L和路由节点 K进行转发, 其路径如图 2中虚线 所示。  For example, as shown in FIG. 2, the routing system uses a technical solution in which the control plane and the forwarding plane are separated, and the data packets sent by the user can be forwarded through the forwarding plane. Specifically, the data packet can be forwarded to the mail server through the routing node H, the routing node J, and the routing node K in sequence, and the routing path is as shown by the solid line in FIG. 2 . The detection packet sent by the NMS is forwarded through the control plane. Specifically, the detection packet can be forwarded through the routing node M, the routing node L, and the routing node K in sequence. The path is shown by the dotted line in Figure 2.
在实现本发明过程中, 发明人发现现有技术中至少存在如下问题: 当转 发路径 H-J-K出现故障导致用户面的数据报文无法转发给用户或者邮件服务 器时, 数据报文将会被丟弃掉, 而网管的检测报文由于不需要通过转发路径 H-J-K进行转发, 因而网管无法检测出转发路径 H-J-K出现故障, 也就不能 及时通告给网络运维人员进行故障定位, 而只能在业务层面感知后才会被人 所知, 且查找故障非常耗时, 这极大的降低了网络的质量, 运维效率也受到 很大影响。 发明内容 In the process of implementing the present invention, the inventors have found that at least the following problems exist in the prior art: When the forwarding path HJK fails, the data packet of the user plane cannot be forwarded to the user or the mail server, and the data packet is discarded. The network management device does not need to forward the forwarding path HJK. Therefore, the network management system cannot detect the fault of the forwarding path HJK, and cannot notify the network operation and maintenance personnel of the fault location in time. It will be known, and it is very time-consuming to find faults, which greatly reduces the quality of the network, and the operation and maintenance efficiency is also affected. Great impact. Summary of the invention
本发明实施例提供了一种故障检测方法、 路由节点及系统, 以解决现有 技术中转发故障感知慢、 查找耗时的问题。  The embodiments of the present invention provide a fault detection method, a routing node, and a system, which solve the problem of slow forwarding fault detection and time consuming in the prior art.
一方面, 本发明实施例提供了一种故障检测方法, 包括:  In one aspect, an embodiment of the present invention provides a fault detection method, including:
通过邻居节点向邻居的邻居 NN节点发送检测报文;  Sending a detection packet to the neighboring NN node of the neighbor through the neighbor node;
若未接收到所述 NN节点通过所述邻居节点返回的响应报文,则确定通过 所述邻居节点到所述 NN节点的转发路径存在故障。  If the response message returned by the NN node through the neighbor node is not received, it is determined that there is a fault in the forwarding path through the neighbor node to the NN node.
另一方面, 本发明实施例提供了一种路由节点, 包括:  On the other hand, an embodiment of the present invention provides a routing node, including:
报文发送模块, 用于通过邻居节点向邻居的邻居 NN节点发送检测报文; 故障判断模块,用于若未接收到所述 NN节点通过所述邻居节点返回的响 应报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。  a packet sending module, configured to send a detection packet to the neighboring neighbor NN node by using the neighboring node, where the fault determining module is configured to determine, if the NN node does not receive the response packet returned by the neighboring node, There is a fault in the forwarding path of the neighboring node to the NN node.
再一方面, 本发明实施例提供了一种故障检测系统, 包括多个路由节点, 其中至少一个路由节点采用如上所述的路由节点。  In another aspect, an embodiment of the present invention provides a fault detection system, including multiple routing nodes, where at least one routing node uses a routing node as described above.
上述技术方案中的一个技术方案具有如下优点或有益效果:  One of the above technical solutions has the following advantages or benefits:
本发明实施例提供的故障检测方法、 路由节点及系统, 采用了路由节点 主动通过邻居节点向邻居的邻居 NN节点发送检测报文,若未接收到所述 NN 节点通过所述邻居节点返回的响应报文, 则可以确定通过所述邻居节点到所 述 NN节点的转发路径存在故障的技术手段, 因此, 本发明实施例可以解决 现有技术中转发故障感知慢、 查找耗时的技术问题, 进而可以提高网络运维 效率、 降低运维成本。 附图说明  The fault detection method, the routing node, and the system provided by the embodiment of the present invention use the routing node to actively send a detection packet to the neighboring neighbor NN node through the neighboring node, and if the NN node does not receive the response returned by the neighboring node. The packet can be used to determine the technical problem that the forwarding path of the neighboring node to the NN node is faulty. Therefore, the embodiment of the present invention can solve the technical problem of slow forwarding fault detection and time consuming in the prior art, and further It can improve network operation and maintenance efficiency and reduce operation and maintenance costs. DRAWINGS
为了更清楚地说明本发明实施例或现有技术中的技术方案, 下面将对实 施例或现有技术描述中所需要使用的附图作一简单地介绍, 显而易见地, 下 面描述中的附图是本发明的一些实施例, 对于本领域普通技术人员来讲, 在 不付出创造性劳动性的前提下, 还可以根据这些附图获得其他的附图。 In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, a brief description of the drawings used in the embodiments or the prior art description will be briefly described below, obviously, The drawings in the above description are some embodiments of the present invention, and those skilled in the art can obtain other drawings based on these drawings without any inventive labor.
图 1为现有技术的一个应用场景图。  FIG. 1 is an application scenario diagram of the prior art.
图 2为现有技术的另一应用场景图。  FIG. 2 is another application scenario diagram of the prior art.
图 3a为本发明实施例一个应用场景的网络拓朴结构示意图。  FIG. 3 is a schematic diagram of a network topology structure of an application scenario according to an embodiment of the present invention.
图 3b为图 3a中节点 A计算的 SPF树的示意图。  Figure 3b is a schematic diagram of the SPF tree calculated by node A in Figure 3a.
图 3c为图 3a中节点 B计算的 SPF树的示意图。  Figure 3c is a schematic diagram of the SPF tree calculated by Node B in Figure 3a.
图 4为本发明提供的一种故障检测方法实施例一的流程示意图。  FIG. 4 is a schematic flowchart diagram of Embodiment 1 of a fault detection method according to the present invention.
图 5a为本发明提供的一种故障检测方法实施例二的流程示意图。  FIG. 5 is a schematic flowchart of Embodiment 2 of a fault detection method according to the present invention.
图 5b为本发明提供的一种故障检测方法实施例二结合图 3a节点 A的检测 报文路径示意图。  FIG. 5b is a schematic diagram of a fault detection method according to Embodiment 2 of the present invention and a detection packet path of the node A of FIG. 3a.
图 5c为本发明提供的一种故障检测方法实施例二结合图 3a节点 B的检测 报文路径示意图。  FIG. 5c is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method and Node B of FIG. 3a.
图 5d为本发明提供的一种故障检测方法实施例二结合图 3a节点 C的检测 报文路径示意图。  FIG. 5 is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method provided by the present invention in combination with Node C of FIG. 3a.
图 5e为本发明提供的一种故障检测方法实施例二结合图 3a节点 D的检测 报文路径示意图。  FIG. 5e is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method and Node D of FIG. 3a.
图 5f为本发明提供的一种故障检测方法实施例二结合图 3a节点 E的检测 报文路径示意图。  FIG. 5f is a schematic diagram of a detection packet path according to Embodiment 2 of the fault detection method and Node E of FIG. 3a.
图 6为本发明提供的一种路由节点实施例一的结构示意图。  FIG. 6 is a schematic structural diagram of Embodiment 1 of a routing node according to the present invention.
图 7为本发明提供的一种路由节点实施例二的结构示意图。  FIG. 7 is a schematic structural diagram of Embodiment 2 of a routing node according to the present invention.
图 8为本发明提供的一种故障检测系统实施例的结构示意图。 具体实施方式  FIG. 8 is a schematic structural diagram of an embodiment of a fault detection system according to the present invention. detailed description
为使本发明的目的、 技术方案和优点更加清楚, 下面将结合本发明实施 例中的附图, 对本发明实施例中的技术方案进行清楚、 完整地描述, 显然, 所描述的实施例是本发明一部分实施例, 而不是全部的实施例。 基于本发明 中的实施例, 本领域普通技术人员在没有作出创造性劳动前提下所获得的所 有其他实施例, 都属于本发明保护的范围。 The technical solutions in the embodiments of the present invention will be clearly and completely described in the following with reference to the accompanying drawings in the embodiments of the present invention. The described embodiments are a part of the embodiments of the invention, and not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without creative efforts are within the scope of the present invention.
为了对本发明实施例的方案进行清楚详细的解释, 此处先对内部网关协 议( Internal Gateway Protocol , 简称 IGP )进行介绍。 作为一种动态路由协议, IGP协议包括距离矢量路由协议和链路状态路由协议,其中链路状态路由协议 包括中间系统到中间系统的路由选择协议( Intermediate System to Intermediate System Routing Protocol,简称 IS-IS )、开放式最短路径优先( Open Shortest Path First, 简称 OSPF ) 协议等。 链路状态路由选择协议又称为最短路径优先 ( Shortest Path First, 简称 SPF )协议, 它基于 SPF算法。 路由设备的链路状 态的信息称为链路状态, 包括: 接口的 IP地址和子网掩码、 网络类型、 该链 路的开销、 该链路上的所有的相邻路由设备, 其中网络类型分为以太网链路、 串行点对点链路等。 每个路由设备都会收到网络中所有路由设备泛洪出来的 这些链路状态, 将收集到的链路状态结合自己的链路状态就会合成一张整个 网络的拓朴图。  In order to explain the solution of the embodiment of the present invention in detail, the Internal Gateway Protocol (IGP) is introduced here first. As a dynamic routing protocol, the IGP protocol includes a distance vector routing protocol and a link state routing protocol, wherein the link state routing protocol includes an intermediate system to an intermediate system routing protocol (IS-IS). ), Open Shortest Path First (OSPF) protocol. The link state routing protocol, also known as the Shortest Path First (SPF) protocol, is based on the SPF algorithm. The information about the link state of the routing device is called the link state, and includes: the IP address and subnet mask of the interface, the network type, the cost of the link, and all neighboring routing devices on the link. For Ethernet links, serial point-to-point links, etc. Each routing device receives the link status flooded by all routing devices on the network, and combines the collected link states with their own link states to form a topology map of the entire network.
在一个 IGP域内, 每个路由设备都可以通过 SPF算法生成以自己为根节点 到达网络中其他路由设备的网络拓朴图,也就是 SPF树,进而计算得出到达各 个 IP地址的路由信息。 图 3a为本发明实施例一个应用场景的网络拓朴结构示 意图, 图中的数字代表相邻两个节点间的路径值。 基于图 3a所示的网络拓朴 结构, 以 A作为根节点, 根据 SPF算法可以得出 SPF树如图 3b所示, 以 B作为 根节点, 根据 SPF算法可以得出 SPF树如图 3c所示。  In an IGP domain, each routing device can use the SPF algorithm to generate a network topology map that is the root node to reach other routing devices in the network, that is, the SPF tree, and then calculate the routing information to each IP address. FIG. 3a is a schematic diagram of a network topology structure of an application scenario according to an embodiment of the present invention, where numbers represent path values between two adjacent nodes. Based on the network topology shown in Figure 3a, with A as the root node, according to the SPF algorithm, the SPF tree can be obtained as shown in Figure 3b, with B as the root node, and the SPF tree can be derived from the SPF algorithm as shown in Figure 3c. .
图 4为本发明提供的一种故障检测方法实施例一的流程示意图。 如图 4所 示, 该实施例包括:  FIG. 4 is a schematic flowchart diagram of Embodiment 1 of a fault detection method according to the present invention. As shown in Figure 4, this embodiment includes:
步骤 401、 通过邻居节点向邻居的邻居( Neighbor of Neighbor, 简称 NN ) 节点发送检测报文;  Step 401: Send a detection packet to a Neighbor of Neighbor (NN) node by using a neighboring node.
举例来说, 路由节点可以通过邻居节点向 NN节点发送检测报文。 这里的邻居节点是指与路由节点相邻的路由设备, NN节点是指与邻居节 点相邻的路由设备。 NN节点的地址可以根据网络拓朴图确定, 网络拓朴图可 以采用现有技术中任意形式的网络拓朴图, 本实施例对此不做限定。 这里的 检测报文可以采用现有技术中各种协议实现, 如因特网包探索器 (Packet Internet Grope, 简称 ping )命令等, 只要根据协议收到该检测报文的目的节点 会回应发出该检测 ^艮文的源节点即可。 本实施例中, 检测 ^艮文的目的节点为 NN节点, 源节点为所述路由节点。 For example, the routing node may send a detection packet to the NN node through the neighbor node. The neighbor node here refers to a routing device adjacent to the routing node, and the NN node refers to a routing device adjacent to the neighbor node. The address of the NN node can be determined according to the network topology map. The network topology map can be any network topology map of any type in the prior art, which is not limited in this embodiment. The detection packet here can be implemented by using various protocols in the prior art, such as a Packet Internet Grope (referred to as ping) command, and the destination node that receives the detection packet according to the protocol will respond to the detection. The source node of the text can be. In this embodiment, the destination node of the detection message is an NN node, and the source node is the routing node.
步骤 402、 若未接收到所述 NN节点通过所述邻居节点返回的响应报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。  Step 402: If the response message returned by the neighboring node by the NN node is not received, it is determined that there is a fault in the forwarding path of the neighboring node to the NN node.
通常收到响应才艮文与发出检测才艮文有一定的时间间隔, 若发出检测才艮文 后未在预设的时间间隔内收到响应报文, 则认为未收到响应报文。 现有技术 中对不同协议的检测报文定义的时间间隔会有不同,本实施例对此不作限定。 若收到了所述 NN节点返回的响应报文,说明所述邻居节点将检测报文转发给 了 NN节点并将 NN节点返回的响应报文转发给了源节点, 则确定源节点通过 所述邻居节点到 NN节点的这条转发路径上不存在故障。  Generally, there is a certain time interval between the receipt of the response and the issuance of the detection. If the response message is not received within the preset time interval after the detection is issued, it is considered that the response message is not received. In the prior art, the time interval defined by the detection packets of different protocols may be different, which is not limited in this embodiment. If the response message returned by the NN node is received, the neighboring node forwards the detection message to the NN node and forwards the response message returned by the NN node to the source node, and determines that the source node passes the neighboring node. There is no fault on this forwarding path from the node to the NN node.
具体地, 结合图 2来说, 路由节点 H通过其邻居节点, 即路由节点 J向 NN 节点, 即路由节点 K发送检测报文, 若未接收到路由节点 K通过路由节点 J返 回的响应报文, 则路由节点 H可以确定转发路径 H-J-K存在故障。 这样在控制 平面和转发平面分离的情况下, 通过路由节点 H的主动检测, 可以及时发现 转发路径 H-J-K的故障。 进一步地, 其他路由节点, 如路由节点 J , 也可以进 行类似的主动检测, 把网络中所有路由节点的检测集合起来, 就可以对网络 中所有转发路径进行检测, 进而可以定位全网的转发故障。  Specifically, in conjunction with FIG. 2, the routing node H sends a detection packet to the NN node, that is, the routing node K through its neighbor node, that is, the routing node J, if the response packet returned by the routing node K through the routing node J is not received. Then, the routing node H can determine that the forwarding path HJK is faulty. In this way, when the control plane and the forwarding plane are separated, the fault of the forwarding path H-J-K can be discovered in time through the active detection of the routing node H. Further, other routing nodes, such as the routing node J, can perform similar active detection, and collect all the routing nodes in the network to detect all forwarding paths in the network, thereby locating the forwarding faults of the entire network. .
本发明实施例采用了路由节点主动通过邻居节点向邻居的邻居 NN节点 发送检测报文, 若未接收到所述 NN节点通过所述邻居节点返回的响应报文, 则可以确定通过所述邻居节点到所述 NN节点的转发路径存在故障的技术手 段, 因此, 本发明实施例可以解决现有技术中转发故障感知慢、 查找耗时的 技术问题, 进而可以提高网络运维效率、 降低运维成本。 In the embodiment of the present invention, the routing node actively sends a detection packet to the neighboring NN node of the neighbor through the neighboring node, and if the NN node does not receive the response packet returned by the neighboring node, the neighboring node may be determined to pass the neighboring node. The forwarding path to the NN node is technically faulty. Therefore, the embodiment of the present invention can solve the problem that the forwarding fault is slow and the search is time-consuming in the prior art. Technical problems can improve network operation and maintenance efficiency and reduce operation and maintenance costs.
图 5a为本发明提供的一种故障检测方法实施例二的流程示意图。 如图 5a 所示, 该实施例包括:  FIG. 5 is a schematic flowchart of Embodiment 2 of a fault detection method according to the present invention. As shown in Figure 5a, this embodiment includes:
步骤 501、 计算最短路径 SPF树;  Step 501: Calculating a shortest path SPF tree;
这里, 网络中每个路由节点都可以根据 SPF算法生成以自己为根节点的 SPF树, 本实施例对此不做限定。  Here, each routing node in the network can generate an SPF tree with itself as the root node according to the SPF algorithm, which is not limited in this embodiment.
步骤 502、 根据所述 SPF树确定邻居节点和 NN节点;  Step 502: Determine a neighbor node and an NN node according to the SPF tree.
这里可以确定邻居节点和 NN节点的地址。 可选地, 还可以确定 ^节点与 邻居节点连接的接口标识等。  Here you can determine the address of the neighbor node and the NN node. Optionally, the interface identifier of the ^ node and the neighbor node may also be determined.
步骤 503、 通过所述邻居节点向所述 NN节点发送因特网控制报文协议 ( Internet Control Message Protocol , 以下简称 ICMP )检测才艮文;  Step 503: Send, by the neighboring node, an Internet Control Message Protocol (ICMP) to the NN node to detect a message;
本实施例中, ICMP检测报文可以是反射请求(Echo Request )报文、 追 踪路由路径(traceroute )报文等。 实际应用中网络环境经常变化, 为了及时 地感知故障, 较优地, 步骤 503中周期性地向通过邻居节点连接的 NN节点发 送检测艮文。  In this embodiment, the ICMP detection packet may be an Echo Request packet, a traceroute packet, or the like. In a practical application, the network environment is frequently changed. In order to sense the fault in time, in step 503, the detection message is periodically sent to the NN node connected through the neighbor node.
步骤 504、 判断是否收到所述 NN节点返回的 ICMP响应报文, 若收到执行 步骤 505, 若未收到执行步骤 506;  Step 504: Determine whether the ICMP response message returned by the NN node is received, and if the execution step 505 is received, if the step 506 is not received,
这里的 ICMP响应报文与 ICMP检测报文对应 , 如 ICMP检测报文为 Echo The ICMP response packet corresponds to the ICMP detection packet. For example, the ICMP detection packet is Echo.
Request报文, 则对应的响应报文是反射响应 ( Echo Reply )报文。 For the Request message, the corresponding response message is an Echo Reply message.
步骤 505、判断通过所述邻居节点到所述 NN节点的转发路径不存在故障。 步骤 506、 判断通过所述邻居节点到所述 NN节点的转发路径存在故障; 步骤 507、 输出告警信息, 所述告警信息包含所述转发路径的标识信息。 这里, 转发路径的标识信息包含根节点、 所述邻居节点和 NN节点的标识 信息, 如地址或名称。 所述告警信息可选地还包含所述根节点与所述邻居节 点连接的接口标识、 所述邻居节点与所述 NN节点连接的接口标识等。  Step 505: Determine that there is no fault in the forwarding path of the neighboring node to the NN node. Step 506: Determine that there is a fault in the forwarding path of the neighboring node to the NN node. Step 507: Output alarm information, where the alarm information includes identifier information of the forwarding path. Here, the identification information of the forwarding path includes identification information of the root node, the neighbor node, and the NN node, such as an address or a name. The alarm information optionally further includes an interface identifier of the root node connected to the neighbor node, an interface identifier of the neighbor node connected to the NN node, and the like.
实际应用中, 转发路径存在故障可能有多种原因, 比如根节点到邻居节 点的链路故障, 邻居节点到 NN节点的链路故障, 邻居节点故障或 NN节点故 障等, 因此本实施例中确定转发路径存在故障后还输出告警信息, 网管可以 根据告警信息进一步排查确定故障点, 本实施例对此不作限定。 In actual applications, there may be multiple reasons for the forwarding path to be faulty, such as the root node to the neighbor node. The link fault of the point, the link failure of the neighbor node to the NN node, the failure of the neighbor node, or the failure of the NN node. Therefore, in this embodiment, the alarm information is output after the fault is determined, and the network management system can further check and determine the fault according to the alarm information. This point is not limited in this embodiment.
进一步地, 若有至少两个 NN节点通过所述邻居节点与根节点连接, 则可 以分别向该至少两个 NN节点发送检测报文。 对应地, 步骤 504中判断是否接 收到各 NN节点分别返回的响应报文, 若未接收到某个 NN节点返回的响应报 文则判断通过所述邻居节点到未返回响应报文的 NN节点的转发路径存在故 障。 对应地, 步骤 507输出的告警信息中可选地包含所述邻居节点与未返回响 应报文的 NN节点连接的接口标识。  Further, if at least two NN nodes are connected to the root node by using the neighbor node, the detection message may be sent to the at least two NN nodes respectively. Correspondingly, in step 504, it is determined whether the response message returned by each NN node is received, and if the response message returned by a certain NN node is not received, it is determined that the neighboring node passes the NN node that does not return the response message. The forwarding path is faulty. Correspondingly, the alarm information outputted by step 507 optionally includes an interface identifier of the neighbor node connected to the NN node that does not return the response message.
另外, 在网管端, 可以根据收到的告警信息中的转发路径, 在网络拓朴 图中突出显示存在故障的所述转发路径, 以全面展示全网转发路径的状态, 还可以进一步精确定位故障点。  In addition, at the network management end, the forwarding path of the fault may be highlighted in the network topology according to the forwarding path in the received alarm information, so as to fully display the state of the entire network forwarding path, and further accurately locate the fault. point.
实际应用中, 网络中每个路由设备(路由节点)都可能有多个邻居节点, 则可以针对每个邻居节点,对通过该邻居节点向与该邻居节点连接的 NN节点 执行步骤 501〜507。 进一步地, 网络中各路由节点都可以进行上述步骤的检测 过程, 把所有路由节点的检测集合起来, 就可以对网络中所有转发路径进行 检测, 进而可以定位全网的转发故障。 具体地, 结合图 3a的网络拓朴, 节点 A 的检测报文路径如图 5b中虚线所示, 节点 B的检测报文路径如图 5c中虚线所 示, 节点 C的检测报文路径如图 5d中虚线所示, 节点 D的检测报文路径如图 5e 中虚线所示, 节点 E的检测报文路径如图 5f中虚线所示。  In an actual application, each routing device (routing node) in the network may have multiple neighboring nodes, and steps 501 to 507 may be performed for each neighboring node to the NN node connected to the neighboring node through the neighboring node. Further, each routing node in the network can perform the detection process of the foregoing steps, and by collecting the detections of all the routing nodes, all the forwarding paths in the network can be detected, and then the forwarding failure of the entire network can be located. Specifically, in combination with the network topology of FIG. 3a, the path of the detection packet of the node A is shown by the dotted line in FIG. 5b, and the path of the detection packet of the node B is shown by the dotted line in FIG. 5c, and the path of the detection packet of the node C is as shown in the figure. As shown by the dotted line in 5d, the detection packet path of node D is as shown by the dotted line in Figure 5e, and the detection packet path of node E is shown by the dotted line in Figure 5f.
本实施例采用了路由设备主动根据计算出来的 SPF树确定邻居节点和 NN 节点, 向 NN节点发送 ICMP检测报文, 若未接收到所述 NN节点返回的 ICMP 响应报文则确定通过所述邻居节点到所述 NN节点的转发路径存在故障,输出 告警信息的技术手段, 因此, 本发明实施例可以解决现有技术中转发故障感 知慢、 查找耗时的技术问题, 进而达到了提高网络运维效率、 降低运维成本 的技术效果。 图 6为本发明提供的一种路由节点实施例一的结构示意图。 如图 6所示, 该实施例包括: In this embodiment, the routing device actively determines the neighbor node and the NN node according to the calculated SPF tree, and sends an ICMP detection message to the NN node. If the ICMP response message returned by the NN node is not received, the neighboring node is determined to pass the neighbor. The technical problem that the forwarding path of the node to the NN node is faulty and the alarm information is output. Therefore, the embodiment of the present invention can solve the technical problem of slow forwarding fault detection and time-consuming searching in the prior art, thereby improving network operation and maintenance. The technical effect of efficiency and reduced operation and maintenance costs. FIG. 6 is a schematic structural diagram of Embodiment 1 of a routing node according to the present invention. As shown in FIG. 6, this embodiment includes:
报文发送模块 61, 用于通过邻居节点向 NN节点发送检测报文; 故障判断模块 62,用于若未接收到所述 NN节点通过所述邻居节点返回的 响应报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。  a message sending module 61, configured to send a detection message to the NN node by using the neighbor node, where the failure determining module 62 is configured to: if the response message returned by the NN node by the neighbor node is not received, determine There is a fault in the forwarding path of the neighbor node to the NN node.
实际应用中, 路由节点可以是具有路由功能的网络设备, 也可以称为路 由设备。  In practical applications, the routing node may be a network device with routing function or a routing device.
本实施例的具体实现参照本发明提供的一种故障检测方法实施例一。 本 实施例采用了路由节点主动通过邻居节点向 NN节点发送检测报文,若未接收 到所述 NN节点通过所述邻居节点返回的响应报文则确定通过所述邻居节点 到所述 NN节点的转发路径存在故障的技术手段, 因此, 本发明实施例可以解 决现有技术中转发故障感知慢、 查找耗时的技术问题, 进而达到了提高网络 运维效率、 降低运维成本的技术效果。  The specific implementation of this embodiment refers to Embodiment 1 of a fault detection method provided by the present invention. In this embodiment, the routing node actively sends a detection packet to the NN node through the neighboring node, and if the NN node does not receive the response packet returned by the neighboring node, it determines that the neighboring node is to the NN node. The technical problem of the fault that the forwarding path is faulty is solved. Therefore, the technical problem of slow forwarding fault detection and time-consuming searching in the prior art can be solved, thereby achieving the technical effect of improving network operation and maintenance efficiency and reducing operation and maintenance cost.
图 7为本发明提供的一种路由节点实施例二的结构示意图。 如图 7所示, 该实施例包括:  FIG. 7 is a schematic structural diagram of Embodiment 2 of a routing node according to the present invention. As shown in FIG. 7, this embodiment includes:
计算模块 73 , 用于计算最短路径 SPF树;  a calculation module 73, configured to calculate a shortest path SPF tree;
报文发送模块 71 , 用于根据所述 SPF树确定邻居节点和 NN节点, 通过所 述邻居节点向所述 NN节点发送检测报文;  a message sending module 71, configured to determine a neighboring node and an NN node according to the SPF tree, and send a detection packet to the NN node by using the neighboring node;
故障判断模块 72,用于若未接收到所述 NN节点通过所述邻居节点返回的 响应报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。  The fault judging module 72 is configured to determine that there is a fault in the forwarding path of the neighboring node to the NN node if the response message returned by the neighboring node by the NN node is not received.
进一步地, 报文发送模块 71具体用于, 周期性地通过所述邻居节点向所 述 NN节点发送 ICMP检测报文; 故障判断模块 72具体用于, 根据是否收到所 述 NN节点返回的 ICMP响应报文, 判断通过所述邻居节点到所述 NN节点的转 发路径是否存在故障。  Further, the message sending module 71 is specifically configured to: periodically send an ICMP detection message to the NN node by using the neighboring node; the fault determining module 72 is specifically configured to: according to whether the ICMP returned by the NN node is received In response to the message, it is determined whether there is a fault in the forwarding path of the neighboring node to the NN node.
进一步地, 报文发送模块 71具体用于, 向所述 NN节点发送 ICMP反射请 求报文; 故障判断模块 72具体用于, 若未接收到所述 NN节点返回的 ICMP反 射响应报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。 进一步地, 若与所述邻居节点连接的 NN节点的个数至少为两个, 报文发 报文; 故障判断模块 72具体用于, 若未接收到某个 NN节点返回的响应报文, 则判断通过所述邻居节点到未返回响应报文的 NN节点的转发路径存在故障。 Further, the message sending module 71 is specifically configured to: send an ICMP reflection request message to the NN node; the fault determining module 72 is specifically configured to: if not received the ICMP back returned by the NN node And responding to the message, determining that there is a fault in the forwarding path of the neighboring node to the NN node. Further, if the number of the NN nodes connected to the neighboring node is at least two, the packet is sent by the packet; the fault determining module 72 is specifically configured to: if the response packet returned by the NN node is not received, It is determined that there is a fault in the forwarding path of the NN node passing the neighboring node to the non-returning response message.
进一步地, 还包括: 告警模块 74, 用于在故障判断模块 72判断通过所述 邻居节点到所述 NN节点的转发路径存在故障时, 输出告警信息, 所述告警信 息包含所述转发路径的标识信息。  Further, the alarm module 74 is configured to: when the fault determining module 72 determines that there is a fault in the forwarding path of the neighboring node to the NN node, the alarm information is output, where the alarm information includes the identifier of the forwarding path. information.
本实施例的具体实现参照本发明提供的一种故障检测方法实施例二。 本 实施例采用了路由设备主动根据计算出来的 SPF树确定邻居节点和 NN节点, 向 NN节点发送 ICMP检测报文, 若未接收到所述 NN节点返回的 ICMP响应报 文则确定通过所述邻居节点到所述 NN节点的转发路径存在故障,并输出告警 信息的技术手段, 因此, 本发明实施例可以解决现有技术中转发故障感知慢、 查找耗时的技术问题, 进而达到了提高网络运维效率、 降低运维成本的技术 效果。  The specific implementation of this embodiment refers to the second embodiment of the fault detection method provided by the present invention. In this embodiment, the routing device actively determines the neighbor node and the NN node according to the calculated SPF tree, and sends an ICMP detection message to the NN node. If the ICMP response packet returned by the NN node is not received, the neighboring node is determined to pass the neighbor. The technical problem that the forwarding path of the node to the NN node is faulty and the alarm information is output. Therefore, the embodiment of the present invention can solve the technical problem of slow forwarding fault detection and time-consuming searching in the prior art, thereby improving the network operation. Technical efficiency of reducing efficiency and reducing operation and maintenance costs.
图 8为本发明提供的一种故障检测系统实施例的结构示意图,如图 8所示, 该实施例包括: 依次连接的路由节点 81、 路由节点 82和路由节点 83 , 路由节 点 81可以采用图 6或者图 7所示实施例中的路由节点的结构。  FIG. 8 is a schematic structural diagram of an embodiment of a fault detection system according to the present invention. As shown in FIG. 8, the embodiment includes: a routing node 81, a routing node 82, and a routing node 83 that are sequentially connected, and the routing node 81 can adopt a map. 6 or the structure of the routing node in the embodiment shown in FIG.
实际应用中路由节点 82和路由节点 83也可以和路由节点 81—样,采用图 6 或者图 7所示实施例中的路由节点的结构。 另外, 路由节点 81也可以和路由节 点 83相邻, 系统中还可以包括与路由节点 81、 路由节点 82、 路由节点 83连接 的其他路由节点, 本实施例对此不做限定  In practical applications, the routing node 82 and the routing node 83 may also be the same as the routing node 81, and adopt the structure of the routing node in the embodiment shown in FIG. 6 or FIG. In addition, the routing node 81 may also be adjacent to the routing node 83. The system may also include other routing nodes connected to the routing node 81, the routing node 82, and the routing node 83, which is not limited in this embodiment.
本实施例采用了路由节点主动通过邻居节点向 NN节点发送检测报文,若 未接收到所述 NN节点通过所述邻居节点返回的响应报文则确定通过所述邻 居节点到所述 NN节点的转发路径存在故障的技术手段, 因此, 本发明实施例 可以解决现有技术中转发故障感知慢、 查找耗时的技术问题, 进而达到了提 高网络运维效率、 降低运维成本的技术效果。 In this embodiment, the routing node actively sends a detection packet to the NN node through the neighboring node, and if the NN node does not receive the response packet returned by the neighboring node, it determines that the neighboring node is to the NN node. The technical problem that the forwarding path has a fault is solved. Therefore, the embodiment of the present invention can solve the technical problem of slow forwarding fault detection and time-consuming searching in the prior art, thereby achieving The technical effect of high network operation and maintenance efficiency and low operation and maintenance cost.
本领域普通技术人员可以理解: 实现上述方法实施例的全部或部分步骤 可以通过程序指令相关的硬件来完成, 前述的程序可以存储于一计算机可读 取存储介质中, 该程序在执行时, 执行包括上述方法实施例的步骤; 而前述 的存储介质包括: ROM、 RAM, 磁碟或者光盘等各种可以存储程序代码的介 质。  A person skilled in the art can understand that all or part of the steps of implementing the above method embodiments may be completed by using hardware related to program instructions, and the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed. The foregoing steps include the steps of the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store program codes, such as a ROM, a RAM, a magnetic disk, or an optical disk.
最后应说明的是: 以上实施例仅用以说明本发明的技术方案, 而非对其 限制; 尽管参照前述实施例对本发明进行了详细的说明, 本领域的普通技术 人员应当理解: 其依然可以对前述各实施例所记载的技术方案进行修改, 或 者对其中部分技术特征进行等同替换; 而这些修改或者替换, 并不使相应技 术方案的本质脱离本发明各实施例技术方案的精神和范围。  It should be noted that the above embodiments are only for explaining the technical solutions of the present invention, and are not intended to be limiting; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those skilled in the art that: The technical solutions described in the foregoing embodiments are modified, or some of the technical features are equivalently replaced. The modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present invention.

Claims

权 利 要 求 书 Claim
1、 一种故障检测方法, 其特征在于, 包括:  A fault detection method, comprising:
通过邻居节点向邻居的邻居 NN节点发送检测报文;  Sending a detection packet to the neighboring NN node of the neighbor through the neighbor node;
若未接收到所述 NN节点通过所述邻居节点返回的响应报文,则确定通过 所述邻居节点到所述 NN节点的转发路径存在故障。  If the response message returned by the NN node through the neighbor node is not received, it is determined that there is a fault in the forwarding path through the neighbor node to the NN node.
2、 根据权利要求 1所述的方法, 其特征在于, 所述通过邻居节点向 NN节 点发送检测报文之前, 还包括:  The method according to claim 1, wherein before the sending, by the neighbor node, the detection packet to the NN node, the method further includes:
计算最短路径 SPF树, 根据所述 SPF树确定所述邻居节点和所述 NN节点。 Calculating a shortest path SPF tree, determining the neighbor node and the NN node according to the SPF tree.
3、 根据权利要求 1所述的方法, 其特征在于, 所述通过邻居节点向 NN节 点发送检测报文, 包括: The method according to claim 1, wherein the sending, by the neighboring node, the detection packet to the NN node includes:
周期性地向所述 NN节点发送因特网控制报文协议 ICMP检测报文; 所述若未接收到所述 NN节点通过所述邻居节点返回的响应报文,则确定 通过所述邻居节点到所述 NN节点的转发路径存在故障, 包括:  Transmitting an Internet Control Message Protocol (ICMP) message to the NN node periodically; if the NN node does not receive the response message returned by the neighbor node, determining to pass the neighbor node to the The forwarding path of the NN node is faulty, including:
若未接收到所述 NN节点返回的 ICMP响应报文, 则确定通过所述邻居节 点到所述 NN节点的转发路径存在故障。  If the ICMP response message returned by the NN node is not received, it is determined that there is a fault in the forwarding path through the neighbor node to the NN node.
4、 根据权利要求 3所述的方法, 其特征在于, 所述向所述 NN节点发送因 特网控制报文协议 ICMP检测报文具体包括:  The method according to claim 3, wherein the sending the Internet Control Message Protocol ICMP detection message to the NN node specifically includes:
向所述 NN节点发送 ICMP反射请求报文;  Sending an ICMP reflection request message to the NN node;
所述若未接收到所述 NN节点返回的 ICMP响应报文, 则确定通过所述邻 居节点到所述 NN节点的转发路径存在故障具体包括:  If the ICMP response packet returned by the NN node is not received, determining that the forwarding path of the neighboring node to the NN node is faulty includes:
若未接收到所述 NN节点返回的 ICMP反射响应报文, 则确定通过所述邻 居节点到所述 NN节点的转发路径存在故障。  If the ICMP reflection response message returned by the NN node is not received, it is determined that there is a fault in the forwarding path of the neighboring node to the NN node.
5、 根据权利要求 1〜4任一所述的方法, 其特征在于, 所述确定通过所述 邻居节点到所述 NN节点的转发路径存在故障之后, 还包括:  The method according to any one of claims 1 to 4, wherein after the determining that the forwarding path of the neighboring node to the NN node is faulty, the method further includes:
输出告警信息, 所述告警信息包含所述转发路径的标识信息。  And outputting alarm information, where the alarm information includes identification information of the forwarding path.
6、 一种路由节点, 其特征在于, 包括: 报文发送模块, 用于通过邻居节点向邻居的邻居 NN节点发送检测报文; 故障判断模块,用于若未接收到所述 NN节点通过所述邻居节点返回的响 应报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。 6. A routing node, comprising: a packet sending module, configured to send a detection packet to the neighboring neighbor NN node by using the neighboring node, where the fault determining module is configured to determine, if the NN node does not receive the response packet returned by the neighboring node, There is a fault in the forwarding path of the neighboring node to the NN node.
7、 根据权利要求 6所述的路由节点, 其特征在于, 还包括:  The routing node according to claim 6, further comprising:
计算模块, 用于计算最短路径 SPF树;  a calculation module, configured to calculate a shortest path SPF tree;
所述报文发送模块具体用于, 根据所述 SPF树确定所述邻居节点和所述 NN节点。  The packet sending module is specifically configured to determine the neighbor node and the NN node according to the SPF tree.
8、 根据权利要求 6所述的路由节点, 其特征在于, 所述报文发送模块具 体用于, 周期性地向所述 NN节点发送因特网控制报文协议 ICMP检测报文; 所述故障判断模块具体用于, 若未接收到所述 NN节点返回的 ICMP响应 报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。  The routing node according to claim 6, wherein the packet sending module is configured to periodically send an Internet Control Message Protocol (ICMP) detection message to the NN node; Specifically, if the ICMP response message returned by the NN node is not received, it is determined that there is a fault in the forwarding path of the neighboring node to the NN node.
9、 根据权利要求 8所述的路由节点, 其特征在于, 所述报文发送模块具 体用于, 向所述 NN节点发送 ICMP反射请求报文;  The routing node according to claim 8, wherein the message sending module is configured to send an ICMP reflection request message to the NN node;
所述故障判断模块具体用于, 若未接收到所述 NN节点返回的 ICMP反射 响应报文, 则确定通过所述邻居节点到所述 NN节点的转发路径存在故障。  The fault judging module is specifically configured to: if the ICMP reflection response message returned by the NN node is not received, determine that the forwarding path of the neighboring node to the NN node is faulty.
10、 根据权利要求 6〜9任一所述的路由节点, 其特征在于, 还包括: 告警模块,用于在所述故障判断模块确定通过所述邻居节点到所述 NN节 点的转发路径存在故障时, 输出告警信息, 所述告警信息包含所述转发路径 的标识信息。  The routing node according to any one of claims 6 to 9, further comprising: an alarm module, configured to determine, in the fault judging module, that a forwarding path through the neighboring node to the NN node is faulty The alarm information is output, and the alarm information includes identification information of the forwarding path.
11、 一种故障检测系统, 其特征在于, 包括多个路由节点, 其中至少一 个路由节点采用权利要求 6〜10任一所述的路由节点。  A fault detection system, comprising: a plurality of routing nodes, wherein at least one routing node uses the routing node according to any one of claims 6 to 10.
PCT/CN2011/074003 2011-05-12 2011-05-12 Fault detection method, route node and system WO2011124178A2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN2011800005298A CN102204169A (en) 2011-05-12 2011-05-12 Fault detection method, route node and system
PCT/CN2011/074003 WO2011124178A2 (en) 2011-05-12 2011-05-12 Fault detection method, route node and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/074003 WO2011124178A2 (en) 2011-05-12 2011-05-12 Fault detection method, route node and system

Publications (2)

Publication Number Publication Date
WO2011124178A2 true WO2011124178A2 (en) 2011-10-13
WO2011124178A3 WO2011124178A3 (en) 2012-04-12

Family

ID=44662803

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/074003 WO2011124178A2 (en) 2011-05-12 2011-05-12 Fault detection method, route node and system

Country Status (2)

Country Link
CN (1) CN102204169A (en)
WO (1) WO2011124178A2 (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014186967A1 (en) * 2013-05-23 2014-11-27 华为技术有限公司 Data forwarding method and device
CN103441897A (en) * 2013-08-26 2013-12-11 深信服网络科技(深圳)有限公司 Method and device for locating failure node in virtual network
CN106301853B (en) * 2015-06-05 2019-06-18 华为技术有限公司 The fault detection method and device of group system interior joint
WO2022135321A1 (en) * 2020-12-21 2022-06-30 华为技术有限公司 Packet transmission method, device and system
CN113783735A (en) * 2021-09-24 2021-12-10 小红书科技有限公司 Method, device, equipment and medium for identifying fault node in Redis cluster
CN115442255B (en) * 2022-03-11 2024-02-06 北京罗克维尔斯科技有限公司 Ethernet detection method, system, device, electronic equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101179499A (en) * 2007-12-06 2008-05-14 上海大学 Method for wireless self-organizing of monitoring system to form tree-shaped routing
CN101211282A (en) * 2006-12-28 2008-07-02 国际商业机器公司 Method of executing invalidation transfer operation for failure node in computer system
CN101951656A (en) * 2010-10-07 2011-01-19 西安电子科技大学 Method for designing wireless network routing protocol with energy efficiency and coding perception
WO2011053290A1 (en) * 2009-10-28 2011-05-05 Hewlett-Packard Development Company Lp Method and apparatus for tracing a multicast flow

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100421393C (en) * 2005-06-03 2008-09-24 华为技术有限公司 Method for recognizing failure node in network
CN100518382C (en) * 2007-08-02 2009-07-22 中兴通讯股份有限公司 Shortest path searching method and device under multi-restraint conditions in automatic switching optical network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101211282A (en) * 2006-12-28 2008-07-02 国际商业机器公司 Method of executing invalidation transfer operation for failure node in computer system
CN101179499A (en) * 2007-12-06 2008-05-14 上海大学 Method for wireless self-organizing of monitoring system to form tree-shaped routing
WO2011053290A1 (en) * 2009-10-28 2011-05-05 Hewlett-Packard Development Company Lp Method and apparatus for tracing a multicast flow
CN101951656A (en) * 2010-10-07 2011-01-19 西安电子科技大学 Method for designing wireless network routing protocol with energy efficiency and coding perception

Also Published As

Publication number Publication date
CN102204169A (en) 2011-09-28
WO2011124178A3 (en) 2012-04-12

Similar Documents

Publication Publication Date Title
JP4714081B2 (en) Network connection device
KR102118687B1 (en) A method operating of a controller and a switch to resolve network error, and the controller and the switch therefor
US8672566B2 (en) Node apparatus and communication method
US8774010B2 (en) System and method for providing proactive fault monitoring in a network environment
US10439880B2 (en) Loop-free convergence in communication networks
US8605603B2 (en) Route convergence based on ethernet operations, administration, and maintenance protocol
WO2009018728A1 (en) Ip ring network, ip ring network routing device and message forwarding method
CN102123088B (en) Set up the method and apparatus of traffic engineering tunnel
CN108768796B (en) Link fault detection method and device
US20100172237A1 (en) Building backup tunnels for fast reroute in communications networks
WO2011124178A2 (en) Fault detection method, route node and system
JP2006279482A (en) Network device, router device, switching method used therefor, program thereof, and recording medium
US8971195B2 (en) Querying health of full-meshed forwarding planes
JP5949035B2 (en) Network device setting device, setting system, setting method and setting program
JP2004159146A (en) Communication network and packet transfer device
US9749215B2 (en) Method for receiving information, method for sending information, and apparatus for the same
CN108924011A (en) Monitoring system, relevant device, method and medium for OSPF+ Routing Protocol
CN113615132A (en) Fast flooding topology protection
US8085654B2 (en) Method for reducing fault detection time in a telecommunication network
CN110380966A (en) A kind of method and its relevant device finding forward-path
CN103457794B (en) Method and system for confirming faults of IP bearer network
WO2012079405A2 (en) Link trace processing method and system
US8042183B2 (en) Method and apparatus for detecting computer-related attacks
US11398970B2 (en) Internet last-mile outage detection using IP-route clustering
CN103188096A (en) Method and device for protecting path in TRILL network

Legal Events

Date Code Title Description
WWE Wipo information: entry into national phase

Ref document number: 201180000529.8

Country of ref document: CN

121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11765096

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11765096

Country of ref document: EP

Kind code of ref document: A2