WO2017193569A1 - 一种路径建立方法及控制器 - Google Patents

一种路径建立方法及控制器 Download PDF

Info

Publication number
WO2017193569A1
WO2017193569A1 PCT/CN2016/108233 CN2016108233W WO2017193569A1 WO 2017193569 A1 WO2017193569 A1 WO 2017193569A1 CN 2016108233 W CN2016108233 W CN 2016108233W WO 2017193569 A1 WO2017193569 A1 WO 2017193569A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
information
path
target
label
Prior art date
Application number
PCT/CN2016/108233
Other languages
English (en)
French (fr)
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 WO2017193569A1 publication Critical patent/WO2017193569A1/zh
Priority to US16/185,994 priority Critical patent/US10749788B2/en
Priority to US16/937,236 priority patent/US11502937B2/en
Priority to US17/976,600 priority patent/US11888726B2/en

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/16Multipoint routing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00Data switching networks
    • H04L12/02Details
    • H04L12/16Arrangements for providing special services to substations
    • H04L12/18Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/1854Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with non-centralised forwarding system, e.g. chaincast
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/02Topology update or discovery
    • 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/12Shortest path evaluation
    • H04L45/121Shortest path evaluation by minimising delays
    • 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
    • H04L45/125Shortest path evaluation based on throughput or bandwidth
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/64Routing or path finding of packets in data switching networks using an overlay routing layer
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/125Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/50Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]

