WO2020087398A1 - Procédé et appareil d'annonce et de traitement de capacité bier de liaison, et nœud de communication - Google Patents

Procédé et appareil d'annonce et de traitement de capacité bier de liaison, et nœud de communication Download PDF

Info

Publication number
WO2020087398A1
WO2020087398A1 PCT/CN2018/113183 CN2018113183W WO2020087398A1 WO 2020087398 A1 WO2020087398 A1 WO 2020087398A1 CN 2018113183 W CN2018113183 W CN 2018113183W WO 2020087398 A1 WO2020087398 A1 WO 2020087398A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
capability information
link
packet
bier
Prior art date
Application number
PCT/CN2018/113183
Other languages
English (en)
Inventor
Senthil DHANARAJ
Jingrong XIE
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Priority to PCT/CN2018/113183 priority Critical patent/WO2020087398A1/fr
Priority to CN201880099263.9A priority patent/CN113016165B/zh
Publication of WO2020087398A1 publication Critical patent/WO2020087398A1/fr

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/22Alternate routing

Definitions

  • the present disclosure relates to the technical field of Bit Index Explicit Replication (BIER) technology, and in particular, to a method and an apparatus for advertising and processing BIER capability of a link, and a communication node.
  • BIER Bit Index Explicit Replication
  • BIER Interior Gateway Protocol
  • BFR BIER Forwarding Router
  • some BIER routers have a mix of line cards with some line cards support BIER and some line cards do not support BIER (as shown in FIG. 1) , where one router have many line cards, each line card have many interfaces, and an interface in the line card can be regarded as link.
  • Such routers are called as “partial BIER capable router” or “partial BFR” .
  • the network may contains a mix of “BIER capable” , “non-BIER capable” and “partial BIER capable” routers. Forwarding of multicast packets using the BIER header requires special hardware and hence the support for migration from existing multicast technologies (PIM, MLDP, and RSVP-TE) to BIER in brownfield deployments is very important.
  • PIM Protocol Independent Multicast
  • MLDP Multicast Label Distribution Protocol
  • RSVP-TE Resource Reservation Protocol-Traffic Engineering
  • the present disclosure provides a method and an apparatus for advertising and processing BIER capability of link, and communication node.
  • the present disclosure relates to a method for processing BIER capability of link, where a first node receives a first packet from a second node, where the first packet includes first capability information including one or more bits, and each bit supports a Bit String Length (BSL) corresponding to an interface of the second node, and the interface of the second node corresponds to a first link between the second node and the first node, determines whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, where the interface of the first node corresponds to the first link, then establishes a tunnel between the first node and a third node to bypass the second node for BIER forwarding if the one or more bits included in the first capability information do not support the BSL corresponding to the interface of the first node.
  • BSL Bit String Length
  • the partial BIER capable nodes in the network can be supported without deploying the complicated IGP multi-topology.
  • the first node determines whether to forward the traffic to the partial BIER capable node or not based on the first capability information.
  • the traffic can be forwarded even encountering a partial BIER capable node in the network topology.
  • the first packet further includes second capability information
  • the first node further determines whether the second capability information indicates the first link supports BIER forwarding if the one or more bits included in the first capability information support the BSL corresponding to the interface of the first node, and then establishes the tunnel between the first node and the third node if the second capability information indicates the first link does not support BIER forwarding.
  • the second capability information is also included in the first packet, the first node further determines whether the second capability information indicates the first link supports BIER forwarding. Then both the first capability information and the second capability information are considered for BIER forwarding.
  • the first node determines whether to forward the traffic to the partial BIER capable node or not based on both the first capability information and the second capability information. The traffic can be forwarded even encountering a partial BIER capable node in the network topology.
  • the first node further adds the second node to a BIER shortest path tree (SPT) by using shortest path first (SPF) if the second capability information indicates the first link supports BIER forwarding.
  • SPT BIER shortest path tree
  • SPF shortest path first
  • the first node determines to add the second node to a BIER SPT by using SPF if the second capability information indicates the first link supports BIER forwarding.
  • the traffic can be forwarded even encountering a partial BIER capable node in the network topology.
  • the first capability information and the second capability information are included in a sub-TLV of the first packet; if the first packet is an IGP Open Shortest Path First routing protocol (OSPF) Link State Advertisement (LSA) packet, the sub-TLV is included in OSPF Extended Link Opaque LSA under the OSPF Extended Link TLV.
  • OSPF IGP Open Shortest Path First routing protocol
  • LSA Link State Advertisement
  • the first capability information and the second capability information are included in a sub-TLV of the first packet; if the first packet is an IGP Intermediate System-Intermediate System routing protocol (ISIS) Link State Protocol (LSP) packet, the sub-TLV is included under TLV-22 of the first packet or TLV-23 of the first packet.
  • ISIS IGP Intermediate System-Intermediate System routing protocol
  • LSP Link State Protocol
  • the third possible implementation form and the fourth possible implementation form show the first capability information and the second capability information can be carried under different TLV in different protocol, and the packet can be LSA or LSP packet, then the technical solution have better compatibility with the existing protocols.
  • the present disclosure relates to a method for advertising BIER capability of link, where a second node determines first capability information including one or more bits, and each bit supports a BSL corresponding to an interface of the second node, and the interface of the second node corresponds to a first link between the second node and a first node; then advertises a first packet to a first node, where the first packet includes the first capability information.
  • the partial BIER capable nodes in the network can be supported without deploying the complicated IGP multi-topology technology.
  • the first packet further includes second capability information, where the second capability information is used for indicating the first link supports BIER forwarding, the second node further determines the second capability information and advertises the second capability information.
  • the second capability information is also indicated in the first data, which can be used for the first node further determines whether the second capability information indicates the first link supports BIER forwarding.
  • first capability information and the second capability information are included in a sub-TLV of the first packet; if the first packet is an IGP OSPF LSA packet, the sub-TLV is included in OSPF Extended Link Opaque LSA under the OSPF Extended Link TLV.
  • first capability information and the second capability information are included in a sub-TLV of the first packet; if the first packet is an IGP ISIS LSP packet, the sub-TLV is included under TLV-22 of the first packet or TLV-23 of the first packet.
  • the second possible implementation form and the third possible implementation form show the first capability information and the second capability information can be carried under different TLV in different protocol, and the packet can be LSA or LSP packet, then the technical solution have better compatibility with the existing protocols.
  • the present disclosure relates to an apparatus for advertising BIER capability of link
  • the apparatus includes a receiving module, a first determining module and an establishing module
  • the receiving module is configured to receive a first packet from a second node, where the first packet includes first capability information including one or more bits, and each bit supports a BSL corresponding to an interface of the second node, and the interface of the second node corresponds to a first link between the second node and the apparatus.
  • the first determining module is configured to determine whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the apparatus, where the interface of the apparatus corresponds to the first link.
  • the establishing module is configured to establish a tunnel between the apparatus and a third node to bypass the second node for BIER forwarding if the first determining module determines that the one or more bits included in the first capability information do not support the BSL corresponding to the interface of the apparatus.
  • the first determining module is specifically configured to determine whether the second capability information indicates the first link supports BIER forwarding, if the first determining module determines that the one or more bits included in the first capability information support the BSL corresponding to the interface of the apparatus; the establishing module is specifically configured to establish the tunnel between the apparatus and the third node if the second capability information indicates the first link does not support BIER forwarding.
  • the apparatus further includes an adding module, the adding module configured to add the second node to a BIER SPT by using SPF if the second capability information indicates the first link supports BIER forwarding.
  • the present disclosure relates to an apparatus for advertising BIER capability of link
  • the apparatus includes a second determining module and an advertising module.
  • the second determining module is configured to determine first capability information including one or more bits, and each bit supports a Bit String Length, BSL, corresponding to an interface of the apparatus, and the interface of the apparatus corresponds to a first link between the apparatus and a first node.
  • the advertising module is configured to advertise a first packet to a first node, where the first packet includes the first capability information.
  • the first packet further includes second capability information, where the second capability information is used for indicating the first link supports BIER forwarding; the second determining module is further configured to determine the second capability information; the advertising module is further configured to advertise the second capability information.
  • the method according to the first aspect of the present disclosure can be performed by the apparatus according to the third aspect of the present disclosure.
  • the method according to the second aspect of the present disclosure can be performed by the apparatus according to the fourth aspect of the present disclosure.
  • Further features and implementation forms of the method according to the first aspect of the present disclosure result directly from the functionality of the apparatus according to the third aspect of the present disclosure and its different implementation forms.
  • Further features and implementation forms of the method according to the second aspect of the present disclosure result directly from the functionality of the apparatus according to the fourth aspect of the present disclosure and its different implementation forms.
  • the present disclosure relates to an apparatus for processing BIER capability of link which includes a processor and a memory.
  • the memory is storing instructions that cause the processor to perform the method according to the first aspect.
  • the present disclosure relates to an apparatus for advertising BIER capability of link which includes a processor and a memory.
  • the memory is storing instructions that cause the processor to perform the method according to the second aspect.
  • a computer-readable storage medium having stored thereon instructions that when executed cause one or more processors configured to process BIER capability of link is proposed.
  • the instructions cause the one or more processors to perform a method according to the first aspect or any possible embodiment of the first aspect.
  • a computer-readable storage medium having stored thereon instructions that when executed cause one or more processors configured to advertise BIER capability of link is proposed.
  • the instructions cause the one or more processors to perform a method according to the second aspect or any possible embodiment of the second aspect.
  • the present disclosure relates to a first communication node including an apparatus for processing BIER capability of link according to the third or the fifth aspect.
  • the present disclosure relates to a second communication node including an apparatus for advertising BIER capability of link according to the fourth or the sixth aspect.
  • the implementation and technical effect of the apparatus cited above can refer to the implementation and technical effect of the method cited above.
  • the partial BIER capable nodes in the network can be supported without deploying the complicated IGP multi-topology technology.
  • FIG. 1 is a schematic view of partial BIER capable router
  • FIG. 2 is a schematic view of a first solution for supporting “non-BIER capable” nodes in prior art
  • FIG. 3 is a schematic view of a second solution for supporting “non-BIER capable” nodes in prior art
  • FIG. 4 is a schematic view of a third solution for supporting “non-BIER capable” nodes in prior art
  • FIG. 5 is a schematic view of technical problems of the first solution in prior art
  • FIG. 6 is a schematic view of technical problems of the second solution in prior art
  • FIG. 7 is a schematic view of how partial BIER capable nodes can be supported by using multi-topology in prior art
  • FIG. 8 is a schematic flowchart of a first method for advertising and processing BIER capability of link according to an embodiment of the present disclosure
  • FIG. 9 is a schematic view of a sub-TLV according to an embodiment of the present disclosure.
  • FIG. 10 is a schematic view of an example application scenario according to an embodiment of the present disclosure.
  • FIG. 11 is a schematic flowchart of a second method for advertising and processing BIER capability of link according to an embodiment of the present disclosure
  • FIG. 12 is a schematic view of another example application scenario according to an embodiment of the present disclosure.
  • FIG. 13 is a structural view of a first apparatus for processing BIER capability of link according to an embodiment of the present disclosure
  • FIG. 14 is a structural view of a second apparatus for processing BIER capability of link according to an embodiment of the present disclosure.
  • FIG. 15 is a structural view of an apparatus for advertising BIER capability of link according to an embodiment of the present disclosure.
  • FIG. 16 is a schematic diagram of a hardware device.
  • a disclosure in connection with a described method may also hold true for a corresponding device or system configured to perform the method and vice versa.
  • a corresponding device may include one or a plurality of units, e.g. functional units, to perform the described one or plurality of method steps (e.g. one unit performing the one or plurality of steps, or a plurality of units each performing one or more of the plurality of steps) , even if such one or more units are not explicitly described or illustrated in the figures.
  • a specific apparatus is described based on one or a plurality of units, e.g.
  • a corresponding method may include one step to perform the functionality of the one or plurality of units (e.g. one step performing the functionality of the one or plurality of units, or a plurality of steps each performing the functionality of one or more of the plurality of units) , even if such one or plurality of steps are not explicitly described or illustrated in the figures. Further, it is understood that the features of the various exemplary embodiments and/or aspects described herein may be combined with each other, unless specifically noted otherwise.
  • Bit Index Explicit Replication is an architecture that provides optimal multicast forwarding through a “BIER domain” without requiring intermediate routers to maintain any multicast related per-flow state.
  • BIER Bit Index Explicit Replication
  • each receiver is represented by a unique bit in the bitmask and all the intended multicast receivers are encoded as a bitmask in the multicast packet header within different encapsulations.
  • a router that receives such a packet will forward the packet based on the bit position in the packet header towards the receiver (s) .
  • the network may contains a mix of “BIER capable” , “non-BIER capable” and “partial BIER capable” routers.
  • BIER capable a mix of “BIER capable” , “non-BIER capable” and “partial BIER capable” routers.
  • non-BIER capable a mix of “BIER capable” , “non-BIER capable” and “partial BIER capable” routers.
  • node in the present disclosure may refer to a communication node included in a network, in the field of building multicast path and forwarding multicast traffic, the “node” may be an ingress router, an immediate router or an egress router, which is not limited in any one of the embodiments of the present disclosure unless otherwise specified.
  • link in the present disclosure may refer to an interface in the line card, in the field of building multicast path and forwarding multicast traffic, one router have many line cards, each line card have many interfaces, and an interface in the line card can be regarded as link.
  • link Normally, in IGP protocol, those skilled in the art always use the word “link” while advertising the properties of a particular interface, which is not limited in any one of the embodiments of the present disclosure unless otherwise specified.
  • BIER capable in the present disclosure may refer to an object that support BIER technology, and can be used for forwarding BIER packets, which is not limited in any one of the embodiments of the present disclosure unless otherwise specified.
  • non-BIER capable in the present disclosure may refer to an object that cannot support BIER technology, and cannot be used for forwarding BIER packets, which is not limited in any one of the embodiments of the present disclosure unless otherwise specified.
  • the capability information may refer to information about the BIER capability of a link
  • the capability information may include a field indicating whether a link supports BIER forwarding; while in some embodiments, the capability information may include one or more bits, and each bit supports a BSL corresponding to an interface of a node, and the interface of the node corresponds to a link between two nodes; while in some embodiments, the capability information may include both the aforementioned field and the aforementioned one or more bits. For example, higher capability router can support “big” bit string length like 256, but lower capability router may support “small” bit string length like 64.
  • the contents of the BIER link capability information is not limited in any one of the embodiments of the present disclosure unless otherwise specified.
  • FIG. 2 is a schematic view of a first solution for supporting “non-BIER capable” nodes in prior art, as shown in FIG. 2, node A can identify node B is a “non-BIER capable” node by IGP advertisement, and tunnel over “non-BIER capable” node B by dynamic unicast tunnels like Multi-Protocol Label Switch (MPLS) or Segment Routing (SR) tunnels when forwarding multicast traffic received from upstream node of node A. Then the multicast traffic from node A to node E follows: [A] - (tunnel) - [D] - [E] .
  • MPLS Multi-Protocol Label Switch
  • SR Segment Routing
  • FIG. 3 is a schematic view of a second solution for supporting “non-BIER capable” nodes in prior art, as shown in FIG. 3, node A uses specific BIER Algorithm (BAR) or IGP Algorithm (IPA) to eliminate the “non-BIER capable” node B from the SPT computed using SPF when building the SPT.
  • BAR BIER Algorithm
  • IPA IGP Algorithm
  • the multicast traffic from node A to node E follows: [A] - [C] - [F] - [D] - [E] .
  • FIG. 4 is a schematic view of a third solution for supporting “non-BIER capable” nodes in prior art, as shown in FIG. 4, node A uses IGP multi-Topology feature to define multiple topologies for unicast and multicast, and excludes “non-BIER capable” node B from the “multicast” topology. Then the multicast traffic from node A to node E follows: [A] - [C] - [F] - [D] - [E] .
  • the first and second solution cited above have the technical problems that the packets forwarding would stop when encountering a “partial BIER capable” nodes in the network topology
  • the third solution cited above can support “partial BIER capable” nodes, but have the technical problems that deploying multi-topology requires to touch the OAM or configuration of all the links in the network, and lose the simplicity of single topological view for both unicast and multicast network.
  • not all operators do support IGP multi-topology.
  • the technical problems of the first and second solution cited above are discussed following in conjunction with FIG. 5 and FIG. 6.
  • FIG. 5 is a schematic view of technical problems of the first solution in prior art, as shown in FIG. 5, node B is a “partial BIER capable” node, and the link connected node A with node B does not support BIER, but the SPT is not modified for BIER, because node A thinks node B is a “BIER capable” node, but node A cannot detect that the link connected node A with node B does not support BIER. So the SPT is not modified and resulting in “BIER forwarding failure” from node A to node E, the multicast traffic from node A to node E is dropped at node B when forwarding multicast traffic received from upstream node of node A.
  • objective of the invention is to support “partial BIER capable” nodes in the network without having to deploy “IGP multi-topology” .
  • the present disclosure provides a method for advertising and processing BIER capability of link, where the “BIER capability” of each link is advertised in the IGP protocol packet, for example, OSPF and ISIS, then the simple technique as mentioned in the first solution and the second solution cited above can be used to eliminate the non-BIER capable links from the SPT calculated for BIER forwarding. This would enable the administrator to deploy BIER technology in a brown-field deployment with “partial BIER capable” nodes without having to configure and enable the complicated IGP multi-topology.
  • FIG. 8 is a schematic flowchart of a first method for advertising and processing BIER capability of link according to an embodiment of the present disclosure. This method shows an interaction operation between a first node and a second node, where both the first node and the second node may be BIER nodes in a network and the first node may be an upstream node of the second node.
  • the method includes the following steps:
  • the second node determines first capability information including one or more bits, and each bit supports a BSL corresponding to an interface of the second node, where the interface of the second node corresponds to a first link between the second node and a first node.
  • a node can know one or more BSL corresponding to an interface thereof, and the interface of the node corresponds to a link between the node and an upstream node thereof.
  • the one or more BSL corresponding to an interface can be indicated as the first capability information. It should be noted that there may be several links between the second node and the first node; the second node may know the BSL corresponding to all interfaces connected to certain links thereof.
  • first link is refer to link (s) between the first node and the second node, even though there is no “second link” , the term “first link” is still used to make the description of the disclosure more concise and clear.
  • the first capability information can be included in a sub-TLV of the first packet.
  • FIG. 9 is a schematic view of a sub-TLV according to an embodiment of the present disclosure, as shown in FIG. 9, the field “Type value” will be assigned by the Internet Assigned Numbers Authority (IANA) from appropriate registries, the field “Length” is set to 4, the field “BSL Flag (BSL capability) ” is a 8-bit long bit-map field with each bit if set, specifying the capability to support particular “BIER bit string length” as follows:
  • the field “BSL Flag (BSL capability) ” represents the first capability information.
  • the second node advertises a first packet to the first node, where the first packet includes the first capability information.
  • the second node specified in this embodiment determines the first capability information
  • the second node advertises a first packet to the first node.
  • the first node determines whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, where the interface of the first node corresponds to the first link between the second node and the first node.
  • router B advertises a first packet to the router A, first capability information is included in the first packet, and the first capability information includes one bit supports a BSL 256 corresponding to an interface of router B.
  • router A determines that the bit included in the first capability information does not support the BSL corresponding to the interface of the router A, and if the BSL corresponding to an interface of router A is 256, router A determines that the bit included in the first capability information supports the BSL corresponding to the interface of the router A, where both the interface of router A and the interface of router B corresponds to the link-1.
  • router B advertises a first packet to the router A, first capability information is included in the first packet, and the first capability information includes two bits support BSL 256 and 64 corresponding to an interface of router B.
  • router A determines that the bits included in the first capability information do not support the BSL corresponding to the interface of the router A, and if the BSL corresponding to an interface of router A is 256 or 64, router A determines that the bits included in the first capability information support the BSL corresponding to the interface of the router A, where both the interface of router A and the interface of router B corresponds to the link-1. It should be noted that there may be one or more bits included in the first capability information, which not limited to one or two as discussed herein.
  • the first node establishes a tunnel between the first node and a third node to bypass the second node for BIER forwarding if the one or more bits included in the first capability information do not support the BSL corresponding to the interface of the first node.
  • FIG. 10 is a schematic view of an example application scenario according to an embodiment of the present disclosure, as shown in FIG. 10, the application scenario and topology is same as the application scenario and topology in FIG. 5, SPT is modified for BIER to tunnel over (bypass) non-BIER capable nodes and links, and can use unicast tunnel to tunnel over (bypass) the non-BIER capable node B, then the multicast traffic from node A to node E follows: [A] - (tunnel) - [D] - [E] .
  • the first node forwards traffic to the second node for BIER forwarding.
  • the first node determines that the one or more bits included in the first capability information support the BSL corresponding to the interface of the first node, which indicates that the second node can be used for forwarding the t traffic, then the first node forwarding the traffic to the second node.
  • the traffic is data need to be forwarded through the network, for example, the multicast traffic in BIER network.
  • the first node determines the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, then the first node adds the second node in BIER SPF.
  • the first node eliminates the second node when building BIER SPT by using SPF.
  • the present disclosure provides a method for advertising and processing BIER capability of link, where the second node determines first capability information including one or more bits, and each bit supports a Bit String Length, BSL, corresponding to an interface of the second node, where the interface of the second node corresponds to a first link between the second node and a first node, then the second node advertises a first packet to the first node, where the first packet includes the first capability information.
  • BSL Bit String Length
  • the first node receives the first packet from the second node, determines whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, where the interface of the first node corresponds to the first link, then establishes a tunnel between the first node and a third node to bypass the second node for BIER forwarding if the one or more bits included in the first capability information do not support the BSL corresponding to the interface of the first node, the technical solution of this embodiment can support the partial BIER capable nodes in the network without deploying the complicated IGP multi-topology technology.
  • the first node determines whether to forward the traffic to the partial BIER capable node or not based on the first capability information.
  • the traffic can be forwarded even encountering a partial BIER capable node in the network topology.
  • FIG. 11 is a schematic flowchart of a second method for advertising and processing BIER capability of link according to an embodiment of the present disclosure.
  • This method shows an interaction operation between a first node and a second node, where both the first node and the second node may be BIER nodes in a network, and the first node may be an upstream node of the second node.
  • the difference between this embodiment and the embodiment specified by FIG. 8 is that the first packet further includes second capability information.
  • the method includes the following steps:
  • the second node determines first capability information including one or more bits, and each bit supports a Bit String Length, BSL, corresponding to an interface of the second node, where the interface of the second node corresponds to a first link between the second node and a first node.
  • BSL Bit String Length
  • the second node advertises a first packet to the first node, where the first packet includes the first capability information.
  • S1103 the first node receives the first packet from the second node.
  • the first node determines whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, where the interface of the first node corresponds to the first link.
  • the first node determines whether the second capability information indicates the first link supports BIER forwarding if the one or more bits included in the first capability information support the BSL corresponding to the interface of the first node.
  • the second capability information may be a filed in the first packet, and different values of this filed indicate whether the first link supports BIER forwarding or not.
  • the second capability information may be included in a sub-TLV, and the presence of this sub-TLV indicates the first link supports BIER forwarding, and if the first node receives a packet without this sub-TLV, the first node determines the first link does not support BIER forwarding.
  • the first capability information and the second capability information are included in a sub-TLV of the first packet; if the first packet is an IGP OSPF LSA packet, the sub-TLV is included in OSPF Extended Link Opaque LSA under the OSPF Extended Link TLV; if the first packet is an IGP ISIS LSP packet, the sub-TLV is included under TLV-22 of the first packet or TLV-23 of the first packet.
  • the first capability information and the second capability information can be carried under different TLV in different protocol, and the packet can be LSA or LSP packet, then the technical solution have better compatibility with the existing protocols.
  • the first node adds the second node to a BIER SPT by using SPF if the second capability information indicates the first link supports BIER forwarding.
  • the first node eliminates the second node when building BIER SPT by using SPF.
  • FIG. 12 is a schematic view of another example application scenario according to an embodiment of the present disclosure, as shown in FIG. 12, the application scenario and topology is same as the application scenario and topology in FIG. 6, the SPT for BIER is built based on the constraint is link and node Must support BIER, so the “non-BIER capable” link A-B is eliminated when building the SPT, but yet, the SPF includes node B in the SPT since it can support BIER forwarding via link C-B, then the multicast traffic from node A to node E follows: [A] - [C] - [B] - [D] - [E] .
  • the first node determines the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, and further determines the second capability information indicates the first link supports BIER forwarding, then the first node forwards the traffic to the second node for BIER forwarding.
  • the first node establishes a tunnel between the first node and a third node to bypass the second node for BIER forwarding.
  • the present disclosure provides a method for advertising and processing BIER capability of link, where the second node determines first capability information including one or more bits, and each bit supports a BSL corresponding to an interface of the second node, where the interface of the second node corresponds to a first link between the second node and a first node, then the second node advertises a first packet to the first node, where the first packet includes the first capability information.
  • the first node receives the first packet from the second node, determines whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, where the interface of the first node corresponds to the first link, then determines whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the first node, where the interface of the first node corresponds to the first link, finally adds the second node to a BIER SPT by using SPF if the second capability information indicates the first link supports BIER forwarding, the technical solution of this embodiment can support the partial BIER capable node and forward traffic or build SPT according to the condition of the partial BIER capable node in the network without deploying the complicated IGP multi-topology technology, where both the first capability information and the second capability information are considered during SPT building or traffic forwarding.
  • FIG. 13 is a structural view of a first apparatus for processing BIER capability of link according to an embodiment of the present disclosure, as shown in FIG. 13, where the apparatus includes: a receiving module 1301, a first determining module 1302 and an establishing module 1303.
  • the receiving module 1301 is configured to receive a first packet from a second node, where the first packet includes first capability information including one or more bits, and each bit supports a BSL corresponding to an interface of the second node, and the interface of the second node corresponds to a first link between the second node and the apparatus.
  • the first determining module 1302 is configured to determine whether the one or more bits included in the first capability information support a BSL corresponding to an interface of the apparatus, where the interface of the apparatus corresponds to the first link.
  • the establishing module 1303 is configured to establish a tunnel between the apparatus and a third node to bypass the second node for BIER forwarding if the first determining module determines that the one or more bits included in the first capability information do not support the BSL corresponding to the interface of the apparatus.
  • the first determining module 1302 is specifically configured to determine whether the second capability information indicates the first link supports BIER forwarding if the first determining module determines that the one or more bits included in the first capability information support the BSL corresponding to the interface of the apparatus, and the establishing module 1303 is specifically configured to establish the tunnel between the apparatus and the third node if the second capability information indicates the first link does not support BIER forwarding.
  • FIG. 14 is a structural view of a second apparatus for processing BIER capability of link according to an embodiment of the present disclosure, as shown in FIG. 14, besides the a receiving module 1301, a first determining module 1302 and the establishing module 1303, the apparatus further includes an adding module 1304, the adding module 1304 is configured to add the second node to a BIER SPT by using SPF if the second capability information indicates the first link supports BIER forwarding.
  • FIG. 15 is a structural view of an apparatus for advertising BIER capability of link according to an embodiment of the present disclosure, as shown in FIG. 15, where the apparatus includes: a second determining module 1501 and an advertising module 1502.
  • the second determining module 1501 is configured to determine first capability information including one or more bits, and each bit supports a BSL corresponding to an interface of the apparatus, and the interface of the apparatus corresponds to a first link between the apparatus and a first node.
  • the advertising module 1502 is configured to advertise a first packet to a first node, where the first packet includes the first capability information.
  • the first packet further includes second capability information
  • the second capability information is used for indicating the first link supports BIER forwarding
  • the second determining module 1501 is further configured to determine the second capability information
  • the advertising module 1502 is configured to advertise the second capability information.
  • the present disclosure also provides a first apparatus processing BIER capability of link which includes a processor and a memory.
  • the memory is storing instructions that cause the processor to perform the method according to the method described above.
  • the present disclosure also provides a second apparatus advertising BIER capability of link which includes a processor and a memory.
  • the memory is storing instructions that cause the processor to perform the method according to the method described above.
  • the present disclosure also provides a first computer-readable storage medium having stored thereon instructions that when executed cause one or more processors configured to process BIER capability of link is proposed.
  • the instructions cause the one or more processors to perform the method described above.
  • the present disclosure also provides a second computer-readable storage medium having stored thereon instructions that when executed cause one or more processors configured to advertise BIER capability of link is proposed.
  • the instructions cause the one or more processors to perform the method described above.
  • the present disclosure also provides a first communication node including an apparatus for processing BIER capability of link according to the above embodiments.
  • the present disclosure also provides a second communication node including an apparatus for advertising BIER capability of link according to the above embodiments.
  • the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium and executed by a hardware-based processing unit.
  • FIG. 16 is a schematic diagram of a hardware device 1600 that may for example, comprise nodes or functional entities of the communications system, and the hardware device 1600 is configured to perform any or all of steps of the above methods and features described herein, according to different embodiments of the present invention.
  • the hardware device may be an element of communications network infrastructure, such as a router or a switch.
  • a device may contain multiple instances of a component, such as multiple processors, memories, transmitters, receivers, transceivers etc. As shown in FIG.
  • the hardware device 1600 includes a processor 1605 such as a Central Processing Unit (CPU) , and may further include specialized processors such as a Graphics Processing Unit (GPU) or other such processor, memory 1620, non-transitory mass storage 1610, I/O interface 1625, network interface 1615, and a transceiver 1630, all of which are communicatively coupled via bi-directional bus.
  • processors 1605 such as a Central Processing Unit (CPU)
  • GPU Graphics Processing Unit
  • memory 1620 such as a Graphics Processing Unit (GPU) or other such processor
  • non-transitory mass storage 1610 such as a graphics processing Unit (GPU) or other such processor
  • I/O interface 1625 such as a graphics processing Unit
  • network interface 1615 such as a graphics processing unit
  • transceiver 1630 all of which are communicatively coupled via bi-directional bus.
  • any or all of the depicted elements may be utilized, or only a subset of the elements.
  • device may contain multiple instances of
  • the memory 1620 may include any type of non-transitory memory such as static random access memory (SRAM) , dynamic random access memory (DRAM) , synchronous DRAM (SDRAM) , read-only memory (ROM) , any combination of such, or the like.
  • the mass storage element may include any type of non-transitory storage device, such as a solid state drive, hard disk drive, a magnetic disk drive, an optical disk drive, USB drive, or any computer program product configured to store data and machine executable program code.
  • mass storage may be integrated with a heterogeneous memory.
  • the memory or mass storage may have recorded thereon statements and instructions executable by the processor for performing any of the aforementioned method steps described above.
  • the hardware device 1600 can include one or more network interfaces 1615, which may include at least one of a wired network interface and a wireless network interface.
  • a network interface may include a wired network interface to connect to a network, and also may include a radio access network interface for connecting to other devices over a radio link.
  • the radio access network interface may be omitted for nodes or functions acting as elements of the PLMN other than those at the radio edge (e.g. an eNB) .
  • both wired and wireless network interfaces may be included.
  • radio access network interface may be present and it may be supplemented by other wireless interfaces such as WiFi network interfaces.
  • the network interfaces allow the hardware device 1600 to communicate with remote entities such as those connected to network.
  • a video adapter and the I/O interface 1625 provide interfaces to couple the hardware device 1600 to external input and output devices.
  • input and output devices include a display coupled to the video adapter and an I/O device such as a touch-screen coupled to the I/O interface.
  • Other devices may be coupled to the hardware device 1600, and additional or fewer interfaces may be utilized.
  • a serial interface such as Universal Serial Bus (USB) (not shown) may be used to provide an interface for an external device.
  • USB Universal Serial Bus
  • hardware device 1600 may be a standalone device, while in other embodiments hardware device 1600 may be resident within a router or switch.
  • Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol.
  • computer-readable media generally may correspond to (1) tangible computer-readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave.
  • Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure.
  • a computer program product may include a computer-readable medium.
  • Such computer-readable storage media can include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium.
  • coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL) , or wireless technologies such as infrared, radio, and microwave are included in the definition of medium.
  • DSL digital subscriber line
  • computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but are instead directed to non-transitory, tangible storage media.
  • Disk and disc includes compact disc (CD) , laser disc, optical disc, digital versatile disc (DVD) , floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
  • processors such as one or more digital signal processors (DSPs) , general purpose microprocessors, application specific integrated circuits (ASICs) , field programmable logic arrays (FPGAs) , or other equivalent integrated or discrete logic circuitry.
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGAs field programmable logic arrays
  • processors may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein.
  • the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.
  • the techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set) .
  • IC integrated circuit
  • a set of ICs e.g., a chip set
  • Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of interoperative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.

