WO2018010658A1 - Procédé et appareil de transfert d'informations dans la réplication explicite indexée par bit - Google Patents

Procédé et appareil de transfert d'informations dans la réplication explicite indexée par bit Download PDF

Info

Publication number
WO2018010658A1
WO2018010658A1 PCT/CN2017/092590 CN2017092590W WO2018010658A1 WO 2018010658 A1 WO2018010658 A1 WO 2018010658A1 CN 2017092590 W CN2017092590 W CN 2017092590W WO 2018010658 A1 WO2018010658 A1 WO 2018010658A1
Authority
WO
WIPO (PCT)
Prior art keywords
link
bier
node
information
protocol
Prior art date
Application number
PCT/CN2017/092590
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 WO2018010658A1 publication Critical patent/WO2018010658A1/fr

Links

Images

Definitions

  • the present invention relates to the field of communications, and in particular, to a bit index explicit copy information transmission method and apparatus.
  • Open Shortest Path First is an Interior Gateway Protocol (IGP) that is used to determine routes in autonomous systems (ASs). It is an implementation of the link state routing protocol and belongs to the Interior Gateway Protocol (IGP), so it operates inside the autonomous system.
  • the famous Dijkstra algorithm (Dijkstra) is used to calculate the shortest path tree.
  • the OSPF routing protocol is a typical link-state routing protocol. In an autonomous system, all OSPF routers maintain a database that describes the AS structure. The database stores the status information of the corresponding links in the routing domain. The OSPF router calculates its OSPF routes through this database. Table of. As a link state routing protocol, OSPF transmits Link State Advertisement (LSA) to all routers in a certain area.
  • LSA Link State Advertisement
  • a link is another term for a router interface, so OSPF is also known as an interface state routing protocol.
  • OSPF establishes a link state database by advertising the state of the network interface between routers to generate a shortest path tree, and each OSPF router uses these shortest paths to construct a routing table.
  • the intermediate system to intermediate system is an internal gateway protocol and is one of the internal gateway protocols commonly used by telecommunication operators.
  • the standard IS-IS protocol is regulated by ISO/IEC 10589:2002, developed by the International Organization for Standardization.
  • the standard IS-IS protocol is designed for connectionless network services (CLNS) and is not directly suitable for IP networks. Therefore, the Internet Engineering Task Force has developed an integrated IS-IS protocol that can be applied to IP networks.
  • Integrated IS-IS which is specified by RFC documents such as RFC 1195.
  • IS-IS belongs to the internal gateway routing protocol and is used inside the autonomous system.
  • IS-IS is a chain The road state protocol is very similar to the OSPF protocol in the TCP/IP network, and uses the shortest path first algorithm for route calculation.
  • BGP Band Gateway Protocol
  • the network reachability information exchanged by BGP provides enough information to detect the routing loop and make decisions on the route based on performance prioritization and policy constraints.
  • the BGP exchange includes network reachability information of all AS paths, and performs a routing policy according to the configuration information.
  • BGP works in conjunction with the IGP protocol.
  • BGP is usually used between autonomous systems, with the development of the network, some scenarios tend to use only BGP as a routing protocol.
  • Babel is a routing protocol that supports IPv6 and IPv4 using vector distance algorithms. It is stable and efficient and can be used in both wired and wireless networks. Compared with the wired network protocol represented by RIP, Babel no longer uses the hop count to select the optimal path, but uses the Expected Transmission Count (ETC) to calculate the arrival of a node. The number of hops. ETC not only considers the hop count information of a certain node, but also considers a series of indicators such as link bandwidth and congestion degree as the basis for routing. However, ETC will change due to changes in the wireless environment and the joining/exit of network nodes, which causes the continuous flipping of routes to make the network difficult to converge.
  • ETC Expected Transmission Count
  • Babel uses history-sensitive to accelerate the convergence of the network, that is, to select a path that has been used with similar ETC values. Babel does not perform periodic routing updates and announcements throughout the network after the network converges. It only passively triggers updates when node information and status change.
  • OSPF/ISIS/BGP/BABEL protocols are important dynamic routing protocols. Because of their own route advertisement interaction characteristics, many technologies use these protocols as carriers to transmit control information or other information.
  • Multicast technology plays an increasingly important role in the current Internet.
  • IPTV Interactive Personality TV
  • Net-Meeting live broadcast, etc. all use multicast technology.
  • the existing technologies of the multicast include PIM (Protocol Independent Multicast), IGMP (Internet Control Message Protocol), and MLD (Multicast Listener Discovery Protocol).
  • PIM Protocol Independent Multicast
  • IGMP Internet Control Message Protocol
  • MLD Multicast Listener Discovery Protocol
  • these existing protocols can meet the needs of users, but with multicast
  • the application is more and more extensive, and the networking is more and more complex.
  • the multicast is directly applied to the Internet.
  • the multicast status in the backbone network is too large, and a large number of control resources and signaling interactions of the intermediate nodes are occupied. Very good support for the development of VPN (Virtual Private Network) technology that is now widely used.
  • VPN Virtual Private Network
  • BIER Bit Indexed Explicit Replication
  • Multicast traffic is transmitted in the intermediate network, and a specific BIER header is encapsulated.
  • the header labels all destination nodes of the multicast stream in the form of BIT bit strings.
  • the intermediate network forwarding device routes according to the BIT bits, and the guaranteed traffic can be sent to all destination nodes.
  • the intermediate node forwarding device uses the internal protocol, such as OSPF (OSPF Open Shortest Path First) protocol in the Layer 3 network, and the ISIS protocol to flood the node information to form a BIFT (Bit Index) for guiding BIER forwarding.
  • BIFT Bit Index
  • Forwarding Table when receiving the traffic encapsulating the BIER header, completes the forwarding of the packet to the destination node according to BIFT.
  • BIER TE Bit Indexed Explicit Replication Traffic Engineering
  • the BIER TE forwarding table that is queried is similar in form to the BIER forwarding table, but In fact, a completely independent forwarding table, each bit in the forwarding entry of the table, identifies a link, not a node. Second, forwarding according to the forwarding entry When only the link BIT bit connected to the node is forwarded and processed accordingly, the packet is not looped back and can reach the destination correctly.
  • the BIER technology can provide multicast traffic forwarding based on the shortest path, and eliminates the state of multicast entries that need to be saved by the intermediate nodes of the traditional multicast technology, and is a multicast technology with advanced significance.
  • BIER TE technology goes a step further and provides a multicast stream forwarding method for traffic engineering, which enables multicast traffic forwarding to be more accurately controlled. Therefore, BIERTE technology is a technology with the same advanced and obvious advantages. In the existing technology, the BIER TE technology only forwards the data plane and lacks the information transmission of the control plane. Based on this, there is a need for a technical solution capable of transmitting control surface information.
  • the embodiments of the present invention are directed to providing a bit index explicit copy information transmission method and apparatus, so as to implement a technical solution for performing control plane information transmission in a BIER network.
  • an embodiment of the present invention provides a bit index explicit replication information delivery method, where the method includes: a bit index explicitly replicating a node in a BIER network to extend a BIT location BP information of a delivery link by using a protocol;
  • the BP information is the BIER TE control information of the link, which is a unique identifier that identifies the link.
  • the method further includes: the node expanding one or more of the following BIER TE control information of the link by using a protocol: BIER TE capability Bit string length BSL, sub-domain ID number, set identifier SI, topology ID, link type, algorithm, and link weight.
  • the link includes a physical link and/or a virtual link.
  • the protocol includes at least one of the following: an open shortest path first OSPF protocol, an intermediate system to an intermediate system ISIS protocol, a border gateway protocol BGP, and a BABEL protocol.
  • the method further includes: directly configuring BIER TE control information of the link; and/or receiving BIER TE control information of the delivered link.
  • the method further includes: generating a corresponding BIER TE forwarding entry according to the BIER TE control information of the link.
  • the corresponding BIER TE forwarding entry is calculated by one of the following algorithms: a shortest path first SPF algorithm and a constraint path algorithm.
  • the method further includes: forwarding, according to the BIER TE forwarding entry, a packet encapsulated in a BIER TE manner.
  • the embodiment of the present invention further provides a bit index explicit copy information transmitting apparatus, which is applied to a bit index to explicitly replicate a node in a BIER network, where the apparatus includes: a sending module, configured to extend a transmission link by using a protocol BIT location BP information; wherein the BP information is control plane information of the BIER TE of the link, and is a unique identifier indicating the link.
  • the sending module is further configured to extend one or more of the following BIER TE control information of the delivery link by using a protocol: BIER TE capability, bit string length BSL, sub-domain ID number, set identifier SI, topology ID, link type, algorithm, and link weight.
  • the apparatus further includes: a processing module, configured to generate a corresponding BIER TE forwarding entry according to the BIERTE control information of the link.
  • the device further includes: a forwarding module, configured to forward the packet encapsulated in the BIER TE manner according to the BIER TE forwarding entry.
  • a storage medium comprising a stored program, wherein the program is executed to perform the method of any of the above.
  • a processor for running a program wherein the program is executed to perform the method of any of the above.
  • a node in a BIER bit index explicit replication network transmits a BIT location BP information of a link of the node by using a protocol extension; wherein the BP information For the BIER TE control information of the node, Shows the unique identifier of the path.
  • the BIER TE control information is transmitted on the control plane of the network, so that the network node can generate a BIER TE forwarding entry according to the information, and implement BIER TE traffic encapsulation and forwarding. This enables BIER TE technology to be truly implemented in the network.
  • FIG. 1 is a schematic flowchart of a bit index explicit copy information transmission method according to Embodiment 1 of the present invention
  • FIG. 2 is a schematic flowchart diagram of a bit index explicit copy information transmission method according to Embodiment 2 of the present invention
  • FIG. 3 is a schematic structural diagram of a network according to Embodiment 3 of the present invention.
  • FIG. 4 is a schematic diagram of an OSPF and ISIS protocol extended format provided by Embodiment 3 of the present invention.
  • FIG. 5 is a schematic diagram of an extended format of a BGP and a BABEL protocol according to Embodiment 3 of the present invention.
  • FIG. 6 is a schematic structural diagram of a network according to Embodiment 4 of the present invention.
  • FIG. 7 is a schematic diagram of an OSPF and ISIS protocol extended format according to Embodiment 4 of the present invention.
  • FIG. 8 is a schematic structural diagram of a network according to Embodiment 5 of the present invention.
  • FIG. 9 is a schematic structural diagram of a network according to Embodiment 6 of the present invention.
  • FIG. 10 is a schematic structural diagram of a network according to Embodiment 7 of the present invention.
  • FIG. 11 is a schematic structural diagram of a bit index explicit copy information transmitting apparatus according to Embodiment 8 of the present invention.
  • FIG. 12 is a schematic structural diagram of another bit index explicit copy information transmitting apparatus according to Embodiment 8 of the present invention.
  • a node in a BIER network transmits BIT location BP information of a link of the node by protocol extension; wherein the BP information is control information of a BIERTE of the node, which is an indication The unique identifier of the path, when the node needs to perform packet transfer
  • the BIER TE format encapsulated packet is forwarded by the forwarding entry generated based on the BP information.
  • a first embodiment of the present invention provides a BIER information transmission method. As shown in FIG. 1, the method includes:
  • the node in the BIER network extends the BIT location BP information of the link by using a protocol.
  • the BP information is BIER TE control information of the link, and is a unique identifier indicating the link.
  • the node in the BIER network identifies the link between itself and another node as the BP information of the node, and transmits it to other nodes through notification.
  • other nodes may be any node other than the node itself in the BIER network to which the node belongs.
  • the link may include a physical link and/or a virtual link.
  • nodes at both ends of a link are respectively referred to as a first node and a second node, where the second node may be a neighboring node of the first node. It can also be a non-adjacent node of the first node.
  • the link is a physical link
  • the BP information of the link is a unique identifier of the physical link between the first node and the second node
  • the second node is When the non-adjacent node of the first node is a virtual link, the BP information of the link is a unique identifier of the virtual link between the first node and the second node, and the virtual link includes the first node.
  • the node may also receive the BP information of the link sent by other nodes, that is, any node in the BIER network may go to other nodes.
  • the BP information of the transmitted link can also receive the BP information of the link sent by other nodes.
  • the BP information of the link sent by the node may be the BP information of the corresponding link of the node itself, or may be the BP information of the link corresponding to the received other node, so that the node in the BIER network can The BP information of the link corresponding to a certain node can be directly received, and the BP information of the link corresponding to other nodes can also be learned.
  • the protocol for transmitting BP information includes at least one of the following protocols: an open shortest path first OSPF protocol, an intermediate system to an intermediate system ISIS protocol, a border gateway protocol BGP, and a BABEL protocol.
  • the extension of the protocol can be achieved by adding BP information to the message in the protocol to pass the BP information.
  • the specific extended form of the protocol is not limited, and the use of the specific protocol is not specifically described herein.
  • the method further includes: directly configuring the BIER TE control information of the link; and/or receiving the BIER TE control information of the delivered link.
  • the BIERTE control information of the link may be configured by the node itself, or the BIERTE control information of the link may be configured by the control end of the node, such as a controller, and then sent to the node through the control end.
  • the corresponding BIER TE forwarding entry is calculated by one of the following algorithms: a shortest path first SPF algorithm and a constraint path algorithm.
  • the node When the node receives the BP information of all other nodes, it actually receives the relatively scattered BP information.
  • the BP information about the node 2 received by the node 1 includes the link 1 and the node 3 is received.
  • the BP information also includes the link 1, but at this time, the relationship between the node 2, the node 3, and the link 1 is not associated.
  • the node 2, the node 3, and the path 1 can be performed by an algorithm such as an SPF algorithm or a constraint path algorithm. In connection, it is determined that the BP information of the link between node 1 and node 2 is link 1.
  • the node in the BIER network generates corresponding BP information including all the links in the BIER network according to all the received BP information, and associates the node of each link with the BP information of the link to generate the network. Forwarding entry.
  • the path required for the multicast traffic forwarding is calculated through the information of the ingress node and the information of the egress node, and the control information corresponding to the link included in the path is obtained according to the forwarding entry.
  • the BP information is encapsulated in the BIER TE packet header.
  • the bit string part in the packet header generates a packet encapsulated in BIER TE mode.
  • the participating forwarding nodes forward the packet according to the BIER TE forwarding table after discovering the packet of the BIER TE type.
  • the forwarding node of the network receives the packet encapsulated in the BIER TE mode, the multicast traffic is forwarded to the destination node according to the encapsulated packet header and the local forwarding entry of each node.
  • the difference between the BIER TE message and the BIER message encapsulated in the BIER TE mode in this embodiment is that the BitString (bit string) information encapsulates not the BP information corresponding to each node, but the chain. BP information corresponding to the road.
  • the bit index explicit copy information transmission method provided by the embodiment of the present invention can implement the control plane transmission of the BIER TE control information in the network, so that the network node can generate a BIER TE forwarding entry according to the control information, and implement BIER TE traffic. Encapsulation and forwarding. Therefore, BIERTE technology can be realized in the network, which plays an important role in promoting the development of multicast technology and network, and plays an important role in promoting the development of multicast technology and network.
  • a first embodiment of the present invention provides a BIER information transmission method. As shown in FIG. 1, the method includes:
  • the node in the BIER network extends the BIT location BP information of the link by using a protocol; wherein the BP information is BIER TE control information of the link, and is a unique identifier indicating the link;
  • the node transmits the BP information by using a protocol extension, and the node extends one or more of the following BIER TE control information of the link by using a protocol: BIER TE capability, bit string length BSL, and sub-domain ID. Number, set identifier SI, topology ID, link type, algorithm, and link weight.
  • the BIER TE control information transmitted by the nodes through the extended protocol includes not only the BP information of the link, but also the BIER TE capability, the bit string length BSL, the sub-domain ID number, the set identifier SI, the topology ID, the link type,
  • the BIER TE capability is used to identify whether the corresponding node of the link supports BIER TE.
  • the node of link 1 is node 1 and node 2, and the BIER TE capability corresponding to link 1 can be obtained.
  • Determine node 1 or node 2 BIER TE is not supported. Specifically, it is used to indicate whether node 1 is not supported or node 1 is not supported.
  • the BSL can be used to indicate the bit string length supported by the node.
  • the sub-domain ID number is used to indicate the sub-domain to which the node belongs.
  • the identifier of the node indicates the sub-domain to which the node belongs.
  • the SI is used to indicate the identifier of the set to which the node belongs, which indicates which set the node belongs to.
  • the topology ID indicates the identifier of the topology to which the node belongs, indicating that the node belongs to the node.
  • topology stratifies the network through subdomains, sets, and topologies, especially for networks with a large number of nodes, making the network structure clear; link type is used to indicate whether the link is a virtual link or a physical chain The algorithm is used to indicate the algorithm used by the link; the link weight is used to indicate the weight of the link, where the link weight can be set according to the traffic bandwidth described by the link.
  • the BIER TE control information of the link may not be limited to the above information, and may be set according to the needs of the user.
  • the protocol for transmitting BIER TE control information includes at least one of the following: an open shortest path first OSPF protocol, an intermediate system to intermediate system ISIS protocol, a border gateway protocol BGP, and a BABEL protocol.
  • the BIER TE control information can be passed by adding fields in the protocol message to implement the extension of the protocol.
  • the specific extended form of the protocol is not limited, and the use of the specific protocol is not specifically described herein.
  • the corresponding BIER TE forwarding entry is calculated by one of the following algorithms: a shortest path first SPF algorithm and a constraint path algorithm.
  • the forwarding entry is generated by the above algorithm according to all the BIER TE control information passed.
  • the information about the path in the packet header may carry the BP information of the link included in the path, and may also carry the link corresponding to other BIER TE in addition to the BP information. information.
  • the path of the multicast traffic to be forwarded can be determined according to the BP information.
  • the forwarding node determines the next node to be sent according to the information of the link and the node in the local forwarding entry, and
  • the relevant situation of the link for example, is Whether BIER TE is supported, whether the link is a virtual link or a physical link, and the algorithm determines the format of the packet to be forwarded at this time, so that the next node performs correct forwarding.
  • the BIER TE control information of the link is transmitted between the nodes, so that the node generates a forwarding table according to the transmitted BIER TE control information, and implements the multicast data flow in the BIER network according to the forwarding table. Correct and fast multicast.
  • the BP of the link is first introduced by way of an example network to further describe the bit index explicit copy information transmission method of the present invention.
  • the BP information of the link in the present invention is exemplarily described by using a BIER network running multiple BIER TE technologies as an example.
  • all the nodes form a network of running BIER TE technologies.
  • These nodes include node 1, node 2 to node 15, where node 1 is the node connecting source 1, node 2, node 3, node 4, node 5, node 6 is connected to the corresponding receiver node, here, node 1.
  • Node 2, Node 3, Node 4, Node 5, and Node 6 are edge nodes of the network connecting the source or the receiver.
  • Node 11, Node 12, Node 13, Node 14, Node 15, Node 16, and Node 17 are intermediate. Forward the node.
  • BP information is allocated to the links of the nodes in the network to support the BIERTE function, wherein the links can be identified by digital identifiers, that is, different links are assigned different digital identifiers as the link.
  • the digital identifier after the link is represented as BP information allocated to the link, such as the link between node 1 and node 11, the assigned BP is link 1, node 11 and node 12,
  • the BPs of the links to which the nodes 14 and 16 are connected are respectively the link 11, the link 2, and the link 3.
  • the BPs assigned by the nodes 14 and the nodes connected to the node 12, the node 13, the node 15, and the node 17 are respectively BP.
  • the links allocated by the link 13, the link 14, the link 9, the link 17, the node 5 and the node 13 and the node 15 are respectively the link 15 and the link 10, and other link allocation modes and the above The nodes are assigned in the same way.
  • BIER TE's BP information can be advertised in the form of TLV (Type, Length, BitPosition Value). This method can provide strong scalability, and can also be implemented through existing protocol notification content attachment methods.
  • Protocol extension transfer link BP information may include one or more of the following protocols: OSPF protocol, ISIS protocol, BGP, and BABEL protocol, where, for OSPF and ISIS protocols, the two protocols are link state protocols, and the extended TLV mode may In the manner shown in Figure 4, the link advertisements of the two protocols are flooded together to implement the corresponding notification of the link and BP; for the BGP and BABEL protocols, the two protocols are distance vector protocols, and there is no direct
  • the link advertisement can be advertised in the manner shown in Figure 5, including: Type, Length, link use name/ID number (interface name/id), and/or neighbor/nexthop (neighbor/nexthop)
  • the BitPosition Value is used to identify, and the nodes in the network can learn the correspondence between the link and the
  • the information to be advertised may also be distributed separately and each information is advertised as a separate TLV.
  • the format shown in FIG. 4 and FIG. 5 is used as a distance of the notification mode, and the present invention does not limit the format of the advertisement.
  • control information of the link may be implemented by being configured on each node, or may be sent by a controller or other means.
  • the information needs to be The advertisement is implemented in the network, so that each node can encapsulate the packet header of the BIER TE according to the needs of the traffic to generate a forwarding entry that can be forwarded by the BIER TE.
  • the OSPF, ISIS, BGP, and BABEL notification mechanisms can be used to advertise information, so that nodes in the network can receive the information and generate corresponding BIER TE forwarding entries through processing. .
  • the path information is obtained according to various calculation methods, and the BP information corresponding to the path is encapsulated to BIER TE message header.
  • the BIER TE packet carrying the BIER TE packet header in this embodiment is different from the BIER packet in the BIER TE mode.
  • the BitString bit string information is encapsulated, not the BP information corresponding to each node. , but the BP information corresponding to the link.
  • Each participating forwarding node discovers that it is a BIER TE type report. After the text, the forwarding is performed according to the BIER TE forwarding table local to each participating forwarding node.
  • the communication link between the source or the receiver and the node is indicated by a broken line.
  • the form of the specific communication link may be conceivable by those skilled in the art.
  • Any communication link, through a solid line, represents the link between the node and the node, which is a physical link.
  • bit index explicit replication information delivery method is further described by a network having a hierarchical structure, wherein, as shown in FIG. 6, the network is in a network in order to support service requirements.
  • the link is divided into two layers.
  • This method can be implemented by sub-domian sub-domains in the BIER technology to implement a multi-service network.
  • the different sub-domains are distinguished by a broken line and a solid line, the link indicated by the broken line is the link of the sub-domain 1, and the link indicated by the solid line is the link of the sub-domain 2.
  • FIG. 6 the bit index explicit replication information delivery method provided by the embodiment of the present invention is further described by a network having a hierarchical structure, wherein, as shown in FIG. 6, the network is in a network in order to support service requirements.
  • the link is divided into two layers.
  • This method can be implemented by sub-domian sub-domains in the BIER technology to implement a multi-service network.
  • the different sub-domains are distinguished by a broken
  • the intermediate network dotted link belongs to subdomain 1, sub-domian-id is 1, the solid link belongs to subdomain 2, and the sub-domian-id is 2.
  • the link between the node 1 and the node 11, the link between the node 11 and the node 14, and the link between the node 14 and the node 15 all belong to two sub-domains, and the links are in two sub-domains.
  • There will be link BP information in the link the link between node 1 and node 11 has a BP of 1 in subdomain 1, and BP in subdomain 2 is 21; the link between node 11 and node 14 is in the middle.
  • the BP in domain 1 is 2, the BP in subdomain 2 is 28; the link between node 14 and node 15 has a BP of 9 in subdomain 1 and a BP of 29 in subdomain 2.
  • the link information can be advertised in association with the TLV information as shown in FIG. 7, and the link and its corresponding sub-domian-id are advertised together on the basis of FIG. Also in the BGP and BABEL protocols, the sub-domian-id can be advertised together on the basis of Figure 5.
  • the layering of the link can also be multi-level layered by way of topology ID.
  • the SI and the topology ID are advertised together, and the layer management function of the link can also be implemented.
  • the multicast of the multicast traffic in the bit index explicit replication information delivery method provided by the present invention is described by the network shown in FIG. 8 to further perform the bit index explicit replication information delivery method provided by the present invention.
  • each node in the network has received BIER TE control information of all other nodes, and has generated a local forwarding entry.
  • the protocol for advertising can be OSPF protocol, and the node learns through protocol extension.
  • BIER TE control information such as BP of each link.
  • the ingress node is node 1, and the egress nodes having the receiver are node 2, node 3, and node 4.
  • the ingress node 1 learns through the path calculation that the multicast traffic needs to pass through the link 1, link 2, link 6, and chain in the network. Road 7 and link 8 arrive at the receiver.
  • the ingress node 1 encapsulates the BP information corresponding to the links into the bit string part of the BIER TE packet header when encapsulating the multicast traffic.
  • the path in the network through which the multicast traffic passes includes link 1, link 2, link 6, link 7 and link 8.
  • the multicast traffic is forwarded to the node 2 and the node 5 according to the local forwarding entry.
  • the node 5 receives the multicast traffic, the multicast traffic is forwarded to the node 6, so that the forwarding node includes the node 1, the node 5, and the node. 6
  • the traffic can be forwarded to the egress node 2, node 3, and node 4 according to the BIER TE forwarding entry generated by the packet header and the local device, so as to reach the receiver and implement multicast of the traffic.
  • the link may use a weight to affect the role of its link in service forwarding.
  • the node 2 arrives at the node 6 for service forwarding, it can be implemented through the link 3 and the link 8, or the link 7 and the link 4.
  • the two paths are equal-cost paths. Therefore, when node 2 is the ingress node of traffic, it may use equalization to share traffic on the two paths.
  • link 7 is an unstable link or has less available bandwidth, so the link can set its link weight to a lower value when advertising information.
  • the path considered for forwarding can be considered according to the link weight in the BIER TE control information, thereby reducing the traffic encapsulated on the link.
  • the setting of the link weight can be set according to the available bandwidth of the link.
  • the basis for setting the link weight may not be limited to the available bandwidth.
  • the notification of the link weight can also be advertised in a manner similar to FIG. 4 or FIG.
  • the examples of the invention are merely format references.
  • the node 3 cannot provide the BIER TE forwarding function. Therefore, when the BIER TE packet encapsulated in the BIER TE mode is sent to the node, the node cannot be processed correctly, packet forwarding errors may occur, or the packet may be directly reported. The case of discarding.
  • a virtual link is established between the node 2 and the node 4, and the BP information is assigned as the link 3.
  • the virtual link may be advertised in a protocol in a link type manner as shown in FIG. 4 or FIG. 5, or in a similar manner to FIG. 6, and other types of links, such as the type of physical link between node 2 and node 6. Different, thus distinguishing from the notification of a common traffic engineering link.
  • the corresponding BIER TE forwarding entry is also generated.
  • the forwarding entry corresponding to the virtual link is different from the normal BIER TE forwarding entry.
  • the eighth embodiment provides a bit index explicit copy information transfer device, which is applied to a node in a BIER network, as shown in FIG.
  • the sending module 801 is configured to extend the BP information of the link by using a protocol extension, where the BP information is control information of the BIER TE of the link, and is a unique identifier indicating the link.
  • the apparatus may further include a storage module configured to store BIT location BP information of the link in the BIER bit index explicit replication network;
  • the sending module 801 is further configured to extend one or more of the following BIER TE control information of the link by protocol: BIER TE capability, bit string length BSL, sub-domain ID number, set identifier SI, topology ID, link Type, algorithm, and link weight.
  • the scalable protocol includes an OSPF protocol, or an ISIS protocol, or a BGP protocol, or a BABEL protocol, or a combination of two or more protocols.
  • the apparatus further includes: a processing module 802, configured to generate a corresponding BIER TE forwarding entry according to the BIERTE control information of the link.
  • the ingress node expands the BIER TE control information transmitted according to the protocol, and the link that the multicast service or the multicast stream needs to pass corresponds to the link BP, and then encapsulates the packet into the bit string portion of the packet header for forwarding. .
  • the device further includes: a forwarding module 803, configured to forward the packet encapsulated in the BIER TE manner according to the BIER TE forwarding entry.
  • a forwarding module 803 configured to forward the packet encapsulated in the BIER TE manner according to the BIER TE forwarding entry.
  • the apparatus may further include receiving means for receiving BIER TE control information carried by the protocol extension.
  • the sending module 801, the processing module 802, and the forwarding module 803 may be a central processing unit (CPU) or a digital signal processor (Digital Signal Processor) located in the network node.
  • CPU central processing unit
  • DSP Digital Signal Processor
  • FPGA Field Programmable Gate Array
  • embodiments of the present invention can be provided as a method, system, or computer program product. Accordingly, the present invention can take the form of a hardware embodiment, a software embodiment, or a combination of software and hardware. Moreover, the invention can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) including computer usable program code.
  • the computer program instructions can also be stored in a computer readable memory that can direct a computer or other programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture comprising the instruction device.
  • the apparatus implements the functions specified in one or more blocks of a flow or a flow and/or block diagram of the flowchart.
  • These computer program instructions can also be loaded onto a computer or other programmable data processing device such that a series of operational steps are performed on a computer or other programmable device to produce computer-implemented processing for execution on a computer or other programmable device.
  • the instructions provide steps for implementing the functions specified in one or more of the flow or in a block or blocks of a flow diagram.
  • a bit index explicit copy information transmission method provided by an embodiment of the present invention
  • the device has the following beneficial effects: the control plane of the BIER TE control information is transmitted in the network, so that the network node can generate a BIER TE forwarding entry according to the information, and implement BIER TE traffic encapsulation and forwarding. This enables BIER TE technology to be truly implemented in the network.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Dans un mode de réalisation, la présente invention concerne un procédé de transfert d'informations dans la réplication explicite indexée par bit. Le procédé comprend les étapes suivantes : un nœud dans un réseau de réplication explicite indexée par bit (BIER) transfère des informations de position BIT BP d'une liaison au moyen d'une extension de protocole, les informations BP étant des informations de commande BIER TE de la liaison et un identifiant unique de la liaison. Un mode de réalisation de la présente invention concerne également un appareil de transfert d'informations en réplication explicite indexée par bit, destiné à la mise en œuvre du procédé.
