WO2011124178A2 - Procédé de détection de défauts, nœud et système de routage - Google Patents

Procédé de détection de défauts, nœud et système de routage 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
English (en)
Chinese (zh)
Other versions
WO2011124178A3 (fr
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/zh
Priority to PCT/CN2011/074003 priority patent/WO2011124178A2/fr
Publication of WO2011124178A2 publication Critical patent/WO2011124178A2/fr
Publication of WO2011124178A3 publication Critical patent/WO2011124178A3/fr

Links

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/0631—Management 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/065—Management 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

La présente invention concerne un procédé de détection de défauts, un nœud et système de routage. Le procédé de détection de défauts comprend: la transmission via un nœud voisin d'un message de détection vers un voisin de nœud voisin (NN) ; si un message de réponse renvoyé par le nœud voisin n'est pas reçu, la détermination de la présence de défauts dans le trajet d'acheminement via le nœud voisin du nœud voisin. Les modes de réalisation de la présente invention peuvent résoudre les problèmes techniques de sensibilité lente aux défauts d'acheminement et à la recherche chronophage, et donc l'efficacité de fonctionnement et de l'entretien du réseau peut être améliorée et le coût de fonctionnement et d'entretien peut être réduit.
PCT/CN2011/074003 2011-05-12 2011-05-12 Procédé de détection de défauts, nœud et système de routage WO2011124178A2 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN2011800005298A CN102204169A (zh) 2011-05-12 2011-05-12 故障检测方法、路由节点及系统
PCT/CN2011/074003 WO2011124178A2 (fr) 2011-05-12 2011-05-12 Procédé de détection de défauts, nœud et système de routage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/074003 WO2011124178A2 (fr) 2011-05-12 2011-05-12 Procédé de détection de défauts, nœud et système de routage

Publications (2)

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

Family

ID=44662803

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/074003 WO2011124178A2 (fr) 2011-05-12 2011-05-12 Procédé de détection de défauts, nœud et système de routage

Country Status (2)

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

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014186967A1 (fr) * 2013-05-23 2014-11-27 华为技术有限公司 Procédé et dispositif de transfert de données
CN103441897A (zh) * 2013-08-26 2013-12-11 深信服网络科技（深圳）有限公司 对虚拟网络中故障节点进行定位的方法及装置
CN106301853B (zh) * 2015-06-05 2019-06-18 华为技术有限公司 集群系统中节点的故障检测方法和装置
WO2022135321A1 (fr) * 2020-12-21 2022-06-30 华为技术有限公司 Procédé, dispositif et système de transmission de paquets
CN113783735A (zh) * 2021-09-24 2021-12-10 小红书科技有限公司 Redis集群中故障节点的识别方法、装置、设备和介质
CN115442255B (zh) * 2022-03-11 2024-02-06 北京罗克维尔斯科技有限公司 以太网检测方法、系统、装置、电子设备和存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101179499A (zh) * 2007-12-06 2008-05-14 上海大学 用于监控系统的无线自组网形成树形路由方法
CN101211282A (zh) * 2006-12-28 2008-07-02 国际商业机器公司 计算机系统中为故障节点执行失效转移操作的方法
CN101951656A (zh) * 2010-10-07 2011-01-19 西安电子科技大学 具有能量有效和编码感知的无线网络路由协议的设计方法
WO2011053290A1 (fr) * 2009-10-28 2011-05-05 Hewlett-Packard Development Company Lp Procédé et appareil de traçage d'un flux de multidiffusion

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100421393C (zh) * 2005-06-03 2008-09-24 华为技术有限公司 识别网络故障节点的方法
CN100518382C (zh) * 2007-08-02 2009-07-22 中兴通讯股份有限公司 自动交换光网络中多约束条件下最短路径查找方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101211282A (zh) * 2006-12-28 2008-07-02 国际商业机器公司 计算机系统中为故障节点执行失效转移操作的方法
CN101179499A (zh) * 2007-12-06 2008-05-14 上海大学 用于监控系统的无线自组网形成树形路由方法
WO2011053290A1 (fr) * 2009-10-28 2011-05-05 Hewlett-Packard Development Company Lp Procédé et appareil de traçage d'un flux de multidiffusion
CN101951656A (zh) * 2010-10-07 2011-01-19 西安电子科技大学 具有能量有效和编码感知的无线网络路由协议的设计方法

Also Published As

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

Similar Documents

Publication Publication Date Title
JP4714081B2 (ja) ネットワーク接続装置
KR102118687B1 (ko) SDN(Software-defined networking)에서 네트워크 장애 해소를 위한 컨트롤러 및 스위치의 동작 방법과, 이를 위한 컨트롤러 및 스위치
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 (fr) Réseau en anneau ip, dispositif de routage de réseau en anneau et procédé pour transmettre un message
CN102123088B (zh) 建立te隧道的方法及设备
CN108768796B (zh) 链路故障检测方法及装置
US20100172237A1 (en) Building backup tunnels for fast reroute in communications networks
WO2011124178A2 (fr) Procédé de détection de défauts, nœud et système de routage
JP2006279482A (ja) ネットワーク、ルータ装置、それに用いる切替方法及びそのプログラム並びに記録媒体
US8971195B2 (en) Querying health of full-meshed forwarding planes
JP5949035B2 (ja) ネットワーク機器設定装置、設定システム、設定方法及び設定プログラム
JP2004159146A (ja) 通信ネットワーク及びパケット転送装置
US9749215B2 (en) Method for receiving information, method for sending information, and apparatus for the same
CN108924011A (zh) 用于ospf+路由协议的监测系统、相关设备、方法及介质
CN113615132A (zh) 快速泛洪拓扑保护
US8085654B2 (en) Method for reducing fault detection time in a telecommunication network
CN110380966A (zh) 一种发现转发路径的方法及其相关设备
CN103457794B (zh) 确定ip承载网故障的方法和系统
WO2012079405A2 (fr) Procédé et système de traitement de trace de liaison
US8042183B2 (en) Method and apparatus for detecting computer-related attacks
US11398970B2 (en) Internet last-mile outage detection using IP-route clustering
CN103188096A (zh) 一种trill网络中路径保护的方法及装置

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