CN108768796A - Link failure detection method and device - Google Patents
Link failure detection method and device Download PDFInfo
- Publication number
- CN108768796A CN108768796A CN201810988568.7A CN201810988568A CN108768796A CN 108768796 A CN108768796 A CN 108768796A CN 201810988568 A CN201810988568 A CN 201810988568A CN 108768796 A CN108768796 A CN 108768796A
- Authority
- CN
- China
- Prior art keywords
- node
- address
- bfd
- path
- hop
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/50—Testing arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Environmental & Geological Engineering (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
A kind of link failure detection method of disclosure offer and device, routing node in IP networkings receives the first BFD messages sent by destination path, if the first BFD messages are the multi-hop BFD messages for including multi-hop BFD labels, judge whether the address for the interface for receiving the first BFD messages is identical as the destination address of the first BFD messages；If identical, the destination address and source address of the first BFD messages are exchanged, obtains the 2nd BFD messages；The 2nd BFD messages are sent to the destination node for sending the first BFD messages, so that destination node when preset duration does not receive the 2nd BFD messages, determines that destination path breaks down.In this way, the multi-hop BFD detections to destination path may be implemented.
Description
Technical field
This disclosure relates to field of communication technology, in particular to a kind of link failure detection method and device.
Background technology
The basic principle of FRR (Fast ReRoute, quick heavy-route) technology is to calculate route stand-by (backup automatically in advance
Next-hop), once detecting link failure, just using route stand-by guidance forwarding, the flow interrupt time is equal to detection and abuts
It the time of failure and the sum of the time that failure routing is replaced using route stand-by, has saved same between router-level topology, forwarding-table item plate
The times such as step, substantially reduce the flow interrupt time.
Currently, FRR technologies are typically to use BFD (Bidirectional Forwarding Detection, two-way converting
Detection) session persistence detection link, however, existing BFD sessions can only establish single-hop automatically between direct-connected neighbor device
BFD sessions.For two indirectly connected equipment, can not be detected by BFD sessions.
Invention content
In view of this, the disclosure is designed to provide a kind of link failure detection method and device, at least partly
Improve the above problem.
In order to achieve the above object, the disclosure adopts the following technical scheme that：
In a first aspect, the disclosure provides a kind of link failure detection method, the routing node being applied in IP networkings is described
Method includes：
The first BFD messages sent by destination path are received, if the first BFD messages are to include multi-hop BFD labels
Multi-hop BFD messages, then judge receive the first BFD messages interface address and the first BFD messages purpose
Whether address is identical；
If identical, the destination address and source address of the first BFD messages are exchanged, the 2nd BFD messages are obtained；
The 2nd BFD messages are sent to the destination node for sending the first BFD messages, so that the destination node exists
When preset duration does not receive the 2nd BFD messages, determine that the destination path breaks down.
Optionally, in above-mentioned link failure detection method, the method further includes：
Determine first node that crosses that the primary path for arriving at location and backup path pass through；
Determine the data that are forwarded from the primary path in first address for crossing the incoming interface on node and
The address of outgoing interface on the routing node；
It establishes using the address of the outgoing interface as source address, using the address of the incoming interface as the multi-hop BFD of purpose address
Session, and the multi-hop for carrying the multi-hop BFD and marking is sent to described first node that crosses by the multi-hop BFD sessions
BFD messages.
Optionally, in above-mentioned link failure detection method, the primary path and backup path for arriving at location are determined
First node that crosses passed through, including：
The node included by the primary path for reaching the destination address is calculated, and each node being calculated is protected successively
It deposits to form first path list；
The node included by the backup path for reaching the destination address is calculated, and each node being calculated is protected successively
It deposits to form the second path list；
By each node in the first path list with each node in second path list according to ordering
It is compared successively, using first identical node as first node that crosses.
Optionally, in above-mentioned link failure detection method,
The node arrived at included by the primary path of location is calculated, including：
According to the link-state information stored in the link state database LSDB of the routing device, pass through shortest path
The node that the primary path includes is calculated in preferential SPF algorithms；
The node included by the backup path for reaching the destination address is calculated, including：
According to the link-state information stored in the LSDB, it is calculated by the alternative LFA algorithms of loop free described
The node that backup path includes.
Optionally, in above-mentioned link failure detection method, determine the data that are forwarded from the primary path described the
The address of incoming interface in one same node point, including：
A upper node for first same node point is searched on the primary path；
Using a upper node as root, the primary next-hop of a calculating upper node to first same node point,
The primary next-hop is determined as to the address of the incoming interface.
Second aspect, the disclosure also provide a kind of link failure detection device, the routing node being applied in IP networkings, institute
Stating device includes：
Receiving module, for receiving the first BFD messages sent by destination path, if the first BFD messages are packet
The multi-hop BFD messages of multi-hop BFD labels are included, then judge the address and described first for receiving the interface of the first BFD messages
Whether the destination address of BFD messages is identical；
Detection module, for the mesh in the address and the first BFD messages of the interface for receiving the first BFD messages
Address it is identical when, exchange the destination address and source address of the first BFD messages, obtain the 2nd BFD messages, and to sending institute
The destination node for stating the first BFD messages sends the 2nd BFD messages, so that the destination node does not receive in preset duration
When the 2nd BFD messages, determine that the destination path breaks down.
Optionally, in above-mentioned link failure detection device, described device further includes：
First determining module, for determining that arriving at the primary path of location and first of backup path process crosses
Node；
Second determining module, for determining from the data that the primary path forwards in first same node point
The address of incoming interface and the address of the outgoing interface on the routing device；
Session establishment module, for establishing using the address of the outgoing interface as source address, being with the address of the incoming interface
The multi-hop BFD sessions of destination address, and carried to the described first node transmission that crosses by the multi-hop BFD sessions described
The multi-hop BFD messages of multi-hop BFD labels.
Optionally, in above-mentioned link failure detection device, first determining module includes：
First computational submodule, for calculating the node included by the primary path for reaching the destination address, and will meter
Obtained each node is preserved successively to form first path list；
Second computational submodule, for calculating the node included by the backup path for reaching the destination address, and will meter
Obtained each node is preserved successively to form the second path list；
Submodule is compared, is used for each node in the first path list and each section in second path list
It presses and is compared successively according to ordering, using first identical node as first node that crosses.
Optionally, in above-mentioned link failure detection device,
First computational submodule, specifically for being stored in the link state database LSDB according to the routing device
Link-state information, the node that the primary path includes is calculated by shortest path first SPF algorithms；
Second computational submodule, specifically for according to the link-state information stored in the LSDB, by acyclic
The node that the backup path includes is calculated in the alternative LFA algorithms on road.
Optionally, in above-mentioned link failure detection device, second determining module is specifically used on the primary road
A upper node for first same node point is searched on diameter, and using a upper node as root, calculate a upper node and arrive
The primary next-hop, is determined as the address of the incoming interface by the primary next-hop of first same node point.
The third aspect, the disclosure also provide a kind of routing node, including processor and machine readable storage medium, the machine
Machine-executable instruction is stored on readable storage medium storing program for executing, the machine-executable instruction, which is performed, promotes the processor real
The link failure detection method that the existing disclosure provides.
Compared to the prior art, the disclosure has the advantages that：
A kind of link failure detection method and device that the disclosure provides, the routing node reception in IP networkings pass through target
The first BFD messages that path is sent, if the first BFD messages are the multi-hop BFD messages for including multi-hop BFD labels, judgement connects
Whether the address for receiving the interface of the first BFD messages is identical as the destination address of the first BFD messages.It is right if identical
The destination address and source address for adjusting the first BFD messages, obtain the 2nd BFD messages, and to the target section for sending the first BFD messages
Point sends the 2nd BFD messages, so that destination node determines that destination path occurs when preset duration does not receive the 2nd BFD messages
Failure.In this way, the multi-hop BFD detections to destination path may be implemented.
Description of the drawings
In order to illustrate more clearly of the technical solution of the disclosure, letter will be made to attached drawing needed in the embodiment below
It singly introduces, it should be understood that the following drawings illustrates only some embodiments of the disclosure, therefore is not construed as to range
It limits, it for those of ordinary skill in the art, without creative efforts, can also be according to these attached drawings
Obtain other relevant attached drawings.
Fig. 1 is a kind of connection diagram for IP networkings that the disclosure provides；
Fig. 2 is a kind of block diagram for routing node that the disclosure provides；
Fig. 3 is a kind of flow diagram for link failure detection method that the disclosure provides；
Fig. 4 is the another flow diagram for the link failure detection method that the disclosure provides；
Fig. 5 is the sub-step schematic diagram of step S41 shown in Fig. 4；
Fig. 6 is the sub-step schematic diagram of step S42 shown in Fig. 4；
Fig. 7 is a kind of functional block diagram for link failure detection device that the disclosure provides.
Icon：10-IP networkings；11,12,13,14,15- routing nodes；121- memories；122- processors；123- networks
Unit；70- link failure detection devices；71- receiving modules；72- detection modules；The first determining modules of 73-；731- first is calculated
Submodule；The second computational submodules of 732-；733- compares submodule；The second determining modules of 74-；75- session establishment modules.
Specific implementation mode
To keep the purpose, technical scheme and advantage of the disclosure clearer, below in conjunction with the attached drawing in the disclosure, to this
Technical solution in open is clearly and completely described, it is clear that described embodiment is that a part of this disclosure is implemented
Example, instead of all the embodiments.It usually here can be with various differences with the component of the disclosure of displaying described in attached drawing
Configuration arrange and design.
Therefore, below the detailed description of the embodiment of the disclosure to providing in the accompanying drawings be not intended to limit it is claimed
The scope of the present disclosure, but be merely representative of the selected embodiment of the disclosure.Based on the embodiment in the disclosure, this field is common
The every other embodiment that technical staff is obtained without making creative work belongs to the model of disclosure protection
It encloses.
It should be noted that：Similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined, then it further need not be defined and explained in subsequent attached drawing in a attached drawing.
Fig. 1 is please referred to, Fig. 1 is a kind of connection diagram for IP networkings 10 that the disclosure provides.The IP networkings include phase
Multiple routing nodes for directly or indirectly communicating to connect between mutually, for example, routing node 11 shown in Fig. 1, routing node 12,
Routing node 13, routing node 14 and routing node 15.
In the disclosure, the routing node can be arbitrary support IP (Internet Protocol, procotol)
The router or three-tier switch of FRR functions, which can calculate automatically reaches the optimal next of corresponding destination address
Jump and with suboptimum next-hop, wherein the optimal next-hop is commonly known as primary next-hop, which is commonly known as
Backup next-hop.
As shown in Fig. 2, being a kind of block diagram for routing node 12 that the disclosure provides, which includes depositing
Reservoir 121, processor 122, network element 123 and link failure detection device 70.
Wherein, link failure detection device 70 can be deposited including at least one in the form of software or firmware (firmware)
The software function module being stored in memory 121, processor 122 are used to execute the executable module being stored in memory 121,
To realize corresponding data processing or interaction.
Wherein, memory 121 may be, but not limited to, random access memory (Random Access Memory,
RAM), read-only memory (Read Only Memory, ROM), programmable read only memory (Programmable Read-Only
Memory, PROM), erasable read-only memory (Erasable Programmable Read-Only Memory, EPROM),
Electricallyerasable ROM (EEROM) (Electric Erasable Programmable Read-Only Memory, EEPROM) etc..
Processor 122 can be a kind of IC chip, the processing capacity with data.Above-mentioned processor 122 can
To be general processor, such as central processing unit (Central Processing Unit, CPU), network processing unit (Network
Processor, NP) etc..Processor 122 may be implemented or execute each method, step and logic diagram disclosed in the disclosure.
In addition, general processor can also be that microprocessor or the processor can also be any conventional processor etc..
Network element 123 is used to establish routing node 12 and miscellaneous equipment (such as user equipment or other roads by network
By node etc.) between communication connection, realize the transmitting-receiving operation of network signal and data.Above-mentioned network signal may include wireless
Signal or wire signal.
It should be appreciated that structure shown in Fig. 2 is only to illustrate, routing node 12 can also include more more less than shown in Fig. 2
Component, or with the configuration different from shown in Fig. 2.Herein it is worth noting that, each component shown in Fig. 2 can with software,
Hardware or combinations thereof is realized.
In the disclosure, the component included by other routing nodes in IP networkings 10 and the connection relation between each component
Similar with routing node 12, details are not described herein.
Fig. 3 is please referred to below, is a kind of flow diagram for link failure detection method that the disclosure provides, link event
Hinder detection method and is applied to any routing node shown in FIG. 1.
Safeguard there is link state database (Link State DataBase, LSDB) in routing node in IP networkings 10,
The link information of the link information of the routing node and the neighbor advertisement of the routing node is stored in the LSDB of routing node.Fortune
Row OSPF (Open Shortest Path First, ospf), IS-IS (Intermediate system
To intermediate system, Intermediate System-to-Intermediate System) etc. IGP (Interior Gateway Protocol, it is interior
Portion's gateway protocol) routing node, can according to the link information in the LSDB safeguarded thereon calculate to destination address routing,
Specific shortest path first (SPF) algorithm that may be used calculates the optimal next-hop for arriving at location as primary next-hop.
For supporting the routing node of IP FRR functions, can also use alternative (the Loop-Free Alternate, LFA) of loop free
Algorithm arrives at the suboptimum next-hop conduct backup next-hop of location to calculate, and the backup next-hop will not result in ring
Road.
It below will be by taking the link failure detection method be applied to routing node 12 as an example, to link provided in this embodiment
Fault detection method is described in detail.
Step S31 receives the first BFD messages sent by destination path, if the BFD messages are to include multi-hop BFD
The multi-hop BFD messages of label then judge the address for receiving the interface of the first BFD messages and the first BFD messages
Whether destination address is identical.
In practical applications, link failure is typically detected by BFD sessions, and existing BFD sessions can only be straight
It is automatically created between routing node even.
Such as networking scene shown in Fig. 3, in the IP networkings 10, routing node 11 arrives the primary path of routing node 15
For：13 → routing node of routing node, 12 → routing node 15 can be created between routing node 11 and routing node 13 at present
Single-hop BFD sessions are built, single-hop BFD sessions are only used for whether chain having occurred between detection routing node 11 and routing node 13
Road failure, breaks down if it is the link between routing node 13 and routing node 12, and single-hop BFD sessions can not detect
It arrives, routing node 11 can still forward the data to primary next-hop (that is, being transmitted to routing node 13).If detecting routing
Link failure between node 13 and routing node 12 needs additionally to dispose BFD interactive functions again on routing node 12.It is this
On the one hand mode needs to dispose BFD interactive functions on each routing node on path, implements inconvenience；It is another
Data cannot be switched on backup path and be forwarded by aspect in time.
In the disclosure, it is contemplated that always exist from a certain routing node to the primary path of destination address and backup path
Cross node, for example, can at least cross at the destination address.When the primary path is before first joint
Any position when breaking down, can be switched to the forwarding that backup path carries out data, be based on this, the disclosure can create
For detecting multi-hop BFD session of the routing node to the primary path between first joint, to primary to this
Path carries out fault detect, and when the primary path breaks down, and forwards data to the destination address by backup path.
Below will be by taking routing node shown in Fig. 1 11 as an example, the process to creating multi-hop BFD sessions is done to be explained in detail
It states.
Step S41 determines first node that crosses that the primary path for arriving at location and backup path pass through.
Optionally, in one embodiment, the destination address can be preset address, in the case, Yong Huke
Only to carry out fault detect to the primary path for reaching the preset address according to demand.Wherein it is possible to according to demand be arranged one,
Two or more preset address.
In another embodiment, a plurality of routing, the purpose in every routing are typically stored in view of routing node 11
Address may each be the destination address in step S41.When implementing, for the destination address in every routing, routing node 11
First node that crosses of the primary path and backup path that reach the destination address can be determined respectively.In other words, routing section
Point 11 can be detected the fault condition for the primary path for reaching the destination address in each item routing.
Optionally, in the disclosure, step S41 may include sub-step shown in fig. 5.
Step S51 calculates the node included by the primary path for reaching the destination address, and each section that will be calculated
Point is preserved successively to form first path list.
Wherein it is possible to according to the link-state information stored in the LSDB of the routing node 11, it is excellent by shortest path
The node that the primary path includes is calculated in first SPF algorithms.
Step S52 calculates the node included by the backup path for reaching the destination address, and each section that will be calculated
Point is preserved successively to form the second path list.
Wherein it is possible to according to the link-state information stored in the LSDB of the routing node 11, calculated by LFA algorithms
Obtain the node that the backup path includes.
It is worth noting that, in the disclosure, the execution sequence of step S51 and step S52 are not limited herein.
In some existing embodiments, each routing node in IP networkings is counted generally according to the LSDB of self maintained
The routing for arriving at location is calculated, which includes primary next-hop and backup next-hop.Each routing node is receiving
It, can be according to the data to be forwarded of the routing forwarding on this node when being sent to the data to be forwarded of the destination address.
In the disclosure, it is contemplated that the LSDB safeguarded on each routing node in network is identical, and on each routing node
Routing be that link-state information in LSDB according to self maintained is calculated.Therefore, routing node 11 can be straight
It connects according to the link-state information in the LSDB safeguarded on this node, calculating forwards the data to be forwarded from routing node 11
To needed for destination address multiple primary routes and multiple route stand-bies, determine primary path further according to the multiple primary route
Including node, the node that backup path includes is determined according to the multiple route stand-by.
In detail, when implementing, step S51 can be achieved by the steps of：
It is root with the routing node 11, calculates and reach the primary next-hop of the destination address, and is calculated
Node where primary next-hop is root, calculates the primary next-hop for reaching the destination address again, until calculated primary
Until address of node is the destination address where next-hop；
Node where recording each primary next-hop being calculated successively according to computation sequence obtains the first path row
Table.
The step S52 can be then achieved by the steps of：
It calculates the routing node 11 and reaches the backup next-hop of the destination address, and record backup next-hop place
Node；
Using node where the backup next-hop as root, the primary next-hop for reaching the destination address is calculated, then in terms of
Obtained primary next-hop is root, calculates the primary next-hop for reaching the destination address, until be calculated it is primary under
Until one jumps place address of node as the destination address；
After node where the backup next-hop, each primary next-hop being calculated is recorded successively according to computation sequence
Place node obtains second path list.
Wherein, refer to calculating using the node as the root of shortest path tree and reaching the destination address using some node as root
Shortest path tree.
Step S53, by each node in each node and second path list in the first path list according to
Ordering is compared successively, using first identical node as first node that crosses.
Implement when, can with one of the first path list and second path list for object listing,
The node in object listing is traversed successively；For the node currently traversed, searched whether in another path list exist with
The identical node of node currently traversed, first node found are first identical node, Ye Jisuo
State first node that crosses.
For example, it is assumed that routing node 15 shown in Fig. 1 is node corresponding with the destination address, then pass through above-mentioned step
Suddenly it was determined that the first path list of routing node 11 to routing node 15 is：
{ routing node 13, routing node 12, routing node 15 }；
Second path list of routing node 11 to routing node 15 is：
{ routing node 14, routing node 12, routing node 15 }.
It, can be using first path list as object listing, then from the routing node 13 in first path list when implementing
Start, searches and whether there is identical node in the second path list, do not find, then searched whether in the second path list
It in the presence of node identical with the routing node 12 in first path list, finds, it is determined that routing node 12 is above-mentioned first
First identical node in path list and the second path list may thereby determine that routing node 11 to routing node 15
First node that crosses of primary path and backup path is routing node 12.
Step S42 determines the data forwarded from the primary path in first incoming interface to cross on node
Address and the address of the outgoing interface on the routing node 11.
Step S43 is established using the address of the outgoing interface as source address, using the address of the incoming interface as purpose address
Multi-hop BFD sessions, and sent to described first node that crosses by the multi-hop BFD sessions and carry what multi-hop BFD was marked
Multi-hop BFD messages.
Determine routing node 12 be described first cross node in the case of, due to need to only be arrived for routing node 11
The primary path of routing node 12 (first node that crosses) carries out link failure detection, therefore, it is possible to the primary path
In the address of 11 corresponding outgoing interface of routing node for source address, with the primary path in 12 corresponding incoming interface of routing node
Address be purpose address creation multi-hop BFD sessions.Wherein, the primary path is in 11 corresponding outgoing interface of routing node
The data forwarded from the primary path are in the outgoing interface of the routing node 11, and the primary path is in the correspondence of routing node 12
Incoming interface be the incoming interface of the data that are forwarded from the primary path in the routing node 12.
Wherein, the outgoing interface can be determined as follows：
Determine that the routing node 11 arrives the master of the routing node 15 (node where destination address in step S41)
With next-hop, searched in ARP (Address Resolution Protocol, address resolution protocol) table primary next with this
Corresponding MAC (Media Access Control or Medium Access Control) address is jumped, then is searched in the mac table
Interface corresponding with the MAC Address is the outgoing interface.
Optionally, in the present embodiment, step S42 can be realized by sub-step as shown in FIG. 6 to the incoming interface
Address determination：
Step S61 searches a upper node for first node that crosses on the primary path.
Based on previous designs, record has the master from the routing node 11 to the destination address on the routing node 11
Can include from the primary path of record then after determining first node that crosses with the node included by path
Each node in, search be recorded in first node that crosses before node as a upper node.
Step S62 calculates a upper node to the primary of first node that crosses using a upper node as root
The primary next-hop is determined as the address of the incoming interface by next-hop.
Wherein, since each node on primary path forwards data from shortest path, thus step S62 can pass through
SPF algorithms are realized, i.e., corresponding next using a upper node as the shortest path of root calculating to first same node point
It jumps, then the next-hop is necessarily the primary path in the address of the incoming interface of first same node point.
By the above process, routing node 11 can be directed to the primary path for arriving at location (such as routing node 15)
Multi-hop BFD sessions are automatically created, to detect whether the primary path link failure occurs by multi-hop BFD sessions, to
It avoids configuring BFD interactive functions at all nodes on the primary path.
Networking scene shown in FIG. 1 is recombined below, is provided an example about above-mentioned steps, is marked in Fig. 1
Outgoing interface and incoming interface corresponding IP address of the primary path on part of nodes.In the IP networkings 10, routing section
Point 11 by table look-up can determine routing node 11 to routing node 15 primary path routing node 11 outgoing interface ground
Location is 2.1.1.1.It can determine that a upper node (routing node 13) for routing node 12 arrives the routing node 12 by calculating
Primary next-hop be 3.1.1.2, thus, the primary path of routing node 11 to routing node 15 enters to connect in routing node 12
The address of mouth is 3.1.1.2.
In the disclosure, after creating the multi-hop BFD sessions on routing node 11, routing node 11 can pass through
To first node that crosses, i.e., node where the destination address of the described multi-hop BFD sessions sends multi-hop for the multi-hop BFD sessions
BFD messages.First crosses node after receiving the multi-hop BFD messages, exchange the multi-hop BFD messages source address and
Destination address obtains corresponding response message, and the response message is returned to routing node 11 along the primary path, if
The primary path does not break down, then routing node 11 can receive the response message in preset duration.In other words,
If routing node 11 is not received by the response message in preset duration, it can determine that the primary path breaks down.
Wherein, the multi-hop BFD messages can be echo (echo) message for carrying preset multi-hop BFD labels, can
To be configured on routing node 11, to increase a diag fields newly in echo messages, and the multi-hop BFD is marked and is arranged
In the newly-increased diag fields.
In this way, first node that crosses (routing node 12), which can receive routing node 11, passes through the primary road
The multi-hop BFD messages that diameter is sent.Wherein, the primary path can serve as the destination path in the disclosure, the routing node
11 can serve as the destination node in the disclosure.
Turning back to reference to Fig. 3, in step S31, the first BFD messages refer to the BFD reports that routing node 12 receives
Text.In practical applications, other than the multi-hop BFD messages that routing node 11 is sent, routing node 12 is also possible to receive it
The single-hop BFD messages etc. that its equipment such as neighbor node is sent.
In implementation process, if not identifying the multi-hop BFD labels in the first BFD messages received,
The first BFD messages are forwarded according to the destination address of the first BFD messages.If identified in the first BFD messages received
Go out the multi-hop BFD labels, then can determine that the first BFD messages are the multi-hop BFD messages sent out by multi-hop BFD sessions.
In the case, further judge whether multi-hop BFD messages are destined to this node.
Step S32 exchanges the destination address and source address of the first BFD messages if identical, obtains the 2nd BFD reports
Text.
Step S33 sends the 2nd BFD messages, so that the mesh to the destination node for sending the first BFD messages
Node is marked when preset duration does not receive the 2nd BFD messages, determines that the destination path breaks down.
When implementing, due to the 2nd BFD messages be exchange the first BFD messages destination address and source address after obtained report
2nd BFD messages can be transmitted to routing node by text, therefore, routing node 12 according to the primary path (that is, destination path)
11 (that is, destination nodes).In this way, when routing node 11 is not received by the 2nd BFD that routing node 12 returns in preset duration
When message, so that it may failure occur with the determination primary path.
Turning back to networking scene shown in referring to Fig.1, above-mentioned steps S31- steps S33 is carried out below in conjunction with the scene
It specifically describes.In the IP networkings 10, when routing node 11 is established using 2.1.1.1 as source address, using 3.1.1.2 as destination
After the multi-hop BFD sessions of location, routing node 11 can periodically be sent using 2.1.1.1 as source address, using 3.1.1.2 as mesh
Address echo messages, when sending the echo messages, routing node the echo messages diag fields addition it is described more
BFD labels are jumped, form the first BFD message X1, and the first multi-hop BFD messages X1 is forwarded according to destination address 3.1.1.2.Then it route
Node 13 can receive the first BFD message X1, and identify that the first BFD messages X1 is the multi-hop BFD for carrying multi-hop BFD labels
Message, at this time routing node 13 further determine the first BFD messages X1 in the address 2.1.1.2 of the incoming interface of this node and first
The destination address 3.1.1.2 of BFD messages X1 is differed, to continue to forward the first BFD messages according to destination address 3.1.1.2
X1。
Then, routing node 12 can receive the first BFD message X1, and identify the first BFD messages X1 be carry it is more
The multi-hop BFD messages for jumping BFD labels, so as to further determine the first BFD messages X1 in the address of the incoming interface of this node
3.1.1.2 identical as the destination address 3.1.1.2 of the first BFD messages X1, it therefore, can be by the destination of the first BFD messages X1
Location is set as its Original Source Address 2.1.1.1, sets the source address of the first BFD messages X1 to its initial purpose address
3.1.1.2, that is, source address and destination address are exchanged, to obtain using 3.1.1.2 as source address, using 2.1.1.1 as purpose address
The 2nd BFD message X2, and forward the 2nd BFD messages X2 according to the destination address 2.1.1.1 of the 2nd BFD messages X2.As long as road
It is not broken down by the primary path between node 11 and routing node 12, the 2nd BFD messages X2 can be in certain time length
It is forwarded back at the outgoing interface of routing node 11.If routing node 11 is not received by the 2nd BFD reports in the duration
Literary X2 can then determine that failure occurs in the primary path between routing node 11 and routing node 12.
By above-mentioned design, it can detect whether destination path breaks down by multi-hop BFD sessions.
Optionally, in the disclosure, behind the address for determining the incoming interface, network administrator can be in routing node 12
The configuration of static multi-hop BFD sessions is carried out on the incoming interface of (first node that crosses), so that routing node 12 weeks
It sends to phase property using the address of the incoming interface as source address, reported using the address of the outgoing interface as the control of purpose address
Text, in this way, routing node 11 can not receive in default detection duration using the address of the incoming interface as source address, with institute
When the address for stating outgoing interface is that the BFD of purpose address controls message, determine that the primary path breaks down.
Wherein, a length of time assay intervals (Detect Interval) when the default detection, usually can be by user's root
It is configured according to demand.
In addition, in practical applications, path that routing node 12 reaches a certain destination address may include primary path and
Backup path, the primary path and the backup path at least have that there are one cross node.In the case, routing node 12 can be with
By Fig. 4-steps shown in Fig. 6, the multi-hop BFD sessions for detecting the primary path are automatically created, and pass through establishment
Multi-hop BFD sessions send the multi-hop for carrying multi-hop BFD and marking to first node that crosses of the primary path and the backup path
BFD messages.Its specific implementation process is referred to the detailed description of step shown in Fig. 4-Fig. 6 in the above, herein no longer
It repeats.
Fig. 7 is please referred to, is a kind of functional block diagram for link failure detection device 70 that the disclosure provides, can apply
In any routing node shown in FIG. 1.The link failure detection device 70 includes receiving module 71 and detection module 72.
Wherein, receiving module 71 is for receiving the first BFD messages sent by destination path, if the first BFD is reported
Text is the multi-hop BFD messages for including multi-hop BFD labels, then judges the address and the institute that receive the interface of the first BFD messages
Whether the destination address for stating the first BFD messages is identical.
In the disclosure, the description as described in receiving module 71 specifically refers to the detailed description to step S31 shown in Fig. 3.
Detection module 72 is used in the address for receiving the interface of the first BFD messages and the first BFD messages
When destination address is identical, the destination address and source address of the first BFD messages are exchanged, obtains the 2nd BFD messages, and to transmission
The destination node of the first BFD messages sends the 2nd BFD messages, so that the destination node does not receive in preset duration
When to the 2nd BFD messages, determine that the destination path breaks down.
In the disclosure, the description as described in detection module 72 is specifically referred to step S32 shown in Fig. 3 and step S33
Detailed description.
Optionally, in the disclosure, the link failure detection device 70 can also include the first determining module 73, second
Determining module 74 and session establishment module 75.
Wherein, the first determining module 73 is used to determine the first of the primary path for arriving at location and backup path process
A node that crosses.
In the disclosure, the description as described in the first determining module 73 specifically refers to retouching in detail to step S41 shown in Fig. 4
It states, i.e. step S41 can be executed by the first determining module 73.
Optionally, the first determining module 73 may include the first computational submodule 731, the second computational submodule 732 and
Compare submodule 733.
Wherein, the first computational submodule 731 is used to calculate the node arrived at included by the primary path of location, and will
Each node being calculated is preserved successively to form first path list.
Optionally, the chain that the first computational submodule 731 specifically can be used for storing in the LSDB according to the routing node
The node that the primary path includes is calculated by SPF algorithms in line state information.
Second computational submodule 732 will be calculated for calculating the node arrived at included by the backup path of location
Obtained each node is preserved successively to form the second path list.
Optionally, the second computational submodule 732 specifically can be used for according to the link-state information stored in the LSDB,
The node that the backup path includes is calculated by LFA algorithms.
Compare submodule 733 be used for by the first path list each node with it is each in second path list
Node is compared successively according to ordering, using first identical node as first node that crosses.Second really
Address of the cover half block 72 for determining the incoming interface from the data that the primary path forwards in first same node point
And the address of the outgoing interface on the routing device 10.
In the disclosure, the description as described in the second determining module 72 specifically refers to retouching in detail to step S42 shown in Fig. 4
It states, i.e. step S42 can be executed by the second determining module 72.
Optionally, the second determining module 72 specifically can be used on the primary path searching described first section that crosses
A upper node for point, and using a upper node as root, a upper node is calculated to the primary of first node that crosses
The primary next-hop is determined as the address of the incoming interface by next-hop.
Session establishment module 73 is for establishing using the address of the outgoing interface as source address, being with the address of the incoming interface
The multi-hop BFD sessions of destination address, and carried to the described first node transmission that crosses by the multi-hop BFD sessions described
The multi-hop BFD messages of multi-hop BFD labels.
In the present embodiment, the description as described in session establishment module 73 is specifically referred to the detailed of step S43 shown in Fig. 4
Description, i.e. step S43 can be executed by detection module 73.
In conclusion a kind of link failure detection method of disclosure offer and device, the routing node in IP networkings receives
The first BFD messages sent by destination path, if the first BFD messages are the multi-hop BFD messages for including multi-hop BFD labels,
Then judge whether the address for the interface for receiving the first BFD messages is identical as the address of the first BFD messages.If identical,
The destination address and source address for exchanging the first BFD messages, obtain the 2nd BFD messages, and to the target for sending the first BFD messages
Node sends the 2nd BFD messages, so that destination node determines that destination path goes out when preset duration does not receive the 2nd BFD messages
Existing failure.In this way, the multi-hop BFD detections to destination path may be implemented.
The foregoing is merely the selected embodiments of the disclosure, are not limited to the protection domain of the disclosure, for
For those skilled in the art, the disclosure is to there is various modifications and variations.All spirit in the disclosure is made within principle
Any modification, equivalent substitution, improvement and etc., should be included within the protection domain of the disclosure.
Claims (10)
1. a kind of link failure detection method, which is characterized in that the routing node being applied in IP networkings, the method includes：
The first BFD messages sent by destination path are received, if the first BFD messages are to include the more of multi-hop BFD labels
BFD messages are jumped, then judge the destination address for receiving the address and the first BFD messages of the interface of the first BFD messages
It is whether identical；
If identical, the destination address and source address of the first BFD messages are exchanged, the 2nd BFD messages are obtained；
The 2nd BFD messages are sent to the destination node for sending the first BFD messages, so that the destination node is default
When duration does not receive the 2nd BFD messages, determine that the destination path breaks down.
2. link failure detection method according to claim 1, which is characterized in that the method further includes：
Determine first node that crosses that the primary path for arriving at location and backup path pass through；
Determine the data forwarded from the primary path in first address for crossing the incoming interface on node and in institute
State the address of the outgoing interface on routing node；
The multi-hop BFD sessions using the address of the outgoing interface as source address, by purpose address of the address of the incoming interface are established,
And the multi-hop BFD reports for carrying the multi-hop BFD and marking are sent to described first node that crosses by the multi-hop BFD sessions
Text.
3. link failure detection method according to claim 2, which is characterized in that determine the primary road for arriving at location
First node that crosses that diameter and backup path pass through, including：
Calculate the node included by the primary path for reaching the destination address, and by each node being calculated preserve successively with
Form first path list；
Calculate the node included by the backup path for reaching the destination address, and by each node being calculated preserve successively with
Form the second path list；
Successively according to ordering by each node in the first path list and each node in second path list
It is compared, using first identical node as first node that crosses.
4. link failure detection method according to claim 3, which is characterized in that
The node included by the primary path for reaching the destination address is calculated, including：
According to the link-state information stored in the link state database LSDB of the routing node, pass through shortest path first
The node that the primary path includes is calculated in SPF algorithms；
The node included by the backup path for reaching the destination address is calculated, including：
According to the link-state information stored in the LSDB, the backup is calculated by the alternative LFA algorithms of loop free
The node that path includes.
5. according to the link failure detection method described in any one of claim 2-4, which is characterized in that determine from described primary
Path forwarding data in first address for crossing the incoming interface on node, including：
A upper node for first node that crosses is searched on the primary path；
Using a upper node as root, the primary next-hop of a calculating upper node to first node that crosses, by institute
State the address that primary next-hop is determined as the incoming interface.
6. a kind of link failure detection device, which is characterized in that the routing node being applied in IP networkings, described device include：
Receiving module, for receiving the first BFD messages sent by destination path, if it includes more that the first BFD messages, which are,
The multi-hop BFD messages of BFD labels are jumped, then judge that the address for receiving the interface of the first BFD messages is reported with the first BFD
Whether the destination address of text is identical；
Detection module, for the destination in the address and the first BFD messages of the interface for receiving the first BFD messages
When location is identical, the destination address and source address of the first BFD messages are exchanged, obtains the 2nd BFD messages, and to sending described the
The destination nodes of one BFD messages sends the 2nd BFD messages so that the destination node do not received in preset duration it is described
When the 2nd BFD messages, determine that the destination path breaks down.
7. link failure detection device according to claim 6, which is characterized in that described device further includes：
First determining module, first section that crosses for determining the primary path and backup path process that arrive at location
Point；
Second determining module, for determining that the data forwarded from the primary path cross to enter to connect on node at described first
The address of mouth and the address of the outgoing interface on the routing node；
Session establishment module, for establishing by the address of the outgoing interface for source address, for the purpose of the address of the incoming interface
The multi-hop BFD sessions of address, and the multi-hop is carried to the described first node transmission that crosses by the multi-hop BFD sessions
The multi-hop BFD messages of BFD labels.
8. link failure detection device according to claim 7, which is characterized in that first determining module includes：
First computational submodule for calculating the node included by the primary path for reaching the destination address, and will calculate
To each node preserved successively to form first path list；
Second computational submodule for calculating the node included by the backup path for reaching the destination address, and will calculate
To each node preserved successively to form the second path list；
Submodule is compared, for pressing each node in the first path list with each node in second path list
It is compared successively according to ordering, using first identical node as first node that crosses.
9. link failure detection device according to claim 8, which is characterized in that
First computational submodule, specifically for the chain stored in the link state database LSDB according to the routing node
The node that the primary path includes is calculated by shortest path first SPF algorithms in line state information；
Second computational submodule, specifically for according to the link-state information stored in the LSDB, passing through loop free
The node that the backup path includes is calculated in alternative LFA algorithms.
10. the link failure detection device according to any one of claim 7-9, which is characterized in that described second determines
Module is specifically used for searching a upper node for first node that crosses on the primary path, and with a upper node
For root, a upper node is calculated to the primary next-hop of first node that crosses, the primary next-hop is determined as
The address of the incoming interface.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810988568.7A CN108768796B (en) | 2018-08-28 | 2018-08-28 | Link fault detection method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810988568.7A CN108768796B (en) | 2018-08-28 | 2018-08-28 | Link fault detection method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108768796A true CN108768796A (en) | 2018-11-06 |
| CN108768796B CN108768796B (en) | 2020-08-14 |
Family
ID=63967493
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810988568.7A Active CN108768796B (en) | 2018-08-28 | 2018-08-28 | Link fault detection method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108768796B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109889441A (en) * | 2019-03-21 | 2019-06-14 | 新华三技术有限公司 | A kind of data forwarding method and device |
| CN111131021A (en) * | 2020-01-17 | 2020-05-08 | 新华三信息安全技术有限公司 | Forwarding method and network equipment for Bidirectional Forwarding Detection (BFD) message |
| CN111654406A (en) * | 2020-02-29 | 2020-09-11 | 新华三信息安全技术有限公司 | Bidirectional forwarding detection method and device |
| CN112073226A (en) * | 2020-08-26 | 2020-12-11 | 内蒙古智诚物联股份有限公司 | IP network recovery method and device based on 5G technology |
| CN114500366A (en) * | 2022-01-28 | 2022-05-13 | 武汉烽火技术服务有限公司 | Method and device for preventing route loop between main and standby nodes |
| CN114650242A (en) * | 2020-12-21 | 2022-06-21 | 华为技术有限公司 | Path fault detection method, device, related equipment and storage medium |
| CN115225462A (en) * | 2022-07-21 | 2022-10-21 | 北京天融信网络安全技术有限公司 | Network fault diagnosis method and device |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104468286A (en) * | 2014-12-31 | 2015-03-25 | 迈普通信技术股份有限公司 | Method and system for detecting multi-hop link |
| CN104639433A (en) * | 2015-01-07 | 2015-05-20 | 烽火通信科技股份有限公司 | Echo message-based multi-hop detection implementation method |
| CN106161246A (en) * | 2016-06-15 | 2016-11-23 | 杭州华三通信技术有限公司 | The implementation method of alternate routing and device |
| CN106209517A (en) * | 2016-07-22 | 2016-12-07 | 安徽皖通邮电股份有限公司 | A kind of method realizing multi-hop BFD single armed echo function |
| CN107547383A (en) * | 2017-07-26 | 2018-01-05 | 新华三技术有限公司 | Path detection method and device |
| CN107659448A (en) * | 2017-09-27 | 2018-02-02 | 新华三技术有限公司 | A kind of multi-hop detection method and device based on echo messages |
| US20180077051A1 (en) * | 2016-09-15 | 2018-03-15 | Cisco Technology, Inc. | Reroute Detection in Segment Routing Data Plane |
-
2018
- 2018-08-28 CN CN201810988568.7A patent/CN108768796B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104468286A (en) * | 2014-12-31 | 2015-03-25 | 迈普通信技术股份有限公司 | Method and system for detecting multi-hop link |
| CN104639433A (en) * | 2015-01-07 | 2015-05-20 | 烽火通信科技股份有限公司 | Echo message-based multi-hop detection implementation method |
| CN106161246A (en) * | 2016-06-15 | 2016-11-23 | 杭州华三通信技术有限公司 | The implementation method of alternate routing and device |
| CN106209517A (en) * | 2016-07-22 | 2016-12-07 | 安徽皖通邮电股份有限公司 | A kind of method realizing multi-hop BFD single armed echo function |
| US20180077051A1 (en) * | 2016-09-15 | 2018-03-15 | Cisco Technology, Inc. | Reroute Detection in Segment Routing Data Plane |
| CN107547383A (en) * | 2017-07-26 | 2018-01-05 | 新华三技术有限公司 | Path detection method and device |
| CN107659448A (en) * | 2017-09-27 | 2018-02-02 | 新华三技术有限公司 | A kind of multi-hop detection method and device based on echo messages |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109889441A (en) * | 2019-03-21 | 2019-06-14 | 新华三技术有限公司 | A kind of data forwarding method and device |
| CN111131021A (en) * | 2020-01-17 | 2020-05-08 | 新华三信息安全技术有限公司 | Forwarding method and network equipment for Bidirectional Forwarding Detection (BFD) message |
| CN111654406A (en) * | 2020-02-29 | 2020-09-11 | 新华三信息安全技术有限公司 | Bidirectional forwarding detection method and device |
| CN112073226A (en) * | 2020-08-26 | 2020-12-11 | 内蒙古智诚物联股份有限公司 | IP network recovery method and device based on 5G technology |
| CN114650242A (en) * | 2020-12-21 | 2022-06-21 | 华为技术有限公司 | Path fault detection method, device, related equipment and storage medium |
| CN114500366A (en) * | 2022-01-28 | 2022-05-13 | 武汉烽火技术服务有限公司 | Method and device for preventing route loop between main and standby nodes |
| CN114500366B (en) * | 2022-01-28 | 2023-05-30 | 武汉烽火技术服务有限公司 | Method and device for preventing routing loop between main node and standby node |
| CN115225462A (en) * | 2022-07-21 | 2022-10-21 | 北京天融信网络安全技术有限公司 | Network fault diagnosis method and device |
| CN115225462B (en) * | 2022-07-21 | 2024-02-02 | 北京天融信网络安全技术有限公司 | Network fault diagnosis method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108768796B (en) | 2020-08-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108768796A (en) | Link failure detection method and device | |
| US10218610B2 (en) | MPLS segment routing | |
| Shand et al. | IP fast reroute framework | |
| CN102598599B (en) | RSVP-TE graceful restart under fast re-route conditions | |
| CN101953124B (en) | Constructing repair paths around multiple non-available links in a data communications network | |
| EP2761827B1 (en) | Incremental deployment of mrt based ipfrr | |
| KR101895092B1 (en) | Mpls fast re-route using ldp (ldp-frr) | |
| CN101102268B (en) | IP loop network, IP loop network routing device and packet forwarding method | |
| EP2036273B1 (en) | A technique for efficiently determining acceptable link-based loop free alternatives in a computer network | |
| US7936667B2 (en) | Building backup tunnels for fast reroute in communications networks | |
| CN103891220B (en) | The MPLS using LDP quickly re-routes method and the NE of (LDP-FRR) | |
| US10439880B2 (en) | Loop-free convergence in communication networks | |
| CN104380671B (en) | The increase failure covering in classification, redundancy, QoS routing selection | |
| CN102123088B (en) | Set up the method and apparatus of traffic engineering tunnel | |
| CN103391247A (en) | Fast reroute using loop free alternate next hop for multipoint label switched path | |
| CN101326762A (en) | Constructing and implementing backup paths in autonomous systems | |
| EP3820089A1 (en) | Controller provided protection paths | |
| US7969898B1 (en) | Technique for breaking loops in a communications network | |
| CN103475578B (en) | A kind of routing resource and device | |
| CN104243320A (en) | Method and device for optimizing network access paths | |
| CN101355486A (en) | Method, equipment and system for switching route | |
| CN103532840B (en) | Link switching method and link switching device | |
| CN103297340A (en) | Routing convergence method and device in multi-protocol label switching (MPLS) and border gateway protocol (BGP) networking | |
| CN108494684A (en) | Create the method and device in tunnel | |
| WO2011124178A2 (en) | Fault detection method, route node and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |