WO2018033060A1 - Procédé et dispositif de commutation de messages - Google Patents

Procédé et dispositif de commutation de messages Download PDF

Info

Publication number
WO2018033060A1
WO2018033060A1 PCT/CN2017/097500 CN2017097500W WO2018033060A1 WO 2018033060 A1 WO2018033060 A1 WO 2018033060A1 CN 2017097500 W CN2017097500 W CN 2017097500W WO 2018033060 A1 WO2018033060 A1 WO 2018033060A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
topology
prefix
mrt
label
Prior art date
Application number
PCT/CN2017/097500
Other languages
English (en)
Chinese (zh)
Inventor
彭少富
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2018033060A1 publication Critical patent/WO2018033060A1/fr

Links

Images

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/12—Shortest path evaluation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/46—Interconnection of networks
    • H04L12/4633—Interconnection of networks using encapsulation techniques, e.g. tunneling
    • 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/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • the present invention relates to the field of communications, and in particular to a packet forwarding method and apparatus.
  • MRT Maximum Redundant Trees
  • FRR Fast Re-Route
  • LDP Label Distribution Protocol
  • IP-tunnel network protocol-tunnel
  • the LDP forwarding mechanism distinguishes between the default topology forwarding behavior and the MRT forwarding behavior through different labels, so that the forwarding plane can support MRT-FRR without any upgrade.
  • the IP-tunnel forwarding mechanism needs to waste the dedicated MRT loopback address to support forwarding. It also enables the forwarding plane to support MRT-FRR without any upgrade. In contrast, the LDP forwarding mechanism is more reasonable. Therefore, the default maximum redundancy tree configuration file of the MRT architecture uses the LDP forwarding mechanism in the default MRT profile. Currently, other MRT profiles are not defined.
  • the segmentation routing technology will enable a node to specify its forwarding path for the message instead of forwarding it according to the general shortest path. By adding the segment list information related to the segment ID segment ID to the message, it is not required. The status information of each path is maintained on the intermediate node. Segmented routing primarily extends the IGP to support advertising and learning segment IDs. Generally, in the network where the segmentation route is deployed, the LDP and the Resource ReSerVation Protocol-Traffic Extension (RSVP-TE) are no longer needed. In the segmented routing network, the known FRR technology has a Topology Independent Loop Free Alternate (TI-LFA), but the protection rules defined by TI-LFA are very complicated and immature.
  • TI-LFA Topology Independent Loop Free Alternate
  • the embodiment of the invention provides a packet forwarding method and device, so as to solve at least the problem that the segment routing network and the MTR function cannot be combined in the related art.
  • a packet forwarding method including: a first node receives a packet to be forwarded, where a destination address of the packet is a second node; and the first node is in advance Searching for a target topology corresponding to the packet in the generated topology, where the pre-generated topology includes: a first topology and a second topology generated according to a maximum redundancy tree MRT algorithm, and obtained according to a shortest path first SPF algorithm a third topology, the first topology and the second topology and the third topology are different from each other; the first node looks up in the target topology for forwarding to the second node a hop node, and forwarding the message to the next hop node based on a predetermined forwarding mechanism, wherein the predetermined forwarding mechanism adopts a segmented route forwarding based on a tunnel nesting manner of each prefix per prefix per prefix mechanism.
  • the method further includes: determining, by the first node, a route from the first topology to the destination address and a route from the second topology to the destination address according to the MRT algorithm a protection route for protecting a route to the destination address in the third topology, and determining that a topology corresponding to the protection route is a protection topology; and/or, the first node according to the color flag information from the Determining a protection route for protecting a route to the destination address in the third topology from a route to a tunnel end point in a topology and a route to a tunnel end point in the second topology, and determining a corresponding path of the protection route
  • the topology is a protection topology, where the tunnel endpoint is a remote node selected by the first node for the protection destination address, and the remote node is loop-free for the fault point, when the fault occurs.
  • the first node uses the MRT tunnel encapsulation message to the remote node.
  • the searching, by the first node, the target topology corresponding to the packet in the pre-generated topology includes: determining, by the first node, a chain in the third topology for reaching the second node Whether the road has a fault; in the case that it is determined that there is no fault, the first node determines that the third topology is the target topology; and/or, in the event that a fault is determined, The first node determines that the protection topology is the target topology.
  • the method before the receiving, by the first node, the packet to be forwarded, the method further includes: the first node generating, according to the MRT algorithm, the first topology and the second topology, and according to The SPF algorithm generates the third topology.
  • the first node generates the first topology and the second topology according to the MRT algorithm
  • the third topology is generated according to the SPF algorithm
  • the first node determines the An MRT Island where a node is located, wherein the MRT Island is an open shortest path first OSPF or intermediate system on the first node and other nodes in the same domain area or the same level as the first node
  • the segmentation route SR and the maximum redundancy tree profile MRT profile are enabled in the intermediate system ISIS instance
  • the first node and the other nodes negotiate with each other in the area or level where the first node is located;
  • the first node generates the first topology and the second topology based on the MRT Island running the MRT algorithm
  • the third topology is generated by running the SPF algorithm based on the area or level.
  • the predetermined forwarding mechanism is specified in the MRT profile.
  • the method further includes at least one of: the first node assigns a first prefix-sid to the first topology for a node-level prefix local to the first node, and the first prefix -sid flooding in the domain area or level of the MRT Island; the first node is a node-level prefix local to the first node, and assigns a second prefix-sid to the second topology, and The second prefix-sid is flooded in a domain area or a hierarchy level in which the MRT Island is located; the first node is a node-level and a non-node-level prefix local to the first node, and the third topology is allocated to the third topology.
  • the first node receiving a prefix of the pre-generated topology on other nodes -sid, recording a prefix-sid of the pre-generated topology on the other node and continuing to advertise a prefix-sid of the pre-generated topology on the other node to a node other than the other node .
  • the forwarding, by the first node, the packet to the next hop node includes: Determining, by the first node, an outgoing label of the first node that matches the packet; the first node encapsulating the outgoing label of the first node into the packet, and sending the encapsulated packet Go to the next hop node.
  • the determining, by the first node, the outbound label of the first node that matches the packet includes: when the target topology is the third topology, the first node corresponding to the target The outbound label of the topology is calculated by the first node based on the third prefix index prefix-sid of the destination prefix prefix corresponding to the destination address and the SRGB of the next hop node.
  • the determining, by the first node, the outbound label of the first node that matches the packet includes: when the target topology is the first topology or the second topology: When the two nodes are the nodes in the MRT Island and the destination prefix prefix corresponding to the destination address is the node-level prefix prefix of the second node, the first node determines the corresponding location of the first node by: An outbound label of the target topology: an outbound label of the first node corresponding to the target topology is prefixed by the first node based on a prefix index of the node level prefix prefix of the second node corresponding to the target topology SRGB calculation with the next hop node; if the second node is not the node in the MRT Island or the destination prefix prefix corresponding to the destination address is the non-node level prefix of the second node The first node determines whether the next hop node is a node outside the MRT Island; when the determination result is no, the first no
  • the first node encapsulates the outgoing label of the first node into the packet, and includes at least one of the following: when the packet type of the packet is an Internet Protocol IP packet, The outbound label of the first node is pressed on the IP header of the IP packet; when the packet type of the packet is a fragmented route SR label packet, the stack of the label stack of the SR label packet is used. The top tag is replaced with the outgoing tag of the first node.
  • the determining, by the first node, the outgoing label of the first node includes: when the first node and the second node are the same node, the first node is determined based on the target topology. The next hop node is the first node, and the first node does not have a label.
  • the method further includes: when the first node and the second node are the same node, the method includes: when the packet type of the packet is an Internet Protocol IP packet, the first Sending, by the node, the packet to the control plane of the first node; and/or, when the packet type of the packet is a fragmented route SR label packet, the first node sends the SR
  • the stack top label of the label stack of the label message pops up, and continues to be forwarded based on the lower layer label or IP header lookup table of the label stack of the message.
  • a message forwarding device is further provided, where the device is applied to a first node, and includes: a receiving module, configured to receive a packet to be forwarded, where the packet is The destination address is a second node, and the search module is configured to search for a target topology corresponding to the packet in a pre-generated topology, where the pre-generated topology includes: a first generated according to a maximum redundancy tree MRT algorithm.
  • a forwarding module configured to be at the target Finding, in the topology, a next hop node for forwarding to the second node, and forwarding the packet to the next hop node based on a predetermined forwarding mechanism, where the predetermined forwarding mechanism adopts per prefix based on each topology
  • the segmentation route forwarding mechanism of the tunnel nesting mode of the index prefix-sid is configured to be at the target Finding, in the topology, a next hop node for forwarding to the second node, and forwarding the packet to the next hop node based on a predetermined forwarding mechanism, where the predetermined forwarding mechanism adopts per prefix based on each topology
  • the segmentation route forwarding mechanism of the tunnel nesting mode of the index prefix-sid is configured to be at the target Finding, in the topology, a next hop node for forwarding to the second node, and forwarding the packet to the next hop node based on a predetermined forwarding mechanism, where the predetermined forwarding mechanism adopts per prefix
  • the apparatus further includes: a determining module, configured to follow a route from the first topology to the destination address and the second topology to the destination according to the MRT algorithm Determining, in the routing of the address, a protection route for protecting a route to the destination address in the third topology, and determining that the topology corresponding to the protection route is a protection topology; and/or, according to the color flag information, from the Determining a protection route for protecting a route to the destination address in the third topology from a route to a tunnel end point in a topology and a route to a tunnel end point in the second topology, and determining a corresponding path of the protection route
  • the topology is a protection topology, where the tunnel endpoint is a remote node selected by the first node for the protection destination address, and the remote node is loop-free for the fault point, when the fault occurs.
  • the first node uses the MRT tunnel encapsulation message to the remote node.
  • a storage medium is also provided.
  • the storage medium is arranged to store program code for performing the above steps.
  • the MRT function is introduced in the segment routing network, thereby achieving the purpose of combining the segment routing network with the MTR function.
  • FIG. 1 is a flowchart of a packet forwarding method according to an embodiment of the present invention.
  • FIG. 2 is a schematic diagram of an MRT Profile according to an embodiment of the present invention.
  • FIG. 3 is a network topology diagram according to a specific embodiment of the present invention.
  • FIG. 4 is a network topology diagram according to a second embodiment of the present invention.
  • FIG. 5 is a network topology diagram according to a third embodiment of the present invention.
  • FIG. 6 is a structural block diagram of a message forwarding apparatus according to an embodiment of the present invention.
  • FIG. 7 is a block diagram showing a preferred structure of a message forwarding apparatus according to an embodiment of the present invention.
  • FIG. 1 is a flowchart of a packet forwarding method according to an embodiment of the present invention. As shown in FIG. 1, the process includes the following steps:
  • Step S102 the first node receives the packet to be forwarded, where the destination address of the packet is the second node;
  • Step S104 The first node searches for a target topology corresponding to the foregoing packet in a pre-generated topology, where the pre-generated topology includes: a first topology and a second topology generated according to a maximum redundancy tree MRT algorithm, According to a third topology obtained by a Shortest Path First (SPF) algorithm, the first topology and the second topology and the third topology are different from each other;
  • SPF Shortest Path First
  • Step S106 the first node searches for a next hop node for forwarding to the second node in the target topology, and forwards the packet to the next hop node according to a predetermined forwarding mechanism, where the predetermined forwarding mechanism is adopted.
  • a segmented route forwarding mechanism based on the tunnel nesting manner of prefix-sid per prefix per topology.
  • the first node may be any node in the MRT Island, and the second node may be any node in the SR Domain, and the second node may be in the MRT Island or outside the MRT Island.
  • One of the first topology and the second topology may be an MRT-red topology, and one is an MRT-blue topology; and the third topology may be an MT-default topology.
  • the first node when the first node forwards the packet to the next hop node, the first node may perform forwarding according to a predetermined forwarding mechanism, which is a tunnel nesting manner based on the per-segment per-segment routing global block SRGB. Segmented route forwarding mechanism.
  • a predetermined forwarding mechanism which is a tunnel nesting manner based on the per-segment per-segment routing global block SRGB. Segmented route forwarding mechanism.
  • the MRT function is introduced in the segment routing network, thereby achieving the purpose of combining the segment routing network with the MTR function.
  • the foregoing method further includes: (can receive the message to be forwarded).
  • the foregoing step is performed in the embodiment: the first node determines, according to the MRT algorithm, the route from the first topology to the destination address and the route from the second topology to the destination address to protect the third topology to the destination address.
  • Protecting the route of the route, and determining that the topology corresponding to the protection route is a protection topology; and/or, the first node according to the color flag information from the first topology to the tunnel end point and the route from the second topology to the tunnel end point Determining a protection route for protecting a route to a destination address in the third topology, and determining that the topology corresponding to the protection route is a protection topology, wherein the tunnel end point is a remote node selected by the first node as a protection destination address
  • the remote node is loop-free for the fault point.
  • the first node uses the MRT tunnel to the remote node to encapsulate the packet.
  • the first topology may be determined as the protection topology
  • the second topology may be determined as the protection topology.
  • the specific topology selected as the protection topology needs to be determined according to actual conditions.
  • the searching, by the first node, the target topology corresponding to the foregoing packet in the pre-generated topology includes: determining, by the first node, whether the link used to reach the second node in the third topology is A fault occurs; the first node determines that the third topology is the target topology in the case that it is determined that there is no fault; and/or, in the case that the fault is determined, the first node determines that the protection topology is the target topology.
  • the packet can be forwarded according to the default topology. After the link is faulty, the protection topology is used to forward the packet.
  • the method before the receiving, by the first node, the packet to be forwarded, the method further includes: the first node generates the first topology and the second topology according to the MRT algorithm, and generates according to the SPF algorithm. Get the third topology.
  • the first node generates the first topology and the second topology according to the foregoing MRT algorithm, and generates the third topology according to the SPF algorithm, where the first node determines the MRT Island where the first node is located.
  • the MRT Island is an Open Shortest Path First (OSPF) or intermediate system to an intermediate system on the first node and other nodes in the same domain area or the same level as the first node. (Intermediate system to Intermediate system, referred to as ISIS), the segmentation route SR and the maximum redundancy tree configuration file MRT profile are enabled in the first section.
  • OSPF Open Shortest Path First
  • ISIS Intermediate system to Intermediate system
  • the first node and the other nodes are mutually negotiated in the area or level where the point is located; the first node generates the first topology and the second topology based on the MRT Island running MRT algorithm, and generates the SPF algorithm based on the above area or level.
  • the third topology is mutually negotiated in the area or level where the point is located; the first node generates the first topology and the second topology based on the MRT Island running MRT algorithm, and generates the SPF algorithm based on the above area or level.
  • the foregoing predetermined forwarding mechanism is specified in the MRT profile. That is, the segmented route forwarding mechanism based on the tunnel nesting manner of the prefix-sid per prefix per topology is adopted.
  • the foregoing method further includes at least one of the following: the first node is a node-level prefix local to the first node, and the first prefix-sid is allocated to the first topology, and the first prefix-sid is Flooding in the domain area or level of the MRT Island; the first node is a node-level prefix local to the first node, and a second prefix-sid is allocated for the second topology, and the second prefix-sid is located at the MRT Island.
  • the first node is a node-level and non-node-level prefix local to the first node, and a third prefix-sid is allocated for the third topology, and the third prefix-sid is in the first node.
  • the first node receives the prefix-sid of the pre-generated topology on the other node, records the prefix-sid of the pre-generated topology on the other node, and the other
  • the prefix-sid of the pre-generated topology on the node continues to be advertised to nodes other than the other nodes.
  • the first prefix-sid, the second prefix-sid, and the third prefix-sid are independent of each other.
  • the first node forwarding the packet to the next hop node includes: the first node determining an outgoing label of the first node that matches the packet; the first node The outgoing label of the node is encapsulated into the above packet, and the encapsulated packet is sent to the next hop node.
  • the label encapsulation manner is different for different types of packets.
  • the first node determines that the egress label of the first node that matches the packet includes: when the target topology is the third topology, the label of the corresponding target topology of the first node is A node is calculated based on the third prefix index prefix-sid of the destination prefix prefix corresponding to the destination address and the SRGB of the next hop node.
  • the first node determines the first section that matches the message.
  • the outbound label of the point includes: when the target topology is the first topology or the second topology: if the second node is a node in the MRT Island and the destination prefix corresponding to the destination address is a node-level prefix prefix of the second node.
  • the first node determines an outbound label of the first node corresponding to the target topology by: the outbound label of the corresponding target topology of the first node is corresponding to the target topology of the first node based on the node level prefix of the second node
  • the prefix index prefix-sid is calculated by the SRGB of the next hop node; if the second node is not the node in the MRT Island or the destination prefix prefix corresponding to the destination address is the non-node level prefix of the second node, the foregoing A node determines whether the next hop node is a node outside the MRT Island; when the determination
  • the first node encapsulates the outgoing label of the first node into the packet, and includes at least one of the following: when the packet type of the packet is an Internet Protocol IP packet, The IP address of the IP packet is stamped with the outgoing label of the first node. When the packet type of the packet is a fragmented routing SR label, the top label of the label stack of the SR label is replaced with the first label. The outgoing label of a node.
  • the determining, by the first node, the outbound label of the first node includes: when the first node and the second node are the same node, the first node determines the next hop node based on the target topology. For the first node, the first node does not have a label.
  • the method further includes: when the first node and the second section are When the point is the same node, the first node sends the packet to the control plane of the first node when the packet type of the packet is an Internet Protocol IP packet; and/or, when the packet is When the packet type is a segment-routed SR-tag packet, the first node pops up the stack-top label of the label stack of the SR-tag packet, and continues to forward the packet based on the lower-layer label or the IP header of the label stack of the packet.
  • the segmentation route is combined with the MRT technology to provide an MRT-FRR method based on the segmentation route forwarding mechanism.
  • an MRT profile is added to the MRT architecture, and the segment routing and forwarding mechanism is used to distinguish the default topology forwarding behavior and the MRT topology forwarding behavior by using the segment routing and forwarding mechanism.
  • the first step is to define a new MRT profile MRT Profile.
  • the SR-LSP is an LSP based on the fragment routing (SR) type, which is similar to the LDP LSP.
  • the SR-LSP tunneling forwarding mechanism is that the SR LSP in the MRT topology is established with the MRT egress node as the destination node. After the MRT FRR switchover occurs, on the MRT Ingress node, the SR LSP in the default topology is the tunnel nested in the MRT. Topology of the SR LSP.
  • Multi-prefix-sid refers to each prefix-sid per topology, that is, the default topology is different from the MRT-red topology and the prefix-sid in the MRT-blue topology.
  • the MRT is enabled in the corresponding IGP instance on each node in the IGP area/level (which may be only a part of the node) and the new MRT profile is supported, and the corresponding MRT Island is generated for the new MRT profile.
  • the corresponding MT-IDs are recorded as MT-red and MT-blue, respectively.
  • the MT-ID corresponding to the default topology generated by the SPF algorithm can be recorded as MT-default.
  • the third step is to enable the IGP instance on each node of the segmentation route. If the MRT is also enabled and the new MRT profile is supported, the MT-default prefix-sid is not assigned to the MT-default. -default node-sid (usually the prefix-sid corresponding to a loopback route, the same below), and also assign the MT-red prefix-sid of the node-level MT-red node-sid to MT-red, and MT-blue The MT-blue prefix-sid of the node level is assigned as the MT-blue node-sid.
  • the three node-sids are flooded with (MT-default, prefix), (MT-red, prefix), and (MT-blue, prefix) reachable notification messages, where (MT-default, prefix) can be between areas. Flooding, but (MT-red, prefix) and (MT-blue, prefix) flood only in the area.
  • the nodes in the above MRT Island need to additionally allocate MT-red node-sid and MT-blue node-sid for their node-level prefix.
  • the non-node-level prefix in the MRT Island can also be assigned the corresponding MT-red prefix-sid and MT-blue prefix-sid, but it is not required. Generally, it is not recommended to allocate. If it is allocated, its corresponding entry establishment process and node.
  • the establishment process of the class prefix is completely similar; the node-level and non-node-level prefix outside the MRT Island do not need to allocate the corresponding MT-red prefix-sid and MT-blue prefix-sid because of the original in these prefixes.
  • the MRT is not perceived, and it is impossible to allocate the MRT-related MT-red prefix-sid and MT-blue prefix-sid.
  • the source node S in the MRT Island calculates the SPF primary next hop and the MRT-blue/red next hop for the node-level prefix (denoted as D-loopback0) of the other destination node D in the Island, ie (MT- Default, D-loopback0) will contain the SPF main next hop, (MT-blue, D-loopback0) will contain the MRT-blue next hop, (MT-red, D-loopback0) will contain MRT-red One jump. And determining whether the MRT-blue next hop or the MRT-red next hop protects the SPF primary next hop by the MRT algorithm.
  • D-loopback0 node-level prefix
  • the MT-default SR outgoing label in the SPF primary next hop is calculated based on the offset of the (MT-default, D-loopback0) corresponding prefix-sid in the SRGB of the next hop node; in the MRT-red next hop The MRT-red SR outgoing label is calculated based on the offset of the (MT-red, D-loopback0) corresponding prefix-sid in the SRGB of the next hop node; the above MRT-blue next The MRT-blue SR outgoing label in the hop is calculated based on the offset of the corresponding prefix-sid of (MT-blue, D-loopback0) in the SRGB of the next hop node.
  • the primary NHLFE includes the SPF primary next hop and the corresponding MT-default SR outgoing label
  • the MRT-FRR standby NHLFE includes the above selected for protecting the SPF primary.
  • the corresponding ILM entry is also generated, and the MT-default SR incoming tag is calculated based on the offset of the (MT-default, prefix) corresponding prefix-sid in the SRGB of the S node, NHLFE Same as the above FTN entry.
  • the S-node can also generate a corresponding Incoming Label Map (ILM) entry for (MT-red, D-loopback0), and the MT-red SR is based on the label (MT-red, D-loopback0).
  • the corresponding prefix-sid is calculated by offsetting in the SRGB of the S node, and the NHLFE includes the MRT-red next hop and the corresponding MT-red SR outgoing label.
  • the corresponding ILM entry is also generated for (MT-blue, D-loopback0), and the MT-blue SR input tag is calculated based on the offset of the corresponding prefix-sid of the (MT-blue, D-loopback0) in the S node.
  • the NHLFE contains the MRT-blue next hop and the corresponding MT-blue SR outgoing label.
  • the source node S in the MRT Island also calculates the SPF primary next hop and the MRT for other prefixes within the Island or other outside of the Island (ie all other prefixes in the network except the node level prefix in the MRT Island where the S is located).
  • -FRR backup next hop MRT-FRR backup next hop is represented as the corresponding MRT Egress node (denoted as E, the corresponding node level prefix is marked as E-loopback0) and the color flag information prompt is selected to the M node of the E node
  • E MRT Egress node
  • E-loopback0 the corresponding node level prefix
  • the color flag information prompt is selected to the M node of the E node
  • the red path is also the MRT-blue path to protect the above SPF primary next hop.
  • the MT-default SR outgoing label in the SPF primary next hop is calculated based on the offset of the (MT-default, prefix) corresponding prefix-sid in the SRGB of the next hop node; the MRT-FRR backup next hop will correspond to one
  • the underlying label is the MT-default SR label assigned by the E node for the destination prefix, that is, based on the offset of the (MT-default, prefix) corresponding prefix-sid in the SRGB of the E node
  • the upper label is S to E's MRT-blue or MRT-red road
  • the SR entry label corresponding to the path (selecting the MRT-blue or MRT-red path according to the color flag information), that is, based on the (MT-red, E-loopback0) or (MT-blue, E-loopback0) corresponding prefix-sid
  • the offset is calculated in the SRGB of the S node.
  • the top-level SR into the label needs to be searched for the corresponding SR ILM entry and replaced with the outgoing label and the direct next hop, that is, the above-mentioned incoming label stack is converted into the outgoing label stack.
  • a corresponding FTN entry is generated.
  • the primary NHLFE includes the foregoing SPF primary next hop and the corresponding MT-default SR outgoing label
  • the standby NHLFE includes the MRT Egress node E and its corresponding color flag information.
  • the calculated inbound label stack (used to be replaced with the label stack before being actually forwarded).
  • the corresponding ILM entry is also generated, and the MT-default SR entry tag is calculated based on the offset of the (MT-default, prefix) corresponding prefix-sid in the S node SRGB, NHLFE and the above
  • the FTN entries are the same. If the prefix is an S node local or direct prefix, there is no NHLFE information.
  • the IP or SR label unicast traffic is forwarded along the MRT path as follows:
  • the MRT Ingress node directs the IP packet based on the corresponding FTN entry of the MT-default, prefix, or the ILM entry guides the SR.
  • Label packet forwarding Specifically divided into two cases:
  • the top-level label of the SR-label packet MT-default SR is switched into the MRT-
  • the red or MRT-blue SR is sent to the MRT-red or MRT-blue next hop after the label is sent out; or the IP packet is directly pressed onto the MRT-red or MRT-blue SR and sent to the MRT-red or MRT- Blue next hop.
  • the MT-default SR is switched to the MT that the MRT Egress node allocates for the prefix.
  • the -default SR tag is then pressed to the MRT-red or MRT-blue SR of the MRT Egress node and sent to the MRT-red or MRT-blue next hop of the MRT Egress node; or the IP packet is directly pressed.
  • the MR-red or MRT-blue SR that is up to the MRT Egress node is sent out to the MRT-red or MRT-blue next hop to the MRT Egress node.
  • the MRT Transit node forwards the message based on the corresponding SR ILM entry to the MRT Egress node level (MT-red, prefix) or (MT-blue, prefix), and continues to exchange the MRT-red or MRT-blue SR into the label.
  • the MRT-red or MRT-blue SR is sent out to the MRT-red or MRT-blue next hop.
  • the MLD-based SR tag corresponding to the lower layer (MT-default, prefix) is used to search for the corresponding ILM entry to forward the packet, or IP address. After the packet header is exposed, it is forwarded directly based on the destination IP address.
  • FIG. 2 is a schematic diagram of an MRT profile according to an embodiment of the present invention.
  • the MRT profile shown in FIG. 2 is basically the same as the default MRT profile defined in RFC7812. The difference is that the MRT Forwarding Mechanism option is SR-LSP based on multi-prefix. -sid tunneling Option.
  • FIG. 3 is a network topology diagram according to a specific embodiment of the present invention.
  • OSPF is running in the network, and all nodes are in the same area.
  • the segment routing function is enabled in the corresponding OSPF instance, and the MRT profile defined in the foregoing embodiment of the present invention is enabled.
  • S establishes the MRT path to the prefix of the destination node D as the source node, and then protects the SPF main path based on this MRT path. Including the following steps:
  • Step S301 After the SR is enabled in the OSPF instance on each node of the S, A, B, and D, and the MRT profile defined in the embodiment of the present invention, they form an MRT Island in the area.
  • the MRT SR-LSP based on multi-prefix-sid tunneling option is used as the forwarding mechanism in the MRT profile.
  • each node in the MRT Island additionally allocates the MT-red prefix-sid.
  • MT-blue prefix-sid for example, three types of node-level prefix S-loopback0 can be assigned on the S node.
  • the prefix-sid is respectively recorded as: (MT-default, S-loopback0) node-sid, (MT-red, S-loopback0) node-sid, (MT-blue, S-loopback0) node-sid.
  • SRGB of the S node is SRGB_S, and the other nodes are similar.
  • the MT-default topology in the area is obtained based on the SPF algorithm on each node in the MRT Island, and the MT-red and MT-blue topologies are obtained based on the MRT algorithm.
  • the MT-default path to the destination node D is S-D
  • the MT-red path is also S-D
  • the MT-blue path is S-A-B-D.
  • Each node generates a corresponding prefix entry based on the topology. For example, on the S node, the MT-default next hop of the node-level prefix D-loopback0 in the MT-default topology to the destination node D is D, and the MT-blue topology is selected. The MT-blue path is given to protect the MT-default next hop D, then the corresponding MRT-FRR next hop will be copied to the next hop in the above MT-blue, that is, A, which is called MRT-blue next hop. .
  • the next hop is D, and the outgoing label is SRGB_D[default_SID0_D]
  • Standby NHLFE the next hop is A, and the outgoing label is SRGB_A[blue_SID0_D]
  • the entry tag is SRGB_S[default_SID0_D]
  • the next hop is D, and the outgoing label is SRGB_D[default_SID0_D]
  • Standby NHLFE the next hop is A, and the outgoing label is SRGB_A[blue_SID0_D]
  • a node A node:
  • the entry tag is SRGB_A[blue_SID0_D]
  • NHLFE The next hop is B, and the outgoing label is SRGB_B[blue_SID0_D]
  • the entry tag is SRGB_B[blue_SID0_D]
  • NHLFE The next hop is D, and the outgoing label is SRGB_D[blue_SID0_D]
  • the entry tag is SRGB_D[blue_SID0_D]
  • NHLFE None. Indicates that the SR-LSP has been terminated.
  • Step S302 When the link SD is faulty, the S node will switch the traffic to the MRT-blue next hop A prepared in advance, that is, the packet will be reported to the destination D-loopback0. The text is forwarded along the MT-blue path SABD.
  • the S receives the MT-default SR label packet, it is forwarded based on the ILM for (MT-default, D-loopback0) entry, and the inbound label SRGB_S[default_SID0_D] is exchanged to the outbound label SRGB_A[blue_SID0_D]; if S If the IP packet is received, it is forwarded based on the FTN for (MT-default, D-loopback0) entry, and the label SRGB_A[blue_SID0_D] is directly pressed on the IP header.
  • Step S303 after receiving the packet, the node A is matched with the ILM_for (MT-blue, D-loopback0) entry according to the top label of the packet, and continues to exchange the top label SRGB_A[blue_SID0_D] of the packet. It is sent to B after SRGB_B[blue_SID0_D].
  • ILM_for MT-blue, D-loopback0
  • Step S304 after receiving the packet, the node B matches the ILM for (MT-blue, D-loopback0) entry according to the top label of the packet, and continues to the top label SRGB_B[blue_SID0_D] of the packet. It is sent to D after being exchanged to SRGB_D[blue_SID0_D].
  • Step S305 After receiving the packet, the D node selects the SLM_D[blue_SID0_D] according to the top label of the packet, and matches the ILM for (MT-blue, D-loopback0) entry to terminate the SR-LSP locally.
  • the IP header continues to forward. Since the IP header is D-loopback0, the packet is sent to the control plane.
  • step S306 for the non-node level prefix on the D node, such as D-loopback1, the corresponding three prefix-sids may also be allocated, for example: (MT-default, D-loopback1) prefix-sid, (MT-red , D-loopback1) prefix-sid, (MT-blue, D-loopback1) prefix-sid.
  • the nodes in the MRT Island are similar to the steps in the step S301 to the D-loopback1, and the forwarding behavior is similar to the steps S302-305, and will not be described again.
  • the optimization method in the embodiment of the present invention may be that the corresponding MT-red node-sid and MT-blue node-sid are additionally allocated only for the node level prefix in the MRT Island.
  • the following describes how each node establishes a corresponding entry for D-loopback1 under this optimization method.
  • Other embodiments will also be described in accordance with this optimization method, and assume that each node's loopback0prefix is a node-level prefix, and other prefixes are non-node-level prefixes.
  • Step S307 creates an entry.
  • Step S307 on the S node, the MT-default next hop in the MT-default topology to D-loopback1 is D, and the MT-blue path (SABD) given in the MT-blue topology is selected to protect the MT-default next.
  • SABD MT-blue path
  • the next hop of the MRT-FRR backup is the MRT Egress node D and the color flag information is MRT-blue.
  • the prefix-sid is default_SID1_D.
  • the next hop is D, and the outgoing label is SRGB_D[default_SID1_D]
  • the top-level tag is SRGB_S[blue_SID0__D]
  • the underlying label is SRGB_D[default_SID1_D]
  • the entry tag is SRGB_S[default_SID1_D]
  • the next hop is D, and the outgoing label is SRGB_D[default_SID1_D]
  • Top-level tag is SRGB_S[blue_SID0_D]
  • the underlying label is SRGB_D[default_SID1_D]
  • the entry tag is SRGB_S[blue_SID0_D]
  • NHLFE The next hop is A, and the outgoing label is SRGB_A[blue_SID0_D]
  • the entry tag is SRGB_D[default_SID1_D]
  • NHLFE None. Indicates that the SR-LSP has been terminated.
  • Step S308 for the packet sent to the destination D-loopback1, when the link SD fails, the S node will switch the traffic as the MRT ingress node to the MRT-blue path prepared to the remote MRT Egress node D in advance. , that is, the message is forwarded along the MT-blue path SABD.
  • the S receives an MT-default SR tag, it is forwarded based on the ILM for (MT-default, D-loopback 1) entry, and the tag SRGB_S[default_SID1_D] is exchanged to the tag SRGB_D[default_SID1_D].
  • SRGB_A[blue_SID0_D] is sent to the next hop A.
  • the S receives an IP packet, it is forwarded based on the FTN for (MT-default, D-loopback1) entry and is directly pressed on the IP header. After the label SRGB_D[default_SID1_D], press SRGB_A[blue_SID0_D] and send it to the next hop A.
  • step S309 the process of receiving the message by the node A is the same as step S303.
  • step S310 the process of receiving the message by the Node B is the same as that of step S304.
  • step S311 after receiving the message, the D node continuously plays off the labels SRGB_D[blue_SID0_D] and SRGB_D[default_SID1_D], and continues to forward based on the IP header. Since the IP header is D-loopback0, the packet is sent to the control plane.
  • the MRT Island when the packet is forwarded along the MRT path, the MRT Island is actually forwarded along the SR-LSP in the corresponding MRT topology, wherein the node-level prefix in the MRT Island is actually the MT-default SR-LSP. It is attached to the MT-blue or MT-red SR-LSP, and the other prefix actually carries its MT-default SR-LSP on the MT-blue or MT-red SR-LSP to the MRT Egress node.
  • FIG. 4 is a network topology diagram according to the second embodiment of the present invention.
  • the network runs OSPF, and includes two areas, all nodes.
  • the segment routing function is enabled in the corresponding OSPF instance, and the MRT profiles defined in the embodiment of the present invention are enabled in the S, A, B, and C in the area1.
  • S establishes the MRT path to the prefix of the destination node D as the source node, and then protects the SPF main path based on this MRT path. Including the following steps:
  • step S401 the SR is enabled in the OSPF instance of all the nodes in area1 and area2. Each node is assigned SRGB.
  • the MRT profiles defined in the embodiment of the present invention are enabled in the OSPF instance on the S, A, B, and C nodes in the area1, they form an MRT Island in the area1.
  • the MRT SR-LSP based on multi-prefix-sid tunneling option is used as the forwarding mechanism in the MRT profile.
  • each node in the MRT Island additionally allocates the MT-red prefix-sid.
  • the three prefix-sids assigned to the node-level prefix B-loopback0 can be respectively recorded as: (MT-default, B-loopback0) node-sid, (MT-red , B-loopback0) node-sid, (MT-blue, B-loopback0) node-sid.
  • Each node will get the MT-default topology in the area based on the SPF algorithm, and based on The MRT algorithm obtains MT-red and MT-blue topologies.
  • the MT-default path to the destination node A is S-A
  • the MT-blue path is also S-A
  • the MT-red path is S-C-B-A.
  • the entries established by the nodes in the MRT Island for the node-level prefixes in the MRT Island are completely similar to the entries established for the prefix D-loopback0 in the step S301 of the first embodiment, and the destination IP matches the corresponding node-level prefix in the MRT Island.
  • the forwarding behavior of the traffic is also completely similar to steps S302-305, and will not be described again.
  • Step S403 On the S node, the MT-default next hop in the MT-default topology to the prefix D-loopback0 is C (assuming that the ABR1 in the area1 is the advertised node of the prefix D-loopback0, the MT to the destination node ABR1 is used. The default path to determine the next hop).
  • the remote node selected by the Tunnel Endpoint Selection method (refer to RFC7812) is A, assuming S is the GADAG root in MRT Island, and S ⁇ A ⁇ B ⁇ C ⁇ S, then The MRT-blue path to node A is SA, which can be used to protect the MT-default next hop C above.
  • Assume (MT-default, D-loopback0) prefix-sid is default_SID0_D.
  • the next hop is C, and the outgoing label is SRGB_C[default_SID0_D]
  • Top-level tag is SRGB_S[blue_SID0_A]
  • the underlying label is SRGB_A[default_SID0_D]
  • the entry tag is SRGB_S[default_SID0_D]
  • the next hop is C, and the outgoing label is SRGB_C[default_SID0_D]
  • Top-level tag is SRGB_S[blue_SID0_A]
  • the underlying label is SRGB_A[default_SID0_D]
  • the entry tag is SRGB_S[blue_SID0_A]
  • NHLFE The next hop is A, and the outgoing label is SRGB_A[blue_SID0_A]
  • a node A node:
  • the entry tag is SRGB_A[blue_SID0_A]
  • NHLFE None. Indicates that the SR-LSP has been terminated.
  • the entry tag is SRGB_A[default_SID0_D]
  • NHLFE The next hop is ABR3, and the outgoing label is SRGB_ABR3[default_SID0_D]
  • the entry tag is SRGB_ABR3[default_SID0_D]
  • NHLFE The next hop is ABR2, and the outgoing label is SRGB_ABR2[default_SID0_D]
  • the entry tag is SRGB_ABR2[default_SID0_D]
  • NHLFE The next hop is D, and the outgoing label is SRGB_D[default_SID0_D]
  • the entry tag is SRGB_D[default_SID0_D]
  • NHLFE None. Indicates that the SR-LSP has been terminated.
  • Step S404 For the packet sent to the destination D-loopback0, when the link S-C fails, the S node will switch the traffic as the MRT ingress node to the remotely prepared to the far end.
  • the MRT-blue path of the MRT Egress node A begins to forward the message along the MT-blue path S-A.
  • the S receives the MT-default SR tag packet, it is forwarded based on the ILM for (MT-default, D-loopback0) entry, and the inbound tag SRGB_S[default_SID0_D] is exchanged to the outbound tag SRGB_A[default_SID0_D].
  • SRGB_A[blue_SID0_A] is sent to the next hop A.
  • the S receives an IP packet, it is forwarded based on the FTN for (MT-default, D-loopback0) entry and is directly pressed on the IP header. After the label SRGB_A[default_SID0_D], press SRGB_A[blue_SID0_A] and send it to the next hop A.
  • Step S405 after receiving the message, the node A bounces off the label SRGB_A[blue_SID0_A], and exchanges the lower layer label SRGB_A[default_SID0_D] into SRGB_ABR3[default_SID0_D] and sends it to the next hop ABR3.
  • Step S406 after receiving the message, the ABR3 node exchanges the label SRGB_ABR3[default_SID0_D] into SRGB_ABR2[default_SID0_D] and sends it to the next hop ABR2.
  • Step S407 after receiving the message, the ABR2 node exchanges the label SRGB_ABR2[default_SID0_D] into SRGB_D[default_SID0_D] and sends it to the next hop D.
  • Step S408 After receiving the packet, the D node bounces off the label SRGB_D[default_SID0_D], and continues forwarding according to the IP header. Since the IP header is D-loopback0, the packet is sent to the control plane.
  • FIG. 5 The network topology diagram of the third embodiment of the present invention, as shown in FIG. 5, runs OSPF in the network, and includes two areas, and all nodes enable segmentation routing function in the corresponding OSPF instance, where S and A in area1
  • the B, C, and C enable the MRT profile defined in the embodiment of the present invention.
  • the B, E, D, and F in the area 2 also enable the MRT profile defined in the embodiment of the present invention.
  • S establishes the MRT path to the prefix of the destination node D as the source node, and then protects the SPF main path based on this MRT path. Including the following steps:
  • step S501 the SR is enabled in the OSPF instance of all the nodes in area1 and area2. Each node is assigned SRGB.
  • Step S502 After the MRT profiles defined in the embodiment of the present invention are enabled in the OSPF instance on the S, A, B, and C nodes in the area 1, they form an MRT Island in the area1.
  • the MRT SR-LSP based on multi-prefix-sid tunneling option is used as the forwarding mechanism in the MRT profile.
  • each node in the MRT Island additionally allocates the MT-red prefix-sid.
  • the three prefix-sids assigned to the node-level prefix B-loopback0 can be respectively recorded as: (MT-default, B-loopback0) node-sid, (MT-red , B-loopback0) node-sid, (MT-blue, B-loopback0) node-sid.
  • the MT-default topology in the area is obtained based on the SPF algorithm, and the MT-red and MT-blue topologies are obtained based on the MRT algorithm.
  • the MT-default path to the destination node B is S-C-B
  • the MT-red path is also S-C-B
  • the MT-blue path is S-A-B.
  • the entries established by the nodes in the MRT Island in the area1 for the node-level prefix in the MRT Island are completely similar to the entries established in the step S301 of the first embodiment for the prefix D-loopback0, and the destination IP matches the MRT Island.
  • the forwarding behavior of the traffic of the corresponding node-level prefix is also completely similar to steps S302-305. No longer.
  • step S503 the MRT profile defined in the embodiment of the present invention is also enabled in the OSPF instance on each of the nodes B, E, D, and F in area2, and then an MRT Island is formed in area2, and correspondingly generated in area2.
  • the entries established by the nodes in the MRT Island in the area 2 for the node-level prefix in the MRT Island are completely similar to the entries established in the step S301 of the first embodiment for the prefix D-loopback 0, and the destination IP matches the corresponding in the MRT Island.
  • the forwarding behavior of the traffic of the node-level prefix is also completely similar to steps S302-305. No longer.
  • Step S504 On the S node, the MT-default next hop in the MT-default topology to the prefix D-loopback0 is C (assuming that the ABR1 in the area1 is the advertised node of the prefix D-loopback0, the MT to the destination node ABR1 is used. The default path to determine the next hop).
  • the remote node selected by the Tunnel Endpoint Selection method (refer to RFC7812) is B, assuming S is the GADAG root in MRT Island, and S ⁇ A ⁇ B ⁇ C ⁇ S, then The MRT-blue path of Node B is SAB, which can be used to protect the MT-default next hop C above.
  • prefix-sid is default_SID0_D.
  • the next hop is C, and the outgoing label is SRGB_C[default_SID0_D]
  • Top-level entry tag is SRGB_S[blue_SID0_B]
  • the underlying label is SRGB_B[default_SID0_D]
  • the entry tag is SRGB_S[default_SID0_D]
  • the next hop is C, and the outgoing label is SRGB_C[default_SID0_D]
  • Top-level entry tag is SRGB_S[blue_SID0_B]
  • the underlying label is SRGB_B[default_SID0_D]
  • the entry tag is SRGB_S[blue_SID0_B]
  • NHLFE The next hop is A, and the outgoing label is SRGB_A[blue_SID0_B]
  • a node A node:
  • the entry tag is SRGB_A[blue_SID0_B]
  • NHLFE The next hop is B, and the outgoing label is SRGB_B[blue_SID0_B]
  • the entry tag is SRGB_B[blue_SID0_B]
  • NHLFE None. Indicates that the SR-LSP has been terminated.
  • the entry tag is SRGB_B[default_SID0_D]
  • NHLFE The next hop is F, and the outgoing label is SRGB_F[default_SID0_D]
  • the entry tag is SRGB_F[default_SID0_D]
  • NHLFE The next hop is D, and the outgoing label is SRGB_D[default_SID0_D]
  • the entry tag is SRGB_D[default_SID0_D]
  • NHLFE None. Indicates that the SR-LSP has been terminated.
  • Step S505 For the packet sent to the destination D-loopback0, when the link SC fails, the S node will switch the traffic as the MRT ingress node to the MRT-blue path prepared to the remote MRT Egress Node B in advance. , that is, the message is forwarded along the MT-blue path SAB.
  • the S receives the MT-default SR tag packet, it is forwarded based on the ILM for (MT-default, D-loopback0) entry, and the inbound tag SRGB_S[default_SID0_D] is exchanged to the outbound tag SRGB_B[default_SID0_D].
  • SRGB_A[blue_SID0_B] is sent to the next hop A.
  • the S receives an IP packet, it is forwarded based on the FTN for (MT-default, D-loopback0) entry and is directly pressed on the IP header. After the label SRGB_B[default_SID0_D], press SRGB_A[blue_SID0_B] and send it to the next hop A.
  • Step S506 after receiving the message, the node A exchanges the label SRGB_A[blue_SID0_B] into SRGB_B[blue_SID0_B] and sends it to the next hop B.
  • Step S507 after receiving the message, the Node B bounces off the label SRGB_B[blue_SID0_B], and exchanges the label SRGB_B[default_SID0_D] into SRGB_F[default_SID0_D] and sends it to the next hop F.
  • Step S508 after receiving the message, the F node exchanges the label SRGB_F[default_SID0_D] into SRGB_D[default_SID0_D] and sends it to the next hop D.
  • Step S509 After receiving the packet, the D node bounces off the label SRGB_D[default_SID0_D], and continues to forward the packet based on the IP header. Since the IP header is D-loopback0, the packet is sent to the control plane.
  • the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course, by hardware, but in many cases, the former is A better implementation.
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk,
  • the optical disc includes a plurality of instructions for causing a terminal device (which may be a mobile phone, a computer, a server, or a network device, etc.) to perform various embodiments of the present invention. The method described.
  • a message forwarding device is also provided, which is used to implement the foregoing embodiments and preferred embodiments, and has not been described again.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 6 is a structural block diagram of a message forwarding apparatus according to an embodiment of the present invention.
  • the apparatus may be applied to a first node.
  • the apparatus includes a receiving module 62, a searching module 64, and a forwarding module 66.
  • the device includes a receiving module 62, a searching module 64, and a forwarding module 66.
  • the receiving module 62 is configured to receive the packet to be forwarded, where the destination address of the packet is the second node, and the searching module 64 is connected to the receiving module 62, and is configured to search for the packet in the pre-generated topology.
  • the pre-generated topology comprises: a first topology and a second topology generated according to a maximum redundancy tree MRT algorithm, and a third topology obtained according to a shortest path first SPF algorithm, the first topology and the first topology
  • the second topology and the third topology are different from each other;
  • the forwarding module 66 is connected to the foregoing searching module 64, configured to search for the next hop node for forwarding to the second node in the target topology, and to perform the foregoing according to a predetermined forwarding mechanism.
  • the message is forwarded to the next hop node, wherein the predetermined forwarding mechanism adopts a segmented route forwarding mechanism based on the tunnel nesting manner of the prefix-sid per prefix per topology.
  • FIG. 7 is a block diagram showing a preferred structure of a message forwarding device according to an embodiment of the present invention. As shown in FIG. 7 (FIG. 7 is only an example), the device includes a determining module in addition to all the modules shown in FIG. 6. 72, the device is described below:
  • the determining module 72 is connected to the receiving module 62, and is configured to determine, according to the foregoing MRT algorithm, a route from the first topology to the destination address and a route from the second topology to the destination address, to protect the third topology to the destination address. Protecting the route of the route, and determining that the topology corresponding to the protection route is a protection topology; and/or determining the route from the first topology to the tunnel end point and the route from the second topology to the tunnel end point according to the color flag information.
  • Protecting the protection route of the route to the destination address in the foregoing third topology, and determining the topology corresponding to the protection route is to protect The topology of the tunnel, wherein the tunnel end point is a remote node selected by the first node for the protection destination address, and the remote node is loop-free for the fault point, and the first node is used to the remote end when the fault occurs.
  • the MRT tunnel of the node encapsulates the packet.
  • the foregoing searching module 64 may search for a target topology corresponding to the foregoing packet in a pre-generated topology by determining whether a link for reaching the second node in the third topology is present. The fault is determined; in the case that it is determined that there is no fault, the third topology is determined to be the target topology; and/or, in the case that the fault is determined, the protection topology is determined to be the target topology.
  • the packet when the link is faulty, the packet can be forwarded according to the default topology. After the link is faulty, the protection topology is used to forward the packet.
  • the foregoing apparatus further includes a first processing module, configured to: before receiving the packet to be forwarded, generate a first topology and a second topology according to an MRT algorithm, and generate and generate according to an SPF algorithm.
  • the third topology is configured to: before receiving the packet to be forwarded, generate a first topology and a second topology according to an MRT algorithm, and generate and generate according to an SPF algorithm. The third topology.
  • the first processing module may generate the first topology and the second topology according to the foregoing MRT algorithm, and generate a third topology according to the SPF algorithm: determining the MRT where the first node is located. Island, where the MRT Island is enabled by the OSPF or ISIS instance at the first node and other nodes at the same domain area or level as the first node, and the maximum redundant tree profile MRT After the profile is formed by the first node and other nodes in the area or level where the first node is located; generating the first topology and the second topology based on the MRT Island running MRT algorithm, and running the SPF algorithm based on the above area or level Generate a third topology.
  • the foregoing predetermined forwarding mechanism is specified in the MRT profile. That is, the segmented route forwarding mechanism based on the tunnel nesting manner of the prefix-sid per prefix per topology is adopted.
  • the apparatus further includes a second processing module, configured to perform at least one of: assigning a first prefix-sid to the first topology for a node-level prefix local to the first node, and The first prefix-sid is at the domain or level of the MRT Island.
  • the local node-level and non-node-level prefix allocates a third prefix-sid for the third topology, and floods the third prefix-sid in all domain areas or levels of the first node; receiving the above on other nodes
  • the prefix-sid of the pre-generated topology records the prefix-sid of the pre-generated topology on the other node and continues to advertise the prefix-sid of the pre-generated topology on the other node to nodes other than the other nodes.
  • the first prefix-sid, the second prefix-sid, and the third prefix-sid are independent of each other.
  • the forwarding module 66 may forward the packet to the next hop node by: determining an outgoing label of the first node that matches the packet; and using the outgoing label of the first node.
  • the packet is encapsulated into the foregoing packet, and the encapsulated packet is sent to the next hop node.
  • the label encapsulation manner is different for different types of packets.
  • the forwarding module 66 may determine, according to the following manner, an outgoing label of the first node that matches the packet: when the target topology is the third topology, the corresponding target topology of the first node is The label is calculated by the first node based on the third prefix index prefix-sid of the destination prefix prefix corresponding to the destination address and the SRGB of the next hop node.
  • the forwarding module 66 may determine, according to the manner, the outgoing label of the first node that matches the foregoing packet: when the target topology is the first topology or the second topology: if the second node is When the node in the MRT Island is the node prefix prefix of the second node, the first node determines the outbound label of the first node corresponding to the target topology by: The outbound label of the corresponding target topology is calculated by the first node based on the prefix index prefix-sid of the corresponding target topology of the node-level prefix prefix of the second node and the SRGB of the next hop node; if the second node is not the MRT Island When the destination prefix corresponding to the node or the destination address is the non-node level prefix of the second node, the first node determines whether the next hop node is a node other than the MRT Island; when the judgment result is no, the first node Determining an outbound
  • the forwarding module 66 may encapsulate the outgoing label of the first node into the packet by using at least one of the following manners: when the packet type of the packet is an Internet Protocol IP packet, The outbound label of the first node is pressed on the IP header of the IP packet; when the packet type of the packet is a fragmented route SR label, the top label of the label stack of the SR label is replaced. The outgoing label of the first node.
  • the forwarding module 66 may determine the outgoing label of the first node by: when the first node and the second node are the same node, the first node is determined according to the target topology.
  • the one-hop node is the first node, and the first node does not have a label.
  • the foregoing apparatus further includes a third processing module, configured to: when the first node and the second node are the same node, perform the following operations: when the packet type of the packet is an Internet Protocol IP address When the packet is sent, the first node sends the packet to the control plane of the first node; and/or, when the packet type of the packet is a fragmented route SR label packet, the first node sends the SR label.
  • the stack top label of the label stack of the message pops up, and continues to be forwarded based on the lower layer label or IP header lookup table of the label stack of the above message.
  • each of the above modules may be implemented by software or hardware.
  • the foregoing may be implemented by, but not limited to, the foregoing modules are all located in the same processor; or, the above modules are in any combination.
  • the forms are located in different processors.
  • Embodiments of the present invention also provide a storage medium.
  • the storage medium may be arranged to store program code for performing the steps described above.
  • the foregoing storage medium may include, but is not limited to, a USB flash drive, a Read-Only Memory (ROM), and a Random Access Memory (RAM).
  • ROM Read-Only Memory
  • RAM Random Access Memory
  • the processor performs the above steps according to the stored program code in the storage medium.
  • the method in the embodiment of the present invention can fill the gap between the segmentation route and the MRT technology in the related technology, and provides a valuable exploration for the evolution of the future network.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the packet forwarding method and apparatus have the following beneficial effects: the MRT function is introduced in the segment routing network, thereby implementing the segment routing network and The purpose of combining MTR functions.