Abstract

L'invention porte sur un procédé et un appareil d'annonce et de traitement de capacité BIER d'une liaison, et sur un nœud de communication. Un premier nœud reçoit un premier paquet provenant d'un deuxième nœud, le premier paquet comprenant des premières informations de capacité comprenant un ou plusieurs bits, chaque bit acceptant une longueur de chaîne de bits, BSL, correspondant à une interface du deuxième nœud, et l'interface du deuxième nœud correspondant à une première liaison entre le deuxième nœud et le premier, détermine si le ou les bits compris dans les premières informations de capacité acceptent une BSL correspondant à une interface du premier nœud, l'interface du premier nœud correspondant à la première liaison, et établit un tunnel entre le premier nœud et un troisième nœud afin de contourner le deuxième nœud pour un acheminement BIER si le ou les bits compris dans les premières informations de capacité n'acceptent pas la BSL correspondant à l'interface du premier nœud. La solution technique de ce mode de réalisation peut prendre en charge des nœuds à capacité BIER partielle dans le réseau sans déployer la technologie multi-topologie IGP compliquée.
PCT/CN2018/113183 2018-10-31 2018-10-31 Procédé et appareil d'annonce et de traitement de capacité bier de liaison, et nœud de communication WO2020087398A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2018/113183 WO2020087398A1 (fr) 2018-10-31 2018-10-31 Procédé et appareil d'annonce et de traitement de capacité bier de liaison, et nœud de communication
CN201880099263.9A CN113016165B (zh) 2018-10-31 2018-10-31 用于公告和处理链路的bier能力的方法和装置以及通信节点

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2018/113183 WO2020087398A1 (fr) 2018-10-31 2018-10-31 Procédé et appareil d'annonce et de traitement de capacité bier de liaison, et nœud de communication