Definitions

  • the present application relates to the field of communications technologies, and in particular, to a path establishing method and a controller.
  • Point-to-Multipoint Traffic Engineering establishes a "tree" path (ie, tunnel) from one head node (ie, ingress node) to multiple tail nodes (ie, egress nodes).
  • a "tree" path ie, tunnel
  • the node in the P2MP TE supports the Resource ReSerVation Protocol (RSVP). Therefore, when the path is established, the head node needs to collect the information of all the nodes in the P2MP TE network through the refresh message in the RSVP. When the information changes, the head node needs to notify the changed nodes of all the nodes in the P2MP TE network through the refresh message. This way of establishing the P2MP TE makes the path establishment process complicated and is not conducive to network management and maintenance.
  • RSVP Resource ReSerVation Protocol
  • the embodiment of the present application discloses a path establishment method and a controller, which are used to reduce the complexity of establishing a P2MP TE path.
  • a path establishment method is disclosed, which is applied to a controller that manages at least three nodes, each of the at least three nodes having a Multi-Protocol Label Switching (MPLS) forwarding function and Segment routing (SR) function, when detecting a path establishment request for establishing a P2MP TE including header node information and tail node information,
  • MPLS Multi-Protocol Label Switching
  • SR Segment routing
  • the head node information and the tail node information calculate a P2MP TE path, that is, calculate a path from a head node to a plurality of tail nodes, and then identify a target fork node in the P2MP TE path, and obtain a label of the target fork node, and the head node information
  • the first information is sent to the third node, and the second information is sent to the target fork node.
  • the P2MP TE path includes at least one bifurcation node and at least two tail nodes, and the target bifurcation node is connected to at least the first node and the second node, where the first node is the first tail node or the target bifurcation node and the first tail a node between nodes, the second node is a second tail node or a node between the target fork node and the second tail node, the first tail node and the second tail node are nodes in the at least two tail nodes, and the target forks
  • the node is any one of the at least one bifurcation node, and the first information may include a label of the target bifurcation node and path information of the P2MP TE path from the third node to the target bifurcation node, where the first information may indicate When receiving the first packet, the third node encapsulates the path information and the label of the target fork node in the first packet, where the path information may instruct the third node to forward
  • the second information may be used to indicate that the target fork node generates the first multicast forwarding entry, and the first multicast forwarding entry may include the target bifurcation node to the tail node information in the P2MP TE path. Node information of the path, the first multicast forwarding entry may be the first packet in a first forwarding multicast forwarding entry upon receiving a first packet comprising a label of a target node in the bifurcated bifurcated target node.
  • the controller when the third node corresponding to the head node information is the same node as the target fork node, the controller sends the third information and the label of the target fork node to the target fork node, and the label of the target fork node
  • the target bifurcation node may be configured to generate a second multicast forwarding entry according to the third information, where the second multicast forwarding entry may include information about a path of the node corresponding to the node from the target bifurcation node to the tail node information in the P2MP TE path, where The second multicast forwarding entry is used to forward the second packet according to the second multicast forwarding entry when the target fork node receives the second packet, so that the fork node can be established in the path. P2MP TE path.
  • the pre-allocated label for the bifurcation node may be stored in the bifurcation node.
  • the controller sends a label acquisition request message to the target bifurcation node, and then the target is received.
  • the information may indicate that the target fork node allocates a label from the stored at least one label to the target fork node in the P2MP TE path that needs to be established, so that different protocols may be prevented from using the same label to cause a forwarding conflict.
  • the pre-assigned label for the bifurcation node may be stored in the controller. After the P2MP TE path is calculated, the controller may select the target in the P2MP TE path to be established from the stored at least one label. The fork node assigns a label to improve the control of the controller.
  • the Constrained Shortest Path First (CSPF) algorithm may be used to calculate an optimal P2MP TE path between the nodes corresponding to the third node and the tail node information corresponding to the head node information, and the P2MP TE path may be made. Meet business forwarding needs.
  • CSPF Constrained Shortest Path First
  • the path establishment request may further include a required bandwidth
  • the P2MP TE path whose bandwidth capacity is greater than or equal to the required bandwidth may be selected from the path between the nodes corresponding to the third node and the tail node information corresponding to the header information.
  • a P2MP TE path that meets the bandwidth requirements can be established.
  • the path establishment request may further include a required maximum delay, and a path with a delay not greater than the required maximum delay may be selected from the path between the node corresponding to the third node and the tail node information corresponding to the header node information.
  • a P2MP TE path that meets the delay requirement can be established.
  • the path establishment request may further include an affinity attribute of the link, and the affinity attribute may be selected from the path between the node corresponding to the third node and the tail node information corresponding to the header node information to satisfy the affinity attribute of the link.
  • the path can be established to meet the P2MP TE path required by the affinity attribute of the link.
  • a controller comprising means for performing the path establishment method disclosed in the first aspect or any of the possible implementations of the first aspect.
  • a controller managing at least three nodes, the controller including a processor, a memory, and a transceiver, wherein
  • a set of program code is stored in the memory, and the processor is used to call the program code stored in the memory to perform the following operations:
  • the P2MP TE path is calculated by using the header node information and the tail node information included in the path establishment request, where the P2MP TE path includes at least a fork node and at least two tail nodes;
  • the transceiver is configured to: when the third node corresponding to the head node information is not the same node as the target fork node, send first information to the third node, and send the information to the target fork node a second information, where the first information includes path information of the label and the third node to the target fork node in the P2MP TE path, where the first information is used to indicate the third node
  • the path information and the label are encapsulated in the first packet
  • the path information is used to indicate that the third node encapsulates the encapsulated first packet according to the first packet.
  • the path information is forwarded, and the second information is used to indicate that the target fork node generates a first multicast forwarding entry, where the first multicast forwarding entry includes the target in the P2MP TE path.
  • the information about the path of the node corresponding to the node corresponding to the tail node information, where the first multicast forwarding entry is used when the target fork node receives the first packet including the label The first packet is forwarded according to the first multicast The entry is forwarded.
  • a fourth aspect discloses a readable storage medium storing program code for a controller to perform the path establishment method disclosed in the first aspect or any of the possible implementations of the first aspect.
  • the controller when the P2MP TE path is established, the controller only needs to send information to the head node and the fork node in the P2MP TE path, and does not need to send information to all nodes in the P2MP TE path, which can reduce P2MP TE.
  • the complexity of the path establishment process facilitates network management and maintenance.
  • FIG. 1 is a schematic diagram of a network architecture disclosed in an embodiment of the present application.
  • FIG. 2 is a schematic flowchart of a path establishment method disclosed in an embodiment of the present application.
  • FIG. 3 is a schematic structural diagram of a controller disclosed in an embodiment of the present application.
  • FIG. 4 is a schematic structural diagram of another controller disclosed in an embodiment of the present application.
  • FIG. 5 is a schematic structural diagram of a path establishment system disclosed in an embodiment of the present application.
  • FIG. 6 is a schematic diagram of a PCLR resv message format disclosed in an embodiment of the present application.
  • FIG. 7 is a schematic diagram of a LABEL-NUMBER format in a PCLR resv message format disclosed in an embodiment of the present application;
  • FIG. 8 is a schematic diagram of a PCLabelUpd Message format disclosed in the implementation of the present application.
  • FIG. 9 is a schematic diagram of a LABEL format in a PCLabelUpd Message format disclosed in an embodiment of the present application.
  • FIG. 10 is a schematic diagram of a LABEL-ATACK format in a PCLabelUpd Message format disclosed in an embodiment of the present application;
  • FIG. 11 is a schematic diagram of a label stack sub-TLV disclosed in an embodiment of the present application.
  • the embodiment of the present application discloses a path establishment method and a controller, which are used to reduce the complexity of establishing a P2MP TE path. The details are described below separately.
  • FIG. 1 is a schematic diagram of a network architecture disclosed in an embodiment of the present application.
  • the path establishment network architecture may include a controller 101 and a plurality of nodes 102.
  • the plurality of nodes 102 include nodes R1, R2, R3, R4, R5, and R6 in FIG.
  • the nodes 102 have an MPLS forwarding function and an SR function.
  • the head node and the fork node are two different nodes, and the controller 101 establishes a network connection with the head node and the fork node.
  • the fork node establishes a network connection with at least three nodes, as shown in the left diagram of FIG.
  • the head node and the branch node of the plurality of nodes 102 may also be the same node, and the controller 101 establishes a network connection with the head node or the fork node, and the branch node and the at least two nodes are connected through the network, as shown in the figure on the right side of FIG. Shown.
  • the controller 101 is configured to detect a path establishment request of the P2MP TE, and respond to the path establishment request of the P2MP TE, calculate a P2MP TE path, and send related information of the P2MP TE path to the head node and/or the fork node in the P2MP TE. Therefore, the node in the P2MP TE path forwards the packet according to the information.
  • the path establishment request of the P2MP TE may be sent by the head node to the controller 101, or may be generated by the controller 101, or may be sent to the controller by a device other than the node 102 and the controller 101 in the P2MP TE network.
  • the embodiment of the present application is not limited.
  • FIG. 2 is a schematic flowchart of a path establishment method according to an embodiment of the present application.
  • the embodiment of the present application is described from the perspective of the controller 101.
  • the path establishment method may include the following steps.
  • the controller may obtain the topology between the nodes in the network in advance through the Internal Gateway Protocol (IGP) or the Border Gateway Protocol (BGP), and may pass the path in advance.
  • Computing communication protocol Path The Computation Element Communication Protocol (PCEP) acquires a Label Switch Path (LSP) between nodes in the network. Therefore, when the controller detects a path establishment request for establishing a P2MP TE including the head node information and the tail node information, the head node information, the tail node information, the topology between the nodes, and the LSP between the nodes may be used.
  • the P2MP TE path is calculated, that is, the path between the nodes corresponding to the node-to-tail node information corresponding to the header information is calculated.
  • the head node is R1 in the figure on the left side of Figure 1
  • the tail node is R5 and R6 in the figure on the left side of Figure 1
  • the calculated P2MP TE path can be R1-R2-R3-R4-R5 and R1-R2- R3-R6.
  • the calculated P2MP TE path may include at least one fork node and at least two tail nodes.
  • the controller may use the CSPF algorithm to calculate an optimal path between the node corresponding to the node node information and the node corresponding to the tail node information, so that the packet transmission path may be optimized.
  • the path establishment request may further include information such as a required bandwidth, a required maximum delay, and an affinity attribute of the link.
  • the node may correspond to the node corresponding to the header information.
  • the path of the node corresponding to the node information is selected from at least one of the required bandwidth, the required maximum delay, and the affinity attribute of the link, so that the calculated P2MP TE path meets the service requirement, and the service report can be implemented. Transmission of text.
  • the controller may send a label acquisition request to the target fork node, so that the target fork node returns the allocated label for the P2MP TE path, or the controller allocates the label for the P2MP TE path, which is not limited in this embodiment.
  • the target fork node is connected to at least the first node and the second node, the first node is the first tail node, or the first node is a node between the target fork node and the first tail node, and the second node is the second node.
  • a tail node or the second node is a node between the target fork node and the second tail node, the first tail node and the second tail node are nodes in at least two tail nodes, and the target fork node is the at least one fork Any of the fork nodes in the node.
  • the label of the target fork node may be allocated by the target fork node itself.
  • the controller may use the Path Computation Element Communication Protocol (PCEP) to add a PCLRResv message (message) to request the label of the target fork node.
  • PCEP Path Computation Element Communication Protocol
  • FIG. 6 is a schematic diagram of a PCLR resv message format disclosed in an embodiment of the present application.
  • FIG. 7 is a schematic diagram of a LABEL-NUMBER format in a PCLR resv message format disclosed in an embodiment of the present application.
  • the label type in the LABEL-NUMBER format is used to indicate whether it is a global label or a partial label.
  • the label can be a local label.
  • the label type is 2
  • the label can be a global label;
  • LABEL-NUMBER format The Label number in the label is used to indicate the number of labels required;
  • the F in the LABEL-NUMBER format is used to indicate whether the label is applied or returned.
  • F When F is set to 0, it indicates that the label is applied.
  • the F flag When the F flag is set to 1, Indicates that the label is returned;
  • Label1-n value in the LABEL-NUMBER format is the label value returned by the target fork node to the controller.
  • the third node corresponding to the head node information is not the same node as the target fork node, send the first information to the third node, and send the second information to the target fork node.
  • the controller may extend the PCEP protocol, and add a PCLabelUpd message to deliver the first information to the third node and the second information to the target fork node.
  • FIG. 8 is a schematic diagram of a PCLabelUpd Message format disclosed in the implementation of the present application.
  • FIG. 9 is a schematic diagram of a LABEL format in a PCLabelUpd Message format disclosed in an embodiment of the present application. The O bit in the LABEL format is used to indicate the type of the label. When the flag is set to 1, it indicates that the label is an outgoing label. When the flag is set to non-1, it indicates that the label is an incoming label. Please refer to FIG. 10.
  • FIG. 10 is a schematic diagram of a LABEL format in a PCLabelUpd Message format disclosed in an embodiment of the present application. The O bit in the LABEL format is used to indicate the type of the label. When the flag is set to 1, it indicates that the label is an outgoing label. When the flag is set to non-1,
  • FIG. 10 is a schematic diagram of a LABEL-ATACK format in a PCLabelUpd Message format disclosed in an embodiment of the present application. Among them, the stacks number in the LABEL-ATACK format is used to indicate the data of the label stack. Please refer to FIG. 11.
  • FIG. 11 is a schematic diagram of a label stack sub-TLV disclosed in an embodiment of the present application. The index in the label stack sub-TLV is used to indicate the first label stack.
  • the third node corresponding to the head node information is not the same node as the target fork node, that is, the head node is not a fork node, the third node is sent to the third node.
  • the first information may include the label of the target fork node and the path information of the P2MP TE path from the third node to the target fork node, where the first information may indicate that the third node receives the first packet
  • the path information and the label of the target fork node are encapsulated in the first packet, and the label of the target fork node is after the path information in the encapsulated first packet, and the path information may indicate that the third node will be encapsulated.
  • the first packet is forwarded according to the path information.
  • the first information may be sent to the third node in a label stack manner. For example, the label stack sent by the controller to the head node R1 in the figure on the left side of FIG.
  • L12 and L23 may represent paths from the head node R1 to the branch node R3 in the P2MP TE path, that is, the message forwarding path is node R1-node R2-node R3.
  • the second information is sent to the target fork node, and the second information may be used to indicate that the target fork node generates the first multicast forwarding entry, where the first multicast forwarding entry may include the target fork node to the tail node in the P2MP TE path.
  • the information about the path of the node corresponding to the information, the first multicast forwarding entry may be the first packet according to the first multicast forwarding table when the target fork node receives the first packet including the label of the target fork node
  • the item is forwarded, that is, the first packet is copied by the number of the path number included in the first multicast forwarding entry, and each first packet is forwarded according to a path included in the first multicast forwarding entry, for example: From the node R3 to the tail node R5 and the node R6, respectively, a path is formed.
  • the node R3 can copy the packet into two copies, and then forward the packet to the node R5 according to R3-R4-R5, and Forward to node R6 according to R3-R6.
  • the first information and the second information are respectively sent to the third node and the target fork node through the PCLabelUpd message.
  • the third node corresponding to the head node information is the same node as the target fork node, send the third information and the label of the target fork node to the target fork node.
  • the label and the third information of the target fork node are sent to the target fork node through the PCLabelUpd message, and the target fork node is
  • the tag may indicate that the target fork node generates a second multicast forwarding entry according to the third information, where the second multicast forwarding entry may include information about a path of the node corresponding to the node from the target fork node to the tail node information in the P2MP TE path.
  • the second multicast forwarding entry may forward the second packet according to the second multicast forwarding entry when the second packet is received by the target fork node, that is, the second packet is copied to the second packet.
  • the third information may further include information indicating that the target bifurcation node is an ingress node, and may indicate that the target bifurcation node is an ingress node.
  • the P2MP TE path is calculated using the header node information and the tail node information included in the path establishment request, and the target in the P2MP TE path is identified.
  • Bifurcation node and acquiring a label of the target fork node, when the third node corresponding to the header node information is not the same node as the target fork node, sending the first information to the third node, and sending the second information to the target fork node
  • the third information and the label of the target fork node are sent to the target fork node.
  • the controller when the P2MP TE path is established, the controller only needs to The head node and/or the fork node in the P2MP TE path can send information to all the nodes in the P2MP TE path, which can reduce the complexity of the P2MP TE path establishment process and facilitate network management and maintenance.
  • FIG. 3 is a schematic structural diagram of a controller disclosed in an embodiment of the present application.
  • the controller can be the controller in the embodiment shown in FIG. 2.
  • the controller may include:
  • the calculating unit 301 is configured to: when detecting a path establishment request for establishing a P2MP TE, calculate a P2MP TE path by using the header node information and the tail node information included in the path establishment request, where the P2MP TE path includes at least one bifurcation node and at least two Tail node
  • the identifying unit 302 is configured to identify a target bifurcation node in the P2MP TE path calculated by the computing unit 301, where the target bifurcation node is connected to at least the first node and the second node, and the first node is the first tail node, or the first node
  • the obtaining unit 303 is configured to acquire a label of the target fork node identified by the identifying unit 302.
  • the sending unit 304 is configured to: when the third node corresponding to the head node information is not the same node as the target fork node, send the first information to the third node, and send the second information to the target fork node identified by the identifying unit 302, where The information includes the label obtained by the obtaining unit 303 and the path information of the P2MP TE path calculated by the calculating unit from the third node to the target fork node.
  • the first information is used to indicate that the third node receives the first packet.
  • the information and the label of the target fork node are encapsulated in the first packet
  • the path information is used to instruct the third node to forward the encapsulated first packet according to the path information
  • the second information is used to indicate that the target fork node generates the first A multicast forwarding entry
  • the first multicast forwarding entry includes information about a path of a node corresponding to the destination node from the destination fork node to the tail node information in the P2MP TE path, where the first multicast forwarding entry is used for the target fork node receiving
  • the first packet is forwarded according to the first multicast forwarding entry.
  • the sending unit 304 is further configured to: when the third node corresponding to the head node information and the target fork node are the same node, send the third information and the acquiring unit to the target fork node identified by the identifying unit 302. 303.
  • the label of the target bifurcation node is obtained.
  • the label of the target bifurcation node is used to indicate that the target bifurcation node generates a second multicast forwarding entry according to the third information, where the second multicast forwarding entry includes the P2MP TE calculated by the computing unit.
  • the information of the path of the node corresponding to the information of the node from the target bifurcation node to the tail node information, and the second multicast forwarding entry is used to select the second packet according to the second group when the target bifurcation node receives the second packet Broadcast forwarding entries are forwarded.
  • the obtaining unit 303 is specifically configured to:
  • the receiving target fork node sends a response message, and the response message includes a label.
  • the obtaining unit 303 is specifically configured to allocate a label to the target fork node.
  • the calculating unit 301 is specifically configured to calculate, by using the constraint shortest path first CSPF algorithm, a P2MP TE path between nodes corresponding to the third node and the tail node information corresponding to the header node information.
  • the P2MP TE path is calculated using the header node information and the tail node information included in the path establishment request, and the target points in the P2MP TE path are identified.
  • Crossing the node, and acquiring the label of the target fork node when the third node corresponding to the head node information is not the same node as the target fork node, sending the first information to the third node, and sending the second information to the target fork node,
  • the third node corresponding to the head node information is the same node as the target fork node
  • the third information and the label of the target fork node are sent to the target fork node.
  • the controller only needs to go to the P2MP.
  • the head node and/or the fork node in the TE path send information without sending information to all the nodes in the P2MP TE path, which can reduce the complexity of the P2MP TE path establishment process and facilitate network management and maintenance.
  • FIG. 4 is a schematic structural diagram of another controller disclosed in the embodiment of the present application.
  • the controller can be the controller in the embodiment shown in FIG. 2.
  • the controller may include a processor 401, a memory 402, and a transceiver 403. among them:
  • a set of program codes is stored in the memory 402, and the processor 401 is configured to call the program code stored in the memory 402 to perform the following operations:
  • the P2MP TE path is calculated by using the header node information and the tail node information included in the path establishment request, where the P2MP TE path includes at least one fork node and at least two Tail node
  • the target bifurcation node is connected to at least the first node and the second node, the first node is the first tail node, or the first node is the target a node between the branch node and the first tail node, the second node is a second tail node, or the second node is a node between the target fork node and the second tail node, and the first tail node and the second tail node are at least a node in two tail nodes, the target fork node is any one of at least one fork node;
  • the transceiver 403 is configured to: when the third node corresponding to the head node information is not the same node as the target fork node, send the first information to the third node, and send the second information to the target fork node, where the first information includes the target point The label of the fork node and the path from the third node to the target fork node in the P2MP TE path
  • the path information is used to indicate that the third node receives the first packet, and encapsulates the path information and the label of the target fork node in the first packet, where the path information is used to indicate that the third node is to be encapsulated.
  • the first packet is forwarded according to the path information, and the second information is used to indicate that the target fork node generates the first multicast forwarding entry, where the first multicast forwarding entry includes the target bifurcation node to the tail node information in the P2MP TE path.
  • the information about the path of the corresponding node, the first multicast forwarding entry is used by the target branching node to receive the first packet of the label including the target fork node, and the first packet is forwarded according to the first multicast forwarding entry. Forward.
  • the transceiver 503 is further configured to: when the third node corresponding to the header node information is the same node as the target fork node, send the third information and the label of the target fork node to the target fork node,
  • the label of the target fork node is used to indicate that the target fork node generates the second multicast forwarding entry according to the third information, where the second multicast forwarding entry includes the node corresponding to the information from the target fork node to the tail node in the P2MP TE path.
  • the information of the path, the second multicast forwarding entry is used to forward the second packet according to the second multicast forwarding entry when the target bifurcation node receives the second packet.
  • the acquiring, by the processor 401, the label of the target fork node includes:
  • the transceiver 403 sends a label acquisition request message to the target fork node, where the label acquisition request message is used to indicate that the target fork node allocates a label for the P2MP TE path.
  • the transceiver 403 receives the target fork node to send a response message, and the response message includes a label.
  • the acquiring, by the processor 401, the label of the target fork node includes:
  • the processor 401 assigns a label to the target fork node.
  • the processor 401 calculates the P2MP TE path by using the header node information and the tail node information included in the path establishment request, including:
  • the processor 401 calculates the P2MP TE path between the nodes corresponding to the third node and the tail node information corresponding to the header node information by using the constrained shortest path first CSPF algorithm.
  • steps 201 and 202 can be performed by the processor 401 in the controller to call the program code stored in the memory 402, and the steps 203 and 204 can be performed by the transceiver 403 in the controller.
  • the calculation unit 301, the identification unit 302, and the acquisition unit 303 can be implemented by the processor 401 and the memory 402 in the controller, and the sending unit 304 can be implemented by the transceiver 403 in the controller. Now.
  • the P2MP TE path is calculated using the header node information and the tail node information included in the path establishment request, and the target points in the P2MP TE path are identified.
  • Crossing the node, and acquiring the label of the target fork node when the third node corresponding to the head node information is not the same node as the target fork node, sending the first information to the third node, and sending the second information to the target fork node,
  • the third node corresponding to the head node information is the same node as the target fork node, the third information and the label of the target fork node are sent to the target fork node.
  • the controller only needs to go to the P2MP.
  • the head node and/or the fork node in the TE path send information without sending information to all the nodes in the P2MP TE path, which can reduce the complexity of the P2MP TE path establishment process and facilitate network management and maintenance.
  • FIG. 5 is a schematic structural diagram of a path establishment system according to an embodiment of the present application.
  • the path establishment system includes a controller 501 and at least three nodes 502, wherein:
  • the controller 501 is configured to: when detecting a path establishment request for establishing a P2MP TE, calculate a P2MP TE path by using the header node information and the tail node information included in the path establishment request, and identify a target bifurcation node in the P2MP TE path, and Obtaining a label of the target bifurcation node, the P2MP TE path includes at least one bifurcation node and at least two tail nodes, the target bifurcation node is connected to at least the first node and the second node, and the first node is the first tail node, or the One node is the node between the target bifurcation node and the first tail node, the second node is the second tail node, or the second node is the node between the target bifurcation node and the second tail node, the first tail node and the second node.
  • the tail node is a node of at least two tail nodes, and the target fork node is any one
  • the controller 501 is further configured to: when the third node corresponding to the header node information is not the same node as the target fork node, send the first information to the third node, and send the second information to the target fork node, where the first information includes the target The label of the forked node and the path information of the P2MP TE path from the third node to the target fork node.
  • the third node 502 is configured to receive the first information, receive the first packet, encapsulate the path information and the label of the target fork node in the first packet, and forward the encapsulated first packet according to the path information to The target bifurcation node, the label of the target bifurcation node is after the path information in the encapsulated first packet;
  • the target fork node 502 is configured to receive the second information, generate a first broadcast forwarding entry, and receive the first packet including the label of the target fork node, and the first packet is forwarded according to the first multicast forwarding entry.
  • the information of the path of the node corresponding to the node corresponding to the tail node information in the included P2MP TE path is forwarded.
  • the controller 501 is further configured to: when the third node corresponding to the head node information and the target fork node are the same node, send the third information and the label of the fork node to the target fork node;
  • the target bifurcation node 502 is further configured to generate a second multicast forwarding entry according to the third information, receive the second packet, and switch the second packet according to the second photo multicast according to the label of the target bifurcation node.
  • the publication item includes information of the path of the node corresponding to the node corresponding to the tail node information in the P2MP TE path.
  • the controller 501 acquiring the label of the target fork node includes:
  • the controller 501 sends a label acquisition request message to the target fork node 502;
  • the target fork node 502 assigns a label to the P2MP TE path and sends it to the controller 501;
  • the controller 501 receives the tag transmitted by the target fork node 502.
  • the controller 501 acquires the label of the target fork node 502, including:
  • a label is assigned to the target furcation node 502.
  • the controller 501 calculates the P2MP TE path by using the header node information and the tail node information included in the path establishment request, including:
  • the constrained shortest path first CSPF algorithm is used to calculate the P2MP TE path between the nodes corresponding to the third node and the tail node information corresponding to the header node information.
  • the head node is indicated by a dotted line, which may indicate that the head node may be the same node as the fork node, or may be a different node.
  • the P2MP TE path is calculated using the header node information and the tail node information included in the path establishment request, and the target points in the P2MP TE path are identified.
  • Crossing the node, and acquiring the label of the target fork node when the third node corresponding to the head node information is not the same node as the target fork node, sending the first information to the third node, and sending the second information to the target fork node,
  • the third node corresponding to the head node information is the same node as the target fork node
  • the third information and the label of the target fork node are sent to the target fork node.
  • the controller only needs to go to the P2MP.
  • the head node and/or the fork node in the TE path send information without sending information to all the nodes in the P2MP TE path, which can reduce the complexity of the P2MP TE path establishment process and facilitate network management and maintenance.
  • a readable storage medium stores program code for executing a path establishment method corresponding to FIG. 2 of the embodiment of the present application.
  • the program may be stored in a computer readable storage medium, and the storage medium may include: Flash disk, read-only memory (ROM), random access memory (RAM), disk or optical disk.

