WO2016198013A1 - Procédé et appareil de transmission de paquet - Google Patents

Procédé et appareil de transmission de paquet Download PDF

Info

Publication number
WO2016198013A1
WO2016198013A1 PCT/CN2016/086768 CN2016086768W WO2016198013A1 WO 2016198013 A1 WO2016198013 A1 WO 2016198013A1 CN 2016086768 W CN2016086768 W CN 2016086768W WO 2016198013 A1 WO2016198013 A1 WO 2016198013A1
Authority
WO
WIPO (PCT)
Prior art keywords
bier
node
traffic
planned path
path information
Prior art date
Application number
PCT/CN2016/086768
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 WO2016198013A1 publication Critical patent/WO2016198013A1/fr

Links

Images

Definitions

  • the present application relates to, but is not limited to, the field of communications, and in particular, to a message transmission method and apparatus.
  • the network forwarding is simplified to be based only on bits, subverting the traditional network protocol (IP, Internet Protocol) forwarding, and it is very easy to realize the transmission of multicast traffic in the intermediate network without any intermediate network recording any multicast.
  • IP Internet Protocol
  • the core idea of BIER technology is: the nodes in the network are represented by only one BIT bit.
  • the multicast traffic is transmitted in the intermediate network, not in the form of multicast IP packets, but encapsulates a specific BIER header.
  • the packet header indicates all destination nodes of the multicast stream in the form of BIT bits.
  • the intermediate network routes according to the BIT bit, and the guaranteed traffic can be sent to all destination nodes.
  • the information obtained by the intermediate network for all nodes is obtained by using a traditional inter-domain routing protocol, such as an Open Shortest Path First (OSPF) protocol and an Intermediate System to Intermediate System (ISIS) protocol.
  • OSPF Open Shortest Path First
  • ISIS Intermediate System to Intermediate System
  • the extension which carries the BIER protocol related information such as the BIT bit, completes the transmission of the information, and calculates the route to all the destination nodes according to the calculation path of OSPF and ISIS, thereby forming the route of the BIER.
  • FIG. 1 is a schematic diagram of BIER network forwarding in the related art. As shown in Figure 1, a multicast traffic is assumed, the entry is a Bit-Forwarding Ingress Router (BFIR) 1, and the egress is a Bit-Forwarding egress Router (BFER), BFER6, and BFER8.
  • BFIR Bit-Forwarding Ingress Router
  • BFER Bit-Forwarding egress Router
  • the forwarding of the traffic in the BIER network will be performed according to the shortest path, that is, the shortest path to the BIER network exit: BFIR1 - Bit-Forwarding Router (BFR) 2 - BFER3; BFIR1 - BFR4 - BFR5—BFER6; BFIR1—BFR7—BFER8.
  • BFR Bit-Forwarding Router
  • the traffic is planned to be transmitted through the following path: BFIR1 - BFR4 - BFR5 - BFER3 / BFER6 / BFER8, the relevant BIER technology cannot be implemented. It can be seen that in the related BIER technology, traffic cannot be forwarded through the planned path, which results in wasted network bandwidth and insufficient utilization of the link.
  • the embodiment of the invention provides a packet transmission method and device, which are used to solve the problem that the related BIER technology cannot allow traffic to be forwarded through the planned path.
  • the embodiment of the present invention provides a packet transmission method, including: a BIER ingress node encapsulates a characteristic traffic identifier of a predetermined traffic and a planned path information to a BIER packet; and a BIER ingress node transmits the BIER packet according to the planned path information.
  • the embodiment of the present invention further provides a message transmission method, including: a BIER node receives a BIER message; when the BIER message carries a feature traffic identifier and a planned path information, the BIER node transmits the BIER according to the planned path information. Message.
  • the embodiment of the present invention further provides a message transmission apparatus, which is applied to a BIER ingress node, and includes: a BIER encapsulation module, configured to encapsulate a characteristic traffic identifier of a predetermined traffic and a planned path information to a BIER message; and a BIER forwarding module is set according to The planning path information is used to transmit the BIER message.
  • a BIER encapsulation module configured to encapsulate a characteristic traffic identifier of a predetermined traffic and a planned path information to a BIER message
  • a BIER forwarding module is set according to The planning path information is used to transmit the BIER message.
  • the embodiment of the present invention further provides a message transmission apparatus, which is applied to a BIER node, and includes: a BIER receiving module, configured to receive a BIER message; and a BIER forwarding module, configured to be the BIER report.
  • a message transmission apparatus which is applied to a BIER node, and includes: a BIER receiving module, configured to receive a BIER message; and a BIER forwarding module, configured to be the BIER report.
  • the embodiment of the invention further provides a computer readable storage medium storing computer executable instructions, which are implemented when the computer executable instructions are executed to implement the message transmission method on the BIER ingress node side.
  • the embodiment of the present invention further provides a computer readable storage medium storing computer executable instructions, where the computer executable instructions are executed to implement the message transmission method on the BIER node side.
  • the BIER ingress node encapsulates the characteristic traffic identifier of the predetermined traffic and the planned path information to the BIER packet; the BIER ingress node transmits the BIER packet according to the planned path information.
  • the packet is transmitted according to the planned path in the BIER network, so that the link can be fully utilized without wasting network bandwidth.
  • the BIER node receives the BIER message; when the BIER message carries the feature traffic identifier and the planned path information, the BIER node transmits the BIER message according to the planned path information.
  • traffic in the BIER network can be forwarded according to the planned path, which makes up for the shortcomings of the BIER domain that cannot be scheduled according to the planned path after the resource cannot be scheduled.
  • the BIER node forms a forwarding entry of the feature traffic identifier according to the feature traffic identifier and the planned path information.
  • the BIER node receives the BIER packet carrying the characteristic traffic identifier again, the BIER node transmits the BIER packet according to the forwarding entry of the characteristic traffic identifier.
  • the embodiment of the present invention automatically generates a forwarding entry according to the feature traffic identifier and the planned path information, and the subsequent packet can encapsulate the feature traffic identifier to complete the planned path forwarding in the BIER network.
  • the multicast path and the unicast traffic can complete the planned path forwarding function in the BIER network, and the planned path of the feature traffic identifier is automatically established.
  • the embodiment of the invention greatly expands the applicable scenario and deployment environment of the BIER technology, and has good adaptability and development prospects.
  • FIG. 1 is a schematic diagram of forwarding of a BIER network in the related art
  • FIG. 2 is a flowchart of a message transmission method according to an embodiment of the present invention.
  • FIG. 3 is another flowchart of a packet transmission method according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a BIER network planning path according to an embodiment of the present invention.
  • FIG. 5 is an optional flowchart of a packet transmission method according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a message transmission apparatus according to an embodiment of the present invention.
  • FIG. 7 is another schematic diagram of a message transmission apparatus according to an embodiment of the present disclosure.
  • FIG. 8 is still another schematic diagram of a message transmission apparatus according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of a network for forwarding a predetermined traffic and normal traffic according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of a network in which a predetermined traffic is forwarded by an Equal Cost Multipath Routing (ECMP) link according to an embodiment of the present invention
  • FIG. 11 is a schematic diagram of a network in which a hybrid network implements planned path forwarding according to an embodiment of the present invention
  • FIG. 12 is a schematic diagram of a network for implementing a planned path forwarding in a BIER capable hybrid network according to an embodiment of the present invention
  • FIG. 13 is a schematic diagram of a package of a characteristic traffic identifier according to an embodiment of the present invention.
  • FIG. 14 is a first schematic diagram of encapsulation of planning path information according to an embodiment of the present invention.
  • 15 is a second schematic diagram of encapsulation of planning path information according to an embodiment of the present invention.
  • FIG. 16 is a schematic diagram of a network for carrying resource requirement information control processing according to an embodiment of the present invention.
  • FIG. 2 is a flowchart of a message transmission method according to an embodiment of the present invention. As shown in FIG. 2, the packet transmission method provided in this embodiment includes the following steps:
  • Step 201 The BIER ingress node encapsulates the characteristic traffic identifier of the predetermined traffic and the planned path information to the BIER packet.
  • Step 202 The BIER ingress node transmits the BIER message according to the planned path information.
  • the BIER ingress node After the BIER ingress node collects all the egress node information, the BIER ingress node encapsulates the characteristic traffic identifier allocated by the BIER ingress node for the scheduled traffic and the calculated or deployed planning path information in the BIER packet. Plan path information to transmit BIER messages.
  • the feature traffic identifier includes: a label set, a predetermined BIER header, or other identifier capable of indicating a predetermined traffic.
  • the feature traffic identifier is used to distinguish different traffic of different planning paths.
  • the planning path information is calculated according to a predetermined algorithm or generated by a configuration.
  • the planning path information is calculated by a BIER ingress node or a controller, Constrained Shortest Path First (CSPF), Path Computation Element (PCE), or other methods, or may be configured by generate.
  • CSPF Constrained Shortest Path First
  • PCE Path Computation Element
  • step 201 includes:
  • the BIER ingress node encapsulates the characteristic traffic identifier of the predetermined traffic and the planned path information to the BIER packet carrying the predetermined traffic;
  • the BIER ingress node encapsulates the characteristic traffic identifier of the predetermined traffic and the planned path information to the BIER packet that does not carry the predetermined traffic.
  • the feature traffic information and the planned path information may be encapsulated and sent along with the predetermined traffic, or may be separately sent to establish a planned path.
  • the BIER ingress node encapsulates the characteristic traffic identifier of the predetermined traffic to the BIER packet, and the method includes: the BIER ingress node encapsulates the characteristic traffic identifier of the predetermined traffic in front of the BIER packet header (for example, directly encapsulating the label set) Before the BIER header, or after the BIER header.
  • the BIER ingress node encapsulates the characteristic traffic identifier of the predetermined traffic after the BIER packet header
  • the method includes: the BIER ingress node directly encapsulates the characteristic traffic identifier of the predetermined traffic after the BIER packet header, before the official traffic Or, encapsulated in the form of Type-Length-Value (TLV, Type-Length-Value) after the BIER header.
  • TLV Type-Length-Value
  • the method further includes: the BIER ingress node is in a packet header of the BIER packet And carrying a characteristic traffic indication identifier, where the BIER packet carries a feature traffic identifier.
  • the implementation of the feature flow indication identifier in the BIER header is, for example, selecting an unused bit in the Reserved field. When the bit is set to 1, the BIER packet carries the characteristic traffic identifier. When the bit is set to 0, the BIER packet is not carried with the feature traffic identifier.
  • this application is not limited thereto. In other embodiments, other fields may be added in the BIER header to implement other fields.
  • the manner in which the planned path information is represented includes: a multi-level BIER network node list or an explicit path list of the planned path.
  • the display path list includes: a list of point-to-multipoint explicit path formats defined in the RFC4875 file, or a path list to all exit nodes.
  • P2MP point-to-multipoint
  • the BIER ingress node encapsulates the planned path information to the BIER packet, and the BIER ingress node encapsulates the path planning information in a TLV format after the BIER header.
  • the BIER ingress node carries a planned path indication identifier in the packet header of the BIER packet, and is used to indicate whether the BIER packet carries planned path information.
  • the implementation manner of adding the planning path indication identifier in the BIER packet header is similar to the implementation manner of adding the feature traffic indication identifier in the BIER packet header, and therefore is not described herein.
  • the method further includes: the BIER ingress node encapsulating the resource requirement information of the predetermined traffic into a BIER message, where the resource requirement information is used to identify a resource required by the predetermined traffic.
  • the resource requirement information includes a bandwidth requirement and an Access Control List (ACL).
  • ACL Access Control List
  • this application is not limited thereto.
  • the resource requirement information may also be in other forms. In practical applications, the resource requirement information may be used to identify resource guarantees such as bandwidth required for the predetermined traffic, and the granularity of the specific traffic may be further controlled.
  • the planned path information carries valid delay information, and is used to identify a validity period of the planned path.
  • the method further includes: the BIER ingress node according to the The feature traffic identifier and the planned path information form a forwarding entry of the feature traffic identifier. Then, when the BIER ingress node receives the BIER packet carrying the characteristic traffic identifier, the BIER packet is transmitted according to the forwarding entry of the characteristic traffic identifier.
  • the method further includes:
  • the BIER ingress node clears the corresponding traffic identifier of the write forwarding table. Entry; or,
  • the BIER ingress node clears the feature of the write forwarding table. The entry corresponding to the traffic identifier.
  • the effective delay may be carried by the planned path information or set in advance.
  • the method further includes: when the planned path information has a valid time delay, the BIER ingress node periodically transmits the BIER message carrying the feature flow identifier and the planned path information according to the effective delay. .
  • FIG. 3 is another flowchart of a message transmission method according to an embodiment of the present invention. As shown in FIG. 3, the packet transmission method provided in this embodiment includes the following steps:
  • Step 301 The BIER node receives the BIER message.
  • Step 302 When the BIER packet carries the feature traffic identifier and the planned path information, the BIER node transmits the BIER packet according to the planned path information.
  • the method further includes: the BIER node forming a forwarding entry of the feature traffic identifier according to the feature traffic identifier and the planned path information.
  • the method further includes: when the BIER node receives the BIER message carrying the feature traffic identifier again, the BIER node transmits the BIER message according to the forwarding entry of the feature traffic identifier.
  • the method further includes: when the planned path information has a valid time delay, the BIER The node processes the transit of the characteristic traffic identifier according to the valid delay Publish the item.
  • the planned path information carries, for example, valid delay information, and the effective delay is used to indicate the validity period of the planned path.
  • the planned path information may be permanently valid or may correspond to a default effective delay of a certain duration.
  • the BIER ingress node periodically sends a BIER packet carrying the feature traffic identifier and the planned path information according to the effective delay, the BIER node on the planned path performs periodic reset delay operation on the forwarding entry of the feature traffic identifier. .
  • the BIER node processes the forwarding entry of the feature traffic identifier according to the valid delay, including:
  • the BIER node clears the entry corresponding to the feature traffic identifier of the write forwarding table
  • the entry corresponding to the characteristic traffic identifier of the write forwarding table is cleared.
  • the feature traffic identifier includes: a label set, a predetermined BIER header, or other identifier capable of indicating a predetermined traffic.
  • the planning path information is encapsulated in a TLV format after the BIER packet header, where the BIER packet header carries a planning path indication identifier, and is used to indicate whether the BIER packet carries planned path information.
  • the method further includes: when the BIER packet carries the resource requirement information, the BIER node is the packet with the characteristic traffic identifier according to the resource requirement information. Reserve resources.
  • the method further includes: the BIER node decapsulating the BIER message and forwarding the decapsulated traffic out BIER network.
  • the planning path information does not affect the protocol information following the existing BIER header. After the BIER egress node processes the planning path information, normal protocol processing can be performed.
  • the BIER node transmits the BIER packet according to the planned path information, including: when there is an equal cost multipath routing (ECMP) on the planned path.
  • ECMP equal cost multipath routing
  • the BIER node selects the corresponding link to transmit the BIER message according to the Entropy field encapsulated in the BIER header.
  • the BIER node transmits the BIER packet according to the planned path information, including: when there is a non-BIER node on the planned path, the BIER node closest to the non-BIER node passes the non-BIER in a tunnel forwarding manner. The node transmits the BIER message to the next BIER node.
  • the BIER node transmits the BIER packet according to the planned path information, where: when there is a BIER node that does not support the planned path forwarding function, the BIER does not support the planned path forwarding function.
  • the BIER node that supports the planned path forwarding function in the tunnel forwarding mode transmits the BIER packet to the next BIER node that supports the planned path forwarding function through the BIER node that does not support the planned path forwarding function.
  • FIG. 4 is a schematic diagram of a BIER network planning path according to an embodiment of the present invention. As shown in FIG. 4, for a predetermined traffic, packet transmission is implemented according to the following planning path: BFIR1 - BFR4 - BFR5 - BFER3 / BFER6 / BFER8.
  • the description of this embodiment is as follows:
  • the destination node BFER3/BFER6/BFER8 is first encapsulated according to the existing BIER header encapsulation technology; secondly, the characteristic traffic identifier assigned by the BFIR1 to the predetermined traffic is encapsulated before the BIER header.
  • the BIER packet header where the feature traffic identifier may be a set including the label of the ingress node itself and an upstream label allocated to the predetermined traffic, or may be other forms; again, according to the obtained planned path information, the encapsulation plan The path information is sent to the BIER header, and the corresponding flag is set.
  • BFIR1 forwards the packet according to the planned path information, and generates a corresponding forwarding entry according to the characteristic traffic identifier.
  • the BIER intermediate node BFR4/BFR5 and the BIER exit node BFER3/BFER6/BFER8 generate a corresponding forwarding entry according to the characteristic traffic identifier and the planned path information of the BIER packet, and forward the BIER message according to the planned path information;
  • the BIER egress node also decapsulates the BIER message and forwards the decapsulated traffic out of the BIER network.
  • each BIER node forwards the traffic according to the established planning path according to the established forwarding entry when receiving the traffic carrying the characteristic traffic identifier.
  • the routing path completes the forwarding in the BIER network and automatically establishes a planning path on the BIER node. In this way, various deployment requirements such as resource scheduling can be adapted, and redundant links are fully utilized, which is highly practical and adaptable.
  • FIG. 5 is an optional flowchart of a packet transmission method according to an embodiment of the present invention. As shown in FIG. 5, the embodiment is applied to a BIER node in a BIER network, and the method includes the following steps:
  • Step 501 When the BIER node receives the BIER packet and needs to perform the forwarding process, the BIER node first checks whether the local forwarding entry is consistent with the characteristic traffic identifier of the BIER packet.
  • Step 502 If the BIER node has a forwarding entry that is consistent with the feature traffic identifier, forward the forwarding entry according to the forwarding entry.
  • Step 503 If the BIER node does not have a forwarding entry that is consistent with the feature traffic identifier, check whether the BIER packet has planned path information (such as a planned path list).
  • planned path information such as a planned path list
  • Step 504 If there is neither the forwarding entry corresponding to the feature traffic identifier nor the planned path information, perform normal BIER forwarding processing.
  • Step 505 If the planned path information exists, processing is performed according to the planned path information, and is forwarded to the next BIER node specified in the planned path information, and corresponding forwarding entries are generated according to the characteristic traffic identifier.
  • Step 506 Determine if the BIER node is one of the BIER exit nodes
  • Step 507 If the BIER node is one of the BIER egress nodes, the BIER packet is decapsulated and forwarded out of the BIER network.
  • the feature traffic information may be a tag set, a predetermined BIER header, or other identifier that can accurately indicate the predetermined traffic.
  • the planning path information may be an explicit path list or a multi-level path node set.
  • the embodiment of the present invention further provides a message transmission apparatus, which is applied to a BIER ingress node, and includes: a BIER encapsulation module, configured to encapsulate a characteristic traffic identifier of a predetermined traffic and a planned path information to a BIER message; a BIER forwarding module, setting The BIER message is transmitted according to the planned path information.
  • a BIER encapsulation module configured to encapsulate a characteristic traffic identifier of a predetermined traffic and a planned path information to a BIER message
  • a BIER forwarding module setting The BIER message is transmitted according to the planned path information.
  • the BIER forwarding module is further configured to form a forwarding entry of the feature traffic identifier according to the feature traffic identifier and the planned path information.
  • the BIER encapsulation module is further configured to encapsulate the resource requirement information in the planning path information when the predetermined traffic needs resource reservation.
  • FIG. 6 is a schematic diagram of a message transmission apparatus according to an embodiment of the present invention.
  • the message transmission apparatus provided in this embodiment is applied to a BIER ingress node, and includes a BIER encapsulation module 61 and a BIER forwarding module 62.
  • the BIER encapsulation module 61 includes, for example, a BIER feature flow identification encapsulation unit 601 and a BIER planning path information encapsulation unit 602.
  • the BIER feature traffic identifier encapsulating unit 601 is configured to encapsulate a characteristic traffic identifier of a predetermined traffic to facilitate forwarding of the BIER network node and planning path generation.
  • the BIER planning path information encapsulating unit 602 is configured to encapsulate planning path information of a predetermined traffic, and guides the planning path generation of the BIER network node.
  • the BIER forwarding module 62 is configured to perform BIER packet forwarding processing according to the feature traffic identifier and/or the planned path information.
  • the embodiment of the present invention further provides a message transmission apparatus, which is applied to a BIER node, and includes: a BIER receiving module, configured to receive a BIER message; and a BIER forwarding module, configured to carry a feature traffic identifier when the BIER message carries When the path information is planned, the BIER message is transmitted according to the planned path information.
  • the apparatus when the BIER node is a BIER egress node, the apparatus further includes: a BIER decapsulation module, configured to decapsulate the received BIER message and forward the decapsulated traffic out of the BIER network.
  • a BIER decapsulation module configured to decapsulate the received BIER message and forward the decapsulated traffic out of the BIER network.
  • the BIER forwarding module is further configured to form a forwarding entry of the feature traffic identifier according to the feature traffic identifier and the planned path information.
  • the BIER forwarding module is further configured to reserve resources for the traffic with the characteristic traffic identifier according to the resource requirement information carried by the BIER packet.
  • FIG. 7 is another schematic diagram of a message transmission apparatus according to an embodiment of the present invention.
  • the message transmission apparatus provided in this embodiment is applied to a BIER intermediate node, and includes a BIER receiving module 71 and a BIER forwarding module 72.
  • the BIER forwarding module 72 includes a BIER planning path generating unit 701.
  • the BIER planning path generating unit 701 is configured to generate a corresponding forwarding entry according to the planned path information and the feature traffic identifier; the BIER forwarding module 72 is configured to forward the BIER message according to the planned path, and perform a conventional BIER forwarding process.
  • the BIER forwarding module 72 can reserve the traffic with the characteristic traffic identifier. Resources.
  • FIG. 8 is still another schematic diagram of a message transmission apparatus according to an embodiment of the present invention.
  • the message transmission apparatus provided in this embodiment is applied to a BIER egress node, and includes a BIER receiving module 81, a BIER forwarding module 82, and a BIER decapsulation module 83.
  • the BIER forwarding module 82 includes, for example, a BIER planning path generating unit 801, and is configured to generate a corresponding forwarding entry according to the feature traffic identifier and the planned path information.
  • the BIER decapsulation module 83 is configured to restore the BIER message to the original protocol traffic and forward it out of the BIER network.
  • the BIER forwarding module 82 is configured to perform packet forwarding according to path planning information and/or feature traffic identifiers, and perform normal BIER forwarding processing.
  • modules may be a combination of software and/or hardware that implements predetermined functions. This application is not limited thereto.
  • FIG. 9 is a schematic diagram of a network for forwarding predetermined traffic and normal traffic according to an embodiment of the present invention.
  • the forwarding of the planned path of the predetermined traffic is achieved.
  • the planned path of the predetermined traffic is as follows: BFIR1 - BFR4 - BFR5 - BFER3 / BFER6 / BFER8.
  • the forwarding destinations for common traffic are BFER3 and BFER8. This embodiment is described as follows:
  • Step 901 At the ingress node BFIR1, the BIER encapsulation module separately encapsulates the predetermined traffic and the common traffic, and the predetermined traffic encapsulation destination node BFER3/BFER6/BFER8, and then encapsulates the planned path information; the common traffic encapsulation destination node BFER3/BFER8, which encapsulates the two packages
  • the traffic packet is sent to the BIER forwarding module of BFIR1.
  • Step 902 The BIER forwarding module of the BFIR1 receives the traffic packet, and forwards the traffic to the next hop BFR2 and BFR7 according to the destination node information.
  • the BIER forwarding module of the BFIR1 receives the traffic packet, and forwards the traffic to the next hop BFR2 and BFR7 according to the destination node information.
  • Step 903 After the BIER message carrying the normal traffic reaches BFR2 and BFR7, BFR2 and BFR7 forward the BIER message to the next hops BFER3 and BFER8 according to the normal BIER forwarding process;
  • Step 904 After the BIER message carrying the predetermined traffic arrives at the BFR4, the BFR4 first checks the locality. If there is a forwarding entry corresponding to the feature traffic identifier, the forwarding entry is forwarded according to the feature traffic identifier forwarding entry. If there is no corresponding forwarding entry, the next hop BFR5 is forwarded to the planned path according to the planned path information. And generating a forwarding entry corresponding to the feature traffic identifier;
  • Step 905 After the BIER message carrying the normal traffic arrives at the BFER3 and the BFER8, the BFER3 and the BFER8 decapsulate the BIER message and forward the BIER network according to the normal forwarding process.
  • Step 906 After the BIER packet carrying the predetermined traffic arrives at the BFR5, the processing of the BFR5 is the same as that of the BFR4. Therefore, the BFR5 generates the forwarding entry corresponding to the feature traffic identifier, and forwards the BIER packet to the BFER3/BFER6/. BFER8;
  • Step 907 After the BIER message carrying the predetermined traffic reaches the BFER3/BFER6/BFER8, the BFER3/BFER6/BFER8 process generates the forwarding entry corresponding to the feature traffic identifier with the BFR4, BFER3/BFER6/BFER8, and decapsulates the BIER message. Forward the BIER network.
  • FIG. 10 is a schematic diagram of a network in which predetermined traffic is forwarded on an ECMP link according to an embodiment of the present invention.
  • the generation and forwarding of the following planning paths are implemented: BFIR1 - BFR4 - BFR5 - BFER3 / BFER6 / BFER8.
  • the selection operation is performed when there are multiple ECMP links according to the Entropy field of the ingress node, so that the predetermined traffic is always transmitted on the path. Therefore, BFR4 selects a corresponding link to reach BFR5 according to the forwarding entry generated by the characteristic traffic identifier, and does not cause the same flow to be forwarded through different ECMP links.
  • FIG. 11 is a schematic diagram of a network in which a hybrid network implements planned path forwarding according to an embodiment of the present invention.
  • the scheduled traffic exit node is BFER3/BFER6/BFER8, and the planned path is: BFIR1 - BFR4 - BFR5 - BFER3 / BFER6 / BFER8.
  • the encapsulation and forwarding process is the same as the embodiment shown in FIG. 9. When a BIER packet carrying a predetermined traffic is forwarded from BFR4 to BFR5, it will be forwarded through the tunnel.
  • BFR4 can directly see BFR5 as the next hop of the tunnel.
  • the traffic of R9 and R10 is transmitted by the Internet Protocol (IP)/User Datagram Protocol (UDP)/Generic Routing Encapsulation (GRE)/Multi-Protocol Label Switching (MPLS, Multi- Protocol Label Switching) is performed in tunnel mode, and R9 and R10 will not perform BIER related processing.
  • IP Internet Protocol
  • UDP User Datagram Protocol
  • GRE Generic Routing Encapsulation
  • MPLS Multi-Protocol Label Switching
  • FIG. 12 is a network for implementing a planned path forwarding of a BIER capable hybrid network according to an embodiment of the present invention.
  • Schematic diagram As shown in Figure 12, although Node BFR4 supports BIER forwarding, it does not support the BIER planning path generation and forwarding processing described in this paper. Therefore, between BFIR1 and BFR5, the scheduled traffic forwarding is also done through tunneling, on BFIR1. Can directly see BFR5 as the next hop of the tunnel.
  • the encapsulation mode can be MPLS tunnel mode. BFR4 will see the normal BIER encapsulation header, no need to plan path generation and forwarding, only need to support ordinary BIER forwarding capability.
  • FIG. 13 is a schematic diagram of a package of a feature flow identification according to an embodiment of the invention.
  • the feature traffic identifier may be a plurality of tag sets.
  • Label 1 and Label 2 may respectively represent the node label of BFIR1 and the upstream label assigned to the predetermined traffic.
  • FIG. 14 is a first schematic diagram of encapsulation of planning path information according to an embodiment of the present invention. As shown in FIG. 14, the entire planned path is carried in the planned path information, wherein the planned path representing the predetermined traffic is BFIR1 - BFR4 - BFR5 - BFER3 / BFER6 / BFER8. It should be noted that since BFIR1 itself is the first node, the BFIR1 node can also be displayed in the path. The path is directly BFR4-BFR5-BFER3/BFER6/BFER8.
  • FIG. 15 is a second schematic diagram of encapsulation of planning path information according to an embodiment of the present invention.
  • the entire planning path is carried in the planning path information, wherein the planning path representing the predetermined traffic is: BFIR1 - BFR4 - BFR5 - BFER3, BFIR1 - BFR4 - BFR5 - BFER6, BFIR1 - BFR4 - BFR5 - BFER8 .
  • the BFIR1 node can also be displayed in the path.
  • FIG. 16 is a schematic diagram of a network carrying resource requirement information control processing according to an embodiment of the present invention.
  • the path of Figure 4 is automatically established, and the bandwidth of the feature traffic needs to be guaranteed.
  • the traffic must guarantee the transmission bandwidth of 100M.
  • the bandwidth guarantee is also established successfully.
  • Each node participating in the path establishment will reserve bandwidth for the traffic with the characteristic traffic identifier, thereby realizing resource guarantee for the feature traffic.
  • the planned path forwarding of the traffic can be completed in the BIER network, which avoids the disadvantage that the BIER network can only be fully utilized according to the shortest path forwarding.
  • the traffic can be completed in the BIER network and the path is automatically established, which makes the BIER technology more abundant, and has good adaptability and development prospects.
  • the embodiment of the invention further provides a computer readable storage medium storing computer executable instructions, which are implemented when the computer executable instructions are executed to implement the message transmission method on the BIER ingress node side.
  • the embodiment of the present invention further provides a computer readable storage medium storing computer executable instructions, where the computer executable instructions are executed to implement the message transmission method on the BIER node side.
  • the method according to the above embodiments can be implemented by means of software plus a necessary general hardware platform, or by hardware, but in many cases, the former is more Good implementation.
  • the technical solution of the present application which is essential or contributes to the related art, may be embodied in the form of a software product stored in a storage medium (such as ROM/RAM, disk, CD-ROM).
  • the instructions include a number of instructions for causing a terminal device (which may be a cell phone, a computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present application.
  • modules or steps of the present application can be implemented by a general-purpose computing device, which can be centralized on a single computing device or distributed over a network of multiple computing devices. They may be implemented by program code executable by the computing device such that they may be stored in the storage device for execution by the computing device and, in some cases, may be performed in a different order than that illustrated herein. Or the steps described, either separately as individual integrated circuit modules, or as a plurality of modules or steps in a single integrated circuit module. Thus, the application is not limited to any particular combination of hardware and software.
  • the embodiment of the present invention provides a packet transmission method and device, which can implement a packet transmission according to a planned path in a BIER network, so as to fully utilize a link without wasting network bandwidth.

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

L'invention concerne un procédé de transmission de paquet qui comprend les opérations suivantes : un nœud d'entrée BIER encapsule un identificateur de trafic de caractéristique pour un trafic prédéterminé et des informations de chemin planifié dans un paquet BIER ; et le nœud d'entrée BIER transmet le paquet BIER selon les informations de chemin planifié. La solution est utilisée pour résoudre le problème selon lequel le trafic ne peut pas être transféré par l'intermédiaire d'un chemin planifié dans des technologies BIER associées.
PCT/CN2016/086768 2015-10-30 2016-06-22 Procédé et appareil de transmission de paquet WO2016198013A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510729233.XA CN106656794B (zh) 2015-10-30 2015-10-30 一种报文传输方法及装置
CN201510729233.X 2015-10-30

Publications (1)

Publication Number Publication Date
WO2016198013A1 true WO2016198013A1 (fr) 2016-12-15

Family

ID=57503056

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/086768 WO2016198013A1 (fr) 2015-10-30 2016-06-22 Procédé et appareil de transmission de paquet

Country Status (2)

Country Link
CN (1) CN106656794B (fr)
WO (1) WO2016198013A1 (fr)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018171396A1 (fr) * 2017-03-22 2018-09-27 中兴通讯股份有限公司 Procédé, dispositif, et système de transmission de données
CN112187648A (zh) * 2020-08-24 2021-01-05 中盈优创资讯科技有限公司 组播报文转发方法及装置
CN112491729A (zh) * 2020-09-22 2021-03-12 中兴通讯股份有限公司 一种数据处理方法、装置、存储介质及电子装置
CN112511988A (zh) * 2020-03-06 2021-03-16 中兴通讯股份有限公司 报文转发方法、设备、系统、网络设备和存储介质
EP3806409A4 (fr) * 2018-06-27 2021-07-28 Huawei Technologies Co., Ltd. Procédé, dispositif et système de transmission de paquets

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108965134B (zh) * 2017-05-23 2022-04-29 中兴通讯股份有限公司 报文转发方法及装置
CN109391478B (zh) * 2017-08-10 2021-09-10 中兴通讯股份有限公司 一种组播业务控制方法和装置、计算机可读存储介质
CN109756425B (zh) * 2017-11-07 2022-01-18 中国电信股份有限公司 组播转发方法、装置以及bfr
CN114095422A (zh) 2018-03-29 2022-02-25 华为技术有限公司 一种报文发送的方法、网络节点和系统
CN110324263B (zh) 2018-03-30 2021-06-29 华为技术有限公司 传输组播报文的方法、设备和系统
CN110417657B (zh) 2018-04-27 2022-05-17 华为技术有限公司 一种处理组播数据报文的方法及装置
CN113595913B (zh) * 2018-11-02 2023-02-14 华为技术有限公司 报文转发的方法、发送报文的装置和接收报文的装置
CN113765809A (zh) 2020-06-05 2021-12-07 华为技术有限公司 Bier组播流量的统计方法、设备以及系统
CN114301839B (zh) * 2020-09-22 2023-05-12 华为技术有限公司 一种组播报文传输方法及装置
CN115473847A (zh) * 2021-06-10 2022-12-13 中兴通讯股份有限公司 转发方法、转发系统、电子设备和计算机可读存储介质
CN116232989A (zh) * 2021-12-02 2023-06-06 中兴通讯股份有限公司 Bier报文转发方法、装置及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101453407A (zh) * 2007-12-03 2009-06-10 华为技术有限公司 路由器及路径消息处理的方法
US20150078380A1 (en) * 2013-09-17 2015-03-19 Cisco Technology, Inc. Bit Indexed Explicit Replication For Layer 2 Networking
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9438432B2 (en) * 2013-09-17 2016-09-06 Cisco Technology, Inc. Bit indexed explicit replication packet encapsulation
US9806897B2 (en) * 2013-09-17 2017-10-31 Cisco Technology, Inc. Bit indexed explicit replication forwarding optimization
WO2015042156A1 (fr) * 2013-09-17 2015-03-26 Cisco Technology, Inc. Répétition explicite indexée de bit
US10003494B2 (en) * 2013-09-17 2018-06-19 Cisco Technology, Inc. Per-prefix LFA FRR with bit indexed explicit replication
US11451474B2 (en) * 2013-09-17 2022-09-20 Cisco Technology, Inc. Equal cost multi-path with bit indexed explicit replication
US9544230B2 (en) * 2013-09-17 2017-01-10 Cisco Technology, Inc. Migration support for bit indexed explicit replication

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101453407A (zh) * 2007-12-03 2009-06-10 华为技术有限公司 路由器及路径消息处理的方法
US20150078380A1 (en) * 2013-09-17 2015-03-19 Cisco Technology, Inc. Bit Indexed Explicit Replication For Layer 2 Networking
CN104811387A (zh) * 2014-01-24 2015-07-29 思科技术公司 具有位索引显式复制的等价多路径

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018171396A1 (fr) * 2017-03-22 2018-09-27 中兴通讯股份有限公司 Procédé, dispositif, et système de transmission de données
CN108632678A (zh) * 2017-03-22 2018-10-09 中兴通讯股份有限公司 一种数据传输方法、装置及系统
EP3806409A4 (fr) * 2018-06-27 2021-07-28 Huawei Technologies Co., Ltd. Procédé, dispositif et système de transmission de paquets
US11627084B2 (en) 2018-06-27 2023-04-11 Huawei Technologies Co., Ltd. Packet sending method, device, and system
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 中兴通讯股份有限公司 报文转发方法、设备、系统、网络设备和存储介质
CN112187648A (zh) * 2020-08-24 2021-01-05 中盈优创资讯科技有限公司 组播报文转发方法及装置
CN112491729A (zh) * 2020-09-22 2021-03-12 中兴通讯股份有限公司 一种数据处理方法、装置、存储介质及电子装置

Also Published As

Publication number Publication date
CN106656794A (zh) 2017-05-10
CN106656794B (zh) 2021-02-09

Similar Documents

Publication Publication Date Title
WO2016198013A1 (fr) Procédé et appareil de transmission de paquet
CN109756425B (zh) 组播转发方法、装置以及bfr
CN111385206B (zh) 报文转发的方法、网络系统、相关设备及计算机存储介质
CN105245452B (zh) 多协议标签交换流量工程隧道建立方法及设备
US10911262B2 (en) Deterministic forwarding across L2 and L3 networks
US8064440B2 (en) Technique for avoiding IP lookup with multipoint-to-multipoint label switched paths
US8908527B2 (en) Using context labels to scale MAC tables on computer network edge devices
US20160006614A1 (en) Source Routing Using Path Computation Elements
WO2017124709A1 (fr) Procédé d'établissement d'un tunnel d'ingénierie de trafic et dispositif
US9184935B2 (en) Network communication method and network node device
EP3364613B1 (fr) Procédé et dispositif pour transmettre un trafic via un trajet spécifié
WO2017059708A1 (fr) Procédé d'émission et procédé de réception d'informations bier, et dispositif associé
US11888726B2 (en) Path establishment method and controller
US20120057505A1 (en) Method, apparatus, and system for setting up bidirectional point-to-multipoint label switched path
WO2012106986A1 (fr) Procédé de négociation d'une étiquette de flux; dispositif et système connexes
US20230370298A1 (en) Message header processing method and apparatus, storage medium and electronic device
CN111614556B (zh) 一种基于bier的双向转发检测会话创建方法及相关设备
WO2017211164A1 (fr) Procédé, appareil et système de détermination de tunnel de chemin à commutation d'étiquettes entre systèmes autonomes
EP3863233A1 (fr) Procédé et dispositif utilisés pour un réseau privé virtuel ethernet
WO2021174958A1 (fr) Procédé de transfert de message, dispositif, système, dispositif de réseau et support de stockage
WO2013139270A1 (fr) Procédé, dispositif et système pour implémenter un réseau privé virtuel en couche 3
CN114465946A (zh) 获取转发表项的方法、装置以及系统
CN107294859B (zh) 一种信息传递方法、装置及系统
US8243728B2 (en) Apparatus and method for transmitting packets in a packet switched network
WO2018010566A1 (fr) Procédé de notification d'informations, procédé et dispositif de génération d'éléments de transfert

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

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

Country of ref document: EP

Kind code of ref document: A1