Landscapes

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

Abstract

L'invention porte, dans des modes de réalisation, sur un procédé et sur un dispositif de commutation de messages. Le procédé comprend les étapes suivantes : un premier nœud reçoit un message qui doit être transmis, une adresse de destination du message étant un second nœud ; le premier nœud recherche, à partir de topologies générées au préalable, une topologie cible correspondant au message, les topologies générées au préalable comprenant : une première topologie et une deuxième topologie générées selon un algorithme MRT, et une troisième topologie générée selon un algorithme SPF, et les première, deuxième et troisième topologies étant différentes les unes des autres ; et le premier nœud recherche, dans la topologie cible, un nœud de saut suivant utilisé pour transmettre le message au second nœud et transmet, sur la base d'un mécanisme de transmission préconfiguré, et au nœud de saut suivant, le message, le mécanisme de transmission préconfiguré adoptant un mécanisme de routage et de transmission de segment sur la base d'un procédé d'encapsulation de tunnellisation et par rapport à chaque topologie et chaque préfixe-SID. Le mode de réalisation de l'invention est utilisé pour atteindre l'objectif consistant à combiner un réseau de routage de segment et la fonction MTR.
PCT/CN2017/097500 2016-08-17 2017-08-15 Procédé et dispositif de commutation de messages WO2018033060A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610682060.5 2016-08-17
CN201610682060.5A CN107770063A (zh) 2016-08-17 2016-08-17 报文转发方法及装置