Landscapes

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

Abstract

一种路径建立方法及控制器,包括:当检测到用于建立P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,P2MP TE路径包括至少一个分叉节点和至少两个尾节点;识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,目标分叉节点是至少一个分叉节点中的分叉节点;当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,并向目标分叉节点发送第二信息,第一信息用于指示第三节点接收到报文时将路径信息和标签封装在报文中,路径信息用于指示第三节点将封装后的报文按照路径信息进行转发,第二信息用于指示目标分叉节点生成组播转发表项。本申请实施例,可以降低P2MP TE路径建立的复杂度。

Description

一种路径建立方法及控制器
本申请要求于2016年05月10日提交中国专利局、申请号为201610307327.2、发明名称为“一种路径建立方法及控制器”的中国专利申请的优先权,其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信技术领域,尤其涉及一种路径建立方法及控制器。
背景技术
点到多点流量工程(Point-to-Multipoint Traffic Engineering,P2MP TE)通过建立一条由一个头节点(即入节点)到多个尾节点(即出节点)的“树形”路径(即隧道)来实现组播业务,可见,路径的建立是P2MP TE实现组播业务必不可少的过程。目前,P2MP TE中的节点支持资源预留协议(Resource ReSerVation Protocol,RSVP),因此,在建立路径时,头节点需要通过RSVP中的refresh消息收集P2MP TE网络中所有节点的信息,当存在节点的信息发生变化时,头节点需要将改变的信息通过refresh消息通知P2MP TE网络中所有节点,这种建立P2MP TE的方式使得路径建立过程复杂,并且不利于网络的管理和维护。
发明内容
本申请实施例公开了一种路径建立方法及控制器,用于降低P2MP TE路径建立的复杂度。
第一方面,公开一种路径建立方法,该方法应用于管理至少三个节点的控制器,这至少三个节点中每个节点具有多协议标签交换(Multi-Protocol Label Switching,MPLS)转发功能和分段路由(Segment Routing,SR)功能,当检测到包括头节点信息和尾节点信息的用于建立P2MP TE的路径建立请求时,使用 头节点信息和尾节点信息计算P2MP TE路径,即计算从一个头节点到多个尾节点的路径,之后识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息。其中,P2MP TE路径包括至少一个分叉节点和至少两个尾节点,目标分叉节点至少与第一节点和第二节点连接,第一节点是第一尾节点或者目标分叉节点与第一尾节点间的节点,第二节点是第二尾节点或者目标分叉节点与第二尾节点间的节点,第一尾节点和第二尾节点是这至少两个尾节点中的节点,目标分叉节点是这至少一个分叉节点中的任一分叉节点,第一信息可以包括目标分叉节点的标签和P2MP TE路径中由第三节点到目标分叉节点的路径信息,第一信息可以指示第三节点接收到第一报文时将路径信息和目标分叉节点的标签封装在第一报文中,该路径信息可以指示第三节点将封装后的第一报文按照该路径信息进行转发,第二信息可以指示目标分叉节点生成第一组播转发表项,第一组播转发表项可以包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第一组播转发表项可以在目标分叉节点接收到包括目标分叉节点的标签的第一报文时将第一报文按照第一组播转发表项进行转发。
在一个实施例中,当头节点信息对应的第三节点与目标分叉节点为同一节点时,控制器将向目标分叉节点发送第三信息和目标分叉节点的标签,目标分叉节点的标签可以指示目标分叉节点根据第三信息生成第二组播转发表项,第二组播转发表项可以包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第二组播转发表项用于当目标分叉节点接收到第二报文时将第二报文按照第二组播转发表项进行转发,可以使不论分叉节点在路径中的那儿都能建立P2MP TE路径。
在一个实施例中,为分叉节点预先分配好的标签可以存储在分叉节点中,计算得到P2MP TE路径之后,控制器将向目标分叉节点发送标签获取请求消息,之后将会接收到目标分叉节点发送的包含标签的响应消息,该标签获取请求消 息可以指示目标分叉节点从存储的至少一个标签中为需要建立的P2MP TE路径中的目标分叉节点分配一个标签,可以避免不同的协议使用相同的标签导致转发冲突。
在一个实施例中,为分叉节点预先分配好的标签可以存储在控制器中,计算得到P2MP TE路径之后,控制器可以从存储的至少一个标签中为需要建立的P2MP TE路径中的目标分叉节点分配一个标签,可以提高控制器的控制能力。
在一个实施例中,可以使用约束最短路径优先(Constrained Shortest Path First,CSPF)算法计算头节点信息对应的第三节点与尾节点信息对应的节点间的最优P2MP TE路径,可以使P2MP TE路径满足业务转发需要。
在一个实施例中,路径建立请求还可以包括所需带宽,可以从头节点信息对应的第三节点与尾节点信息对应的节点间的路径中选取带宽容量大于或等于所需带宽的P2MP TE路径,可以建立满足带宽要求的P2MP TE路径。
在一个实施例中,路径建立请求还可以包括所需最大时延,可以从头节点信息对应的第三节点与尾节点信息对应的节点间的路径中选取时延不大于所需最大时延的路径,可以建立满足时延要求的P2MP TE路径。
在一个实施例中,路径建立请求还可以包括链路的亲和属性,可以从头节点信息对应的第三节点与尾节点信息对应的节点间的路径中选取亲和属性满足链路的亲和属性的路径,可以建立满足链路的亲和属性要求的P2MP TE路径。
第二方面,公开一种控制器,该控制器包括用于执行第一方面或第一方面的任一种可能实现方式所公开的路径建立方法的单元。
第三方面,公开一种控制器,所述控制器管理至少三个节点,所述控制器包括处理器、存储器和收发器,其中;
存储器中存储有一组程序代码,处理器用于调用存储器中存储的程序代码执行以下操作:
当检测到用于建立P2MP TE的路径建立请求时,使用所述路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,所述P2MP TE路径包括至少 一个分叉节点和至少两个尾节点;
识别所述P2MP TE路径中的目标分叉节点,并获取所述目标分叉节点的标签,所述目标分叉节点至少与第一节点和第二节点连接,所述第一节点是第一尾节点,或者所述第一节点为所述目标分叉节点与第一尾节点间的节点,所述第二节点是第二尾节点,或者所述第二节点为所述目标分叉节点与第二尾节点间的节点,所述第一尾节点和所述第二尾节点是所述至少两个尾节点中的节点,所述目标分叉节点是所述至少一个分叉节点中的任一分叉节点;
所述收发器,用于当所述头节点信息对应的第三节点与所述目标分叉节点不是同一节点时,向所述第三节点发送第一信息,以及向所述目标分叉节点发送第二信息,所述第一信息包括所述标签和所述P2MP TE路径中由所述第三节点到所述目标分叉节点的路径信息,所述第一信息用于指示所述第三节点接收到第一报文时,将所述路径信息和所述标签封装在所述第一报文中,所述路径信息用于指示所述第三节点将封装后的所述第一报文按照所述路径信息进行转发,所述第二信息用于指示所述目标分叉节点生成第一组播转发表项,所述第一组播转发表项包括所述P2MP TE路径中由所述目标分叉节点到所述尾节点信息对应的节点的路径的信息,所述第一组播转发表项用于所述目标分叉节点接收到包括所述标签的第一报文时,将所述第一报文按照所述第一组播转发表项进行转发。
第四方面公开一种可读存储介质,该可读存储介质存储了控制器用于执行第一方面或第一方面的任一种可能实现方式所公开的路径建立方法的程序代码。
本申请实施例中,在建立P2MP TE路径时,控制器只需要向P2MP TE路径中的头节点和分叉节点发送信息,而不需要向P2MP TE路径中的所有节点发送信息,可以降低P2MP TE路径建立过程的复杂度,便于网络的管理和维护。
附图说明
为了更清楚地说明本申请实施例中的技术方案,下面将对实施例中所需要使 用的附图作简单地介绍,显而易见地,下面描述中的附图仅是本申请的一些实施例,对于本领域普通技术人员来讲,在不付出创造性劳动性的前提下,还可以根据这些附图获得其他的附图。
图1是本申请实施例公开的一种网络架构示意图;
图2是本申请实施例公开的一种路径建立方法的流程示意图;
图3是本申请实施例公开的一种控制器的结构示意图;
图4是本申请实施例公开的另一种控制器的结构示意图;
图5是本申请实施例公开的一种路径建立系统的结构示意图;
图6是本申请实施例公开的一种PCLRresv message格式的示意图;
图7是本申请实施例公开的一种PCLRresv message格式中的LABEL-NUMBER格式的示意图;
图8是本申请实施公开的一种PCLabelUpd Message格式的示意图;
图9是本申请实施例公开的一种PCLabelUpd Message格式中的LABEL格式的示意图;
图10是本申请实施例公开的一种PCLabelUpd Message格式中的LABEL-ATACK格式的示意图;
图11是本申请实施例公开的一种label stack sub-TLV的示意图。
具体实施方式
下面将结合本申请实施例中的附图,对本申请实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅是本申请一部分实施例,而不是全部的实施例。基于本申请中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都属于本申请保护的范围。
本申请实施例公开了一种路径建立方法及控制器,用于降低P2MP TE路径建立的复杂度。以下分别进行详细说明。
为了更好地理解本申请实施例公开的一种路径建立方法及控制器,下面先对本申请实施例使用的网络架构进行描述。请参阅图1,图1是本申请实施例公开的一种网络架构示意图。如图1所示,该路径建立网络架构可以包括控制器101和多个节点102,例如:该多个节点102包括图1中的节点R1,R2,R3,R4,R5和R6等,该多个节点102具有MPLS转发功能和SR功能。该多个节点102中存在至少一个分叉节点(branch node)102,以及至少两个尾节点(egress node)102。此外,该多个节点102中可以存在一个头节点(ingress node)102,此时,头节点和分叉节点是两个不同的节点,控制器101与头节点和分叉节点之间建立网络连接,此时分叉节点与至少三个节点建立网络连接,如图1左边的图所示。该多个节点102中头节点和分叉节点也可以为同一节点,控制器101与头节点或分叉节点建立网络连接,分叉节点与至少两个节点通过网络连接,如图1右边的图所示。控制器101用于检测P2MP TE的路径建立请求,并响应P2MP TE的路径建立请求,计算P2MP TE路径,并将P2MP TE路径的相关信息发送给P2MP TE中的头节点和/或分叉节点,以便P2MP TE路径中节点根据这些信息转发报文。其中,P2MP TE的路径建立请求可以是头节点发送给控制器101的,也可以是控制器101生成的,还可以是除P2MP TE网络中节点102和控制器101之外的设备发送给控制器101的,本申请实施例不作限定。
基于图1所示的网络架构,请参阅图2,图2是本申请实施例公开的一种路径建立方法的流程示意图。其中,本申请实施例是从控制器101的角度来描述的。如图2所示,该路径建立方法可以包括以下步骤。
201、当检测到用于建立P2MP TE的路径建立请求时,使用该路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径。
本实施例中,控制器(controller)可以预先通过内部网关协议(Internal Gateway Protocol,IGP)或边界网关协议(Border Gateway Protocol,BGP)获取到网络中节点之间的拓扑结构,以及可以预先通过路径计算通信协议(Path  Computation Element Communication Protocol,PCEP)获取网络中节点之间的标签交换路径(Label Switch Path,LSP)。因此,当控制器检测到包括头节点信息和尾节点信息的用于建立P2MP TE的路径建立请求时,可以根据该头节点信息、尾节点信息、节点之间的拓扑结构和节点之间的LSP计算P2MP TE路径,即计算头节点信息对应的节点到尾节点信息对应的节点间的路径。例如:头节点为图1左边的图中的R1,以及尾节点为图1左边的图中的R5和R6,计算的P2MP TE路径可以为R1-R2-R3-R4-R5以及R1-R2-R3-R6。其中,计算的P2MP TE路径可以包括至少一个分叉节点和至少两个尾节点。
作为一种可能的实施方式,控制器可以使用CSPF算法计算头节点信息对应的节点与尾节点信息对应的节点间的最优路径,可以使报文传输路径最优。
作为一种可能的实施方式,路径建立请求还可以包括所需带宽、所需最大时延、链路的亲和属性等信息,控制器计算P2MP TE路径时,可以从头节点信息对应的节点到尾节点信息对应的节点的路径中选取满足所需带宽、所需最大时延、链路的亲和属性等信息中至少一种的路径,以便使计算的P2MP TE路径满足业务要求,可以实现业务报文的传输。
202、识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签。
本实施例中,计算得到P2MP TE路径之后,需要识别P2MP TE路径中的目标分叉节点,即识别P2MP TE路径从哪个节点开始分路,这个节点即为分叉节点。其中,可以是控制器向目标分叉节点发送标签获取请求,以便目标分叉节点为P2MP TE路径返回分配的标签,也可以是控制器为P2MP TE路径分配标签,本实施例不作限定。其中,目标分叉节点至少与第一节点和第二节点连接,第一节点是第一尾节点,或者第一节点为目标分叉节点与第一尾节点间的节点,第二节点是第二尾节点,或者第二节点为目标分叉节点与第二尾节点间的节点,第一尾节点和第二尾节点是至少两个尾节点中的节点,目标分叉节点是这至少一个分叉节点中的任一分叉节点。
本实施例中,目标分叉节点的标签可以为该目标分叉节点自己分配的,在这 种情况下,控制器可以通过扩展路径计算通信协议(Path Computation Element Communication Protocol,PCEP),新增PCLRResv消息(message)用来请求目标分叉节点的标签。请参阅图6,图6是本申请实施例公开的一种PCLRresv message格式的示意图。请参阅图7,图7是本申请实施例公开的一种PCLRresv message格式中的LABEL-NUMBER格式的示意图。其中,LABEL-NUMBER格式中的label type用于指示是全局标签还是局部标签,当label type为1时可以表明标签为局部标签,当label type为2时可以表明标签为全局标签;LABEL-NUMBER格式中的Label number用于指示需要的标签个数;LABEL-NUMBER格式中的F用于指示是申请标签还是返回标签,当F设置为0时,表明是申请标签,当F flag设置为1时,表明是返回标签;LABEL-NUMBER格式中的Label1-n value是目标分叉节点返回给控制器的标签值。
203、当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息。
本实施例中,控制器可以扩展PCEP协议,新增一个PCLabelUpd消息用来向第三节点下发第一信息,以及向目标分叉节点下发第二信息。请参阅图8,图8是本申请实施公开的一种PCLabelUpd Message格式的示意图。请参阅图9,图9是本申请实施例公开的一种PCLabelUpd Message格式中的LABEL格式的示意图。其中,LABEL格式中的O位用于指示标签的类型,当该标志位设置为1时,表明该标签是出标签,当该标志位设置为非1时,表明该标签是入标签。请参阅图10,图10是本申请实施例公开的一种PCLabelUpd Message格式中的LABEL-ATACK格式的示意图。其中,LABEL-ATACK格式中的stacks number用于指示标签栈的数据。请参阅图11,图11是本申请实施例公开的一种label stack sub-TLV的示意图。其中,label stack sub-TLV中的index用于指示第几个标签栈。
本实施例中,获取到目标分叉节点的标签之后,当头节点信息对应的第三节点与目标分叉节点不是同一节点,即头节点不是分叉节点时,将向第三节点发 送第一信息,第一信息可以包括目标分叉节点的标签和P2MP TE路径中由第三节点到目标分叉节点的路径信息,第一信息可以指示第三节点在接收到第一报文时,将该路径信息和目标分叉节点的标签封装在第一报文中,目标分叉节点的标签在封装后的第一报文中处于路径信息之后,路径信息可以指示第三节点将封装后的第一报文按照路径信息进行转发。第一信息可以以标签栈的方式发送给第三节点,例如:图1左边的图中控制器发送给头节点R1的标签栈可以为{L12L23L3N},其中,L3N是分叉节点R3的标签,L12和L23可以表示P2MP TE路径中由头节点R1到分叉节点R3的路径,即报文转发路径为节点R1-节点R2-节点R3。也向目标分叉节点发送第二信息,第二信息可以指示目标分叉节点生成第一组播转发表项,第一组播转发表项可以包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第一组播转发表项可以当目标分叉节点接收到包括目标分叉节点的标签的第一报文时,将第一报文按照第一组播转发表项进行转发,即将第一报文复制第一组播转发表项中包括的路径数量的份数,并每份第一报文按照第一组播转发表项包括的一条路径进行转发,例如:从节点R3到尾节点R5和节点R6分别各一条路径,因此,节点R3接收到包括L3N的报文后,可以将该报文复制两份,之后按照R3-R4-R5转发给节点R5,以及按照R3-R6转发给节点R6。其中,第一信息和第二信息是通过PCLabelUpd消息分别下发给第三节点和目标分叉节点的。
204、当头节点信息对应的第三节点与目标分叉节点为同一节点时,向目标分叉节点发送第三信息和目标分叉节点的标签。
本实施例中,当头节点信息对应的第三节点与目标分叉节点为同一节点时,将目标分叉节点的标签和第三信息通过PCLabelUpd消息下发给目标分叉节点,目标分叉节点的标签可以指示目标分叉节点根据第三信息生成第二组播转发表项,第二组播转发表项可以包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第二组播转发表项可以当目标分叉节点接收到第二报文时,将第二报文按照第二组播转发表项进行转发,即将第二报文复制第二 组播转发表项中包括的路径数量的份数,并每份第二报文按照第二组播转发表项包括的一条路径进行转发。第三信息还可以包括用于指示目标分叉节点为入节点的信息,可以表明目标分叉节点即入节点。
在图2所描述的路径建立方法中,当检测到用于建立P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息,当头节点信息对应的第三节点与目标分叉节点为同一节点时,向目标分叉节点发送第三信息和目标分叉节点的标签,可见,在建立P2MP TE路径时,控制器只需要向P2MP TE路径中的头节点和/或分叉节点发送信息,而不需要向P2MP TE路径中的所有节点发送信息,可以降低P2MP TE路径建立过程的复杂度,便于网络的管理和维护。
基于图1所示的网络架构,请参阅图3,图3是本申请实施例公开的一种控制器的结构示意图。该控制器可以为图2所示实施例中的控制器。如图3所示,该控制器可以包括:
计算单元301,用于当检测到用于建立P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,P2MP TE路径包括至少一个分叉节点和至少两个尾节点;
识别单元302,用于识别计算单元301计算的P2MP TE路径中的目标分叉节点,目标分叉节点至少与第一节点和第二节点连接,第一节点是第一尾节点,或者第一节点为目标分叉节点与第一尾节点间的节点,第二节点是第二尾节点,或者第二节点为目标分叉节点与第二尾节点间的节点,第一尾节点和第二尾节点是至少两个尾节点中的节点,目标分叉节点是至少一个分叉节点中的任一分叉节点;
获取单元303,用于获取识别单元302识别的目标分叉节点的标签;
发送单元304,用于当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向识别单元302识别的目标分叉节点发送第二信息,第一信息包括获取单元303获取的标签和计算单元计算的P2MP TE路径中由第三节点到目标分叉节点的路径信息,第一信息用于指示第三节点接收到第一报文时,将路径信息和目标分叉节点的标签封装在第一报文中,路径信息用于指示第三节点将封装后的第一报文按照路径信息进行转发,第二信息用于指示目标分叉节点生成第一组播转发表项,第一组播转发表项包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第一组播转发表项用于目标分叉节点接收到包括目标分叉节点的标签的第一报文时,将第一报文按照第一组播转发表项进行转发。
作为一种可能的实施方式,发送单元304,还用于当头节点信息对应的第三节点与目标分叉节点为同一节点时,向识别单元302识别的目标分叉节点发送第三信息和获取单元303获取的目标分叉节点的标签,目标分叉节点的标签用于指示目标分叉节点根据第三信息生成第二组播转发表项,第二组播转发表项包括计算单元计算的P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第二组播转发表项用于当目标分叉节点接收到第二报文时,将第二报文按照第二组播转发表项进行转发。
作为一种可能的实施方式,获取单元303具体用于:
向目标分叉节点发送标签获取请求消息,标签获取请求消息用于指示目标分叉节点为P2MP TE路径分配标签;
接收目标分叉节点发送响应消息,该响应消息包含标签。
作为一种可能的实施方式,获取单元303,具体用于为目标分叉节点分配标签。
作为一种可能的实施方式,计算单元301,具体用于使用约束最短路径优先CSPF算法计算头节点信息对应的第三节点与尾节点信息对应的节点间的P2MP TE路径。
在图3所描述的控制器中,当检测到用于建立P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息,当头节点信息对应的第三节点与目标分叉节点为同一节点时,向目标分叉节点发送第三信息和目标分叉节点的标签,可见,在建立P2MP TE路径时,控制器只需要向P2MP TE路径中的头节点和/或分叉节点发送信息,而不需要向P2MP TE路径中的所有节点发送信息,可以降低P2MP TE路径建立过程的复杂度,便于网络的管理和维护。
基于图1所示的网络架构,请参阅图4,图4是本申请实施例公开的另一种控制器的结构示意图。该控制器可以为图2所示实施例中的控制器。如图4所示,该控制器可以包括:处理器401、存储器402和收发器403。其中:
存储器402中存储有一组程序代码,处理器401用于调用存储器402中存储的程序代码执行以下操作:
当检测到用于建立点到多点流量工程P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,P2MP TE路径包括至少一个分叉节点和至少两个尾节点;
识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,目标分叉节点至少与第一节点和第二节点连接,第一节点是第一尾节点,或者第一节点为目标分叉节点与第一尾节点间的节点,第二节点是第二尾节点,或者第二节点为目标分叉节点与第二尾节点间的节点,第一尾节点和第二尾节点是至少两个尾节点中的节点,目标分叉节点是至少一个分叉节点中的任一分叉节点;
收发器403,用于当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息,第一信息包括目标分叉节点的标签和P2MP TE路径中由第三节点到目标分叉节点的路 径信息,第一信息用于指示第三节点接收到第一报文时,将路径信息和目标分叉节点的标签封装在第一报文中,路径信息用于指示第三节点将封装后的第一报文按照路径信息进行转发,第二信息用于指示目标分叉节点生成第一组播转发表项,第一组播转发表项包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第一组播转发表项用于目标分叉节点接收到包括目标分叉节点的标签的第一报文时,将第一报文按照第一组播转发表项进行转发。
作为一种可能的实施方式,收发器503,还用于当头节点信息对应的第三节点与目标分叉节点为同一节点时,向目标分叉节点发送第三信息和目标分叉节点的标签,目标分叉节点的标签用于指示目标分叉节点根据第三信息生成第二组播转发表项,第二组播转发表项包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息,第二组播转发表项用于当目标分叉节点接收到第二报文时,将第二报文按照第二组播转发表项进行转发。
作为一种可能的实施方式,处理器401获取目标分叉节点的标签包括:
收发器403向目标分叉节点发送标签获取请求消息,标签获取请求消息用于指示目标分叉节点为P2MP TE路径分配标签;
收发器403接收目标分叉节点发送响应消息,响应消息包含标签。
作为一种可能的实施方式,处理器401获取目标分叉节点的标签包括:
处理器401为目标分叉节点分配标签。
作为一种可能的实施方式,处理器401使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径包括:
处理器401使用约束最短路径优先CSPF算法计算头节点信息对应的第三节点与尾节点信息对应的节点间的P2MP TE路径。
其中,步骤201和202可以由控制器中的处理器401调用存储器402中存储的程序代码执行,步骤203和步骤204可以由控制器中的收发器403执行。
其中,计算单元301、识别单元302和获取单元303可以由控制器中的处理器401和存储器402来实现,发送单元304可以由控制器中的收发器403来实 现。
在图4所描述的控制器中,当检测到用于建立P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息,当头节点信息对应的第三节点与目标分叉节点为同一节点时,向目标分叉节点发送第三信息和目标分叉节点的标签,可见,在建立P2MP TE路径时,控制器只需要向P2MP TE路径中的头节点和/或分叉节点发送信息,而不需要向P2MP TE路径中的所有节点发送信息,可以降低P2MP TE路径建立过程的复杂度,便于网络的管理和维护。
基于图1所示的网络架构,请参阅图5,图5是本申请实施例公开的一种路径建立系统的结构示意图。如图5所示,该路径建立系统包括控制器501和至少三个节点502,其中:
控制器501,用于当检测到用于建立P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,P2MP TE路径包括至少一个分叉节点和至少两个尾节点,目标分叉节点至少与第一节点和第二节点连接,第一节点是第一尾节点,或者第一节点为目标分叉节点与第一尾节点间的节点,第二节点是第二尾节点,或者第二节点为目标分叉节点与第二尾节点间的节点,第一尾节点和第二尾节点是至少两个尾节点中的节点,目标分叉节点是至少一个分叉节点中的任一分叉节点;
控制器501,还用于当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息,第一信息包括目标分叉节点的标签和P2MP TE路径中由第三节点到目标分叉节点的路径信息。
第三节点502,用于接收第一信息,接收第一报文,将路径信息和目标分叉节点的标签封装在第一报文中,以及将封装后的第一报文按照路径信息转发至目标分叉节点,目标分叉节点的标签在封装后的第一报文中处于路径信息之后;
目标分叉节点502,用于接收第二信息,生成组第一播转发表项,接收包括目标分叉节点的标签的第一报文,将该第一报文按照第一组播转发表项包括的P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息进行转发。
作为一种可能的实施方式,控制器501,还用于当头节点信息对应的第三节点与目标分叉节点为同一节点时,向目标分叉节点发送第三信息和分叉节点的标签;
目标分叉节点502,还用于在目标分叉节点的标签的指示下根据第三信息生成第二组播转发表项,接收第二报文,将第二报文按第二照组播转发表项包括P2MP TE路径中由目标分叉节点到尾节点信息对应的节点的路径的信息进行转发。
作为一种可能的实施方式,控制器501获取目标分叉节点的标签包括:
控制器501向目标分叉节点502发送标签获取请求消息;
目标分叉节点502为P2MP TE路径分配标签并发送给控制器501;
控制器501接收目标分叉节点502发送的标签。
作为一种可能的实施方式,控制器501获取目标分叉节点502的标签包括:
为目标分叉节点502分配标签。
作为一种可能的实施方式,控制器501使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径包括:
使用约束最短路径优先CSPF算法计算头节点信息对应的第三节点与尾节点信息对应的节点间的P2MP TE路径。
其中,头节点用虚线框,可以表示头节点可以与分叉节点为同一节点,也可以为不同的节点。
在图5所描述的控制器中,当检测到用于建立P2MP TE的路径建立请求时,使用路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,识别P2MP TE路径中的目标分叉节点,并获取目标分叉节点的标签,当头节点信息对应的第三节点与目标分叉节点不是同一节点时,向第三节点发送第一信息,以及向目标分叉节点发送第二信息,当头节点信息对应的第三节点与目标分叉节点为同一节点时,向目标分叉节点发送第三信息和目标分叉节点的标签,可见,在建立P2MP TE路径时,控制器只需要向P2MP TE路径中的头节点和/或分叉节点发送信息,而不需要向P2MP TE路径中的所有节点发送信息,可以降低P2MP TE路径建立过程的复杂度,便于网络的管理和维护。
在一个实施例中,一种可读存储介质,该可读存储介质存储了命令分发装置用于执行本申请实施例图2所对应的路径建立方法的程序代码。
本领域普通技术人员可以理解上述实施例的各种方法中的全部或部分步骤是可以通过程序来指令相关的硬件来完成,该程序可以存储于一计算机可读存储介质中,存储介质可以包括:闪存盘、只读存储器(read-only memory,ROM)、随机存取器(random access memory,RAM)、磁盘或光盘等。
以上对本申请实施例公开的路径建立方法及控制器进行了详细介绍,本文中应用了具体个例对本申请的原理及实施方式进行了阐述,以上实施例的说明只是用于帮助理解本申请的方法及其核心思想;同时,对于本领域的一般技术人员,依据本申请的思想,在具体实施方式及应用范围上均会有改变之处,综上所述,本说明书内容不应理解为对本申请的限制。