PCT/CN2017/092590 2016-07-13 2017-07-12 Procédé et appareil de transfert d'informations dans la réplication explicite indexée par bit WO2018010658A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610555855.X 2016-07-13
CN201610555855.XA CN107623630B (zh) 2016-07-13 2016-07-13 一种位索引显式复制信息传递方法和装置

Publications (1)

Publication Number Publication Date
WO2018010658A1 true WO2018010658A1 (fr) 2018-01-18

Family

ID=60952229

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/092590 WO2018010658A1 (fr) 2016-07-13 2017-07-12 Procédé et appareil de transfert d'informations dans la réplication explicite indexée par bit

Country Status (2)

Country Link
CN (1) CN107623630B (fr)
WO (1) WO2018010658A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019205799A1 (fr) * 2018-04-27 2019-10-31 华为技术有限公司 Procédé et dispositif de traitement d'un paquet de données multidiffusion
CN112511988A (zh) * 2020-03-06 2021-03-16 中兴通讯股份有限公司 报文转发方法、设备、系统、网络设备和存储介质
WO2022115882A3 (fr) * 2021-02-12 2022-06-30 Futurewei Technologies, Inc. Extensions igp pour bier-te

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110581806B (zh) * 2018-06-11 2022-02-25 中兴通讯股份有限公司 一种自动切分网络的方法、装置、设备及存储介质
CN113726666B (zh) 2018-06-27 2022-11-18 华为技术有限公司 一种发送报文的方法和装置
CN113595913B (zh) * 2018-11-02 2023-02-14 华为技术有限公司 报文转发的方法、发送报文的装置和接收报文的装置

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105743793A (zh) * 2014-12-31 2016-07-06 瞻博网络公司 用于网络设备组件的比特索引显式复制（bier）转发

