WO2016198012A2 - 一种通过指定路径传输流量的方法和装置 - Google Patents

一种通过指定路径传输流量的方法和装置 Download PDF

Info

Publication number
WO2016198012A2
WO2016198012A2 PCT/CN2016/086762 CN2016086762W WO2016198012A2 WO 2016198012 A2 WO2016198012 A2 WO 2016198012A2 CN 2016086762 W CN2016086762 W CN 2016086762W WO 2016198012 A2 WO2016198012 A2 WO 2016198012A2
Authority
WO
WIPO (PCT)
Prior art keywords
node
information
specified path
bit
traffic
Prior art date
Application number
PCT/CN2016/086762
Other languages
English (en)
French (fr)
Other versions
WO2016198012A3 (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 中兴通讯股份有限公司
Priority to EP16806910.2A priority Critical patent/EP3364613B1/en
Publication of WO2016198012A2 publication Critical patent/WO2016198012A2/zh
Publication of WO2016198012A3 publication Critical patent/WO2016198012A3/zh

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/34Source routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/16Multipoint routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/30Routing of multiclass traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/38Flow based routing

Definitions

  • This document relates to, but is not limited to, the field of data communications, and more particularly to a method and apparatus for transmitting traffic through a specified path.
  • BIER Bit Indexed Explicit Replication
  • the core idea of BIER technology is to represent the nodes in the network with 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 header labels all the egress nodes of the multicast stream in the form of BIT bits.
  • the intermediate network routes according to the BIT bits, and the guaranteed traffic can be sent to all egress nodes.
  • the information obtained by the intermediate network for all nodes is extended by the traditional inter-domain routing protocol OSPF (Open Shortest Path First) and ISIS (intermediate system to intermediate system). Carrying information about the BIER protocol, such as the BIT bit, completes the transmission of information, and calculates the route to all the egress nodes according to the calculation path of OSPF and ISIS, thereby forming a route of the BIER.
  • OSPF Open Shortest Path First
  • ISIS intermediate system to intermediate system
  • BIER technology enables the transmission of multicast traffic, and greatly simplifies the intermediate network Control management, but this technology has the disadvantage of not being able to implement the function of transmitting according to the specified path for a specific traffic, that is, it cannot calculate a specific path, so that specific traffic can be forwarded in the network in a guaranteed resource manner. Therefore, how to enable BIER technology to provide specific traffic guarantee services for specific traffic, so as to realize the differentiated transmission of different traffic in the intermediate network, is an urgent problem to be solved.
  • the embodiment of the invention provides a method and device for transmitting traffic by specifying a path, which can realize differentiated transmission of different traffic in the intermediate network.
  • a method of transmitting traffic through a specified path including:
  • the bit index explicitly copies the specified path information that the ingress node of the BIER network sends traffic.
  • the specified path information is obtained by routing calculation by an ingress node or a controller, or is generated according to configuration information.
  • the specified path information is transmitted by using the specified path information after the packet header of the BIER packet.
  • the packet header of the BIER packet further includes a traffic constraint identifier, configured to indicate whether the specified path information is included.
  • the specified path information is a tree list that is rooted at the ingress node and reaches all the egress nodes, and the hierarchical information of the tree list is used to indicate the level at which each node is located.
  • the node identifier in the specified path information is forwarded by the bit identifier forwarding router identifier BFR-ID mode.
  • the BFR-ID is represented by a bit string of the same level in the specified path information.
  • the node set of the same level in the specified path information is represented by a bit string
  • Different levels are identified using a uniform bit string length.
  • the node set of the same level in the specified path information is represented by a bit string
  • different levels are identified by using different bit string lengths.
  • the specified path information is represented by a list formed by a BFR-ID of the node.
  • the specified path information is represented by using a bit index forwarding router number BFR-Prefix list.
  • the hierarchical information in the specified path information is the same as the multi-level information of the point-to-multipoint, or is hierarchical information of the preset unicast traffic;
  • the hierarchical information in the specified path information includes different sets of scalable nodes that are distinguished by different identifier values.
  • a method of transmitting traffic through a specified path including:
  • the bit index explicitly copies the specified path information that the BIER network node obtains to obtain traffic
  • the BIER network node sends a BIER message of the traffic according to the specified path information.
  • the BIER network node sends the BIER packet of the traffic according to the specified path information, including:
  • the BIER network node continues to forward the BIER message of the traffic to the next-level node of the local node in the specified path information;
  • the BIER network node When the BIER network node is an egress node, the BIER network node forwards the BIER packet of the traffic out of the BIER network, and clears information about the node in the egress node information of the traffic.
  • the BIER network node continues to forward the BIER message of the traffic to the next-level node of the node in the specified path information, including:
  • the BIER network node obtains, from the BIER forwarding table, an entry of the node whose current hop level is the current level of the specified path information;
  • the calculating by using the bit information in the obtained entry and the bit information of the egress node, to obtain the bit information of the reserved node, including:
  • calculating bit information of the reserved node, bit information in the obtained entry, and bit position information of the egress node including:
  • bit information in the obtained entry and the bit information of the egress node are ANDed, and the result obtained by the operation and the bit string of the set of reserved nodes are ORed to obtain a calculation result.
  • the modifying the level information of the specified path information includes:
  • the BIER network node sends the BIER message of the traffic according to the specified path information, including:
  • the BIER network node When the next level node of the node in the specified path information is a node that does not support BIER forwarding, or a node that only supports BIER forwarding and does not support the BIER specified path, the BIER network node establishes a tunnel and The nodes in the specified path information are connected under the lower level node and can support the processing of the BIER specified path.
  • the method further includes: when the link in the specified path through which the traffic passes has an equal-cost routing link, indicating that the traffic is transmitted by using the equal-cost routing link.
  • An apparatus for transmitting traffic through a specified path, setting a bit index to explicitly copy a BIER network Ingress nodes including:
  • the first sending module is configured to send the specified path information through which the traffic passes.
  • the specified path information is obtained by routing calculation by an ingress node or a controller, or is generated according to configuration information.
  • the specified path information is transmitted by using the specified path information after the packet header of the BIER packet.
  • the packet header of the BIER packet further includes a traffic constraint identifier, configured to indicate whether the specified path information is included.
  • the specified path information is a tree list that is rooted at the ingress node and reaches all the egress nodes, and the hierarchical information of the tree list is used to indicate the level at which each node is located.
  • the node identifier in the specified path information is forwarded by the bit identifier forwarding router identifier BFR-ID mode.
  • the BFR-ID is represented by a bit string of the same level in the specified path information.
  • the node set of the same level in the specified path information is represented by a bit string
  • different levels are identified by using a uniform bit string length.
  • the node set of the same level in the specified path information is represented by a bit string
  • different levels are identified by using different bit string lengths.
  • the specified path information is represented by a list formed by a BFR-ID of the node.
  • the specified path information is represented by a BFR-Prefix list.
  • the hierarchical information in the specified path information is the same as the multi-level information of the point-to-multipoint, or is hierarchical information of the preset unicast traffic;
  • the hierarchical information in the specified path information includes different sets of scalable nodes that are distinguished by different identifier values.
  • a device for transmitting traffic through a specified path, setting a bit index to explicitly copy a BIER network node including:
  • Obtaining a module configured to obtain specified path information through which the traffic passes;
  • the second sending module is configured to send the BIER message of the traffic according to the specified path information.
  • the second sending module includes:
  • the first processing sub-module is configured to continue forwarding the BIER message of the traffic to the next-level node of the node in the specified path information
  • the BIER packet of the traffic is forwarded out of the BIER network, and the information of the node in the egress node information of the traffic is cleared.
  • the first processing submodule includes:
  • An obtaining unit configured to obtain, from the BIER forwarding table, an entry of a node whose current hop node is the current level of the specified path information
  • the calculating unit is configured to perform bit calculation using the bit information in the obtained entry and the bit information of the egress node to obtain bit position information of the reserved node;
  • a processing unit configured to calculate bit information of the reserved node, bit information in the obtained entry, and bit position information of the egress node, and modify the hierarchical information of the specified path information, and continue to forward the BIER message for traffic.
  • the calculating unit uses the bit information in the obtained entry to calculate the bit position information of the egress node, and obtains the bit bit information of the reserved node, including:
  • the calculating, by the processing unit, the bit information of the reserved node, the bit information in the obtained entry, and the bit information of the egress node include:
  • bit information in the obtained entry and the bit information of the egress node are ANDed, and the result obtained by the operation and the bit string of the set of reserved nodes are ORed to obtain a calculation result.
  • the processing unit modifies the hierarchical information of the specified path information by: include:
  • the sending, by the second sending module, the BIER message of the traffic according to the specified path information includes:
  • next-level node of the node in the specified path information is a node that does not support BIER forwarding, or a node that only supports BIER forwarding and does not support the BIER specified path
  • the tunnel and the specified path information are established.
  • the middle level is connected under the lower level node to support nodes that process the BIER specified path.
  • the second sending module is further configured to indicate that the traffic is transmitted by using the equal-cost routing link when the link in the specified path through which the traffic passes has an equal-cost routing link.
  • a computer readable storage medium storing computer executable instructions for performing the above method.
  • the embodiment of the present invention can perform forwarding in the BIER network according to the specified path, can adapt various deployment requirements such as resource scheduling, and fully utilize redundant links. Highly practical and adaptable.
  • FIG. 1 is a schematic diagram of traffic forwarding in a BIER network in the related art
  • FIG. 2 is a flowchart of a method for transmitting traffic by using a specified path according to an embodiment of the present invention
  • FIG. 3 is a flow chart of forwarding processing according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of determining path forwarding according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of a network for forwarding specific traffic and common traffic according to an embodiment of the present invention
  • FIG. 6 is a schematic diagram of a network in which an specific traffic is forwarded on an ECMP (Equal-Cost Multipath) link according to an embodiment of the present invention
  • FIG. 7 is a schematic diagram of a network in which a hybrid network implements specified path forwarding according to an embodiment of the present invention.
  • FIG. 8 is a schematic diagram of a network for implementing a specified path forwarding by a BIER capable hybrid network according to an embodiment of the present invention
  • FIG. 9 is a schematic illustration of a BIER head in accordance with an embodiment of the present invention.
  • FIG. 10 is a schematic diagram 1 of a BIER extended specified path node list TLV (Type-Length-Value) according to an embodiment of the present invention
  • FIG. 11 is a second schematic diagram of a BIER extended specified path node list TLV according to an embodiment of the present invention.
  • FIG. 12 is a third schematic diagram of a BIER extended specified path node list TLV according to an embodiment of the present invention.
  • FIG. 13 is a fourth schematic diagram of a BIER extended specified path node list TLV according to an embodiment of the present invention.
  • FIG. 14 is a structural diagram of an apparatus for transmitting traffic through a specified path according to an embodiment of the present invention.
  • FIG. 1 is a schematic diagram of traffic forwarding in a BIER network in the related art. Take a multicast traffic as an example.
  • the entry is a BFIR (Bit-Forwarding Ingress Router), such as BFIR1 in Figure 1, and the BFE (Bit-Forwarding Egress Router).
  • BFER3, BFER6 and BFER8 in Figure 1 the BIER network also includes BFR (Bit-Forwarding Router), such as BFR2, BFR4, BFR5 and BFR7 in Figure 1, the traffic is forwarded in the BIER network.
  • BFR Bit-Forwarding Router
  • the shortest path is carried out, that is, the following shortest path to the BIER network exit:
  • the traffic is intended to be transmitted through the following path:
  • a method for transmitting traffic by using a specified path including:
  • the specified path information that the ingress node of the BIER network sends traffic is not limited
  • the method further includes: the specified path information that the ingress node of the BIER network generates the traffic.
  • the specified path information is obtained by routing calculation by an ingress node or a controller, or is generated according to configuration information.
  • the specified path information is transmitted by using the specified path information after the packet header of the BIER packet.
  • the packet header of the BIER packet further includes a traffic constraint identifier, configured to indicate whether the specified path information is included.
  • the specified path information is a tree list that is rooted at the ingress node and reaches all egress nodes, where the hierarchical information of the tree list is used to indicate the level at which each node is located.
  • the node identifier in the specified path information is identified by a BFR-ID (Bit-Forwarding Router Identifier).
  • the BFR-ID is represented by a bit string of the same level in the specified path information.
  • the node set of the same level in the specified path information is represented by a bit string
  • different levels are identified by using a uniform bit string length.
  • the specified path information is represented by a list formed by a BFR-ID of the node.
  • the specified path information is represented by using a bit index forwarding router number BFR-Prefix list.
  • the hierarchical information in the specified path information is the same as the multi-level information of the point-to-multipoint, or is hierarchical information of the preset unicast traffic;
  • the hierarchical information in the specified path information includes different sets of scalable nodes that are distinguished by different identification values.
  • the ingress node of the BIER network can make other nodes according to the specified path information that the traffic passes through in the network that can only use the shortest path to forward the traffic.
  • the specified path completes forwarding in the BIER network, can adapt to various deployment requirements such as resource scheduling, and fully utilizes redundant links, and has high practicability and adaptability.
  • FIG. 2 is a flowchart of a method for transmitting traffic by using a specified path according to an embodiment of the present invention.
  • the method shown in Figure 2 includes steps 201-202:
  • Step 201 The BIER network node obtains specified path information that the traffic passes through;
  • Step 202 The BIER network node sends a BIER packet of the traffic according to the specified path information.
  • the BIER network node sends the BIER packet of the traffic according to the specified path information, including:
  • the BIER network node continues to forward the BIER message of the traffic to the next-level node of the node in the specified path information;
  • the BIER network node When the BIER network node is an egress node, the BIER network node forwards the BIER packet of the traffic out of the BIER network, and clears information about the node in the egress node information of the traffic.
  • the BIER network node continues to forward the BIER message of the traffic to the next-level node of the node in the specified path information, including:
  • the BIER network node obtains, from the BIER forwarding table, an entry of the node whose current hop level is the current level of the specified path information;
  • the calculating by using the bit information in the obtained entry and the bit information of the egress node, to obtain the bit information of the reserved node, including:
  • the calculating, the bit position information of the reserved node, the bit bit information in the obtained entry, and the bit position information of the egress node including:
  • bit information in the obtained entry and the bit information of the egress node are ANDed, and the result obtained by the operation and the bit string of the set of reserved nodes are ORed to obtain a calculation result.
  • the modifying the level information of the specified path information includes:
  • the BIER network node sends the BIER message of the traffic according to the specified path information, including:
  • the BIER network node When the next level node of the node in the specified path information is a node that does not support BIER forwarding, or a node that only supports BIER forwarding and does not support the BIER specified path, the BIER network node establishes a tunnel and The nodes in the specified path information are connected under the lower level node and can support the processing of the BIER specified path.
  • the nodes that do not support BIER forwarding between the two BIER nodes on the path, or the nodes that only support BIER forwarding and do not support the BIER specified path will be in the two A tunnel is established between the BIER nodes.
  • the BIER forwarding node that does not support the BIER will not be aware of the BIER header and its contents.
  • the nodes that do not support the BIER specified path processing capability will only be forwarded according to the normal BIER.
  • the method may further include: when the link in the specified path through which the traffic passes has an equal-cost routing link, indicating that the traffic is transmitted by using the equal-cost routing link.
  • the BIER network node can complete the BIER network according to the specified path by receiving the specified path information of the traffic in the network that can only use the shortest path for forwarding traffic.
  • the forwarding it can adapt to various deployment requirements such as resource scheduling, make full use of redundant links, and has high practicability and adaptability.
  • the BIER ingress node encapsulates the BIER header and the path list according to the egress node information of the specific traffic and the specified path information, and each node of the BIER network has Some BIER forwarding technologies are also processed according to the specified list by using the method provided by the embodiment of the present invention, and the BIER network node completes the specified path forwarding of the specific traffic.
  • traffic that can only be forwarded using the shortest path can be forwarded in the BIER network according to the specified path, and can be adapted to various deployment requirements such as resource scheduling, and fully utilize redundant links. Practicality and adaptability.
  • FIG. 3 is a flowchart of a forwarding process according to an embodiment of the present invention. As shown in FIG. 3, the process includes the following steps S302-S330:
  • Step S302 When the BIER network node receives the packet (that is, the traffic) needs to perform forwarding processing, first performs a route searching operation according to the egress node information in the BIER header encapsulation to see whether the node is an egress node.
  • step S304 is performed, and step S306 is performed; if it is not an egress node, step S306 is directly executed.
  • Step S304 the decapsulation is completed and the BIER network is forwarded out; the current node bit in the egress node bit string (ie, the information of the local node in the egress node information of the clearing traffic) is cleared.
  • Step S306 determining, according to the egress node information of the BIER header, whether there are other egress nodes that need to forward the traffic;
  • step S308 is performed; if not, the process is ended.
  • Step S308 determining, according to the set information of the traffic constraint identifier, whether the specified path information needs to be processed.
  • the traffic constraint identifier is not set, it indicates that no path information needs to be processed, and the process is processed according to the normal BIER forwarding process. If the traffic constraint identifier is set, it indicates that the specified path information needs to be processed, and step S310 is performed.
  • Step S310 Acquire specified path information, take out the current hierarchical node set, and find whether the next hop in the BIER forwarding table has an entry of a node in the current hierarchical node set.
  • step S312 is performed.
  • the current hierarchical node can be found as the entry of the next hop because the tunnel link is established.
  • Step S312 obtaining an entry of the next hop
  • Step S314 performing an AND operation on the bit string of the egress node and the bit bit string in the BIER entry where the next hop is located. After obtaining the result, the result is reversed, and then the bit string of the egress node is compared with Operation, obtaining a bit string of the set of reserved nodes.
  • Step S316 performing an AND operation on the bit string of the egress node and the BIER entry in which the next hop is located, performing or operating the result obtained by the operation with the bit string of the set of reserved nodes, and adding the current level of the specified path information to the current level. After the relevant processing, it is sent to the current node of the specified path.
  • step S326 may be further included, and juxtaposed with step S316, one of S316 and S326 may be selected to perform:
  • the first-level peer list in the specified path information is deleted.
  • the length of the deleted hierarchical node list is subtracted from the TLV length, and the encapsulated packet is forwarded according to the BIER forwarding mode.
  • Step S330 when the message arrives at the next node, repeat the above processing flow, and finally report The file is forwarded to the egress node, and the egress node completes the decapsulation of the message and forwards it to the BIER network.
  • the form of the path information is specified, and the set of nodes of the same level may use the BIER correlation technique to identify the BIT string generated after the BIT bit of each node of the level is performed or operated.
  • the form of the path information is specified, and the set of nodes of the same level may be a list of BFR-IDs of each node.
  • the form of the path information is specified, and the set of nodes of the same level may be a list of BFR-Prefix for each node.
  • FIG. 4 is a schematic diagram of determining path forwarding in accordance with an embodiment of the present invention. Assume that the specified path for a particular traffic is BFIR1 - BFR4 - BFR5 - BFER3 / BFER6; BFIR1 - BFR7 - BFER8.
  • the process shown in Figure 4 includes the following steps 402-416:
  • Step 402 first encapsulating the BIER header at the ingress BFIR1 node, encapsulating the BIT bit of the egress node BFER3/BFER6/BFER8 according to the BIER header encapsulation technology in the related art, and setting the traffic constraint flag.
  • Step 404 Encapsulate the specified path into the TLV of the specified path information, where the length is the total length of the path, where the specified path is encapsulated as follows: level 1 node BFR4/BFR7, level 2 node BFR5/BFER8, level 3 node BFER3/BFER6, current level The node is level 1.
  • Step 406 When performing processing forwarding, first perform a BIER forwarding entry search operation on the egress node to determine whether the node is an egress node. If the node is an egress node, decapsulate the traffic and forward it out of the BIER network, and clear the egress. The node bit in the node bit string (that is, the information of the node).
  • Step 408 If there are other nodes that need to arrive, the BFER3 traffic is not directly forwarded to the BFR2 according to the shortest path, but only the BIER forwarding table with the next hop being BFR4 and BFR7 is found according to the current level of the specified path information. After the two entries are matched with the bit string of the BIER exit node, the opposite operation is performed, and then the bit string of the exit node is again matched, and the bit string of the reserved node set is BFER3.
  • Step 410 According to the second entry, respectively, after the bit string operation of the egress node is operated, the merge is guaranteed.
  • the bit string of the set of remaining nodes is incremented by 1 for the current hierarchical node of the specified path, and then processed to be sent to the next node.
  • the egress node of the packet sent to BFR4 is BFER3 and BFER6; the egress node sent to BFR7 is BFER8.
  • Step 412 when BFR4 and BFR7 receive the message, repeat steps 406 to 410, BFR4 is sent to the next level node BFR5, and the exit nodes are BFER3 and BFER6.
  • the message egress node sent by BFR7 to BFER8 is BFER8.
  • Step 414 BFR5 and BFER8 receive the message, repeat steps 406 to 410, and send to the next nodes BFER3 and BFER6, and the egress nodes are respectively two. BFER8 terminates at this node, decapsulates the packet and forwards it out of the BIER network.
  • Step 416 BFER3 and BFER6 receive the message, repeat steps 406 to 410, terminate at the local node, decapsulate the message and forward the BIER network.
  • FIG. 5 is a schematic diagram of a network for specific traffic and normal traffic forwarding according to an embodiment of the present invention.
  • Step 502 First, the specific traffic and the normal traffic are respectively encapsulated at the ingress BFIR1 node, and the specific traffic is encapsulated by the egress node BFER6/BFER8, and then the specified path is encapsulated.
  • the current level is 1, and the traffic constraint flag is set; the common traffic encapsulates the egress node. BFER3/BFER6.
  • Step 504 After receiving the traffic to be forwarded, BFIR1 first performs a BIER forwarding table lookup operation on the egress node, and finds that the node is not an egress node; and because the traffic constraint identifier is set, the specified path information is processed, and the current hierarchical node is found.
  • the BFER forwarding table is taken out, and the entry with the next hop being BFR2 is taken out, and after the exit node is inverted, and then inverted, and then with the egress node, the node BFER6/BFER8 that needs to be reserved is obtained (assuming BFER6/ is reached).
  • the shortest path next hop of BFER8 is BFR4/BFR7).
  • the merged reserved node information is in the BIER encapsulation header, and the specified path information is processed and forwarded to the next hop node BFR2.
  • BFIR1 When BFIR1 processes normal traffic, it directly checks the BIER forwarding table according to the exit node BFER3/BFER6 and forwards it to the next hop node BFR4.
  • Step 506 the specific traffic of the BFR2 is reached, and the BIER forwarding table is also checked first to determine the node.
  • Non-export node then check the specified path information, take the current hierarchical node BFER3 as the next hop entry in the BIER forwarding table, and the BIT string of the egress node is inverted, and then inverted, and then with the egress node BIT string
  • the reserved node BFER6/BFER8 is obtained; the BIER header processing with the next hop being BFER3 is performed and the reserved node is merged, and then the current level of the path list is added and processed, and then forwarded to the next hop BFER3.
  • the shortest path search is performed. It is found that the normal traffic directly forwards the packet to BFR5.
  • Step 508 the specific traffic continues to reach BFER3, and after repeating the specified path operation step, forwarding to the next hop node BFR5. Normal traffic arriving at BFR5 is also normally forwarded to BFER3 and BFER6.
  • step 510 the specific traffic reaches BFR5, and the specified path operation steps are repeated again, and are forwarded to BFER6 and BFER8, respectively.
  • the normal traffic arriving at BFER3 and BFER6 is normally decapsulated and forwarded out of the BIER network.
  • step 512 the specific traffic reaches BFER6 and BFER8, and the specified path operation step is repeated to decapsulate the traffic and forward it out of the BIER network.
  • FIG. 6 is a schematic diagram of a network in which specific traffic is forwarded on an ECMP link according to an embodiment of the present invention, and implements forwarding of a specified path: BFIR1 - BFR2 - BFR3 - BFR5 - BFER6 / BFER8. If there are multiple ECMP links between BFR2 and BFR3, the selection operation is performed when there are multiple ECMP links according to the Entropy field of the ingress node to ensure that the specific traffic is transmitted on the path in the subsequent path.
  • FIG. 7 is a schematic diagram of a network in which a hybrid network implements specified path forwarding according to an embodiment of the present invention.
  • Nodes BFR4 and BFR5 are nodes R9 and R10 that do not support BIER forwarding.
  • the specific traffic exit nodes are BFER6 and BFER8, and the specified forwarding path is:
  • the encapsulation and forwarding process is the same as the previous embodiment.
  • the BFR4 can directly see that BFR5 is the next hop of the tunnel.
  • the traffic of R9 and R10 is tunneled in IP/UDP/GRE/MPLS, and R9 and R10 will not perform BIER correlation processing.
  • FIG. 8 is a schematic diagram of a BIER capable hybrid network implementing a specified path forwarding according to an embodiment of the present invention.
  • the BFR4 supports BIER forwarding, the BIER designation described herein is not supported.
  • the path forwarding process is performed. Therefore, between BFIR1 and BFR5, the specific traffic forwarding is performed through the tunnel. BFIR1 can directly see that BFR5 is 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 perform the specified path processing, only need to support the normal BIER forwarding capability.
  • a traffic constraint identifier may be identified by the reserved rightmost bit position shown in the figure, indicating a specified path node list TLV that is to be processed.
  • FIG. 10 is a schematic diagram 1 of a BIER extended specified path node list TLV according to an embodiment of the present invention.
  • a specified path node is presented in a BIT string manner with the same level node, and the BIT string lengths used by different levels are the same.
  • the TLV type is 1.
  • FIG. 11 is a schematic diagram of a BIER extended specified path node list TLV according to an embodiment of the present invention.
  • the method is that the specified path node is presented in the BIT string manner with the same level node, and the BIT string lengths used by different levels are inconsistent.
  • the TLV type is 2.
  • FIG. 12 is a third schematic diagram of a BIER extended specified path node list TLV according to an embodiment of the present invention.
  • the manner is that the specified path node and the same level node are presented in a BFR-ID list manner.
  • the TLV type is 3.
  • FIG. 13 is a fourth schematic diagram of a BIER extended specified path node list TLV according to an embodiment of the present invention.
  • the manner is that the specified path node is presented in the BFR-Prefix list manner.
  • the TLV type is 4 to identify the IPv4 Prefix; the TLV type is 5 to identify the IPv6 Prefix.
  • the figure shows the IPv4 form, and the IPv6 form adjusts the Prefix to a 128-bit format or a prefix/mask.
  • the embodiment of the invention further provides an apparatus for transmitting traffic by using a specified path, which can be set at an ingress node of the BIER network, including:
  • the first sending module is configured to send the specified path information through which the traffic passes.
  • the specified path information is obtained by routing calculation by an ingress node or a controller, or is generated according to configuration information.
  • the specified path information is a specified path after the packet header of the BIER packet. Information transfer.
  • the packet header of the BIER packet further includes a traffic constraint identifier, configured to indicate whether the specified path information is included.
  • the specified path information is a tree list that is rooted at the ingress node and reaches all egress nodes, where the hierarchical information of the tree list is used to indicate the level at which each node is located.
  • the node identifier in the specified path information is forwarded by the bit identifier forwarding router identifier BFR-ID mode.
  • the BFR-ID is represented by a bit string of the same level in the specified path information.
  • the node set of the same level in the specified path information is represented by a bit string
  • different levels are identified by using a uniform bit string length.
  • the specified path information is represented by a list formed by the BFR-ID of the node.
  • the specified path information is represented by a BFR-Prefix list.
  • the hierarchical information in the specified path information is the same as the multi-level information of the point-to-multipoint, or is the hierarchical information of the preset unicast traffic;
  • the hierarchical information in the specified path information includes different sets of scalable nodes that are distinguished by different identifier values.
  • the specified path information that the traffic passes through can be configured to enable other nodes to complete the BIER according to the specified path. Forwarding in the network can adapt to various deployment requirements such as resource scheduling, making full use of redundant links, and has high practicability and adaptability.
  • FIG. 14 is a structural diagram of an apparatus for transmitting traffic through a specified path according to an embodiment of the present invention.
  • the device shown in Figure 14 can be placed on a BIER network node, including:
  • the obtaining module 1401 is configured to obtain specified path information that the traffic passes through;
  • the second sending module 1402 is configured to send the traffic according to the specified path information. BIER message.
  • the second sending module 1402 includes:
  • the first processing sub-module is configured to continue forwarding the BIER message of the traffic to the next-level node of the node in the specified path information
  • the first processing sub-module when the BIER network node is an egress node, the first processing sub-module further forwards the BIER packet of the traffic out of the BIER network, and clears information about the node in the egress node information of the traffic. .
  • the first processing submodule includes:
  • An obtaining unit configured to obtain, from the BIER forwarding table, an entry of a node whose current hop node is the current level of the specified path information
  • the calculating unit is configured to perform bit calculation using the bit information in the obtained entry and the bit information of the egress node to obtain bit position information of the reserved node;
  • a processing unit configured to calculate bit information of the reserved node, bit information in the obtained entry, and bit position information of the egress node, and modify the hierarchical information of the specified path information, and continue to forward the BIER message for traffic.
  • the calculating unit uses the bit information in the obtained entry to calculate the bit position information of the egress node, and obtains the bit bit information of the reserved node, including:
  • the calculating, by the processing unit, the bit information of the reserved node, the bit information in the obtained entry, and the bit information of the egress node include:
  • bit information in the obtained entry and the bit information of the egress node are ANDed, and the result obtained by the operation and the bit string of the set of reserved nodes are ORed to obtain a calculation result.
  • the processing unit modifies the hierarchical information of the specified path information by:
  • the sending, by the second sending module 1402, the BIER packet of the traffic according to the specified path information includes:
  • next-level node of the node in the specified path information is a node that does not support BIER forwarding, or a node that only supports BIER forwarding and does not support the BIER specified path
  • the tunnel and the specified path information are established.
  • the middle level is connected under the lower level node to support nodes that process the BIER specified path.
  • the nodes that do not support BIER forwarding between the two BIER nodes on the path, or the nodes that only support BIER forwarding and do not support the BIER specified path will be in the two A tunnel is established between the BIER nodes.
  • the BIER forwarding node that does not support the BIER will not be aware of the BIER header and its contents.
  • the nodes that do not support the BIER specified path processing capability will only be forwarded according to the normal BIER.
  • the second sending module 1402 is further configured to indicate that the traffic is transmitted by using the equal-cost routing link when the link in the specified path through which the traffic passes has an equal-cost routing link.
  • the device provided by the embodiment of the present invention can perform forwarding in the BIER network according to the specified path by receiving the specified path information of the traffic in the network that can only use the shortest path for forwarding traffic. It can adapt to various deployment requirements such as resource scheduling, make full use of redundant links, and has high practicability and adaptability.
  • the embodiment of the invention further provides a computer readable storage medium storing computer executable instructions for performing the method of the above embodiment.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve. Thus, embodiments of the invention are not limited to any specific combination of hardware and software.
  • the devices/function modules/functional units in the above embodiments may be implemented by a general-purpose computing device, which may be centralized on a single computing device or distributed over a network of multiple computing devices.
  • the device/function module/functional unit in the above embodiment When the device/function module/functional unit in the above embodiment is implemented in the form of a software function module and sold or used as a stand-alone product, it can be stored in a computer readable storage medium.
  • the above mentioned computer readable storage medium may be a read only memory, a magnetic disk or an optical disk or the like.
  • the embodiment of the present invention can perform forwarding in the BIER network according to the specified path, can adapt various deployment requirements such as resource scheduling, and fully utilize redundant links. Highly practical and adaptable.