Claims (10)

  1. 一种路径建立方法,其特征在于,所述方法应用于管理至少三个节点的控制器,所述方法包括:
    当所述控制器检测到用于建立点到多点流量工程P2MP TE的路径建立请求时,使用所述路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,所述P2MP TE路径包括至少一个分叉节点和至少两个尾节点;
    所述控制器识别所述P2MP TE路径中的目标分叉节点,并获取所述目标分叉节点的标签,所述目标分叉节点至少与第一节点和第二节点连接,所述第一节点是第一尾节点,或者所述第一节点为所述目标分叉节点与第一尾节点间的节点,所述第二节点是第二尾节点,或者所述第二节点为所述目标分叉节点与第二尾节点间的节点,所述第一尾节点和所述第二尾节点是所述至少两个尾节点中的节点,所述目标分叉节点是所述至少一个分叉节点中的任一分叉节点;
    当所述头节点信息对应的第三节点与所述目标分叉节点不是同一节点时,所述控制器向所述第三节点发送第一信息,以及向所述目标分叉节点发送第二信息,所述第一信息包括所述标签和所述P2MP TE路径中由所述第三节点到所述目标分叉节点的路径信息,所述第一信息用于指示所述第三节点接收到第一报文时,将所述路径信息和所述标签封装在所述第一报文中,所述路径信息用于指示所述第三节点将封装后的所述第一报文按照所述路径信息进行转发,所述第二信息用于指示所述目标分叉节点生成第一组播转发表项,所述第一组播转发表项包括所述P2MP TE路径中由所述目标分叉节点到所述尾节点信息对应的节点的路径的信息,所述第一组播转发表项用于所述目标分叉节点接收到包括所述标签的第一报文时,将所述第一报文按照所述第一组播转发表项进行转发。
  2. 根据权利要求1所述的方法,其特征在于,所述方法还包括:
    当所述头节点信息对应的第三节点与所述目标分叉节点为同一节点时,所述控制器向所述目标分叉节点发送第三信息和所述标签,所述标签用于指示所述目标分叉节点根据所述第三信息生成第二组播转发表项,所述第二组播转发表项包括所述P2MP TE路径中由所述目标分叉节点到所述尾节点信息对应的节点的路径的信息,所述第二组播转发表项用于当所述目标分叉节点接收到第二报文时,将所述第二报文按照所述第二组播转发表项进行转发。
  3. 根据权利要求1或2所述的方法,其特征在于,所述控制器获取所述目标分叉节点的标签包括:
    所述控制器向所述目标分叉节点发送标签获取请求消息,所述标签获取请求消息用于指示所述目标分叉节点为所述P2MP TE路径分配标签;
    所述控制器接收所述目标分叉节点发送响应消息,所述响应消息包含所述标签。
  4. 根据权利要求1或2所述的方法,其特征在于,所述控制器获取所述目标分叉节点的标签包括:
    所述控制器为所述目标分叉节点分配标签。
  5. 根据权利要求1-4任一项所述的方法,其特征在于,所述控制器使用所述路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径包括:
    所述控制器使用约束最短路径优先CSPF算法计算所述头节点信息对应的第三节点与所述尾节点信息对应的节点间的P2MP TE路径。
  6. 一种控制器,其特征在于,所述控制器管理至少三个节点,所述控制器包括:
    计算单元,用于当检测到用于建立点到多点流量工程P2MP TE的路径建立请求时,使用所述路径建立请求包括的头节点信息和尾节点信息计算P2MP TE路径,所述P2MP TE路径包括至少一个分叉节点和至少两个尾节点;
    识别单元,用于识别所述计算单元计算的P2MP TE路径中的目标分叉节点,所述目标分叉节点至少与第一节点和第二节点连接,所述第一节点是第一尾节点,或者所述第一节点为所述目标分叉节点与第一尾节点间的节点,所述第二节点是第二尾节点,或者所述第二节点为所述目标分叉节点与第二尾节点间的节点,所述第一尾节点和所述第二尾节点是所述至少两个尾节点中的节点,所述目标分叉节点是所述至少一个分叉节点中的任一分叉节点;
    获取单元,用于获取所述识别单元识别的目标分叉节点的标签;
    发送单元,用于当所述头节点信息对应的第三节点与所述目标分叉节点不是同一节点时,向所述第三节点发送第一信息,以及向所述识别单元识别的目标分叉节点发送第二信息,所述第一信息包括所述获取单元获取的标签和所述计算单元计算的P2MP TE路径中由所述第三节点到所述目标分叉节点的路径信息,所述第一信息用于指示所述第三节点接收到第一报文时,将所述路径信息和所述标签封装在所述第一报文中,所述路径信息用于指示所述第三节点将封装后的所述第一报文按照所述路径信息进行转发,所述第二信息用于指示所述目标分叉节点生成第一组播转发表项,所述第一组播转发表项包括所述P2MP TE路径中由所述目标分叉节点到所述尾节点信息对应的节点的路径的信息,所述第一组播转发表项用于所述目标分叉节点接收到包括所述标签的第一报文时,将所述第一报文按照所述第一组播转发表项进行转发。
  7. 根据权利要求6所述的控制器,其特征在于,所述发送单元,还用 于当所述头节点信息对应的第三节点与所述目标分叉节点为同一节点时,向所述识别单元识别的目标分叉节点发送第三信息和所述获取单元获取的标签,所述标签用于指示所述目标分叉节点根据所述第三信息生成第二组播转发表项,所述第二组播转发表项包括所述计算单元算的P2MP TE路径中由所述目标分叉节点到所述尾节点信息对应的节点的路径的信息,所述第二组播转发表项用于当所述目标分叉节点接收到第二报文时,将所述第二报文按照所述第二组播转发表项进行转发。
  8. 根据权利要求6或7所述的控制器,其特征在于,所述获取单元具体用于:
    向所述目标分叉节点发送标签获取请求消息,所述标签获取请求消息用于指示所述目标分叉节点为所述P2MP TE路径分配标签;
    接收所述目标分叉节点发送响应消息,所述响应消息包含所述标签。
  9. 根据权利要求6或7所述的控制器,其特征在于,所述获取单元,具体用于为所述目标分叉节点分配标签。
  10. 根据权利要求6-9任一项所述的控制器,其特征在于,所述计算单元,具体用于使用约束最短路径优先CSPF算法计算所述头节点信息对应的第三节点与所述尾节点信息对应的节点间的P2MP TE路径。
