CN109660458A - A kind of method for routing and equipment - Google Patents
A kind of method for routing and equipment Download PDFInfo
- Publication number
- CN109660458A CN109660458A CN201910117358.5A CN201910117358A CN109660458A CN 109660458 A CN109660458 A CN 109660458A CN 201910117358 A CN201910117358 A CN 201910117358A CN 109660458 A CN109660458 A CN 109660458A
- Authority
- CN
- China
- Prior art keywords
- node
- path
- anycast
- destination node
- preferred path
- 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
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/22—Alternate routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/34—Source routing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the present invention discloses a kind of method for routing and equipment, is related to field of computer technology, can be by the way that equipment information database and multi-hop BFD link, to realize being switched fast for data transfer path.This method comprises: determining the first anycast member's failure when source node does not receive the first multi-hop BFD message of the first anycast member transmission in the first preferred path；Source node determines at least one backup path according to the second destination node prefix in the first destination node prefix matching equipment information database, and determines the second preferred path according at least one backup path；Source node obtains the 2nd anycast member according to the second preferred path；Source node sends data to destination node by the outgoing interface of the 2nd anycast member.The embodiment of the present invention is applied to network system.
Description
Technical field
The embodiment of the present invention is related to field of computer technology more particularly to a kind of method for routing and equipment.
Background technique
Anycast group anycast group in Segment routing Segment Routing refers on multiple nodes in domain
Distribute identical prefix, identical segment.Such prefix segment does not identify specific node, and identifies a group node.Net
The flow that anycast address is gone in network can be routed to that member that distance is nearest in anycast group.If
The distance of two or more members of anycast set is identical, then flow will load between identical member at these
Equilibrium, by this mechanism by traffic distribution to all members of anycast group.Anycast group provide needle at present
Fail-safe mechanisms to one or more members of anycast set are when a node in anycast group occurs
When failure, if there are other nodes identical with the nodal distance to break down in anycast group, flow will be by negative
Flow is all directed to other on identical node by the method for carrying equilibrium；Otherwise, by the firmly convergent method of network,
The prefix of anycast group and segment (SID) are associated on other anycast group nodes on source node, so
Afterwards flow from the nearest member of original distance move to fault condition after the nearest member of distance on.However, traditional
The method for routing of anycast group node failure relies primarily on the routing convergence process in equipment, this process and network are multiple
Miscellaneous degree, equipment routing entry number, apparatus of load etc. have direct relationship, and usual routing convergence time is second grade.
Summary of the invention
The embodiment of the present invention provides a kind of method for routing and equipment, can be by by equipment information database and multi-hop
BFD linkage, to realize being switched fast for data transfer path.
In order to achieve the above objectives, the present invention adopts the following technical scheme:
In a first aspect, a kind of method for routing is provided, this method comprises: when source node does not receive in the first preferred path
The first multi-hop BFD message that first anycast member sends, determines the first anycast member's failure；Wherein, the first anycast
Member is one of node in the first preferred path, and the first preferred path is the transmission of data used in source node to destination node
Path；Source node determines at least one according to the second destination node prefix in the first destination node prefix matching equipment information database
Backup path determines the second preferred path according at least one backup path；Wherein the second preferred path is source node to Su Jie
Point data transfer path used；Source node obtains the 2nd anycast member according to the second preferred path；Wherein second
Anycast member is one of node in the second preferred path；The outgoing interface that source node passes through the 2nd anycast member will
Data are sent to destination node.
In the above-mentioned methods, after source node determines the first anycast member's failure；Firstly, before according to the first destination node
The the second destination node prefix sewed in matching unit information database determines at least one backup path, and spare according at least one
Path determines the second preferred path；Then, the 2nd anycast member is obtained according to the second preferred path；Finally, passing through second
The outgoing interface of anycast member sends data to destination node.The embodiment of the present invention can by by equipment information database with
Multi-hop BFD linkage, to realize being switched fast for data transfer path.
Second aspect provides a kind of node device, which includes: processing unit, excellent first for working as receiving unit
The the first multi-hop BFD message for not receiving the first anycast member transmission in routing diameter, determines the first anycast member's failure；
Wherein, the first anycast member is one of node in the first preferred path, and the first preferred path is source node to Su Jie
Point data transfer path used；Processing unit is also used to according in the first destination node prefix matching equipment information database
Second destination node prefix determines at least one backup path, and determines the second preferred path according at least one backup path；Its
In the second preferred path be source node to destination node used in data transfer path；Processing unit is also used to according to second preferably
Path obtains the 2nd anycast member；Wherein the 2nd anycast member is one of node in the second preferred path；Hair
Unit is sent, the outgoing interface of the 2nd anycast member for obtaining through the processing unit sends data to destination node.
It is to be appreciated that the node device of above-mentioned offer is used to execute the corresponding method of first aspect presented above,
Therefore, the attainable beneficial effect of institute can refer to right in the corresponding method of first aspect above and following detailed description
The beneficial effect for the scheme answered, details are not described herein again.
The third aspect provides a kind of node device, includes processor and memory, storage in the structure of the node device
Device saves the necessary program instruction of the node device and data, processor is for executing in memory for coupling with processor
The program instruction of storage, so that the method that the node device executes first aspect.
Fourth aspect provides a kind of computer storage medium, is stored with computer program code in computer storage medium,
When computer program code is run on the node device of such as third aspect, so that node device executes above-mentioned first aspect
Method.
5th aspect, provides a kind of computer program product, which stores above-mentioned computer software
Instruction, when computer software instructions are run on the node device of such as the third aspect, so that node device executes such as above-mentioned the
The program of one side scheme.
Detailed description of the invention
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Fig. 1 is a kind of structural schematic diagram for data transfer path that the embodiment of the present invention provides；
Fig. 2 is a kind of flow diagram for method for routing that the embodiment of the present invention provides；
Fig. 3 is a kind of structural schematic diagram for node device that the embodiment of the present invention provides；
Fig. 4 is the structural schematic diagram for another node device that the embodiment of the present invention provides；
Fig. 5 is the structural schematic diagram for another node device that the embodiment of the present invention provides.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
It should be noted that in the embodiment of the present invention, " illustrative " or " such as " etc. words make example, example for indicating
Card or explanation.Be described as in the embodiment of the present invention " illustrative " or " such as " any embodiment or design scheme do not answer
It is interpreted than other embodiments or design scheme more preferably or more advantage.Specifically, " illustrative " or " example are used
Such as " word is intended to that related notion is presented in specific ways.
It should also be noted that, in the embodiment of the present invention, " (English: of) ", " corresponding (English:
Corresponding, relevant) " it sometimes can be mixed with " corresponding (English: corresponding) ", it should be pointed out that
It is that, when not emphasizing its difference, meaning to be expressed is consistent.
For the ease of clearly describing the technical solution of the embodiment of the present invention, in an embodiment of the present invention, use " the
One ", the printed words such as " second " distinguish function and the essentially identical identical entry of effect or similar item, and those skilled in the art can
To understand that the printed words such as " first ", " second " are not to be defined to quantity and execution order.
Anycast group anycast group in Segment routing Segment Routing refers on multiple nodes in domain
Distribute identical prefix, identical segment.Such prefix segment does not identify specific node, and identifies a group node.Net
The flow that anycast address is gone in network can be routed to that member that distance is nearest in anycast group.If
The distance of two or more members of anycast set is identical, then flow will load between identical member at these
Equilibrium, by this mechanism by traffic distribution to all members of anycast group.Anycast group provide needle at present
Fail-safe mechanisms to one or more members of anycast set are when a node in anycast group occurs
When failure, if there are other nodes identical with the nodal distance to break down in anycast group, flow will be by negative
Flow is all directed to other on identical node by the method for carrying equilibrium；Otherwise, by the firmly convergent method of network,
The prefix of anycast group and segment (SID) are associated on other anycast group nodes on source node, so
Afterwards flow from the nearest member of original distance move to fault condition after the nearest member of distance on.
Illustratively, as described in Figure 1, the specific number of a total of 5 nodes, node is 1~5, forms two datas altogether
Transmission path, respectively 1~3~5 and 1~2~4~5.Assuming that the cost of all data transfer paths is all the same.3 He of node
Node 4 forms anycast group, and node 1 is intended to send data packet to node 5, in the preferred anycast group of the meeting of node 1
Node 3 is sent to node 5 as transmission intermediate point.If the node 3 in anycast group breaks down, node 1
After can be by routing convergence, and then the node 4 in anycast group be selected to transmit intermediate point by node 2.However, passing
The routing convergence process of system, the complexity with network, how much is the routing entry learnt in equipment, and apparatus of load situation has directly
The relationship connect, usual routing convergence time are second grades.
Based on above-mentioned technical background and problem of the existing technology, referring to Fig. 2, the embodiment of the present invention provides a kind of road
By method, this method comprises:
201, the first multi-hop BFD of the first anycast member transmission is not received in the first preferred path when source node
Message determines the first anycast member's failure；Wherein, the first anycast member is one of section in the first preferred path
Point, the first preferred path are data transfer path used in source node to destination node.
202, source node is determined according to the second destination node prefix in the first destination node prefix matching equipment information database
At least one backup path, and the second preferred path is determined according at least one backup path；Wherein the second preferred path is source
Data transfer path used in node to destination node.
Specifically, source node is according to the second destination node prefix in the first destination node prefix matching equipment information database,
Determine the second destination node prefix at least one backup path identical with the first destination node prefix, it will be at least one backup path
Shortest path as the second preferred path.
Illustratively, referring to table 1, be explained as follows to entry included in the equipment information database: Inlabel refers to
Into the data packet institute tape label of local device, Outlabel refers to the data packet institute tape label issued from local device,
Prefix refers to that the address prefix of destination node, SID refer to that the segment id, OutInt of destination node refer to the sheet for reaching destination node
Outgoing interface in end equipment, anycast-pre refer to the prefix for reaching the anycast group that destination node passes through (if on path
Without anycast group, this field is emptied with three fields below), anycast-sid refers to that reaching destination node passes through
Anycast group segment id, priority refer to this entry whether the preferred road for being anycast group
Diameter, BFD refer to the multi-hop BFD for whether having had been switched in this entry and having reached anycast group, wherein " 1 " indicates
"Yes", "-" indicate "No".
Table 1203, source node obtain the 2nd anycast member according to the second preferred path；Wherein the 2nd anycast member
For one of node in the second preferred path.
In addition, after step 203 further include:
Source node sends the second multi-hop BFD message to the 2nd anycast member according to the second preferred path, and receives second
The third multi-hop BFD message that anycast member returns；Wherein the second multi-hop BFD message and third multi-hop BFD message one are a pair of
It answers.
Optionally, the first anycast member and the 2nd anycast member belong to same anycast group.
204, source node sends data to destination node by the outgoing interface of the 2nd anycast member.
For a better understanding, being illustrated in conjunction with table 1 and Fig. 1 to above-mentioned steps 201~204, in table 1
The corresponding example of OutInt in data transfer path between source node and destination node of f1/1 and f1/2；F1/1 is preferred
Path.Wherein, f1/1 can be understood as data transfer path 1~3~5 shown in Fig. 1；F1/2 can be understood as shown in Fig. 1
1~2~4~5, when Fig. 1 node 1 be intended to node 5 send data packet when (node 1 be source node, node 5 be destination node),
Routing forwarding, i.e. data transfer path are carried out according to the node 3 in shortest rule, 1 first choice anycast group of node
It is f1/1, sends data packets to node 5 via 1~3~5；It specifically includes:
S1, node 1 send multi-hop BFD message to node 3.Go to step S2.
If S2, node 1 do not receive the multi-hop BFD message from node 33 periods, then it is assumed that node 1 and node 3 it
Between link occur problem.Go to step S3.
Equipment information database shown in S3,1 look-up table 1 of node, the outgoing interface for finding node 5 can also pass through f1/2
It is sent；Go to step S4.
S4, node 1 send data packet from f1/2, and forward-path is 1~2~4~5；Meanwhile node 1 and node 4
Exchange multi-hop BFD message.
Based on above-mentioned steps S1~S4, node 1 completes the protection for the business that anycast group interior joint 3 breaks down
Switching action.
In the above-mentioned methods, after source node determines the first anycast member's failure；Firstly, before according to the first destination node
The the second destination node prefix sewed in matching unit information database determines at least one backup path, and spare according at least one
Path determines the second preferred path；Then, the 2nd anycast member is obtained according to the second preferred path；Finally, passing through second
The outgoing interface of anycast member sends data to destination node.The embodiment of the present invention can by by equipment information database with
Multi-hop BFD linkage, to realize being switched fast for data transfer path.
Referring to Fig. 3, the embodiment of the present invention provides a kind of node device 30, which includes:
Processing unit 302, for not receiving the first anycast member in the first preferred path when receiving unit 301
The the first multi-hop BFD message sent, determines the first anycast member's failure；Wherein, the first anycast member is first preferred
One of node in path, the first preferred path are data transfer path used in source node to destination node.
Processing unit 302 is also used to according to the second destination node in the first destination node prefix matching equipment information database
Prefix determines at least one backup path, and determines the second preferred path according at least one backup path；Wherein second preferably
Path is data transfer path used in source node to destination node.
Processing unit 302 is also used to obtain the 2nd anycast member according to the second preferred path；Wherein the 2nd anycast
Member is one of node in the second preferred path.
The outgoing interface of transmission unit 303, the 2nd anycast member obtained for through the processing unit 302 sends out data
It send to destination node.
In a kind of illustrative scheme, transmission unit 303 is also used to according to the second preferred path to the 2nd anycast
Member sends the second multi-hop BFD message；
Receiving unit 301 is also used to receive the third multi-hop BFD message of the 2nd anycast member return；Wherein more than second
It jumps BFD message and third multi-hop BFD message corresponds.
In a kind of illustrative scheme, the first anycast member and the 2nd anycast member belong to same anycast
Group.
In a kind of illustrative scheme, processing unit 302 is specifically used for being believed according to the first destination node prefix matching equipment
The second destination node prefix in database is ceased, determining the second destination node prefix, identical with the first destination node prefix at least one is standby
With path, using the shortest path at least one backup path as the second preferred path.
Since the node device in the embodiment of the present invention can be applied to implement above method embodiment, institute's energy
The technical effect of acquisition is see also above method embodiment, and details are not described herein for the embodiment of the present invention.
Using integrated unit, Fig. 4 shows one of node device 30 involved in above-described embodiment
The possible structural schematic diagram of kind.Node device 30 includes: processing module 401, communication module 402 and memory module 403.Handle mould
Block 401 is for carrying out control management to the movement of node device 30, for example, processing module 401 is held for support node apparatus 30
Process 201~203 in row Fig. 2.Communication module 402 is used for the communication of support node apparatus 30 and other entities.Memory module
403 are used for the program code and data of memory node equipment 30.
Wherein, processing module 401 can be processor or controller, such as can be central processing unit (central
Processing unit, CPU), general processor, digital signal processor (digital signal processor, DSP),
Specific integrated circuit (application-specific integrated circuit, ASIC), field programmable gate array
It is (field programmable gate array, FPGA) or other programmable logic device, transistor logic, hard
Part component or any combination thereof.It may be implemented or execute to combine and various illustratively patrol described in present disclosure
Collect box, module and circuit.Processor is also possible to realize the combination of computing function, such as includes one or more microprocessors
Combination, DSP and the combination of microprocessor etc..Communication module 402 can be transceiver, transmission circuit or communication interface etc..It deposits
Storage module 403 can be memory.
When processing module 401 is processor as shown in Figure 5, communication module 402 is the transceiver of Fig. 5, memory module 403
For Fig. 5 memory when, node device 30 involved in the embodiment of the present application can be following node device 30.
Referring to Figure 5, which includes: processor 501, transceiver 502, memory 503 and bus 504.
Wherein, processor 501, transceiver 502, memory 503 are connected with each other by bus 504；Bus 504 can be outer
If component connection standard (peripheral component interconnect, PCI) bus or expanding the industrial standard structure
(extended industry standard architecture, EISA) bus etc..Bus can be divided into address bus, number
According to bus, control bus etc..Only to be indicated with a thick line in figure, it is not intended that an only bus or one convenient for indicating
The bus of seed type.
Processor 501 can be a general central processor (Central Processing Unit, CPU), micro process
Device, application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC) or one or more
A integrated circuit executed for controlling application scheme program.
Memory 503 can be read-only memory (Read-Only Memory, ROM) or can store static information and instruction
Other kinds of static storage device, random access memory (Random Access Memory, RAM) or letter can be stored
The other kinds of dynamic memory of breath and instruction, is also possible to Electrically Erasable Programmable Read-Only Memory (Electrically
Erasable Programmable Read-only Memory, EEPROM), CD-ROM (Compact Disc Read-
Only Memory, CD-ROM) or other optical disc storages, optical disc storage (including compression optical disc, laser disc, optical disc, digital universal
Optical disc, Blu-ray Disc etc.), magnetic disk storage medium or other magnetic storage apparatus or can be used in carrying or store to have referring to
Enable or data structure form desired program code and can by any other medium of computer access, but not limited to this.
Memory, which can be, to be individually present, and is connected by bus with processor.Memory can also be integrated with processor.
Wherein, memory 503 is used to store the application code for executing application scheme, and is controlled by processor 501
System executes.Transceiver 502 is used to receive the content of external equipment input, and processor 501 is used to execute to store in memory 503
Application code, to realize the method for routing in the embodiment of the present application.
It should be understood that magnitude of the sequence numbers of the above procedures are not meant to execute suitable in the various embodiments of the application
Sequence it is successive, the execution of each process sequence should be determined by its function and internal logic, the implementation without coping with the embodiment of the present application
Process constitutes any restriction.
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
Scope of the present application.
It is apparent to those skilled in the art that for convenience and simplicity of description, the equipment of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method, it can be with
It realizes by another way.For example, apparatus embodiments described above are merely indicative, for example, the division of unit,
Only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components can be with
In conjunction with or be desirably integrated into another system, or some features can be ignored or not executed.Another point, it is shown or discussed
Mutual coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING of equipment or unit or
Communication connection can be electrical property, mechanical or other forms.
Unit may or may not be physically separated as illustrated by the separation member, shown as a unit
Component may or may not be physical unit, it can and it is in one place, or may be distributed over multiple networks
On unit.It can some or all of the units may be selected to achieve the purpose of the solution of this embodiment according to the actual needs.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.
In the above-described embodiments, can come wholly or partly by software, hardware, firmware or any combination thereof real
It is existing.When being realized using software program, can entirely or partly realize in the form of a computer program product.The computer
Program product includes one or more computer instructions.On computers load and execute computer program instructions when, all or
Partly generate the process or function according to the embodiment of the present application.Computer can be general purpose computer, special purpose computer, calculating
Machine network or other programmable devices.Computer instruction may be stored in a computer readable storage medium, or from one
Computer readable storage medium is transmitted to another computer readable storage medium, for example, computer instruction can be from a net
Website, computer, server or data center pass through wired (such as coaxial cable, optical fiber, Digital Subscriber Line (Digital
Subscriber Line, DSL)) or wireless (such as infrared, wireless, microwave etc.) mode to another web-site, computer,
Server or data center are transmitted.Computer readable storage medium can be any usable medium that computer can access
Either comprising data storage devices such as one or more server, data centers that can be integrated with medium.Usable medium can
To be magnetic medium (for example, floppy disk, hard disk, tape), optical medium (for example, DVD) or semiconductor medium (such as solid-state is hard
Disk (Solid State Disk, SSD)) etc..
The embodiment of the present invention also provides a kind of computer program product, which can be loaded directly into storage
In device, and contain software code, which is loaded into via computer and can be realized above-mentioned transaction after executing
Tracking.
It should be understood that magnitude of the sequence numbers of the above procedures are not meant to execute suitable in the various embodiments of the application
Sequence it is successive, the execution of each process sequence should be determined by its function and internal logic, the implementation without coping with the embodiment of the present application
Process constitutes any restriction.
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps can be realized with the combination of electronic hardware or computer software and electronic hardware.These functions are actually
It is implemented in hardware or software, the specific application and design constraint depending on technical solution.Professional technician
Each specific application can be used different methods to achieve the described function, but this realization is it is not considered that exceed
Scope of the present application.
It is apparent to those skilled in the art that for convenience and simplicity of description, the equipment of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method, it can be with
It realizes by another way.For example, apparatus embodiments described above are merely indicative, for example, the division of unit,
Only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components can be with
In conjunction with or be desirably integrated into another system, or some features can be ignored or not executed.Another point, it is shown or discussed
Mutual coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING of equipment or unit or
Communication connection can be electrical property, mechanical or other forms.
Unit may or may not be physically separated as illustrated by the separation member, shown as a unit
Component may or may not be physical unit, it can and it is in one place, or may be distributed over multiple networks
On unit.It can some or all of the units may be selected to achieve the purpose of the solution of this embodiment according to the actual needs.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.
In the above-described embodiments, can come wholly or partly by software, hardware, firmware or any combination thereof real
It is existing.When being realized using software program, can entirely or partly realize in the form of a computer program product.The computer
Program product includes one or more computer instructions.On computers load and execute computer program instructions when, all or
Partly generate the process or function according to the embodiment of the present application.Computer can be general purpose computer, special purpose computer, calculating
Machine network or other programmable devices.Computer instruction may be stored in a computer readable storage medium, or from one
Computer readable storage medium is transmitted to another computer readable storage medium, for example, computer instruction can be from a net
Website, computer, server or data center pass through wired (such as coaxial cable, optical fiber, Digital Subscriber Line (Digital
Subscriber Line, DSL)) or wireless (such as infrared, wireless, microwave etc.) mode to another web-site, computer,
Server or data center are transmitted.Computer readable storage medium can be any usable medium that computer can access
Either comprising data storage devices such as one or more server, data centers that can be integrated with medium.Usable medium can
To be magnetic medium (for example, floppy disk, hard disk, tape), optical medium (for example, DVD) or semiconductor medium (such as solid-state is hard
Disk (Solid State Disk, SSD)) etc..
The embodiment of the present invention also provides a kind of computer program product, which can be loaded directly into storage
In device, and contain software code, which is loaded into via computer and can be realized above-mentioned routing after executing
Method.
More than, the only specific embodiment of the application, but the protection scope of the application is not limited thereto, and it is any to be familiar with
Those skilled in the art within the technical scope of the present application, can easily think of the change or the replacement, and should all cover
Within the protection scope of the application.Therefore, the protection scope of the application should be subject to the protection scope in claims.
Claims (11)
1. a kind of method for routing characterized by comprising
When source node does not receive the first multi-hop BFD message of the first anycast member transmission, determination in the first preferred path
First anycast member's failure；Wherein, the first anycast member is wherein one in first preferred path
A node, first preferred path are data transfer path used in the source node to destination node；
The source node determines at least according to the second destination node prefix in the first destination node prefix matching equipment information database
One backup path, and the second preferred path is determined according at least one described backup path；Wherein second preferred path
For data transfer path used in the source node to destination node；
The source node obtains the 2nd anycast member according to second preferred path；The wherein second anycast member
For one of node in second preferred path；
The source node sends data to the destination node by the outgoing interface of the 2nd anycast member.
2. method for routing according to claim 1, which is characterized in that the source node is obtained according to second preferred path
After taking the 2nd anycast member, further includes:
The source node sends the second multi-hop BFD message to the 2nd anycast member according to second preferred path, and receives
The third multi-hop BFD message that the 2nd anycast member returns；Wherein the second multi-hop BFD message and the third are more
BFD message is jumped to correspond.
3. method for routing according to claim 2, which is characterized in that the first anycast member and described second
Anycast member belongs to same anycast group.
4. method for routing according to claim 1, which is characterized in that the source node is according to the first destination node prefix matching
The second destination node prefix in equipment information database determines at least one backup path, and according at least one described spare road
Diameter determines the second preferred path, specifically includes:
Second destination node of the source node in the equipment information database according to the first destination node prefix matching
Prefix determines the second destination node prefix at least one described backup path identical with the first destination node prefix, will
Shortest path at least one described backup path is as second preferred path.
5. a kind of node device characterized by comprising
Processing unit, for not receiving the first of the first anycast member transmission in the first preferred path when receiving unit
Multi-hop BFD message determines the first anycast member's failure；Wherein, the first anycast member is described first excellent
One of node in routing diameter, first preferred path are data transfer path used in source node to destination node；
The processing unit is also used to according to the second destination node prefix in the first destination node prefix matching equipment information database
It determines at least one backup path, and the second preferred path is determined according at least one described backup path；Wherein described second
Preferred path is data transfer path used in the source node to destination node；
The processing unit is also used to obtain the 2nd anycast member according to second preferred path；Wherein described second
Anycast member is one of node in second preferred path；
The outgoing interface of transmission unit, the 2nd anycast member for being obtained by the processing unit sends data
To the destination node.
6. node device according to claim 5, which is characterized in that further include:
The transmission unit is also used to send the second multi-hop BFD report to the 2nd anycast member according to second preferred path
Text；
The receiving unit is also used to receive the third multi-hop BFD message that the 2nd anycast member returns；It is wherein described
Second multi-hop BFD message and the third multi-hop BFD message correspond.
7. node device according to claim 6, which is characterized in that the first anycast member and described second
Anycast member belongs to same anycast group.
8. node device according to claim 5 characterized by comprising
The processing unit, described in the equipment information database according to the first destination node prefix matching
Second destination node prefix, determining the second destination node prefix, identical with the first destination node prefix described at least one is standby
With path, using the shortest path at least one described backup path as second preferred path.
9. a kind of node device, which is characterized in that include processor and memory in the structure of the node device, memory is used
It is coupled in processor, saves the necessary program instruction of the node device and data, processor is deposited for executing in memory
The program instruction of storage, so that the node device executes method for routing according to any one of claims 1-4.
10. a kind of computer storage medium, which is characterized in that computer program code is stored in computer storage medium, when
Computer program code on node device as claimed in claim 9 when running, so that the node device executes such as right
It is required that the described in any item method for routing of 1-4.
11. a kind of computer program product, which is characterized in that computer program product stores computer software instructions, works as meter
Calculation machine software instruction on node device as claimed in claim 9 when running, so that the node device executes such as claim 1-4
The program of described in any item method for routing.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910117358.5A CN109660458B (en) | 2019-02-15 | 2019-02-15 | Routing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910117358.5A CN109660458B (en) | 2019-02-15 | 2019-02-15 | Routing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109660458A true CN109660458A (en) | 2019-04-19 |
| CN109660458B CN109660458B (en) | 2021-04-06 |
Family
ID=66122683
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910117358.5A Active CN109660458B (en) | 2019-02-15 | 2019-02-15 | Routing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109660458B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111885630A (en) * | 2020-07-01 | 2020-11-03 | 中国联合网络通信集团有限公司 | Data transmission method and communication device |
| CN113300949A (en) * | 2020-02-24 | 2021-08-24 | 华为技术有限公司 | Method for forwarding message, method, device and system for issuing routing information |
| WO2024109045A1 (en) * | 2022-11-22 | 2024-05-30 | 华为技术有限公司 | Routing updating method and apparatus, device, and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101044728A (en) * | 2004-12-10 | 2007-09-26 | 思科技术公司 | Fast reroute (frr) protection at the edge of a rfc 2547 network |
| CN101340356A (en) * | 2007-07-05 | 2009-01-07 | 华为技术有限公司 | Method for forwarding information and information forwarding apparatus |
| US8259564B1 (en) * | 2008-12-12 | 2012-09-04 | Juniper Networks, Inc. | Egress protection for label switched paths |
| CN102769560A (en) * | 2003-12-29 | 2012-11-07 | 英特尔公司 | Method and device for anycast addressing for internet protocol version six |
| US20180062914A1 (en) * | 2016-08-31 | 2018-03-01 | Nicira, Inc. | Edge node cluster network redundancy and fast convergence using an underlay anycast vtep ip |
-
2019
- 2019-02-15 CN CN201910117358.5A patent/CN109660458B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102769560A (en) * | 2003-12-29 | 2012-11-07 | 英特尔公司 | Method and device for anycast addressing for internet protocol version six |
| CN101044728A (en) * | 2004-12-10 | 2007-09-26 | 思科技术公司 | Fast reroute (frr) protection at the edge of a rfc 2547 network |
| CN101340356A (en) * | 2007-07-05 | 2009-01-07 | 华为技术有限公司 | Method for forwarding information and information forwarding apparatus |
| US8259564B1 (en) * | 2008-12-12 | 2012-09-04 | Juniper Networks, Inc. | Egress protection for label switched paths |
| US20180062914A1 (en) * | 2016-08-31 | 2018-03-01 | Nicira, Inc. | Edge node cluster network redundancy and fast convergence using an underlay anycast vtep ip |
Non-Patent Citations (1)
| Title |
|---|
| W.JIA等: "Integrated fault-tolerant multicast and anycast routing algorithms", 《IEEE》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113300949A (en) * | 2020-02-24 | 2021-08-24 | 华为技术有限公司 | Method for forwarding message, method, device and system for issuing routing information |
| WO2021169258A1 (en) * | 2020-02-24 | 2021-09-02 | 华为技术有限公司 | Message forwarding method, routing information publishing method, apparatus and system |
| CN111885630A (en) * | 2020-07-01 | 2020-11-03 | 中国联合网络通信集团有限公司 | Data transmission method and communication device |
| WO2024109045A1 (en) * | 2022-11-22 | 2024-05-30 | 华为技术有限公司 | Routing updating method and apparatus, device, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109660458B (en) | 2021-04-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11310155B1 (en) | Virtual router workload offloading | |
| CN102783097B (en) | Packet transfer system, control apparatus, transfer apparatus, method of creating processing rules | |
| US7120711B2 (en) | System and method for communicating over intra-hierarchy and inter-hierarchy links | |
| CN104717081B (en) | The implementation method and device of a kind of gateway function | |
| Panda et al. | Cap for networks | |
| CN103560967B (en) | The virtual data center mapping method of a kind of business demand perception | |
| US9185006B2 (en) | Exchange of server health and client information through headers for request management | |
| CN109660458A (en) | A kind of method for routing and equipment | |
| CN106161610A (en) | A kind of method and system of distributed storage | |
| CN109032974A (en) | The resource management in quick peripheral parts interconnected domain | |
| CN105122730A (en) | System and method for rapid link failure handling | |
| CN102845035A (en) | Method of identifying destination in virtual environment | |
| US11601365B2 (en) | Wide area networking service using provider network backbone network | |
| CN102663661A (en) | Health information system | |
| US11824773B2 (en) | Dynamic routing for peered virtual routers | |
| JP2008228150A (en) | Switch device, and frame switching method and program thereof | |
| CN106020926A (en) | Data transmission method and device used in virtual switch technique | |
| CN106464600A (en) | System and method for providing congestion notification in layer 3 networks | |
| CN106713378A (en) | Method and system for realizing service provision by multiple application servers | |
| WO2016029029A1 (en) | Diagnostic routing system and method for a link access group | |
| CN103207801B (en) | The methods, devices and systems of virtual machine (vm) migration and fibre channel media | |
| EP3192221A1 (en) | Method for scalable computer network partitioning | |
| US7480735B2 (en) | System and method for routing network traffic through weighted zones | |
| JP5754504B2 (en) | Management apparatus, information processing apparatus, information processing system, and data transfer method | |
| CN104348737B (en) | The transmission method and interchanger of a kind of multicast message |
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 |