Landscapes

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

Abstract

一种通过指定路径传输流量的方法和装置。所述方法,包括:BIER网络的入口节点发送流量所经过的指定路径信息。另一种方法,包括:BIER网络节点获取流量所经过的指定路径信息;所述BIER网络节点根据所述指定路径信息,发送所述流量的BIER报文。

Description

一种通过指定路径传输流量的方法和装置 技术领域
本文涉及但不限于数据通信领域,尤其涉及一种通过指定路径传输流量的方法和装置。
背景技术
随着SDN(Software Defined Network,软件定义网络)技术和NFV(Network Function Virtualization,网络功能虚拟化)在这些年的迅速发展,网络的部署可控性越来越强,控制复杂度也随之越来越高。尤其是像核心网络以及汇聚网络这样的中间网络,为了适配不同的业务,满足不同的部署需求,控制手段越来越繁杂。尤其是组播应用如MVPN(Multicast Virtual Private Net,组播虚拟专用网)和IPTV(Internet Television,网络电视)等,需要的中间网络节点状态数量指数级增长。为了减轻中间网络的控制复杂度,BIER(Bit Indexed Explicit Replication,位索引显式复制)技术应运而生。BIER技术,通过对转发层面的彻底改造,能极大的减轻中间网络的协议复杂度和中间状态。将网络的转发简化成只根据BIT(比特)位进行,颠覆了传统的IP转发,能够非常容易的实现组播流量在中间网络的传输,无需中间网络记录任何的组播流量状态,极大的方便了网络的运维。
BIER技术的核心思想,是将网络中的节点都只用一个BIT位来表示,组播流量在中间网络传输,不是以组播IP包形式呈现,而是封装了一个特定的BIER头,这个报文头以BIT位的形式标注了该组播流的所有出口节点,中间网络根据BIT位进行路由,保障流量能够发送到所有出口节点。中间网络对所有节点的信息获取,是通过对传统域间路由协议OSPF(Open Shortest Path First,开放式最短路径优先)和ISIS(Intermediate system to intermediate system,中间系统到中间系统)进行扩展,让其携带BIT位等BIER协议相关信息,完成信息的传输,并且根据OSPF和ISIS的算路算出到达所有出口节点的路由,由此形成BIER的路由。
虽然BIER技术实现了组播流量的传输,并且极大的简化了中间网络的 控制管理,但这个技术有个缺点,就是无法为特定流量实现按照指定路径传输的功能,也就是不能通过计算出特定的路径,使特定流量能够以保障资源方式在网络中转发。因此,如何使BIER技术能够为特定的流量,提供特定的流量保障服务,从而实现不同流量在中间网络的区分传递,是亟待解决的问题。
发明内容
以下是对本文详细描述的主题的概述。本概述并非是为了限制权利要求的保护范围。
本发明实施例提供一种通过指定路径传输流量的方法和装置,可以实现不同流量在中间网络的区分传递。
本发明实施例采用如下技术方案。
一种通过指定路径传输流量的方法,包括:
位索引显式复制BIER网络的入口节点发送流量所经过的指定路径信息。
可选的,所述指定路径信息是由入口节点或者控制器进行路由计算得到的,或者,是根据配置信息生成的。
可选的,所述指定路径信息是通过BIER报文的报文头后的指定路径信息传输的。
可选的,所述BIER报文的报文头还包括流量约束标识,用于指示是否包括所述指定路径信息。
可选的,所述指定路径信息是以入口节点为根,到达所有出口节点的一个树形列表,所述树形列表的层级信息用来表明每个节点所处的层次。
可选的,所述指定路径信息中的节点标识以位索引转发路由器标识BFR-ID方式标识。
可选的,所述BFR-ID在指定路径信息中同层级的节点集合使用比特位串来表示。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时, 不同层级使用统一的比特位串长度来进行标识。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用不同的比特位串长度来进行标识。
可选的,所述指定路径信息使用节点的BFR-ID构成的列表来表示。
可选的,所述指定路径信息使用位索引转发路由器编号BFR-Prefix列表来表示。
可选的,当所述流量为单播流量时,所述指定路径信息中的层级信息与点对多点的多层级信息相同,或者,为预先设置的单播流量的层级信息;
当所述流量为组播流量时,所述指定路径信息中的层级信息包括通过不同标识值来区分的,不同的可分级的节点集合。
一种通过指定路径传输流量的方法,包括:
位索引显式复制BIER网络节点获取流量所经过的指定路径信息;
所述BIER网络节点根据所述指定路径信息,发送所述流量的BIER报文。
可选的,所述BIER网络节点根据指定路径信息,发送所述流量的BIER报文,包括:
所述BIER网络节点向所述指定路径信息里中本节点的下一层级节点继续转发所述流量的BIER报文;
在所述BIER网络节点是出口节点时,所述BIER网络节点还将所述流量的BIER报文转发出BIER网络,并清除所述流量的出口节点信息中本节点的信息。
可选的,所述BIER网络节点向所述指定路径信息中本节点的下一层级节点继续转发所述流量的BIER报文包括:
所述BIER网络节点从BIER转发表中,获取下一跳节点为所述指定路径信息当前层级的节点的表项;
利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息;
对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,并修改所述指定路径信息的层级信息,继续转发所述流量的BIER报文。
可选的,所述利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息,包括:
将获取到的表项中的比特位信息与出口节点的比特位信息进行与操作,对与操作的结果进行取反操作,再与出口节点的比特位串进行与操作,得到保留节点集合的比特位串。
可选的,对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,包括:
将获取到的表项中的比特位信息以及出口节点的比特位信息进行与操作,将与操作得到的结果与保留节点集合的比特位串进行或操作,得到计算结果。
可选的,所述修改所述指定路径信息的层级信息,包括:
将指定路径信息当前层级加1,得到修改后的指定路径信息的层级信息;或者,
删除所述指定路径信息中的最前同级列表,并在所述指定路径信息的总长中减去删除掉的当前层级节点长度,得到修改后的指定路径信息。
可选的,所述BIER网络节点根据指定路径信息,发送所述流量的BIER报文包括:
当所述指定路径信息中本节点的下一层级节点为不支持BIER转发的节点、或为仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,所述BIER网络节点通过建立隧道和所述指定路径信息中层级在所述下一层级节点之下的、能够支持对BIER指定路径进行处理的节点进行连通。
可选的,所述的方法还包括:在所述流量所经过的指定路径中的链路有等价路由链路时,指示利用所述等价路由链路传输所述流量。
一种通过指定路径传输流量的装置,设置于位索引显式复制BIER网络 的入口节点,包括:
第一发送模块,设置成发送流量所经过的指定路径信息。
可选的,所述指定路径信息是由入口节点或者控制器进行路由计算得到的,或者,是根据配置信息生成的。
可选的,所述指定路径信息是通过BIER报文的报文头后的指定路径信息传输的。
可选的,所述BIER报文的报文头还包括流量约束标识,用于指示是否包括所述指定路径信息。
可选的,所述指定路径信息是以入口节点为根,到达所有出口节点的一个树形列表,所述树形列表的层级信息用来表明每个节点所处的层次。
可选的,所述指定路径信息中的节点标识以位索引转发路由器标识BFR-ID方式标识。
可选的,所述BFR-ID在指定路径信息中同层级的节点集合使用比特位串来表示。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用统一的比特位串长度来进行标识。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用不同的比特位串长度来进行标识。
可选的,所述指定路径信息使用节点的BFR-ID构成的列表来表示。
可选的,所述指定路径信息使用BFR-Prefix列表来表示。
可选的,当所述流量为单播流量时,所述指定路径信息中的层级信息与点对多点的多层级信息相同,或者,为预先设置的单播流量的层级信息;
当所述流量为组播流量时,所述指定路径信息中的层级信息包括通过不同标识值来区分的,不同的可分级的节点集合。
一种通过指定路径传输流量的装置,设置于位索引显式复制BIER网络节点,包括:
获取模块,设置成获取流量所经过的指定路径信息;
第二发送模块,设置成根据所述指定路径信息,发送所述流量的BIER报文。
可选的,第二发送模块包括:
第一处理子模块,设置成向所述指定路径信息中本节点的下一层级节点继续转发所述流量的BIER报文;
在所述BIER网络节点是出口节点时,还将所述流量的BIER报文转发出BIER网络,并清除所述流量的出口节点信息中本节点的信息。
可选的,所述第一处理子模块包括:
获取单元,设置成从BIER转发表中,获取下一跳节点为所述指定路径信息当前层级的节点的表项;
计算单元,设置成利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息;
处理单元,设置成对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,并修改所述指定路径信息的层级信息,继续转发所述流量的BIER报文。
可选的,所述计算单元利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息包括:
将获取到的表项中的比特位信息与出口节点的比特位信息进行与操作,对与操作的结果进行取反操作,再与出口节点的比特位串进行与操作,得到保留节点集合的比特位串。
可选的,所述处理单元对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算包括:
将获取到的表项中的比特位信息以及出口节点的比特位信息进行与操作,将与操作得到的结果与保留节点集合的比特位串进行或操作,得到计算结果。
可选的,所述处理单元通过如下方式修改所述指定路径信息的层级信息, 包括:
将指定路径信息当前层级加1,得到修改后的指定路径信息的层级信息;或者,
删除所述指定路径信息中的最前同级列表,并在所述指定路径信息的总长中减去删除掉的当前层级节点长度,得到修改后的指定路径信息。
可选的,所述第二发送模块根据指定路径信息,发送所述流量的BIER报文包括:
当所述指定路径信息中本节点的下一层级节点为不支持BIER转发的节点、或为仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,通过建立隧道和所述指定路径信息中层级在所述下一层级节点之下的、能够支持对BIER指定路径进行处理的节点进行连通。
可选的,所述第二发送模块还设置成在流量所经过的指定路径中的链路有等价路由链路时,指示利用所述等价路由链路传输所述流量。
一种计算机可读存储介质,存储有计算机可执行指令,所述计算机可执行指令用于执行上述方法。
本发明实施例在原本只能使用最短路径进行转发的流量的网络中,能够根据指定路径完成在BIER网络中的转发,能够适配资源调度等各种部署需求,充分利用冗余链路,具有高度的实用性和适应性。
在阅读并理解了附图和详细描述后,可以明白其它方面。
附图概述
图1为相关技术中BIER网络中流量转发的示意图;
图2为本发明实施例提供的通过指定路径传输流量的方法的流程图;
图3是根据本发明实施例的转发处理的流程图;
图4是根据本发明实施例的确定路径转发示意图;
图5是根据本发明实施例的特定流量与普通流量转发的网络示意图;
图6是根据本发明实施例的特定流量在ECMP(Equal-Cost Multipath,等价多路径)链路转发的网络示意图;
图7根据本发明实施例的混杂网络实现指定路径转发的网络示意图;
图8是根据本发明实施例的BIER能力混杂网络实现指定路径转发的网络示意图;
图9是根据本发明实施例的BIER头示意图;
图10是根据本发明实施例的BIER扩展指定路径节点列表TLV(Type-Length-Value,类型-长度-值)示意图一;
图11是根据本发明实施例的BIER扩展指定路径节点列表TLV示意图二;
图12是根据本发明实施例的BIER扩展指定路径节点列表TLV示意图三;
图13是根据本发明实施例的BIER扩展指定路径节点列表TLV示意图四;
图14为本发明实施例提供的通过指定路径传输流量的装置的结构图。
本发明的实施方式
需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互任意组合。
需要说明的是,本申请的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象,而不必用于描述特定的顺序或先后次序。
图1为相关技术中BIER网络中流量转发的示意图。以一个组播流量为例,入口是BFIR(Bit-Forwarding Ingress Router,比特位转发入口路由器),比如图1中的BFIR1,出口是BFER(Bit-Forwarding Egress Router,比特位转发出口路由器),比如图1中的BFER3,BFER6和BFER8,BIER网络中还包括BFR(Bit-Forwarding Router,比特位转发路由器),比如图1中的BFR2、BFR4、BFR5和BFR7则该流量在BIER网络中的转发,将根据相关技术中的 最短路径进行,也就是经过如下几条最短路径到达BIER网络出口:
BFIR1—BFR2—BFER3;
BFIR1—BFR4—BFR5—BFER6;
BFIR1—BFR7—BFER8。
但如果因为资源规划或者其他的需求,该流量想通过如下的路径进行传输:
BFIR1—BFR4—BFR5—BFER3/BFER6;
BFIR1—BFR7—BFER8。
相关技术中的BIER技术不可能实现。
因此,在本实施例中提供了一种通过指定路径传输流量的方法,包括:
BIER网络的入口节点发送流量所经过的指定路径信息。
可选的,所述BIER网络的入口节点发送流量所经过的指定路径信息前还包括:BIER网络的入口节点生成流量所经过的指定路径信息。
可选的,所述指定路径信息是由入口节点或者控制器进行路由计算得到的,或者,是根据配置信息生成的。
可选的,所述指定路径信息是通过BIER报文的报文头后的指定路径信息传输的。
可选的,所述BIER报文的报文头还包括流量约束标识,用于指示是否包括所述指定路径信息。
可选的,所述指定路径信息是以入口节点为根,到达所有出口节点的一个树形列表,其中所述树形列表的层级信息用来表明每个节点所处的层次。
可选的,所述指定路径信息中的节点标识以BFR-ID(Bit-Forwarding Router Identifier,位索引转发路由器标识)方式标识。
可选的,所述BFR-ID在指定路径信息中同层级的节点集合使用比特位串来表示。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用统一的比特位串长度来进行标识。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用不同的比特位串长度来进行标识;
可选的,所述指定路径信息使用节点的BFR-ID构成的列表来表示。
可选的,所述指定路径信息使用位索引转发路由器编号BFR-Prefix列表来表示。
可选的,当所述流量为单播流量时,所述指定路径信息中的层级信息与点对多点的多层级信息相同,或者,为预先设置的单播流量的层级信息;
当所述流量为组播流量时,所述指定路径信息中的层级信息包括通过不同标识值来区分的、不同的可分级的节点集合。
由上可以看出,本发明实施例提供的方法,BIER网络的入口节点在原本只能使用最短路径进行转发的流量的网络中,通过发送流量所经过的指定路径信息,能够使的其他节点根据指定路径完成在BIER网络中的转发,能够适配资源调度等各种部署需求,充分利用冗余链路,具有高度的实用性和适应性。
图2为本发明实施例提供的通过指定路径传输流量的方法的流程图。图2所示方法包括步骤201~202:
步骤201、BIER网络节点获取流量所经过的指定路径信息;
步骤202、所述BIER网络节点根据所述指定路径信息,发送所述流量的BIER报文。
可选的,所述BIER网络节点根据指定路径信息,发送所述流量的BIER报文,包括:
所述BIER网络节点向所述指定路径信息中本节点的下一层级节点继续转发所述流量的BIER报文;
其中,在所述BIER网络节点是出口节点时,所述BIER网络节点还将所述流量的BIER报文转发出BIER网络,并清除所述流量的出口节点信息中本节点的信息。
可选的,所述BIER网络节点向所述指定路径信息中本节点的下一层级节点继续转发所述流量的BIER报文包括:
所述BIER网络节点从BIER转发表中,获取下一跳节点为所述指定路径信息当前层级的节点的表项;
利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息;
对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,并修改所述指定路径信息的层级信息,继续转发所述流量的BIER报文。
可选的,所述利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息,包括:
将获取到的表项中的比特位信息与出口节点的比特位信息进行与操作,对与操作的结果进行取反操作,再与出口节点的比特位串进行与操作,得到保留节点集合的比特位串。
可选的,所述对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,包括:
将获取到的表项中的比特位信息以及出口节点的比特位信息进行与操作,将与操作得到的结果与保留节点集合的比特位串进行或操作,得到计算结果。
可选的,所述修改所述指定路径信息的层级信息,包括:
将指定路径信息当前层级加1,得到修改后的指定路径信息的层级信息;或者,
删除所述指定路径信息中的最前同级列表,并在所述指定路径信息的总长中减去删除掉的当前层级节点长度,得到修改后的指定路径信息。
可选的,所述BIER网络节点根据指定路径信息,发送所述流量的BIER报文包括:
当所述指定路径信息中本节点的下一层级节点为不支持BIER转发的节点、或为仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,所述BIER网络节点通过建立隧道和所述指定路径信息中层级在所述下一层级节点之下的、能够支持对BIER指定路径进行处理的节点进行连通。
该可选方案中,在路径上的两个BIER节点之间是不支持BIER转发的节点,或者之间包含仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,将在这两个BIER节点之间建立隧道进行连通,所经过的不支持BIER转发节点将不感知BIER头以及其中的内容;所经过的不支持BIER指定路径处理能力的节点只会按照普通的BIER转发。
可选的,所述方法还可以包括:在流量所经过的指定路径中的链路有等价路由链路时,指示利用所述等价路由链路传输所述流量。
由上可以看出,本发明实施例提供的方法,BIER网络节点在原本只能使用最短路径进行转发的流量的网络中,通过接收流量所经过的指定路径信息,能够根据指定路径完成在BIER网络中的转发,能够适配资源调度等各种部署需求,充分利用冗余链路,具有高度的实用性和适应性。
综上可以看出,本发明实施例提供的通过指定路径传输流量的方法,BIER入口节点根据特定流量的出口节点信息以及指定路径信息,封装BIER头和路径列表,BIER网络每个节点除了依据已有的BIER转发技术,还使用本发明实施例所提供的方法,根据指定列表进行处理,BIER网络节点完成特定流量的指定路径转发。
通过上述步骤,可以让原本只能使用最短路径进行转发的流量,能够根据指定路径完成在BIER网络中的转发,能够适配资源调度等各种部署需求,充分利用冗余链路,具有高度的实用性和适应性。
图3是根据本发明实施例的转发处理的流程图,如图3所示,该流程包括如下步骤S302~S330:
步骤S302,BIER网络节点收到报文(即:所述流量)需要进行转发处理时,先根据BIER头封装里的出口节点信息进行路由查找操作,看本节点是否是出口节点。
如果是出口节点,则执行步骤S304,再执行步骤S306;如果不是出口节点,则直接执行步骤S306。
步骤S304,完成解封装并转发出BIER网络;清除在出口节点比特位串中的当前节点位(即清除流量的出口节点信息中本节点的信息)。
步骤S306,根据BIER头的出口节点信息,判断是否还有其他出口节点需要转发所述流量;
如果有,则执行步骤S308;如果没有,结束流程。
步骤S308,根据流量约束标识的置位信息,判断是否存在指定路径信息需要处理。
如果流量约束标识没有置位,则表示没有指定路径信息需要处理,则按照普通BIER转发流程处理;如果流量约束标识有置位,则表示有指定路径信息需要处理,执行步骤S310。
步骤S310,获取指定路径信息,将当前层级节点集合取出,并查找BIER转发表里下一跳是否有当前层级节点集合中节点的表项。
在BIER转发表中,如果查找不到当前层级节点作为下一跳的表项,则结束处理流程。如果查找到当前层级节点作为下一跳的表项,则执行步骤S312。
需要注意如果有跨越不支持BIER转发节点,或者跨越仅支持BIER转发而不支持BIER指定路径转发节点时,因为建立了隧道链接,所以是可以找到当前层级节点作为下一跳的表项的。
步骤S312,获取所述下一跳所在的表项;
步骤S314,将出口节点的比特位串与下一跳所在的BIER表项中的比特位串进行与操作,在得到结果后,对结果进行取反操作,再与出口节点的比特位串进行与操作,得到保留节点集合的比特位串。
步骤S316,将出口节点的比特位串和下一跳所在的BIER表项进行与操作,将与操作得到的结果与保留节点集合的比特位串进行或操作,再将指定路径信息当前层级加1,相关处理后发送到指定路径当前节点。
可选的,还可以包括步骤S326,与步骤S316并列,可以选择S316和S326中的一个步骤执行:
将指定路径信息中的最前同级列表删除,TLV长度中减去删除掉的层级节点列表的长度,将封装后的报文根据BIER转发方式进行转发。
步骤S330,当报文到达下一个节点时,重复以上的处理流程,最终将报 文转发到出口节点,由出口节点完成报文的解封装,并转发到BIER网络之外。
在一个可选的实施例中,指定路径信息的形式,同一层级的节点集合可以使用BIER相关技术,用于标识该层级每个节点的BIT位进行或操作后生成的BIT串。
在一个可选的实施例中,指定路径信息的形式,同一层级的节点集合可以是每个节点的BFR-ID的列表。
在一个可选的实施例中,指定路径信息的形式,同一层级的节点集合可以是每个节点的BFR-Prefix的列表。
图4是根据本发明实施例的确定路径转发的示意图。假设对于某特定流量的指定路径为BFIR1—BFR4—BFR5—BFER3/BFER6;BFIR1—BFR7—BFER8。图4所示流程包括如下步骤402~416:
步骤402,首先在入口BFIR1节点,封装好BIER头,将出口节点BFER3/BFER6/BFER8的BIT位,按照相关技术中的BIER头封装技术封装好,并且将流量约束标识置位。
步骤404,将指定路径封装到指定路径信息的TLV中,其中长度为路径总长,其中指定路径封装如下:1级节点BFR4/BFR7,2级节点BFR5/BFER8,3级节点BFER3/BFER6,当前层级节点为1层级。
步骤406,在进行处理转发时,首先对出口节点进行BIER转发表项查找操作,确定本节点是否是出口节点,如果本节点是出口节点,则将流量解封装并转发出BIER网络,并清除出口节点位串中的本节点位(即本节点的信息)。
步骤408,如果还有其他节点需要到达,这里不再按照最短路径来直接转发BFER3的流量到BFR2,而是根据指定路径信息当前层级,只寻找出下一跳为BFR4和BFR7的BIER转发表。将此二表项与BIER出口节点的比特位串相与后,再做取反操作,然后再次与出口节点位串相与,得出保留节点集合的比特位串为BFER3。
步骤410,分别按照此二表项,对出口节点的比特位串操作后,合并保 留节点集合的比特位串,将指定路径当前层级节点加1,进行相关处理后,发送到下一节点。其中发送给BFR4的报文的出口节点为BFER3和BFER6;发送给BFR7的报文出口节点为BFER8。
步骤412,BFR4和BFR7收到报文时,重复步骤406到步骤410,BFR4发送给下一层级节点BFR5,出口节点为BFER3和BFER6。BFR7发送给BFER8的报文出口节点即为BFER8。
步骤414,BFR5和BFER8收到报文,重复步骤406到步骤410,发送给下一节点BFER3和BFER6,出口节点分别为二者。BFER8在本节点终结,解封装报文并转发出BIER网络。
步骤416,BFER3和BFER6收到报文,重复步骤406到步骤410,在本节点终结,解封装报文并转发出BIER网络。
图5是根据本发明实施例的特定流量与普通流量转发的网络示意图。
参照图1,实现指定路径的转发:
BFIR1—BFR2—BFER3—BFR5—BFER6/BFER8(出口节点是BFER6和BFER8)。普通流量转发目的为BFER3和BFER6。步骤包括如下S502~S512:
步骤502,首先在入口BFIR1节点,将特定流量和普通流量分别封装,特定流量封装出口节点BFER6/BFER8,再封装好指定路径,当前级别为1,流量约束标识置位;普通流量封装好出口节点BFER3/BFER6。
步骤504,BFIR1收到待转发的流量后,首先对出口节点进行BIER转发表查表操作,发现本节点并非出口节点;再因为流量约束标识置位,对指定路径信息进行处理,当前层级节点发现为BFR2,则将BFER转发表中,下一跳为BFR2的条目取出,与出口节点相与后,取反,再与出口节点相与,得出需要保留的节点BFER6/BFER8(假设到达BFER6/BFER8的最短路径下一跳是BFR4/BFR7),下一跳正常转发处理后,合并保留节点信息在BIER封装头中,并对指定路径信息进行相关处理,转发到下一跳节点BFR2。BFIR1处理普通流量时,直接根据出口节点BFER3/BFER6查BIER转发表,转发到下一跳节点BFR4。
步骤506,到达BFR2的特定流量,同样先查BIER转发表,确定本节点 非出口节点;再查指定路径信息,对当前层级节点BFER3在BIER转发表中作为下一跳的表项取出,与出口节点的BIT串相与,取反,再与出口节点BIT串相与后,得到保留节点BFER6/BFER8;进行下一跳为BFER3的BIER头处理并合并保留节点,再将路径列表当前层级进行加1和相关处理后,再继续转发到下一跳BFER3。对于到达BFR4的普通流量,进行最短路径查找,发现是普通流量直接转发报文到BFR5。
步骤508,特定流量继续到达BFER3,重复指定路径操作步骤后,转发给下一跳节点BFR5。到达BFR5的普通流量也正常转发到BFER3和BFER6。
步骤510,特定流量到达BFR5,同样重复指定路径操作步骤,分别转发到BFER6和BFER8。到达BFER3和BFER6的普通流量正常解封装并转发出BIER网络。
步骤512,特定流量到达BFER6和BFER8,重复指定路径操作步骤,将流量解封装并转发出BIER网络。
图6是根据本发明实施例的特定流量在ECMP链路转发的网络示意图,实现指定路径的转发:BFIR1—BFR2—BFR3—BFR5—BFER6/BFER8。其中BFR2到BFR3间有多条ECMP链路,则会根据入口节点的Entropy字段,在存在多条ECMP链路时进行选择操作,保证该特定流量在后续一直以该路径传输。
图7根据本发明实施例的混杂网络实现指定路径转发的网络示意图,节点BFR4和BFR5之间,是不支持BIER转发的节点R9和R10。特定流量出口节点为BFER6和BFER8,指定转发路径为:
BFIR1—BFR4—BFR5—BFER6/BFER8。
封装和转发流程同前实施例所述,在BFR4转发到BFR5时,将通过隧道转发的方式,BFR4可直接看到BFR5为隧道下一跳。使得流量在R9和R10的传输以IP/UDP/GRE/MPLS等隧道方式进行,R9和R10将不进行BIER相关处理。
图8是根据本发明实施例的BIER能力混杂网络实现指定路径转发的网络示意图,节点BFR4虽然支持BIER转发,但不支持本文所述的BIER指定 路径转发处理,因此在BFIR1到BFR5之间,会同样通过隧道方式来完成特定流量转发,BFIR1上能够直接看到BFR5为隧道下一跳。封装方式可以是MPLS隧道方式。BFR4将看到普通的BIER封装头,无需进行指定路径处理,只需要支持普通BIER转发能力即可。
图9是根据本发明实施例的BIER头示意图:可以用图中所示的Reserved最右位置位来标识流量约束标识,表示紧跟着需要处理的指定路径节点列表TLV。
图10是根据本发明实施例的BIER扩展指定路径节点列表TLV示意图一,这种方式是指定路径节点同层级节点以BIT串方式呈现,不同级别所用的BIT串长度一致。TLV类型为1。
图11是根据本发明实施例的BIER扩展指定路径节点列表TLV示意图二,这种方式是指定路径节点同层级节点以BIT串方式呈现,不同级别所用的BIT串长度不一致。TLV类型为2。
图12是根据本发明实施例的BIER扩展指定路径节点列表TLV示意图三,这种方式是指定路径节点同层级节点以BFR-ID列表方式呈现。TLV类型为3。
图13是根据本发明实施例的BIER扩展指定路径节点列表TLV示意图四,这种方式是指定路径节点同层级节点以BFR-Prefix列表方式呈现。TLV类型为4标识IPv4的Prefix;TLV类型为5标识IPv6的Prefix。该图展示的是IPv4形式,IPv6形式则将Prefix调整为128位的格式,或者采用前缀/掩码的方式表示。
本发明实施例还提供一种通过指定路径传输流量的装置,可以设置于BIER网络的入口节点,包括:
第一发送模块,设置成发送流量所经过的指定路径信息。
可选的,所述指定路径信息是由入口节点或者控制器进行路由计算得到的,或者,是根据配置信息生成的。
可选的,所述指定路径信息是通过BIER报文的报文头后的指定路径信 息传输的。
可选的,所述BIER报文的报文头还包括流量约束标识,用于指示是否包括所述指定路径信息。
可选的,所述指定路径信息是以入口节点为根,到达所有出口节点的一个树形列表,其中所述树形列表的层级信息用来表明每个节点所处的层次。
可选的,所述指定路径信息中的节点标识以位索引转发路由器标识BFR-ID方式标识。
可选的,所述BFR-ID在指定路径信息中同层级的节点集合使用比特位串来表示。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用统一的比特位串长度来进行标识。
可选的,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用不同的比特位串长度来进行标识;
可选的,述指定路径信息使用节点的BFR-ID构成的列表来表示。
可选的,所述指定路径信息使用BFR-Prefix列表来表示。
可选的,当所述流量为单播流量时,所述指定路径信息中的层级信息与点对多点的多层级信息相同,或者,为预先设置的单播流量的层级信息;当所述流量为组播流量时,所述指定路径信息中的层级信息包括通过不同标识值来区分的、不同的可分级的节点集合。
由上可以看出,本发明实施例提供的装置,在原本只能使用最短路径进行转发的流量的网络中,通过发送流量所经过的指定路径信息,能够使的其他节点根据指定路径完成在BIER网络中的转发,能够适配资源调度等各种部署需求,充分利用冗余链路,具有高度的实用性和适应性。
图14为本发明实施例提供的通过指定路径传输流量的装置的结构图。图14所示装置可以设置于BIER网络节点,包括:
获取模块1401,设置成获取流量所经过的指定路径信息;
第二发送模块1402,设置成根据所述指定路径信息,发送所述流量的 BIER报文。
可选的,第二发送模块1402包括:
第一处理子模块,设置成向所述指定路径信息中本节点的下一层级节点继续转发所述流量的BIER报文;
可选的,在所述BIER网络节点是出口节点时,所述第一处理子模块还将所述流量的BIER报文转发出BIER网络,并清除所述流量的出口节点信息中本节点的信息。
可选的,所述第一处理子模块包括:
获取单元,设置成从BIER转发表中,获取下一跳节点为所述指定路径信息当前层级的节点的表项;
计算单元,设置成利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息;
处理单元,设置成对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,并修改所述指定路径信息的层级信息,继续转发所述流量的BIER报文。
可选的,所述计算单元利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息包括:
将获取到的表项中的比特位信息与出口节点的比特位信息进行与操作,对与操作的结果进行取反操作,再与出口节点的比特位串进行与操作,得到保留节点集合的比特位串。
可选的,所述处理单元对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算包括:
将获取到的表项中的比特位信息以及出口节点的比特位信息进行与操作,将与操作得到的结果与保留节点集合的比特位串进行或操作,得到计算结果。
可选的,所述处理单元通过如下方式修改所述指定路径信息的层级信息,包括:
将指定路径信息当前层级加1,得到修改后的指定路径信息的层级信息;或者,
删除所述指定路径信息中的最前同级列表,并在所述指定路径信息的总长中减去删除掉的当前层级节点长度,得到修改后的指定路径信息。
可选的,所述第二发送模块1402根据指定路径信息,发送所述流量的BIER报文包括:
当所述指定路径信息中本节点的下一层级节点为不支持BIER转发的节点、或为仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,通过建立隧道和所述指定路径信息中层级在所述下一层级节点之下的、能够支持对BIER指定路径进行处理的节点进行连通。
本可选方案中,在路径上的两个BIER节点之间是不支持BIER转发的节点,或者之间包含仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,将在这两个BIER节点之间建立隧道进行连通,所经过的不支持BIER转发节点将不感知BIER头以及其中的内容;所经过的不支持BIER指定路径处理能力的节点只会按照普通的BIER转发。
可选的,所述第二发送模块1402还设置成在流量所经过的指定路径中的链路有等价路由链路时,指示利用所述等价路由链路传输所述流量。
由上可以看出,本发明实施例提供的装置,在原本只能使用最短路径进行转发的流量的网络中,通过接收流量所经过的指定路径信息,能够根据指定路径完成在BIER网络中的转发,能够适配资源调度等各种部署需求,充分利用冗余链路,具有高度的实用性和适应性。
本发明实施例还提供一种计算机可读存储介质,存储有计算机可执行指令,所述计算机可执行指令用于执行上述实施例的方法。
本领域普通技术人员可以理解上述实施例的全部或部分步骤可以使用计算机程序流程来实现,所述计算机程序可以存储于一计算机可读存储介质中,所述计算机程序在相应的硬件平台上(如系统、设备、装置、器件等)执行, 在执行时,包括方法实施例的步骤之一或其组合。
可选地,上述实施例的全部或部分步骤也可以使用集成电路来实现,这些步骤可以被分别制作成一个个集成电路模块,或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样,本发明实施例不限制于任何特定的硬件和软件结合。
上述实施例中的装置/功能模块/功能单元可以采用通用的计算装置来实现,它们可以集中在单个的计算装置上,也可以分布在多个计算装置所组成的网络上。
上述实施例中的装置/功能模块/功能单元以软件功能模块的形式实现并作为独立的产品销售或使用时,可以存储在一个计算机可读取存储介质中。上述提到的计算机可读取存储介质可以是只读存储器,磁盘或光盘等。
工业实用性
本发明实施例在原本只能使用最短路径进行转发的流量的网络中,能够根据指定路径完成在BIER网络中的转发,能够适配资源调度等各种部署需求,充分利用冗余链路,具有高度的实用性和适应性。