PCT/CN2016/108233 2016-05-10 2016-12-01 一种路径建立方法及控制器 WO2017193569A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
US16/185,994 US10749788B2 (en) 2016-05-10 2018-11-09 Path establishment method and controller
US16/937,236 US11502937B2 (en) 2016-05-10 2020-07-23 Path establishment method and controller
US17/976,600 US11888726B2 (en) 2016-05-10 2022-10-28 Path establishment method and controller

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610307327.2A CN105827529B (zh) 2016-05-10 2016-05-10 一种路径建立方法及控制器
CN201610307327.2 2016-05-10

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/185,994 Continuation US10749788B2 (en) 2016-05-10 2018-11-09 Path establishment method and controller

Publications (1)

Publication Number Publication Date
WO2017193569A1 true WO2017193569A1 (zh) 2017-11-16

Family

ID=56528567

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/108233 WO2017193569A1 (zh) 2016-05-10 2016-12-01 一种路径建立方法及控制器

Country Status (3)

Country Link
US (3) US10749788B2 (zh)
CN (1) CN105827529B (zh)
WO (1) WO2017193569A1 (zh)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105827529B (zh) * 2016-05-10 2019-02-26 华为技术有限公司 一种路径建立方法及控制器
CN109561021B (zh) * 2017-09-25 2021-08-20 华为技术有限公司 一种报文转发的方法及网络设备
CN109962848A (zh) * 2017-12-22 2019-07-02 杭州达乎科技有限公司 一种sdn网络中实现跨域mpls标签分配的方法、装置和系统
CN108512758B (zh) * 2018-03-07 2021-09-14 华为技术有限公司 报文处理方法、控制器以及转发设备
CN108966039B (zh) * 2018-08-29 2021-09-21 迈普通信技术股份有限公司 一种组播方法和设备
CN110943923B (zh) * 2018-09-21 2023-09-12 中兴通讯股份有限公司 一种lsp建立方法、装置、设备和计算机存储介质
CN109861913B (zh) * 2018-12-25 2020-03-20 华为技术有限公司 一种跨内部网关协议的前缀标识通告方法和装置
CN113132234B (zh) * 2019-12-27 2024-06-11 华为技术有限公司 隧道分段方法及装置、数据传输系统
CN111641561B (zh) * 2020-05-28 2022-02-22 迈普通信技术股份有限公司 报文转发方法、装置、隧道创建方法、装置及网络设备

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102142969A (zh) * 2010-12-31 2011-08-03 华为技术有限公司 一种p2mp的建立方法、装置和系统
WO2011160498A1 (zh) * 2010-06-22 2011-12-29 华为技术有限公司 运营管理和维护的配置方法和节点
CN103873378A (zh) * 2012-12-18 2014-06-18 瞻博网络公司 具有集中控制的聚合网络
CN105827529A (zh) * 2016-05-10 2016-08-03 华为技术有限公司 一种路径建立方法及控制器

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9571387B1 (en) * 2012-03-12 2017-02-14 Juniper Networks, Inc. Forwarding using maximally redundant trees
US9112713B2 (en) * 2012-06-27 2015-08-18 Cisco Technology, Inc. System and method for efficient point-to-multi-point traffic engineering (P2MP-TE) path protection
US9179197B2 (en) * 2012-10-10 2015-11-03 Sonos, Inc. Methods and apparatus for multicast optimization
EP3038303B1 (en) 2013-09-26 2018-09-19 Huawei Technologies Co., Ltd. Establishment method and device of a cross-domain path
US9450864B2 (en) * 2013-10-11 2016-09-20 Futurewei Technologies, Inc. Using PCE as SDN controller
CN104579966B (zh) * 2013-10-14 2018-08-17 华为技术有限公司 转发表项生成的方法、转发节点和控制器
CN103595631B (zh) * 2013-10-31 2016-12-07 华为技术有限公司 一种路径建立的方法和装置
CN104954265B (zh) * 2014-03-25 2018-06-15 华为技术有限公司 发送组播报文的方法及交换机
CN105337785B (zh) * 2014-07-18 2018-10-02 华为技术有限公司 一种路径连通性检测方法及装置
US20180102965A1 (en) * 2016-10-07 2018-04-12 Alcatel-Lucent Usa Inc. Unicast branching based multicast
US10554543B1 (en) * 2017-09-08 2020-02-04 Juniper Networks, Inc. Migrating data traffic between label switched paths (LSPs) based on per-LSP protocol priority value

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011160498A1 (zh) * 2010-06-22 2011-12-29 华为技术有限公司 运营管理和维护的配置方法和节点
CN102142969A (zh) * 2010-12-31 2011-08-03 华为技术有限公司 一种p2mp的建立方法、装置和系统
CN103873378A (zh) * 2012-12-18 2014-06-18 瞻博网络公司 具有集中控制的聚合网络
CN105827529A (zh) * 2016-05-10 2016-08-03 华为技术有限公司 一种路径建立方法及控制器