Publications (1)

Publication Number Publication Date
WO2018033060A1 true WO2018033060A1 (fr) 2018-02-22

Family

ID=61196426

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/097500 WO2018033060A1 (fr) 2016-08-17 2017-08-15 Procédé et dispositif de commutation de messages

Country Status (2)

Country Link
CN (1) CN107770063A (fr)
WO (1) WO2018033060A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491701A (zh) * 2018-04-13 2021-03-12 华为技术有限公司 转发报文方法和装置
EP3915230A4 (fr) * 2019-01-24 2022-01-19 Telefonaktiebolaget LM Ericsson (publ) Procédé et système pour empêcher des micro-boucles lors d'un changement de topologie de réseau
CN112491701B (zh) * 2018-04-13 2024-06-07 华为技术有限公司 转发报文方法和装置

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110620728B (zh) * 2018-06-19 2022-07-15 中兴通讯股份有限公司 一种报文传输方法、装置及计算机可读存储介质
CN110830354B (zh) * 2018-08-08 2021-12-03 北京华为数字技术有限公司 数据转发方法、装置、设备及存储介质
CN109861913B (zh) * 2018-12-25 2020-03-20 华为技术有限公司 一种跨内部网关协议的前缀标识通告方法和装置
CN114844818A (zh) * 2019-01-28 2022-08-02 华为技术有限公司 一种建立跨域转发路径的方法、装置及系统
CN113364680A (zh) * 2020-03-06 2021-09-07 华为技术有限公司 一种sr策略的发布、接收方法及装置
WO2022012690A1 (fr) * 2020-07-17 2022-01-20 华为技术有限公司 Procédé d'annonce de routeur et dispositif associé
CN112272144B (zh) * 2020-10-28 2022-11-25 北京轻网科技股份有限公司 报文转发方法及装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8861340B1 (en) * 2012-03-12 2014-10-14 Juniper Networks, Inc. Fast reroute using maximally redundant trees
CN104660507A (zh) * 2013-11-22 2015-05-27 华为技术有限公司 数据流转发路由的控制方法及装置
CN104754025A (zh) * 2013-12-27 2015-07-01 英特尔公司 可编程分布式联网
CN105453491A (zh) * 2013-07-19 2016-03-30 瑞典爱立信有限公司 扩展远程lfa快速重新路由

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8861340B1 (en) * 2012-03-12 2014-10-14 Juniper Networks, Inc. Fast reroute using maximally redundant trees
CN105453491A (zh) * 2013-07-19 2016-03-30 瑞典爱立信有限公司 扩展远程lfa快速重新路由
CN104660507A (zh) * 2013-11-22 2015-05-27 华为技术有限公司 数据流转发路由的控制方法及装置
CN104754025A (zh) * 2013-12-27 2015-07-01 英特尔公司 可编程分布式联网

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112491701A (zh) * 2018-04-13 2021-03-12 华为技术有限公司 转发报文方法和装置
CN112491701B (zh) * 2018-04-13 2024-06-07 华为技术有限公司 转发报文方法和装置
EP3915230A4 (fr) * 2019-01-24 2022-01-19 Telefonaktiebolaget LM Ericsson (publ) Procédé et système pour empêcher des micro-boucles lors d'un changement de topologie de réseau