Claims (40)

  1. 一种通过指定路径传输流量的方法,包括:
    位索引显式复制BIER网络的入口节点发送流量所经过的指定路径信息。
  2. 根据权利要求1所述的方法,其中,所述指定路径信息是由入口节点或者控制器进行路由计算得到的,或者,是根据配置信息生成的。
  3. 根据权利要求1所述的方法,其中,所述指定路径信息是通过BIER报文的报文头后的指定路径信息传输的。
  4. 根据权利要求1所述的方法,其中,所述BIER报文的报文头还包括流量约束标识,用于指示是否包括所述指定路径信息。
  5. 根据权利要求1所述的方法,其中,所述指定路径信息是以入口节点为根,到达所有出口节点的一个树形列表,所述树形列表的层级信息用来表明每个节点所处的层次。
  6. 根据权利要求5所述的方法,其中:
    所述指定路径信息中的节点标识以位索引转发路由器标识BFR-ID方式标识。
  7. 根据权利要求6所述的方法,其中,所述BFR-ID在指定路径信息中同层级的节点集合使用比特位串来表示。
  8. 根据权利要求7所述的方法,其中,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用统一的比特位串长度来进行标识。
  9. 根据权利要求7所述的方法,其中,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用不同的比特位串长度来进行标识。
  10. 根据权利要求6所述的方法,其中,所述指定路径信息使用节点的 BFR-ID构成的列表来表示。
  11. 根据权利要求5所述的方法,其中,所述指定路径信息使用位索引转发路由器编号BFR-Prefix列表来表示。
  12. 根据权利要求5所述的方法,其中:
    当所述流量为单播流量时,所述指定路径信息中的层级信息与点对多点的多层级信息相同,或者,为预先设置的单播流量的层级信息;
    当所述流量为组播流量时,所述指定路径信息中的层级信息包括通过不同标识值来区分的,不同的可分级的节点集合。
  13. 一种通过指定路径传输流量的方法,包括:
    位索引显式复制BIER网络节点获取流量所经过的指定路径信息;
    所述BIER网络节点根据所述指定路径信息,发送所述流量的BIER报文。
  14. 根据权利要求13所述的方法,其中,所述BIER网络节点根据指定路径信息,发送所述流量的BIER报文,包括:
    所述BIER网络节点向所述指定路径信息里中本节点的下一层级节点继续转发所述流量的BIER报文;
    在所述BIER网络节点是出口节点时,所述BIER网络节点还将所述流量的BIER报文转发出BIER网络,并清除所述流量的出口节点信息中本节点的信息。
  15. 根据权利要求14所述的方法,其中,所述BIER网络节点向所述指定路径信息中本节点的下一层级节点继续转发所述流量的BIER报文包括:
    所述BIER网络节点从BIER转发表中,获取下一跳节点为所述指定路径信息当前层级的节点的表项;
    利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息;
    对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口 节点的比特位信息进行计算,并修改所述指定路径信息的层级信息,继续转发所述流量的BIER报文。
  16. 根据权利要求15所述的方法,其中,
    所述利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息,包括:
    将获取到的表项中的比特位信息与出口节点的比特位信息进行与操作,对与操作的结果进行取反操作,再与出口节点的比特位串进行与操作,得到保留节点集合的比特位串。
  17. 根据权利要求16所述的方法,其中,对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,包括:
    将获取到的表项中的比特位信息以及出口节点的比特位信息进行与操作,将与操作得到的结果与保留节点集合的比特位串进行或操作,得到计算结果。
  18. 根据权利要求15所述的方法,其中,所述修改所述指定路径信息的层级信息,包括:
    将指定路径信息当前层级加1,得到修改后的指定路径信息的层级信息;或者,
    删除所述指定路径信息中的最前同级列表,并在所述指定路径信息的总长中减去删除掉的当前层级节点长度,得到修改后的指定路径信息。
  19. 根据权利要求13所述的方法,其中,所述BIER网络节点根据指定路径信息,发送所述流量的BIER报文包括:
    当所述指定路径信息中本节点的下一层级节点为不支持BIER转发的节点、或为仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,所述BIER网络节点通过建立隧道和所述指定路径信息中层级在所述下一层级节点之下的、能够支持对BIER指定路径进行处理的节点进行连通。
  20. 根据权利要求13所述的方法,还包括:在所述流量所经过的指定路 径中的链路有等价路由链路时,指示利用所述等价路由链路传输所述流量。
  21. 一种通过指定路径传输流量的装置,设置于位索引显式复制BIER网络的入口节点,包括:
    第一发送模块,设置成发送流量所经过的指定路径信息。
  22. 根据权利要求21所述的装置,其中,所述指定路径信息是由入口节点或者控制器进行路由计算得到的,或者,是根据配置信息生成的。
  23. 根据权利要求21所述的装置,其中,所述指定路径信息是通过BIER报文的报文头后的指定路径信息传输的。
  24. 根据权利要求21所述的装置,其中,所述BIER报文的报文头还包括流量约束标识,用于指示是否包括所述指定路径信息。
  25. 根据权利要求21所述的装置,其中,所述指定路径信息是以入口节点为根,到达所有出口节点的一个树形列表,所述树形列表的层级信息用来表明每个节点所处的层次。
  26. 根据权利要求25所述的装置,其中:
    所述指定路径信息中的节点标识以位索引转发路由器标识BFR-ID方式标识。
  27. 根据权利要求26所述的装置,其中,所述BFR-ID在指定路径信息中同层级的节点集合使用比特位串来表示。
  28. 根据权利要求27所述的装置,其中,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用统一的比特位串长度来进行标识。
  29. 根据权利要求27所述的装置,其中,所述指定路径信息中同层级的节点集合使用比特位串来表示时,不同层级使用不同的比特位串长度来进行标识。
  30. 根据权利要求26所述的装置,其中,所述指定路径信息使用节点的BFR-ID构成的列表来表示。
  31. 根据权利要求25所述的装置,其中,所述指定路径信息使用 BFR-Prefix列表来表示。
  32. 根据权利要求25所述的装置,其中:
    当所述流量为单播流量时,所述指定路径信息中的层级信息与点对多点的多层级信息相同,或者,为预先设置的单播流量的层级信息;
    当所述流量为组播流量时,所述指定路径信息中的层级信息包括通过不同标识值来区分的,不同的可分级的节点集合。
  33. 一种通过指定路径传输流量的装置,设置于位索引显式复制BIER网络节点,包括:
    获取模块,设置成获取流量所经过的指定路径信息;
    第二发送模块,设置成根据所述指定路径信息,发送所述流量的BIER报文。
  34. 根据权利要求33所述的装置,其中,第二发送模块包括:
    第一处理子模块,设置成向所述指定路径信息中本节点的下一层级节点继续转发所述流量的BIER报文;
    在所述BIER网络节点是出口节点时,还将所述流量的BIER报文转发出BIER网络,并清除所述流量的出口节点信息中本节点的信息。
  35. 根据权利要求34所述的装置,其中,所述第一处理子模块包括:
    获取单元,设置成从BIER转发表中,获取下一跳节点为所述指定路径信息当前层级的节点的表项;
    计算单元,设置成利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息;
    处理单元,设置成对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算,并修改所述指定路径信息的层级信息,继续转发所述流量的BIER报文。
  36. 根据权利要求35所述的装置,其中,所述计算单元利用获取到的表项中的比特位信息与出口节点的比特位信息进行计算,得到保留节点的比特位信息包括:
    将获取到的表项中的比特位信息与出口节点的比特位信息进行与操作,对与操作的结果进行取反操作,再与出口节点的比特位串进行与操作,得到保留节点集合的比特位串。
  37. 根据权利要求36所述的装置,其中,所述处理单元对所述保留节点的比特位信息、获取到的表项中的比特位信息以及出口节点的比特位信息进行计算包括:
    将获取到的表项中的比特位信息以及出口节点的比特位信息进行与操作,将与操作得到的结果与保留节点集合的比特位串进行或操作,得到计算结果。
  38. 根据权利要求35所述的装置,其中,所述处理单元通过如下方式修改所述指定路径信息的层级信息,包括:
    将指定路径信息当前层级加1,得到修改后的指定路径信息的层级信息;或者,
    删除所述指定路径信息中的最前同级列表,并在所述指定路径信息的总长中减去删除掉的当前层级节点长度,得到修改后的指定路径信息。
  39. 根据权利要求33所述的装置,其中,所述第二发送模块根据指定路径信息,发送所述流量的BIER报文包括:
    当所述指定路径信息中本节点的下一层级节点为不支持BIER转发的节点、或为仅支持BIER转发,不支持对BIER指定路径进行处理的节点时,通过建立隧道和所述指定路径信息中层级在所述下一层级节点之下的、能够支持对BIER指定路径进行处理的节点进行连通。
  40. 根据权利要求33所述的装置,其中,所述第二发送模块还设置成在流量所经过的指定路径中的链路有等价路由链路时,指示利用所述等价路由链路传输所述流量。