Also Published As

Publication number Publication date
US10749788B2 (en) 2020-08-18
US20190081885A1 (en) 2019-03-14
US20230269173A1 (en) 2023-08-24
CN105827529B (zh) 2019-02-26
US20200358695A1 (en) 2020-11-12
US11888726B2 (en) 2024-01-30
CN105827529A (zh) 2016-08-03
US11502937B2 (en) 2022-11-15

Similar Documents

Publication Publication Date Title
WO2017193569A1 (zh) 一种路径建立方法及控制器
US11431611B2 (en) Computing forwarding paths based on notification packet delays
US9860163B2 (en) MPLS traffic engineering for point-to-multipoint label switched paths
US9716648B2 (en) System and method for computing point-to-point label switched path crossing multiple domains
US9185040B2 (en) Flow label negotiation method, related device, and system
US8908501B2 (en) Procedures for finding a backup ingress of a point-to-multipoint label switched path
US8442050B2 (en) Apparatus and method of controlling LSP of RSVP-TE protocol using label with availability of end-to-end range
US10554537B2 (en) Segment routing in a multi-domain network
US9736066B2 (en) Method, apparatus and system for establishing optical bypass
US12068949B2 (en) Routing management method and apparatus, network device, and readable storage medium
WO2017211164A1 (zh) 一种确定跨域标签交换路径隧道的方法、设备和系统
CN105634941A (zh) 一种跨域路径的计算方法及装置
EP3361683B1 (en) Path computation method and device
US10666562B2 (en) Network path computation method, apparatus, and system
EP2466813B1 (en) Method and system for determining initiator and terminator in forwarding adjacency label switched path
US7042882B2 (en) Layer-structured path setup method and node apparatus for implementing same

Legal Events

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

Ref country code: DE

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

Ref document number: 16901524

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 16901524

Country of ref document: EP

Kind code of ref document: A1