Also Published As

Publication number Publication date
CN107770063A (zh) 2018-03-06

Similar Documents

Publication Publication Date Title
WO2018033060A1 (fr) Procédé et dispositif de commutation de messages
US10992574B2 (en) Packet forwarding method and device
WO2018019131A1 (fr) Procédé et dispositif de réacheminement de message
EP2761827B1 (fr) Déploiement incrémental d'ifrr fondé sur mrt
US9525619B2 (en) Scalable edge node protection using segment routing
US9444677B2 (en) Scalable edge node protection using IPv6 segment routing extension header
WO2016115823A1 (fr) Procédé et appareil pour transférer une construction d'étiquette et paquet d'étiquettes
US9143395B2 (en) Scalable BGP protection from edge node failure using context labels in data packets identifying backup router mirror table
WO2016115850A1 (fr) Procédé de traitement de routage de segment, appareil de traitement et appareil d'envoi
WO2016198015A1 (fr) Procédé de transmission de paquets, appareil, et système
US9036463B2 (en) Scalable BGP protection from edge node failure using dynamically assigned labels in data packets
EP2911350B1 (fr) Distribution étiquette-voisine avec protocole de distribution d'étiquette
EP2761832B1 (fr) Optimisation de la sélection de points d'extrémité pour des trajets de détour mrt-frr
US20180205641A1 (en) Entropy prefix segment identifier for use with entropy label in segment routing networks
US20210409312A1 (en) Fault Protection Method, Node, and Storage Medium
WO2018082652A1 (fr) Procédé, appareil et système de transmission d'informations et appareil
US20120124238A1 (en) Prioritization of routing information updates
EP3484107B1 (fr) Procédés et dispositifs d'obtention et de notification de paramètre, et support de stockage
WO2015149623A1 (fr) Procédé et dispositif d'établissement de tunnel de service

Legal Events

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

Ref document number: 17841032

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17841032

Country of ref document: EP

Kind code of ref document: A1