Family Cites Families (2)

* 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
US11451474B2 (en) * 2013-09-17 2022-09-20 Cisco Technology, Inc. Equal cost multi-path with bit indexed explicit replication

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105743793A (zh) * 2014-12-31 2016-07-06 瞻博网络公司 用于网络设备组件的比特索引显式复制（bier）转发

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
CHEN, RAN ET AL.: "PCEP Extensions for BIER Draft-chen-bier-pee-bier-Ol", NETWORKING WORKING GROUP, 5 July 2016 (2016-07-05), XP015113991 *
ECKERT, T. ET AL.: "Traffic Engineering for Bit Index Explicit Replication BIER-TE Draft-eckert-bier-te-arch-03", NETWORK WORKING GROUP, 20 March 2016 (2016-03-20), XP015111987 *
PRZYGIENDA, A. ET AL.: "BIER Support via ISIS Draft-przygienda-bier-isis-ran-ges-O", INTERNET ENGINEERING TASK FORCE, 30 January 2015 (2015-01-30), XP055456860 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019205799A1 (fr) * 2018-04-27 2019-10-31 华为技术有限公司 Procédé et dispositif de traitement d'un paquet de données multidiffusion
US11431615B2 (en) 2018-04-27 2022-08-30 Huawei Technologies Co., Ltd. Multicast data packet processing method and apparatus
CN112511988A (zh) * 2020-03-06 2021-03-16 中兴通讯股份有限公司 报文转发方法、设备、系统、网络设备和存储介质
US11882021B2 (en) 2020-03-06 2024-01-23 Zte Corporation Packet forwarding method, apparatus and system, network device and storage medium
CN112511988B (zh) * 2020-03-06 2024-04-19 中兴通讯股份有限公司 报文转发方法、设备、系统、网络设备和存储介质
WO2022115882A3 (fr) * 2021-02-12 2022-06-30 Futurewei Technologies, Inc. Extensions igp pour bier-te