PCT/CN2016/086762 2015-10-14 2016-06-22 一种通过指定路径传输流量的方法和装置 WO2016198012A2 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
EP16806910.2A EP3364613B1 (en) 2015-10-14 2016-06-22 Method and device for transmitting traffic via specified path

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510673646.0A CN106603413B (zh) 2015-10-14 2015-10-14 通过指定路径传输流量的方法和装置
CN201510673646.0 2015-10-14

Publications (2)

Publication Number Publication Date
WO2016198012A2 true WO2016198012A2 (zh) 2016-12-15
WO2016198012A3 WO2016198012A3 (zh) 2017-02-09

Family

ID=57502972

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/086762 WO2016198012A2 (zh) 2015-10-14 2016-06-22 一种通过指定路径传输流量的方法和装置

Country Status (3)

Country Link
EP (1) EP3364613B1 (zh)
CN (1) CN106603413B (zh)
WO (1) WO2016198012A2 (zh)

Families Citing this family (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108989208B (zh) * 2017-05-31 2021-08-10 中兴通讯股份有限公司 一种标识分配方法和装置
CN109391478B (zh) * 2017-08-10 2021-09-10 中兴通讯股份有限公司 一种组播业务控制方法和装置、计算机可读存储介质
CN107888518A (zh) * 2017-10-20 2018-04-06 深圳市楠菲微电子有限公司 用于转发报文的方法及装置
CN108337176B (zh) * 2017-12-27 2021-04-20 华为技术有限公司 一种报文处理方法和装置
CN109996309B (zh) * 2018-01-02 2020-10-02 中国移动通信有限公司研究院 一种路由流量引流系统、方法、装置和介质
CN110417657B (zh) 2018-04-27 2022-05-17 华为技术有限公司 一种处理组播数据报文的方法及装置
CN113726666B (zh) * 2018-06-27 2022-11-18 华为技术有限公司 一种发送报文的方法和装置
CN109246017B (zh) * 2018-11-28 2021-03-23 新华三技术有限公司 一种查询组播转发路径的方法及装置
CN112511988B (zh) * 2020-03-06 2024-04-19 中兴通讯股份有限公司 报文转发方法、设备、系统、网络设备和存储介质
EP4391480A1 (en) * 2021-09-27 2024-06-26 Huawei Technologies Co., Ltd. Multicast message processing method and related apparatus and device

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9544230B2 (en) * 2013-09-17 2017-01-10 Cisco Technology, Inc. Migration support for bit indexed explicit replication
US10461946B2 (en) * 2013-09-17 2019-10-29 Cisco Technology, Inc. Overlay signaling for bit indexed explicit replication
CN104811387B (zh) * 2014-01-24 2018-06-01 思科技术公司 具有位索引显式复制的等价多路径

Also Published As

Publication number Publication date
WO2016198012A3 (zh) 2017-02-09
CN106603413B (zh) 2020-12-11
CN106603413A (zh) 2017-04-26
EP3364613A2 (en) 2018-08-22
EP3364613A4 (en) 2019-03-27
EP3364613B1 (en) 2020-06-10

Similar Documents

Publication Publication Date Title
WO2016198012A2 (zh) 一种通过指定路径传输流量的方法和装置
US9832031B2 (en) Bit index explicit replication forwarding using replication cache
CN109218178B (zh) 一种报文处理方法及网络设备
JP7208386B2 (ja) パケット転送方法、パケット送信装置、およびパケット受信装置
US10581732B2 (en) Target FEC (forwarding equivalence class) stack based FEC query in segment routing environments
CN109756425B (zh) 组播转发方法、装置以及bfr
WO2016198013A1 (zh) 一种报文传输方法及装置
US10158561B2 (en) Data plane learning of bi-directional service chains
WO2016177087A1 (zh) 一种传输bier报文的方法及装置
US8077713B2 (en) Dynamic update of a multicast tree
JP5862769B2 (ja) 通信システム、制御装置、通信方法及びプログラム
WO2016165492A1 (zh) 一种实现业务功能链的方法和装置
WO2017059708A1 (zh) Bier信息的发送方法、接收方法及装置
WO2019205806A1 (zh) 数据包的处理方法及装置、存储介质、电子装置
WO2018072704A1 (zh) 报文传输方法、装置、节点和计算机存储介质
CN107040400A (zh) 网络装置及方法
JP4971496B2 (ja) イーサネット・スパニング・ツリープロビジョン
CN102150148A (zh) 层2拓扑中针对单播帧和多播帧的差别化服务
CN107770073A (zh) 一种信息同步的方法,装置及系统
CN106982157A (zh) 流量工程隧道建立方法和装置
CN108632150A (zh) 一种信息传递方法及装置
WO2017177756A1 (zh) 一种信息传递方法、装置及系统
KR101318001B1 (ko) 내부 mpls 라벨과 외부 mpls 라벨을 링크하는 방법 및 제조 물품
WO2018010566A1 (zh) 信息的通告方法、转发条目的生成方法及装置
US20200106628A1 (en) Bit forwarding router identifier signaling using protocol independent multicast attribute

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 2016806910

Country of ref document: EP

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

Ref document number: 16806910

Country of ref document: EP

Kind code of ref document: A2