Publications (1)

Publication Number Publication Date
WO2020087398A1 true WO2020087398A1 (fr) 2020-05-07

Family

ID=70463533

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/113183 WO2020087398A1 (fr) 2018-10-31 2018-10-31 Procédé et appareil d'annonce et de traitement de capacité bier de liaison, et nœud de communication

Country Status (2)

Country Link
CN (1) CN113016165B (fr)
WO (1) WO2020087398A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022105927A1 (fr) * 2020-11-23 2022-05-27 华为技术有限公司 Procédé, dispositif et système de notification de capacité de traitement d'un dispositif réseau

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015042156A1 (fr) * 2013-09-17 2015-03-26 Cisco Technology, Inc. Répétition explicite indexée de bit
US20150085635A1 (en) * 2013-09-17 2015-03-26 Cisco Technology, Inc. Migration support for bit indexed explicit replication
WO2016188501A1 (fr) * 2015-10-12 2016-12-01 中兴通讯股份有限公司 Procédé de mise en œuvre de réplication explicite d'indice binaire et routeur d'acheminement binaire

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106341327A (zh) * 2015-07-08 2017-01-18 中兴通讯股份有限公司 一种bier报文的传输方法及***

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015042156A1 (fr) * 2013-09-17 2015-03-26 Cisco Technology, Inc. Répétition explicite indexée de bit
US20150085635A1 (en) * 2013-09-17 2015-03-26 Cisco Technology, Inc. Migration support for bit indexed explicit replication
WO2016188501A1 (fr) * 2015-10-12 2016-12-01 中兴通讯股份有限公司 Procédé de mise en œuvre de réplication explicite d'indice binaire et routeur d'acheminement binaire

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2022105927A1 (fr) * 2020-11-23 2022-05-27 华为技术有限公司 Procédé, dispositif et système de notification de capacité de traitement d'un dispositif réseau