Also Published As

Publication number Publication date
CN107623630A (zh) 2018-01-23
CN107623630B (zh) 2021-04-06

Similar Documents

Publication Publication Date Title
US10616063B1 (en) Stateless multicast in IP networks
EP3435595B1 (fr) Arbres redondants au maximum vers des noeuds sources de multidiffusion redondants pour protection de multidiffusion
US10686699B2 (en) Multicast systems and methods for segment routing
US11483237B2 (en) BIER traffic engineering (BIER-TE) using unicast MPLS-TE tunnels
US8811388B2 (en) Service instance applied to MPLS networks
WO2018010658A1 (fr) Procédé et appareil de transfert d'informations dans la réplication explicite indexée par bit
CN102150148B (zh) 层2拓扑中针对单播帧和多播帧的差别化服务
US20160006614A1 (en) Source Routing Using Path Computation Elements
US8077713B2 (en) Dynamic update of a multicast tree
CN101960785B (zh) 在链路状态协议受控以太网网络上实现vpn
US8064440B2 (en) Technique for avoiding IP lookup with multipoint-to-multipoint label switched paths
WO2018072704A1 (fr) Procédé et appareil de transmission de messages, nœud et support de stockage informatique
JP4971496B2 (ja) イーサネット・スパニング・ツリープロビジョン
WO2016188502A1 (fr) Procédé et dispositif pour fournir une notification d'informations d'ingénierie de trafic dans un réseau bier
US20210112020A1 (en) Multicast traffic control in hybrid networks containing both software defined networking domains and non-sdn ip domains
CN113709034A (zh) 使用路由协议的定向信息分布中的位掩码路线目标
CN107294859B (zh) 一种信息传递方法、装置及系统
WO2018040941A1 (fr) Procédé et dispositif de transmission de métadonnées
WO2020021558A1 (fr) Procédés, appareil et supports lisibles par machine se rapportant à un calcul de chemin dans un réseau de communication
WO2018107955A1 (fr) Procédé et dispositif de transmission d'informations de réplication explicite indexées par bits
WO2022042610A1 (fr) Procédé de traitement d'informations, dispositif de commande de réseau, nœud et support de stockage lisible par ordinateur
WO2023173989A1 (fr) Procédé et appareil de génération de table de transfert, et support de stockage et appareil électronique
Riaz Multicast in MPLS Based Networks and VPNs
LSPs Networking Working Group L. Ginsberg Internet-Draft S. Previdi Intended status: Standards Track Y. Yang Expires: December 18, 2013 Cisco Systems June 16, 2013

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

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

Country of ref document: EP

Kind code of ref document: A1