Also Published As

Publication number Publication date
CN113016165B (zh) 2022-09-16
CN113016165A (zh) 2021-06-22

Similar Documents

Publication Publication Date Title
CN110661706B (zh) 一种传输路径故障的处理方法、装置及***
US11563641B1 (en) Shifting network traffic from a network device
US10027623B2 (en) Internet protocol address resolution
EP3780517B1 (fr) Procédé et dispositif de traitement d'un paquet de données multidiffusion
US9634924B2 (en) Server-layer shared link risk group analysis to identify potential client-layer network connectivity loss
US9680745B2 (en) Multi-domain source routed forwarding based on collaborating network controllers
US7411963B2 (en) Method for dissemination of non-routing information using the IS-IS protocol
US11424835B2 (en) Quantum internet router
CN114070782A (zh) 一种传输路径故障的处理方法、装置及***
US10567272B2 (en) Bit error information transfer method, network device, and communications system
US20110235525A1 (en) Monitoring apparatus, monitoring method, and monitoring program
US10404598B1 (en) Managing next hop groups in routers
US11296979B2 (en) Method and system for symmetric integrated routing and bridging
US10044770B2 (en) Method and apparatus for managing a plurality of sessions in a multi-path routing based network
US20210184897A1 (en) Packet processing method and gateway device
WO2016124049A1 (fr) Procédé et appareil d'obtention de chemin de port
CN108600099A (zh) 一种报文转发方法、装置及Leaf设备
WO2020087398A1 (fr) Procédé et appareil d'annonce et de traitement de capacité bier de liaison, et nœud de communication
US10419282B1 (en) Self-configuring network devices
CN113904985A (zh) 一种段列表获取方法、报文转发方法、装置及电子设备
US10091056B1 (en) Distribution of modular router configuration
CN111224870B (zh) 一种SR-MPLS Anycast场景下的故障修复方法、设备和存储介质
WO2019204107A1 (fr) Routage dans des réseaux en arbre élargi à l'aide de publicités à désagrégation négative
CN109921989B (zh) 一种bgp逻辑拓扑生成的方法及设备
US10129089B1 (en) Shifting network traffic

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: 18938684

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: 18938684

Country of ref document: EP

Kind code of ref document: A1