WO2012159316A1 - Method, network device and system for determining equal-cost paths in network - Google Patents

Method, network device and system for determining equal-cost paths in network Download PDF

Info

Publication number
WO2012159316A1
WO2012159316A1 PCT/CN2011/076898 CN2011076898W WO2012159316A1 WO 2012159316 A1 WO2012159316 A1 WO 2012159316A1 CN 2011076898 W CN2011076898 W CN 2011076898W WO 2012159316 A1 WO2012159316 A1 WO 2012159316A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
equivalent path
path
equivalent
path information
Prior art date
Application number
PCT/CN2011/076898
Other languages
French (fr)
Chinese (zh)
Inventor
国辛纯
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Priority to PCT/CN2011/076898 priority Critical patent/WO2012159316A1/en
Priority to CN201180001237.6A priority patent/CN103004149B/en
Publication of WO2012159316A1 publication Critical patent/WO2012159316A1/en

Links

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/12Shortest path evaluation

Definitions

  • the present invention relates to the field of network communications and, more particularly, to a method, network apparatus and system for determining an equivalent path in a network in the field of network communications.
  • LSP Label Switching Path
  • LDP Label Distribution Protocol
  • Label Switched Router on LSP Label Switched Router
  • LSR Label Switched Router
  • the ingress LSR When an Internet Protocol (IP) packet enters the MPLS network, the ingress LSR adds a corresponding label to the packet according to the Forward Equivalence Class (FEC) to which the IP packet belongs, and forwards the label to the neighbor LSR. .
  • the neighboring LSR does not need to analyze the IP packet header, but directly searches for the routing forwarding table based on the label forwarding according to the label carried in the IP packet, and replaces the IP packet with a new label, and outputs it from the corresponding outgoing interface, and sends it to the next. Jump the LSR. Then, on the LSP corresponding to the FEC to which the IP packet belongs, the LSR sends the IP packet to the egress LSR of the MPLS network, and the egress LSR deletes the label and then forwards the packet on the IP network.
  • IP Internet Protocol
  • FEC Forward Equivalence Class
  • Equivalent paths exist in both MPLS networks and IP networks.
  • the so-called equivalence path refers to multiple paths having the same metric value and priority between the source node and the destination node, and the data flow from the source node to the destination node will be allocated to the equivalence paths according to a predetermined policy. .
  • By forwarding the data stream through the equivalent path you can increase the data bandwidth, achieve load balancing, and provide path backup.
  • equivalent paths which are equal-valued paths based on Equal-Cost Multi-Path Routing (EPCMP) and Link Aggregation Group (LAG). Value path.
  • EPCMP Equal-Cost Multi-Path Routing
  • LAG Link Aggregation Group
  • the data stream from the source node can flow through different equivalent paths according to different ECMP algorithms.
  • the LAG equivalent path since the LAG uses multiple physical links between two adjacent nodes as one logical link, the LAG equivalent path exists only between the adjacent two nodes, and the two nodes The data streams passed between can be distributed to different equivalent paths according to policies to achieve load balancing and the like.
  • an equivalent path may cause out-of-order when packets of the same data stream arrive at the destination.
  • traffic-based multi-path traffic forwarding can be performed through the flow label. Messages belonging to the same data stream can be forwarded through the same path more finely by reference to the flow label.
  • the introduction of flow labels will generate a large amount of network overhead, because a series of flow classification, capability negotiation, and flow label allocation and maintenance operations are required.
  • the individual links in the equivalent path may be congested or lose the forwarding function and may not work, thereby causing the link to be inefficient, but the network management system cannot effectively recognize the partial equivalent path. Congestion problems that occur in the middle. Thus, the existence of an equivalent path is also detrimental to the management and maintenance of the network.
  • the embodiments of the present invention provide a method, a network device, and a system for determining an equal path in a network, which can determine an equivalence path in the network, and locate the equivalence path, thereby facilitating deployment of the flow label and network management and maintenance. .
  • an embodiment of the present invention provides a method for determining an equivalent path in a network, including: when a node is a start node of an equivalent path, generating an equivalent path information carrying the node Transmitting, to the ingress node of the network, the message carrying the equivalent path information at the node, so that the ingress node determines, according to the equivalence path information and the shortest path tree of the network, The node is the equivalent path of the starting node.
  • an embodiment of the present invention provides a method for determining an equivalent path in a network, including: receiving, by an intermediate node, a message carrying the equivalent path information at the intermediate node; The value path information and the shortest path tree of the network determine an equivalent path starting from the intermediate node.
  • the embodiment of the present invention provides a network device, including: a generating module, configured to: when the network device is a starting node of an equal path, generate an equivalent path information that carries the network device a sending module, configured to send, to an ingress node of the network, the message carrying the equivalent path information at the network device, so that the ingress node is based on the equivalent path message And the shortest path tree of the network, determining an equivalent path starting with the network device.
  • a generating module configured to: when the network device is a starting node of an equal path, generate an equivalent path information that carries the network device
  • a sending module configured to send, to an ingress node of the network, the message carrying the equivalent path information at the network device, so that the ingress node is based on the equivalent path message
  • the shortest path tree of the network determining an equivalent path starting with the network device.
  • an embodiment of the present invention provides a network apparatus, including: a first receiving module, configured to receive a message that is sent by an intermediate node and that carries the equivalent path information at the intermediate node; And determining, based on the equivalence path information and the shortest path tree of the network, an equivalent path starting from the intermediate node.
  • embodiments of the present invention provide a system for determining an equivalent path in a network, the system including at least one first network device and a second network device.
  • the first network device is configured to: when the first network device is a start node of an equal path, generate a message carrying the equivalent path information at the first network device; to the second network device Sending the message carrying the equivalent path information at the first network device.
  • the second network device is configured to receive, by the first network device, the message carrying the equivalent path information at the first network device; based on the equal path information and a shortest path tree of the network, An equivalent path is determined with the first network device as a starting node.
  • a node that is a starting node of an equal path can generate a message carrying the equivalent path information and send the message to the ingress node, so that the ingress node of the network can be based on the collected equivalent path information.
  • the shortest path tree to determine the equivalence path to achieve the positioning of the equivalence path, thereby facilitating the deployment of the flow label where the equivalence path exists, avoiding the waste of resources when using the flow label on the path without using the flow label, and the like
  • the positioning of the value path also facilitates the management and maintenance of the equivalent path.
  • FIG. 1 is a flow diagram of a method performed by an intermediate node of a network for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
  • FIG. 2 is a flow diagram of another method for determining an equivalent path in a network in accordance with an embodiment of the present invention.
  • 3 is a flow diagram of still another method for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
  • 4 is a flow diagram of a method performed by an ingress node of a network for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
  • Figure 5 is a flow diagram of yet another method for determining an equivalent path in a network in accordance with an embodiment of the present invention.
  • Figure 6 is an example of a network topology in which an ECMP equivalent path exists.
  • Figure 7 is an example of a network topology in which a LAG equivalent path exists.
  • FIG. 8 is a structural block diagram of a network device according to an embodiment of the present invention.
  • FIG. 9 is a block diagram showing the structure of another network device according to an embodiment of the present invention.
  • FIG. 10 is a structural block diagram of still another network device according to an embodiment of the present invention.
  • FIG. 11 is a block diagram showing the structure of still another network device according to an embodiment of the present invention.
  • FIG. 12 is a structural block diagram of still another network device according to an embodiment of the present invention.
  • Figure 13 is a block diagram showing the structure of a system for determining an equivalent path in a network in accordance with an embodiment of the present invention. detailed description
  • the method 100 includes: in S110, when a node is a starting node of an equivalent path, generating a message carrying the equivalent path information at the node; in S120, sending to the ingress node of the network A message carrying the equivalent path information at the node, so that the ingress node determines the equivalent path with the node as the starting node based on the equivalent path information and the shortest path tree of the network.
  • method 100 can be performed by an intermediate node of the network. Assume that node M is used to represent the intermediate node. If the node M is the starting node of the equivalent path, the node M may carry the equivalent path information in the message to notify the ingress node, so that the ingress node locates the equivalent path based on the equivalence path information and the shortest path tree.
  • the node M can carry the equivalent path information through various messages. For example, in
  • the node M can carry the equivalent path information through the message based on the LDP protocol. In this way, not only can the message in the existing MPLS network be compatible, but also the message of the protocol itself can be used to help realize the transmission of the equivalent path information, which has little impact on the protocol and the network.
  • a notification message is generated, and the type length value TLV (Type Length Value) field of the notification message carries the equivalent path information.
  • TLV Type Length Value
  • a Label Mapping Message carrying the equivalent path information in the option field is generated.
  • the notification message and the label mapping message are messages in the LDP protocol.
  • the existing message can be conveniently used to collect the equivalent path information.
  • the information of the equivalent path carried in the message may include the node identifier of the starting node of the equal value path, the forwarding equivalence class corresponding to the equal value path, and the outbound interface identifier corresponding to the equal value path.
  • the equivalent path information carried by the TLV field and the option field may be the same.
  • the following uses the TLV field as an example to describe an example of carrying the equivalent path information.
  • the TLV field may have the form shown in Table 1.
  • the information carried in the TLV field includes not only the node identifier (Node ID), the forwarding equivalence class (FEC), and the outbound interface identifier (interfacellD to Interface n ID), but also includes such as U-bit, F-bit, ECMP TLV.
  • Optional content such as Type, Length, Path Number, etc., to facilitate processing of TLV fields.
  • U bits and F bits have the same usage as in the prior art.
  • the node that receives the message carrying the TLV field can identify the TLV field; when the value of the U bit is 0, the node that receives the message carrying the TLV field cannot identify the TLV. Word Segment, and return a response message to the node that sent the message.
  • the F bit is to be recognized by the node, and the U bit needs to be 1.
  • the value of the F bit is 1
  • the node that receives the packet carrying the TLV field forwards the packet.
  • the value of the F bit is not 1, the node that receives the packet carrying the TLV field receives the packet.
  • the message is forwarded. Therefore, in order to forward the message carrying the TLV field to the ingress node of the network, it is necessary to make the values of the U bit and the F bit both 1.
  • the ECMP TLV Type indicates that the type of the TLV field is for the ECMP equivalent path.
  • Length indicates the length of the TLV field.
  • Path Number indicates the number of ECMP equivalent paths. Reserve indicates the reserved portion.
  • FEC indicates the forwarding equivalence class to which the ECMP equivalent path belongs.
  • the Node ID indicates the node identifier of the ECMP equivalent path, which may be the node number or the IP address of the node.
  • Interfacel ID, Interface2 ID, and Interface n ID (n is greater than or equal to 2) respectively indicate the outbound interface identifier corresponding to the ECMP equivalent path.
  • the TLV field may have the form shown in Table 2.
  • the information carried in the information includes not only the node identifier (Node ID), the forwarding equivalence class (FEC), and the outbound interface identifier (interfacellD to Interface n ID), but also information such as U-bit, F-bit, and LAG TLV Type.
  • Optional content such as Length, Path Number, etc., to facilitate processing of the TLV field and indicate the relevant situation of the LAG equivalent path.
  • the U bit and the F bit are as described in Table 1, and the values of the U bit and the F bit are both set to 1.
  • the LAG TLV Type indicates that the type of the TLV field is for the LAG equivalent path. Length, Path Number, Reserve, and FEC are basically the same as Table 1.
  • the Local interface ID indicates the outbound interface identifier of the LAG equivalent path on the node.
  • the remote interface ID indicates the inbound interface identifier of the LAG equivalent path on the next hop node. When there are multiple LAG equivalent paths, the Local interface ID and the Remote interface ID have multiple values, respectively - corresponding.
  • the outbound interface identifier and the inbound interface identifier can be alternately recorded to represent the corresponding relationship.
  • the outbound interface identifier record can be completely recorded and then recorded into the interface identifier. There is a corresponding order relationship between the two.
  • Sum bandwidth represents the total bandwidth of the LAG equivalent path.
  • Linkl bandwidth, Link2 bandwidth to Link n bandwidth (n is greater than or equal to 2) respectively indicate the bandwidth of the corresponding LAG equivalent path, corresponding to the LAG equivalent path determined by the inbound interface identifier and the outbound interface identifier.
  • the node M transmits the message generated in S110 to the ingress node of the network.
  • the node M may send a message generated in S110 to its peer node, and the peer node of the node M sends the message to its own peer node, through peering.
  • the node forwards the message so that the message eventually reaches the ingress node of the network. If the peer node of node M happens to be the ingress node, then no forwarding of the peer node is required, and node M can directly send the message to the ingress node.
  • the ingress node After receiving the message sent by the node M, the ingress node can determine the equivalence path with the node M as the starting node by comparing the shortest path tree saved in the database of the ingress node with the equivalent path information carried by the message. That is, the ingress node can know which nodes and which links each of the equivalence paths with node M as the starting node has passed.
  • the shortest path tree saved in the database of the ingress node can be calculated in the process of establishing a route (for example, using the open shortest path first OSFP protocol, etc.), and the specific calculation process can be the same as the prior art, and details are not described herein again.
  • the shortest path tree contains all the forwarding paths in the network, and the data flows on the shortest path tree.
  • the ingress node finds the node M on the shortest path tree, combined with the topology of the shortest path tree and the direction of the data stream the equivalent path with the node M as the starting node can be determined.
  • the endpoint of the equivalent path can be the node along the direction of the data stream and the first time the data stream is aggregated.
  • the operation of the ingress node will be described in conjunction with Figures 4 and 5, and will not be expanded here.
  • the intermediate node may base the ingress node by sending the equivalent path information to the ingress node if it is the starting node of the equivalent path.
  • the equivalence path information and the shortest path tree are used to locate the equivalence path, so that the flow label can be deployed where the equivalence path exists, avoiding waste of resources when using the flow label on the path without using the flow label, and equivalent
  • the positioning of the path is also beneficial to the equivalent path Manage and maintain.
  • FIG. 2 is a flow diagram of a method 200 for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
  • the network can divide different data streams into different forwarding equivalence classes. For example, based on the destination IP address of the data stream, the type of data carried, the priority, the port number, etc., the data stream is divided into different FECs, and the same forwarding path exists for each FEC. Thus, a route forwarding table can be established based on the FEC.
  • Node M can determine the existence of the equivalent path by querying its own routing forwarding table. When it is found that the same forwarding equivalence class has multiple outgoing interfaces or outgoing labels, it indicates that the node M is the starting node of the equivalent path corresponding to the forwarding equivalence class.
  • S210 a message carrying the equivalent path information at the node is generated. This step is the same as S110 in the method 100.
  • a message carrying the equivalent path information at the node is sent to the ingress node of the network, so that the ingress node determines the equivalent of the node as the starting node based on the equivalent path information and the shortest path tree of the network. path.
  • This step is the same as S120 in method 100.
  • a node M may receive a message forwarded by its peer node from its peer node, the message being sent by other intermediate nodes in the network carrying the equivalent path information at the intermediate node.
  • the message can still be a notification message or a label mapping message, carrying the equivalent path information through the TLV field or the option field.
  • the received message is sent to the ingress node, so that the ingress node determines the equivalent path with the intermediate node as the starting node based on the equivalent path information and the shortest path tree carried by the message.
  • Node M can forward the message received in S230 to its peer node for delivery to the ingress node.
  • the ingress node may determine the equivalent path of the intermediate node that sends the message as the starting node according to the equivalent path information and the shortest path tree carried by the message.
  • the ingress node can determine the equivalence path in the network by collecting the equivalent path information at different nodes.
  • the ingress node is notified of the change, so that the ingress node updates the determined equivalent value of the node as the starting node based on the change and the shortest path tree. path.
  • the node M When the equivalent path with the node M as the starting node changes, the node M generates a message for notifying the change (for example, a notification message under the LDP protocol) and transmits it to the ingress node. For example, node M sends a message informing the change to the peer node of node M, which forwards the message to its own peer node, and continues until the message is delivered to the ingress node.
  • a message for notifying the change for example, a notification message under the LDP protocol
  • node M sends a message informing the change to the peer node of node M, which forwards the message to its own peer node, and continues until the message is delivered to the ingress node.
  • the ingress node After receiving the message, the ingress node can compare the change indicated in the message with the shortest path tree stored in the database of the ingress node, and update the equivalence path with the node M as the starting node determined in S220.
  • S230 and S240 are executed after S220 in Fig. 2, S230 and S240 can be executed at any other time.
  • S250 is executed after S240, S250 can also be executed before S230 and S240, as long as it is executed after S220.
  • an intermediate node that is a starting node of an equivalent path generates a message carrying the equivalent path information, and then facilitates forwarding through other nodes, and may
  • the equivalent path information at itself is told to the ingress node, so that the ingress node can collect information about the equivalence path in the network to determine the equivalent path in the network, and realize the positioning of the equivalence path.
  • the equivalent path information to enable the ingress node to collect and utilize to determine the equivalence path, it is advantageous to deploy the flow label where there is an equivalence path, and on other paths, the application of the flow label is not required, thereby reducing Unnecessary network overhead. And because the equivalent path is determined, it is beneficial to manage and maintain the equivalent path.
  • the notification of the change to the ingress node in time can update the location of the equivalence path of the ingress node in time to facilitate real-time control of where in the network there are equivalent paths.
  • FIG. 3 is a flow diagram of a method 300 for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
  • S305 a message sent by the intermediate node carrying the equivalent path information at the intermediate node is received. This step is basically the same as S230.
  • the equivalent path information at the node is added to the received message to generate a message carrying the equivalent path information at the node.
  • the node M receives the message carrying the equivalent path information sent by the intermediate node, if the node M is the starting node of the equivalent path, the node M adds its own equivalent path information to the received message, and then This message is sent to the ingress node. In this way, the number of messages carrying the equivalent path information in the network can be reduced, thereby reducing the resource overhead of the network and avoiding excessive messages carrying the equivalent path information.
  • the message received by node M can be a notification message or a label mapping message.
  • Node M adds its own equivalent path information to the TLV field of the notification message or to the option field of the label mapping message. Either the TLV field or the option field, the added equivalent path information can be the same. An example of adding equivalent path information is still described using the TLV field as an example.
  • the TLV field may have the form shown in Table 3.
  • the information carried in the information includes not only the equivalent path information of multiple nodes, but also some optional content to facilitate processing of the TLV field, and the optional content may include U-bit, F-bit, ECMP TLV Type, Length, and ECMP Number.
  • the ECMP Number represents the number of nodes that are the starting nodes of different ECMP equivalent paths.
  • the initial value of the ECMP Number can be 0.
  • the ECMP Number is incremented by 1.
  • the equivalent path information at node 1, the equivalent path information at node 2, and the equivalent path information at node n respectively represent node 1, node 2 node n-direction messages with equivalent paths (eg The respective equivalent path information added in the notification message).
  • the equivalent path information at the node can be in the form of Table 1, or only the Node ID, FEC, Interfacel ID to Interface n ID in Table 1.
  • the TLV field when there is a LAG equivalent path in the network, the TLV field may have the form as shown in Table 4.
  • the information carried therein includes not only the equivalent path information of multiple nodes, but also one
  • the optional content is convenient for processing the TLV field and indicating the correlation of the LAG equivalent path, etc., and the optional content may include U bits, F bits, LAG TLV Type, Length, LAG Number.
  • the LAG Number represents the number of nodes that are the starting nodes of different LAG equivalent paths.
  • the initial value of the LAG Number can be 0.
  • the equivalent path information at node 1 the equivalent path information at node 2
  • the equivalent path information at node n respectively represent node 1, node 2 node n-direction message with LAG equivalent path ( For example, the corresponding equivalent path information added in the notification message).
  • the equivalent path information at the node can be in the form of Table 2, or only the Node ID, FEC, and Local Interface ID in Table 2.
  • a message carrying the equivalent path information at the node is sent to the ingress node of the network, so that the ingress node determines the equivalent of the node as the starting node based on the equivalent path information and the shortest path tree of the network. path.
  • This step is the same as S220.
  • the ingress node may also determine the other intermediate based on the shortest path tree of the network and the equivalent path information at other intermediate nodes carried in the message.
  • the node is the equivalent path of the starting node.
  • an intermediate node that is a starting node of an equivalent path may cause an ingress node to pass a message by adding respective equivalent path information to the same message.
  • the equivalent path information at multiple nodes is collected, and the equivalent path information of each node corresponds to the equivalent path with the node as the starting node. Therefore, the overhead of network resources can be saved, and excessive network messages can be generated to affect network performance.
  • the method 400 includes: receiving, in S410, a message that is sent by an intermediate node and carrying the equivalent path information at the intermediate node; in S420, determining, based on the equal path information and the shortest path tree of the network, The intermediate node is the equivalent path of the starting node.
  • method 400 can be performed by an ingress node of a network.
  • the ingress node can collect the equivalent path information in the network by receiving the message carrying the equivalent path information, so that the equivalent path can be determined by comparing the equivalent path information with the shortest path tree of the network, and the equivalent value is implemented. The location of the path.
  • the ingress node can receive a plurality of messages carrying the equivalent path information.
  • the received message may be a message based on the LDP protocol.
  • a notification message carrying the equivalent path information in the type length value TLV field sent by the intermediate node is received.
  • a label mapping message that carries the equivalent path information in the option field sent by the intermediate node is received.
  • the information about the egress path carried in the message may include the node identifier of the start node of the equivalence path, the forwarding equivalence class to which the equivalence path belongs, and the egress interface identifier corresponding to the equivalence path.
  • the ingress node in the route establishment process, can collect information about each node and each link in the network, and by using an algorithm for calculating the shortest path, the shortest path tree of the network can be calculated.
  • the data stream is transmitted on the shortest path tree.
  • the ingress node may compare the equivalence path information with the shortest path tree; based on the result of the comparison, determine the equivalence path with the intermediate node as the starting node.
  • the ingress node may find the node that is the starting node of the equivalence path on the shortest path tree based on the node identifier included in the equivalence path information; The ingress node determines the corresponding link and determines the direction of the data flow on the shortest path tree based on the outbound interface identifier included in the equivalence path information. When multiple data streams are aggregated in one node, the node is an equal path. End node. Based on the forwarding equivalence class, the ingress node can determine that the found equivalence path is for the data flow of the forwarding equivalence class.
  • the ingress node may collect the equivalent path information at the intermediate node based on the equivalent path information carried in the message, by using the shortest path of the comparison network.
  • the tree can realize the positioning of the equivalence path, thereby facilitating the use of the flow label in the presence of the equivalence path, avoiding waste of resources by using the flow label on the path without using the flow label, and determining the equivalent path. Conducive to the management and dimension of the equivalent path Protection.
  • Figure 5 is a flow diagram of a method 500 for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
  • Equivalent path information of multiple nodes may exist in the message received by the ingress node. For related content, reference may be made to S305 and S310 of method 300.
  • an equivalent path starting from the intermediate node is determined.
  • This step is substantially the same as S420 of method 400.
  • an equivalent path with other intermediate nodes as starting nodes is determined.
  • S530 is executed after S520 in Fig. 5, S530 may be executed before S520 or simultaneously with S520, and the order of execution thereof is not limited to the scope of protection of the present invention.
  • the ingress node When the ingress node receives a message carrying the equivalent path information of the plurality of nodes in S510, the ingress node needs to determine a corresponding equivalent path with each node as the starting node for each of the equivalent path information therein. In this way, the ingress node can implement the positioning of the equivalent path with each of the plurality of nodes as the starting node, so that the positioning of the network medium value path can be realized.
  • the intermediate node may notify the ingress node of the change to facilitate the ingress node to update the determined equivalent path with the intermediate node as the starting node.
  • the ingress node After the ingress node knows the change of the intermediate node, if the equivalent path with the intermediate node as the starting node disappears, the ingress node deletes the equivalent path determined in S520 with the intermediate node as the starting node in combination with the shortest path tree. If the outbound interface of the equivalent path with the intermediate node as the starting node changes or the next hop changes, the equivalent path with the intermediate node as the starting node is re-determined in combination with the shortest path tree to determine the value determined in S520. The value path is updated. In this way, the ingress node can quickly grasp the changes of the network medium value path and accurately locate the existing equivalent path in the network.
  • S540 and S550 are executed after S530 in FIG. 5, S540 and S550 may be executed after S520.
  • an ingress node may collect equivalent path information in a network, and determine a specific equivalent based on a comparison result of the equal path information and the shortest path tree. The path, thus achieving the positioning of the equivalent path.
  • the ingress node can quickly grasp the change of the network medium value path and accurately locate the existing equivalent path in the network by receiving the message indicating the change of the equivalent path sent by the intermediate node. By determining the path of the equal value, it is not necessary to apply the flow label to the path that does not need the flow label, which can reduce the unnecessary protocol overhead.
  • the mastery of the equivalent path information facilitates the interaction between the subsequent MPLS-TP network (not supporting ECMP/LAG) and the MPLS network (ECMP/LAG extensive deployment), providing them with sufficient information to facilitate subsequent network operation maintenance and management.
  • the collection of equivalent path information provides sufficient information for subsequent network maintenance management.
  • Figure 6 is an example of a network topology in which an ECMP equivalent path exists, which corresponds to the shortest path tree of the network.
  • the data stream is sent from node A to node J, which is the ingress node of the network.
  • Node B is the starting node of ECMP equivalent path BCD and B-B1-C1-D1-D
  • node F is the ECMP equivalent path starting from FGH and F-F1-G1-H1-H The beginning of the festival.
  • Ingress node A can determine the ECMP equivalent path in the network by the following process.
  • Node B By querying its own routing forwarding table, Node B finds that the first FEC corresponds to multiple outbound interfaces or outgoing labels, and then determines that Node B is the starting node of the equivalent path.
  • Node B generates a message carrying the equivalent path information at Node B and sends it to Node A.
  • the equivalent path information at the node B includes: a node identifier of the node B, a first FEC corresponding to the ECMP equivalent path of the node B, and an interface identifier of the outbound interface of the node B to the node C (for example, an interface number or an IP of the interface) Address), the interface identifier of the outbound interface from Node B to Node B1.
  • the ingress node A After the ingress node A receives the equivalent path information sent by the node B, the ingress node A can find the node B on the shortest path tree shown in FIG. 6 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node D of the data stream convergence, determine that the node D is the end node of the equivalent path with the node B as the starting node, and the equivalent path of the node B to the node D corresponds to the first FEC. Similarly, the node F searches for its own routing forwarding table, and finds that the second FEC corresponds to multiple outbound interfaces or outbound labels, and then determines that the node F is the starting node of the equivalent path. The first FEC and the second FEC may be the same or different.
  • Node F generates a message carrying the equivalent path information at node F and sends it to node A.
  • the equivalent path information at the node F includes: a node identifier of the node F, a second FEC corresponding to the ECMP equivalent path of the node F, an interface identifier of the outbound interface of the node F to the node G, and an outbound interface of the node F to the node F1. Interface identifier.
  • the message sent by the node F to the node A may be forwarded to the node A through the nodes 0, C, and B, and may be forwarded to the node through the nodes D, D1, Cl, Bl, and B in sequence.
  • the ingress node A After the ingress node A receives the equivalent path information sent by the node F, the ingress node A can find the node F on the shortest path tree shown in FIG. 6 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node H of the data stream convergence, determine that the node H is the end node of the equivalent path with the node F as the starting node, and the equivalent path of the node F to the node H corresponds to the second FEC.
  • Node B and Node F can also share the same message to carry their respective equivalent path information.
  • the message is first generated by the node F, carrying the equivalent path information at the node F.
  • Node B arrives in the process of forwarding to the peer node, and Node B adds its own equivalent path information to the message and sends it to the ingress node A.
  • the ingress node A After the ingress node A receives the message carrying the equivalent path information, it compares the equivalent path information of the node B with the shortest path tree, finds the outbound interface of the node B and the node B, thereby finding the BCD and the B-B1-C1- D1-D two ECMP equivalent paths, and the two ECMP equivalent paths correspond to the first FEC.
  • the ingress node A compares the equivalence path information of the node F with the shortest path tree, finds the outbound interface of the node F and the node F, and finds two ECMP equivalent paths of FGH and F-F1-G1-H1-H, and The two ECMP equivalent paths correspond to the second FEC.
  • Figure 7 is an example of a network topology in which a LAG equivalent path exists, which corresponds to the shortest path tree of the network.
  • the data stream is sent from node A to node J, which is the ingress node of the network.
  • Node B is the starting node of the LAG equivalent path between Node B and Node C
  • Node F is the starting node of the LAG equivalent path between Node F and Node G.
  • Ingress node A can determine the LAG equivalent path in the network by the following process.
  • the Node B By querying its own routing forwarding table, the Node B finds that the first FEC corresponds to multiple outbound interfaces or outgoing labels, and then determines that the Node B is the starting node of the equivalent path. The Node B generates a message carrying the equivalent path information at the Node B and transmits it to the Node A.
  • the information of the equivalent path at the node B includes: a node identifier of the node B, a first FEC corresponding to the LAG contour path of the node B, and an interface identifier of the three outbound interfaces of the node B to the node C.
  • the ingress node A After the ingress node A receives the equivalent path information sent by the node B, the ingress node A can find the node B on the shortest path tree shown in FIG. 7 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node C where the data stream is aggregated, determine that node C is the end node of the equivalent path with node C as the starting node, and the equivalent path of node B to node C corresponds to the first FEC.
  • the node F searches for its own routing forwarding table, and finds that the second FEC corresponds to multiple outbound interfaces or outgoing labels, and then determines that the node F is the starting node of the equivalent path.
  • the first FEC and the second FEC may be the same or different.
  • Node F generates a message carrying the equivalent path information at node F and sends it to node A.
  • the equivalent path information at the node F includes: a node identifier of the node F, a second FEC corresponding to the LAG equivalent path of the node F, and an interface identifier of the three outbound interfaces of the node F to the node G.
  • the message sent by node F to node A can be forwarded to node by node D, C, and B in turn.
  • the ingress node A After the ingress node A receives the equivalent path information sent by the node F, the ingress node A can find the node F on the shortest path tree shown in FIG. 7 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node G of the data stream convergence, determine that the node G is the end node of the equivalent path with the node F as the starting node, and the equivalent path of the node F to the node G corresponds to the second FEC.
  • Node B and Node F can also share the same message to carry their respective equivalent path information.
  • the message is first generated by the node F, carrying the equivalent path information at the node F.
  • Node B arrives in the process of forwarding to the peer node, and Node B adds its own equivalent path information to the message and sends it to the ingress node A.
  • the node B's equivalent path information is compared with the shortest path tree, and the node B and the outbound interface of the node B are found, thereby finding the relationship between the node B and the node C.
  • Three LAG equivalent paths, and the three LAG equivalent paths correspond to the first FEC.
  • the ingress node A compares the equivalence path information of the node F with the shortest path tree, finds the outbound interface of the node F and the node F, and finds three LAG equivalent paths between the node F and the node G, and the three LAG equivalents The path corresponds to the second FEC.
  • the ingress node A can collect the network median path.
  • the path information is combined with the shortest path tree of the network to determine the equivalence path to achieve positioning of the equivalence path.
  • FIG. 8 is a block diagram showing the structure of a network device 800 according to an embodiment of the present invention.
  • Network device 800 includes a generation module 810 and a transmission module 820.
  • the generating module 810 can be configured to generate a message carrying the equivalent path information at the network device 800 when the network device 800 is the starting node of the equivalent path.
  • the sending module 820 can be configured to send, to the ingress node of the network, a message carrying the equivalent path information at the network device 800, so that the ingress node determines to use the network device 800 as a starting node based on the equivalent path information and the shortest path tree of the network. The equivalent path.
  • the foregoing and other operations and/or functions of the generating module 810 and the transmitting module 820 may refer to S110 and S120 in the foregoing method 100. To avoid repetition, details are not described herein again.
  • the network device provided by the embodiment of the present invention can make the ingress node realize the equivalence based on the equivalence path information and the shortest path tree by notifying the ingress path of the equivalence path information.
  • the location of the path is conducive to the deployment of the flow label in the presence of the equivalent path, avoiding the waste of resources by using the flow label on the path without using the flow label, and the positioning of the equivalent path is also beneficial for managing the equivalent path. And maintenance.
  • FIG. 9 is a block diagram showing the structure of a network device 900 according to an embodiment of the present invention.
  • the generating module 910 and the transmitting module 820 of the network device 900 are substantially identical to the generating module 810 and the transmitting module 820 of the network device 800.
  • Network device 900 may also include a determination module 905, in accordance with an embodiment of the present invention.
  • the determining module 905 can be configured to determine that the network device 900 is the starting node of the equivalent path when the same forwarding equivalence class corresponds to at least two outbound interfaces or outbound tags.
  • Network device 900 may also include a receiving module 930 and a forwarding module 940, in accordance with an embodiment of the present invention.
  • the receiving module 930 can be configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node.
  • the forwarding module 940 can be configured to send the received message to the ingress node, so that the ingress node determines the equivalent path with the intermediate node as the starting node based on the equivalent path information carried by the message and the shortest path tree.
  • Network device 900 may also include notification module 950, in accordance with an embodiment of the present invention.
  • the notification module 950 can be configured to notify the ingress node of the change when the equivalent path changes with the network device 900 as a starting node, so that the ingress node updates the determined network device 900 based on the change and the shortest path tree.
  • the equivalent path of the starting node is an MPLS network, and the message carrying the equivalent path information is a message based on a label distribution protocol.
  • the generating module 910 may include a first generating unit 912 and/or a second generating unit 914.
  • the first generating unit 912 can be configured to generate a notification message carrying the equivalent path information in the type length value TLV field.
  • the second generating unit 914 can be configured to generate a label mapping message carrying the equivalent path information in the option field.
  • the equivalent path information may include a node identifier of the start node of the equivalence path, a forwarding equivalence class corresponding to the equivalence path, and an outbound interface identifier corresponding to the equivalence path.
  • the foregoing and other operations and/or functions of the determining module 905, the receiving module 930, the forwarding module 940, the notification module 950, the first generating unit 912, and the second generating unit 914 may refer to S205, S230, S240, and S250 in the foregoing method 200.
  • the network device that is the starting node of the equivalence path can generate the equivalent path information by sending a message carrying the equivalent path information and then forwarding the message through other nodes.
  • the ingress node such that the ingress node can collect information about the equivalence path in the network to determine an equivalence path in the network, and achieve positioning of the equivalence path.
  • the notification of the change to the ingress node in time can update the location of the equivalent path of the ingress node in time to facilitate real-time control of where in the network there is an equivalent path.
  • FIG. 10 is a block diagram showing the structure of a network device 1000 according to an embodiment of the present invention.
  • the generating module 1010 and the transmitting module 1020 of the network device 1000 are substantially the same as the generating module 810 and the transmitting module 820 of the network device 800.
  • Network device 1000 may also include receiving module 1005, in accordance with an embodiment of the present invention.
  • the receiving module 1005 is configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node.
  • the generating module 1010 can be configured to add the equivalent path information at the network device 1000 to the received message to generate a message carrying the equivalent path information at the network device 1000.
  • the network device that is the starting node of the equivalence path can add the respective equivalent path information to the same message, so that when the message arrives at the ingress node, the ingress node can collect through a message.
  • Equivalent path information to a plurality of nodes that are the starting nodes of the equivalent path Therefore, the overhead of network resources can be saved, and excessive network messages can be generated to affect network performance.
  • FIG. 11 is a block diagram showing the structure of a network device 1100 according to an embodiment of the present invention.
  • the network device 1100 can include a first receiving module 1110 and a first determining module 1120.
  • the first receiving module 1110 is configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node.
  • the first determining module 1120 can be configured to determine an equivalent path starting from the intermediate node based on the equal path information and the shortest path tree of the network.
  • the foregoing and other operations and/or functions of the first receiving module 1110 and the first determining module 1120 may refer to S410 and S420 in the foregoing method 400. To avoid repetition, details are not described herein again.
  • the network device provided by the embodiment of the present invention can implement the location of the equivalence path based on the equivalence path information carried in the message and the shortest path tree of the network, thereby facilitating determining that the flow label is used where the equivalence path exists, thereby avoiding
  • the use of flow labels on the path using the flow label causes waste of resources, and the determination of the equivalent path also facilitates the management and maintenance of the equivalent path.
  • FIG. 12 is a structural block diagram of a network device 1200 according to an embodiment of the present invention.
  • the first receiving module 1210 and the first determining module 1220 of the network device 1200 are substantially identical to the first receiving module 1110 and the first determining module 1120 of the network device 1100.
  • the first receiving module 1210 is configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node and the equivalent path information at the other intermediate node.
  • the network device 1200 may further include a second determining module 1230.
  • the second determining module 1230 can be configured to determine an equivalent path starting with other intermediate nodes based on the equivalent path information and the shortest path tree at the other intermediate nodes.
  • the network device 1200 may further include a second receiving module.
  • the second receiving module 1240 is configured to receive a message sent by the intermediate node to indicate an equivalent path change with the intermediate node as the starting node.
  • the update module 1250 can be configured to update the determined equivalent path with the intermediate node as the starting node based on the change and the shortest path tree.
  • the first determining module 1220 may include a comparing unit 1222 and a determining unit 1224.
  • Comparison unit 1222 can be used to perform the equivalent path information with the shortest path tree. Comparison.
  • the determining unit 1224 can be configured to determine an equivalent path starting with the intermediate node based on the result of the comparison.
  • the network may be an MPLS network
  • the message carrying the equivalent path information may be a message based on a label distribution protocol.
  • the equivalent path information may include a node identifier that is a starting node of the equivalent path, a forwarding equivalence class corresponding to the equivalence path, and an outbound interface identifier corresponding to the equivalence path.
  • the first receiving module 1210 may include a first receiving unit 1212 and/or a second receiving unit 1214.
  • the first receiving unit 1212 is configured to receive a notification message that is sent by the intermediate node and that carries the equivalent path information in the type length value TLV field.
  • the second receiving unit 1214 is configured to receive a label mapping message sent by the intermediate node that carries the equivalent path information in the option field.
  • first receiving module 1210 the second determining module 1230, the second receiving module 1240, the updating module 1250, the comparing unit 1222, the determining unit 1224, the first receiving unit 1212, and the second receiving unit 1214
  • S510, S530 to S550 in the above method 500 and S410 and S420 of the method 400. To avoid repetition, details are not described herein again.
  • the network device may collect the equivalence path information in the network, and determine a specific equivalence path based on the comparison result of the equivalence path information and the shortest path tree, thereby realizing the positioning of the equivalence path.
  • the network device can quickly grasp the change of the network medium value path and accurately locate the existing equivalent path in the network by receiving the message indicating the change of the equivalent path sent by the intermediate node. By determining the path of the equal value, it is not necessary to apply the flow label to the path that does not need the flow label, which can reduce unnecessary protocol overhead.
  • the mastery of the equivalent path information facilitates the interaction between the subsequent MPLS-TP network (not supporting ECMP/LAG) and the MPLS network (ECMP/LAG extensive deployment), providing them with sufficient information to facilitate subsequent network operation and maintenance. management.
  • the collection of equivalent path information also provides sufficient information for subsequent network maintenance management.
  • Figure 13 is a block diagram showing the structure of a system 1300 for determining an equivalent path in a network in accordance with an embodiment of the present invention.
  • System 1300 can include at least one first network device 1310 and a second network device 1320.
  • the first network device 1310 can be configured to generate a message carrying the equivalent path information at the first network device 1310 when the first network device 1310 is the starting node of the equivalent path; and send the carried message to the second network device 1320.
  • the second network device 1320 is configured to receive a message that is sent by the first network device 1310 and that carries the equivalent path information at the first network device 1310; and determine the first network device 1310 based on the equivalent path information and the shortest path tree of the network. Is the equivalent path of the starting node.
  • the foregoing and other operations and/or functions of the first network device 1310 may be referred to the related descriptions of the network device 800, the network device 900, and the network device 1000, and the above and other operations and/or functions of the second network device 1320 may refer to the network described above.
  • the related descriptions of the device 1100 and the network device 1200 are not described herein again in order to avoid redundancy.
  • the first network device by notifying the second network device of the equivalent path information, in the case that it is the starting node of the equivalent path,
  • the second network device implements positioning of the equi-path based on the equi-path information and the shortest path tree, thereby facilitating deployment of the flow label in the presence of the equi-path, avoiding the use of the flow label on the path that does not need to use the flow label.
  • the waste of resources, and the positioning of the equivalent path is also conducive to the management and maintenance of the equivalent path.
  • RAM random access memory
  • ROM read only memory
  • EEPROM electrically programmable ROM
  • EEPROM electrically erasable programmable ROM
  • registers hard disk, removable disk, CD-ROM or technology Any other form of storage medium known.

Landscapes

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

Abstract

The embodiments of the present invention provide a method, network device and system for determining equal-cost paths in a network. The method comprises the following steps: when a node is the starting node of equal-cost paths, a message carried equal-cost path information of the node is generated; the message carried equal-cost path information of the node is transmitted to the ingress node of the network, so that the ingress node determines the equal-cost paths whose starting node is the node based on the equal-cost path information and the shortest path tree of the network. Based on the technical solution, when an intermediate node itself is the starting node of the equal-cost paths, by informing the ingress node the equal-cost path information, the intermediate node could make the ingress node locate the equal-cost paths based on the equal-cost path information and the shortest path tree, therefore it is beneficial for disposing flow labels where the equal-cost paths exist and managing and maintaining the equal-cost paths.

Description

用于在网络中确定等值路径的方法、 网络装置和*** 技术领域  Method, network device and system for determining an equivalent path in a network
本发明涉及网络通信领域, 并且更具体地, 涉及网络通信领域中用于在 网络中确定等值路径的方法、 网络装置和***。 背景技术  The present invention relates to the field of network communications and, more particularly, to a method, network apparatus and system for determining an equivalent path in a network in the field of network communications. Background technique
多协议标签交换( Multi-Protocol Label Switching , MPLS ) MPLS网络中, 通过标签分发协议 ( Label Distribution Protocol, LDP ) 建立标签交换路径 ( Label Switching Path, LSP ), LSP上的标签交换路由器(Label Switched Router, LSR )基于报文携带的标签对报文进行转发。  Multi-Protocol Label Switching (MPLS) MPLS network, Label Switching Path (LSP) is established through Label Distribution Protocol (LDP), Label Switched Router on LSP (Label Switched Router) , LSR) forwards the packet based on the label carried in the packet.
当网络协议 ( Internet Protocol, IP )报文进入 MPLS网络时, 入口 LSR 根据该 IP报文所属的转发等价类( Forward Equivalence Class, FEC )为该报 文添加相应的标签, 并向邻居 LSR转发。 邻居 LSR无需分析 IP报文头, 而 直接根据 IP报文携带的标签来查找基于标签转发的路由转发表, 为该 IP报 文换上新的标签, 并从相应出接口输出, 送往下一跳的 LSR。 于是, 在该 IP 报文所属的 FEC对应的 LSP上,通过 LSR为该 IP报文更换标签而送达 MPLS 网络的出口 LSR, 由出口 LSR删除标签后继续在 IP网上进行转发。  When an Internet Protocol (IP) packet enters the MPLS network, the ingress LSR adds a corresponding label to the packet according to the Forward Equivalence Class (FEC) to which the IP packet belongs, and forwards the label to the neighbor LSR. . The neighboring LSR does not need to analyze the IP packet header, but directly searches for the routing forwarding table based on the label forwarding according to the label carried in the IP packet, and replaces the IP packet with a new label, and outputs it from the corresponding outgoing interface, and sends it to the next. Jump the LSR. Then, on the LSP corresponding to the FEC to which the IP packet belongs, the LSR sends the IP packet to the egress LSR of the MPLS network, and the egress LSR deletes the label and then forwards the packet on the IP network.
无论是在 MPLS网络中还是在 IP网络中, 都存在着等值路径。 所谓等 值路径是指在源节点和目的节点之间具有相同的度量值和优先级的多条路 径,从该源节点到该目的节点的数据流将按照预定策略被分配到这些等值路 径上。 通过将数据流经过等值路径转发可以增加数据带宽, 实现负载均衡, 并提供路径备份。  Equivalent paths exist in both MPLS networks and IP networks. The so-called equivalence path refers to multiple paths having the same metric value and priority between the source node and the destination node, and the data flow from the source node to the destination node will be allocated to the equivalence paths according to a predetermined policy. . By forwarding the data stream through the equivalent path, you can increase the data bandwidth, achieve load balancing, and provide path backup.
目前存在的等值路径主要包括两大类, 分别是基于等值多路径路由 ( Equal-Cost Multi-Path Routing, ECMP )的等值路径和基于链路汇聚组( Link Aggregation Group, LAG )的等值路径。 在 ECMP等值路径中, 来自源节点 的数据流可以根据不同的 ECMP算法流经不同的等值路径。 在 LAG等值路 径中, 由于 LAG将相邻两节点之间的多条物理链路作为一条逻辑链路来使 用, 所以 LAG等值路径只存在于相邻两节点之间, 在该两节点之间传递的 数据流可以按策略分布到不同的等值路径上, 以实现负载均衡等。  Currently, there are two types of equivalent paths, which are equal-valued paths based on Equal-Cost Multi-Path Routing (EPCMP) and Link Aggregation Group (LAG). Value path. In the ECMP equivalent path, the data stream from the source node can flow through different equivalent paths according to different ECMP algorithms. In the LAG equivalent path, since the LAG uses multiple physical links between two adjacent nodes as one logical link, the LAG equivalent path exists only between the adjacent two nodes, and the two nodes The data streams passed between can be distributed to different equivalent paths according to policies to achieve load balancing and the like.
虽然使用等值路径转发数据流可以带来用户使用带宽的增加、故障切换 的灵活以及链路的负载均衡能力, 但是也存在一定的负面影响。 例如, 等值 路径的存在可能使同一数据流的报文到达目的端时出现乱序。 为了避免同一 数据流的报文产生乱序, 目前可以通过流标签进行基于数据流的多路径流量 转发。通过流标签的引用可以更精细地将属于同一数据流的报文经由相同的 路径转发。 但是, 流标签的引入将产生大量的网络开销, 因为需要进行一系 列的流分类、 能力协商以及流标签分配、 维护等操作。 Although using the equivalent path to forward data streams can lead to increased user bandwidth usage, failover Flexibility and load balancing capabilities of the link, but there are also certain negative effects. For example, the existence of an equivalent path may cause out-of-order when packets of the same data stream arrive at the destination. To avoid out-of-order packets in the same data stream, traffic-based multi-path traffic forwarding can be performed through the flow label. Messages belonging to the same data stream can be forwarded through the same path more finely by reference to the flow label. However, the introduction of flow labels will generate a large amount of network overhead, because a series of flow classification, capability negotiation, and flow label allocation and maintenance operations are required.
另外, 由于负载分担算法的缺陷, 可能使得等值路径中的个别链路出现 拥塞或失去转发功能而不能工作, 从而造成链路的使用效率低下, 但是网管 ***不能有效地意识到部分等值路径中出现的拥塞问题。 从而, 等值路径的 存在也不利于网络的管理和维护。  In addition, due to the defect of the load sharing algorithm, the individual links in the equivalent path may be congested or lose the forwarding function and may not work, thereby causing the link to be inefficient, but the network management system cannot effectively recognize the partial equivalent path. Congestion problems that occur in the middle. Thus, the existence of an equivalent path is also detrimental to the management and maintenance of the network.
因此, 希望能够在网络中确定等值路径即对等值路径进行定位, 以有效 地分配流标签和进行网络管理维护,但是在现有技术中还不能实现对等值路 径的定位。 发明内容  Therefore, it is desirable to be able to determine the equivalent path in the network, that is, to locate the equal value path, to effectively allocate the flow label and perform network management and maintenance, but the positioning of the equal path cannot be achieved in the prior art. Summary of the invention
本发明实施例提供了用于在网络中确定等值路径的方法、 网络装置和系 统, 能够确定网络中的等值路径, 对等值路径进行定位, 从而有利于流标签 的部署和网络管理维护。  The embodiments of the present invention provide a method, a network device, and a system for determining an equal path in a network, which can determine an equivalence path in the network, and locate the equivalence path, thereby facilitating deployment of the flow label and network management and maintenance. .
一方面, 本发明实施例提供了一种用于在网络中确定等值路径的方法, 包括: 当节点是等值路径的起始节点时, 生成携带有所述节点处的等值路径 信息的消息; 向网络的入口节点发送所述携带有所述节点处的等值路径信息 的消息, 以使所述入口节点基于所述等值路径信息和所述网络的最短路径 树, 确定以所述节点为起始节点的等值路径。  In one aspect, an embodiment of the present invention provides a method for determining an equivalent path in a network, including: when a node is a start node of an equivalent path, generating an equivalent path information carrying the node Transmitting, to the ingress node of the network, the message carrying the equivalent path information at the node, so that the ingress node determines, according to the equivalence path information and the shortest path tree of the network, The node is the equivalent path of the starting node.
另一方面, 本发明实施例提供了一种用于在网络中确定等值路径的方 法, 包括: 接收中间节点发送的携带有所述中间节点处的等值路径信息的消 息; 基于所述等值路径信息和网络的最短路径树, 确定以所述中间节点为起 始节点的等值路径。  In another aspect, an embodiment of the present invention provides a method for determining an equivalent path in a network, including: receiving, by an intermediate node, a message carrying the equivalent path information at the intermediate node; The value path information and the shortest path tree of the network determine an equivalent path starting from the intermediate node.
再一方面, 本发明实施例提供了一种网络装置, 包括: 生成模块, 用于 当所述网络装置是等值路径的起始节点时,生成携带有所述网络装置处的等 值路径信息的消息; 发送模块, 用于向网络的入口节点发送所述携带有所述 网络装置处的等值路径信息的消息, 以使所述入口节点基于所述等值路径信 息和所述网络的最短路径树, 确定以所述网络装置为起始节点的等值路径。 又一方面, 本发明实施例提供了一种网络装置, 包括: 第一接收模块, 用于接收中间节点发送的携带有所述中间节点处的等值路径信息的消息; 第 一确定模块, 用于基于所述等值路径信息和网络的最短路径树, 确定以所述 中间节点为起始节点的等值路径。 In a further aspect, the embodiment of the present invention provides a network device, including: a generating module, configured to: when the network device is a starting node of an equal path, generate an equivalent path information that carries the network device a sending module, configured to send, to an ingress node of the network, the message carrying the equivalent path information at the network device, so that the ingress node is based on the equivalent path message And the shortest path tree of the network, determining an equivalent path starting with the network device. In another aspect, an embodiment of the present invention provides a network apparatus, including: a first receiving module, configured to receive a message that is sent by an intermediate node and that carries the equivalent path information at the intermediate node; And determining, based on the equivalence path information and the shortest path tree of the network, an equivalent path starting from the intermediate node.
又一方面, 本发明实施例提供了一种用于在网络中确定等值路径的系 统, 该***包括至少一个第一网络装置和第二网络装置。 所述第一网络装置 用于当所述第一网络装置是等值路径的起始节点时, 生成携带有所述第一网 络装置处的等值路径信息的消息; 向所述第二网络装置发送所述携带有所述 第一网络装置处的等值路径信息的消息。所述第二网络装置用于接收所述第 一网络装置发送的所述携带有所述第一网络装置处的等值路径信息的消息; 基于所述等值路径信息和网络的最短路径树,确定以所述第一网络装置为起 始节点的等值路径。  In still another aspect, embodiments of the present invention provide a system for determining an equivalent path in a network, the system including at least one first network device and a second network device. The first network device is configured to: when the first network device is a start node of an equal path, generate a message carrying the equivalent path information at the first network device; to the second network device Sending the message carrying the equivalent path information at the first network device. The second network device is configured to receive, by the first network device, the message carrying the equivalent path information at the first network device; based on the equal path information and a shortest path tree of the network, An equivalent path is determined with the first network device as a starting node.
根据本发明实施例提供的上述技术方案,作为等值路径的起始节点的节 点通过生成携带等值路径信息的消息并向入口节点发送, 可以使网络的入口 节点基于收集到的等值路径信息和最短路径树来确定等值路径, 实现等值路 径的定位, 从而有利于在存在等值路径之处部署流标签, 避免在无需使用流 标签的路径上使用流标签而造成资源浪费, 同时等值路径的定位还有利于对 等值路径进行管理和维护。 附图说明  According to the foregoing technical solution provided by the embodiment of the present invention, a node that is a starting node of an equal path can generate a message carrying the equivalent path information and send the message to the ingress node, so that the ingress node of the network can be based on the collected equivalent path information. And the shortest path tree to determine the equivalence path to achieve the positioning of the equivalence path, thereby facilitating the deployment of the flow label where the equivalence path exists, avoiding the waste of resources when using the flow label on the path without using the flow label, and the like The positioning of the value path also facilitates the management and maintenance of the equivalent path. DRAWINGS
为了更清楚地说明本发明实施例的技术方案, 下面将对实施例中所需要 使用的附图作筒单地介绍, 显而易见地, 下面描述中的附图仅仅是本发明的 一些实施例, 对于本领域技术人员来讲, 在不付出创造性劳动的前提下, 还 可以根据这些附图获得其他的附图。  In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the embodiments will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the present invention. Those skilled in the art can obtain other drawings according to these drawings without paying any creative work.
图 1是根据本发明实施例的由网络的中间节点执行的用于在网络中确定 等值路径的方法的流程图。  1 is a flow diagram of a method performed by an intermediate node of a network for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
图 2是根据本发明实施例的用于在网络中确定等值路径的另一方法的流 程图。  2 is a flow diagram of another method for determining an equivalent path in a network in accordance with an embodiment of the present invention.
图 3是根据本发明实施例的用于在网络中确定等值路径的再一方法的流 程图。 图 4是根据本发明实施例的由网络的入口节点执行的用于在网络中确定 等值路径的方法的流程图。 3 is a flow diagram of still another method for determining an equivalent path in a network, in accordance with an embodiment of the present invention. 4 is a flow diagram of a method performed by an ingress node of a network for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
图 5是根据本发明实施例的用于在网络中确定等值路径的又一方法的流 程图。  Figure 5 is a flow diagram of yet another method for determining an equivalent path in a network in accordance with an embodiment of the present invention.
图 6是存在 ECMP等值路径的网络拓朴的例子。  Figure 6 is an example of a network topology in which an ECMP equivalent path exists.
图 7是存在 LAG等值路径的网络拓朴的例子。  Figure 7 is an example of a network topology in which a LAG equivalent path exists.
图 8是根据本发明实施例的网络装置的结构框图。  FIG. 8 is a structural block diagram of a network device according to an embodiment of the present invention.
图 9是根据本发明实施例的另一网络装置的结构框图。  9 is a block diagram showing the structure of another network device according to an embodiment of the present invention.
图 10是根据本发明实施例的再一网络装置的结构框图。  FIG. 10 is a structural block diagram of still another network device according to an embodiment of the present invention.
图 11是根据本发明实施例的又一网络装置的结构框图。  11 is a block diagram showing the structure of still another network device according to an embodiment of the present invention.
图 12是根据本发明实施例的又一网络装置的结构框图。  FIG. 12 is a structural block diagram of still another network device according to an embodiment of the present invention.
图 13是根据本发明实施例的用于在网络中确定等值路径的***的结构 框图。 具体实施方式  Figure 13 is a block diagram showing the structure of a system for determining an equivalent path in a network in accordance with an embodiment of the present invention. detailed description
下面将结合本发明实施例中的附图,对本发明实施例的技术方案进行清 楚、 完整地描述, 显然, 所描述的实施例是本发明的一部分实施例, 而不是 全部实施例。 基于本发明中的所述实施例, 本领域技术人员在没有做出创造 性劳动的前提下所获得的所有其他实施例, 都应属于本发明保护的范围。  BRIEF DESCRIPTION OF THE DRAWINGS The technical solutions of the embodiments of the present invention will be clearly and completely described in the following description of the embodiments of the present invention. It is obvious that the described embodiments are a part of the embodiments of the present invention, and not all embodiments. All other embodiments obtained by a person skilled in the art based on the described embodiments of the present invention without creative work shall fall within the protection scope of the present invention.
首先,结合图 1描述根据本发明实施例的用于在网络中确定等值路径的 方法 100。  First, a method 100 for determining an equivalent path in a network in accordance with an embodiment of the present invention will be described in conjunction with FIG.
如图 1所示, 方法 100包括: 在 S110中, 当节点是等值路径的起始节 点时, 生成携带有该节点处的等值路径信息的消息; 在 S120中, 向网络的 入口节点发送携带有该节点处的等值路径信息的消息, 以使入口节点基于等 值路径信息和网络的最短路径树, 确定以该节点为起始节点的等值路径。  As shown in FIG. 1, the method 100 includes: in S110, when a node is a starting node of an equivalent path, generating a message carrying the equivalent path information at the node; in S120, sending to the ingress node of the network A message carrying the equivalent path information at the node, so that the ingress node determines the equivalent path with the node as the starting node based on the equivalent path information and the shortest path tree of the network.
例如, 方法 100可以由网络的中间节点来执行。 假设用节点 M来代表 中间节点。 如果节点 M是等值路径的起始节点, 节点 M可以将等值路径信 息携带在消息中通知给入口节点, 以使入口节点基于等值路径信息和最短路 径树对等值路径进行定位。  For example, method 100 can be performed by an intermediate node of the network. Assume that node M is used to represent the intermediate node. If the node M is the starting node of the equivalent path, the node M may carry the equivalent path information in the message to notify the ingress node, so that the ingress node locates the equivalent path based on the equivalence path information and the shortest path tree.
在 S110中, 节点 M可以通过多种消息来携带等值路径信息。 例如, 在 In S110, the node M can carry the equivalent path information through various messages. For example, in
MPLS网络中,节点 M可以通过基于 LDP协议的消息来携带等值路径信息。 这样, 不仅可以和现有的 MPLS网络中的消息相兼容, 还可以利用协议本身 的消息来帮助实现等值路径信息的传输, 对协议和网络的影响很小。 In the MPLS network, the node M can carry the equivalent path information through the message based on the LDP protocol. In this way, not only can the message in the existing MPLS network be compatible, but also the message of the protocol itself can be used to help realize the transmission of the equivalent path information, which has little impact on the protocol and the network.
根据本发明的一个实施例, 当节点 M是等值路径的起始节点时, 生成 通知消息( Notification Message ),该通知消息的类型长度值 TLV( Type Length Value )字段中携带有等值路径信息。 根据本发明的另一实施例, 当节点 M 是等值路径的起始节点时, 生成在选项字段中携带等值路径信息的标签映射 消息 ( Label Mapping Message )。  According to an embodiment of the present invention, when the node M is the start node of the equivalence path, a notification message is generated, and the type length value TLV (Type Length Value) field of the notification message carries the equivalent path information. . According to another embodiment of the present invention, when the node M is the starting node of the equivalent path, a Label Mapping Message carrying the equivalent path information in the option field is generated.
通知消息和标签映射消息是 LDP协议中的消息。 利用通知消息的 TLV 字段和标签映射消息的选项字段来携带等值路径信息,可以方便地利用现有 消息来实现对等值路径信息的收集。 消息中携带的等值路径信息可以包括等 值路径的起始节点的节点标识、该等值路径对应的转发等价类和该等值路径 对应的出接口标识。  The notification message and the label mapping message are messages in the LDP protocol. By using the TLV field of the notification message and the option field of the label mapping message to carry the equivalent path information, the existing message can be conveniently used to collect the equivalent path information. The information of the equivalent path carried in the message may include the node identifier of the starting node of the equal value path, the forwarding equivalence class corresponding to the equal value path, and the outbound interface identifier corresponding to the equal value path.
TLV字段和选项字段携带的等值路径信息可以相同。 下面以 TLV字段 为例来描述携带等值路径信息的例子。  The equivalent path information carried by the TLV field and the option field may be the same. The following uses the TLV field as an example to describe an example of carrying the equivalent path information.
例如, 当网络中存在 ECMP等值路径时, TLV字段可以具有如表 1所 示的形式。 其中 TLV字段携带的信息不仅包括节点标识(Node ID )、 转发 等价类( FEC )和出接口标识( InterfacellD至 Interface n ID )这些等值路径 信息, 还包括诸如 U比特、 F比特、 ECMP TLV Type, Length, Path Number 之类的可选内容, 以便于对 TLV字段进行处理等。  For example, when an ECMP equivalent path exists in the network, the TLV field may have the form shown in Table 1. The information carried in the TLV field includes not only the node identifier (Node ID), the forwarding equivalence class (FEC), and the outbound interface identifier (interfacellD to Interface n ID), but also includes such as U-bit, F-bit, ECMP TLV. Optional content such as Type, Length, Path Number, etc., to facilitate processing of TLV fields.
表 1  Table 1
U F ECMP TLV Type Length  U F ECMP TLV Type Length
Path Number Reserve  Path Number Reserve
FEC  FEC
Node ID  Node ID
Interface 1 ID  Interface 1 ID
Interface2 ID  Interface2 ID
Interface n ID Interface n ID
在表 1中, U比特和 F比特具有与现有技术相同的用法。 当 U比特的值 为 1时, 接收到携带该 TLV字段的报文的节点能够识别该 TLV字段; 当 U 比特的值为 0时, 接收到携带该 TLV字段的报文的节点不能识别该 TLV字 段, 并向发送该报文的节点返回响应消息。 F比特要被节点识别, 需要 U比 特为 1。 当 F比特的值为 1时,接收到携带该 TLV字段的报文的节点对该报 文进行转发, 当 F比特的值不为 1时, 接收到携带该 TLV字段的报文的节 点对该报文进行转发。 因此, 为了使携带 TLV字段的消息向网络的入口节 点转发, 需要使 U比特和 F比特的值都为 1。 In Table 1, U bits and F bits have the same usage as in the prior art. When the value of the U bit is 1, the node that receives the message carrying the TLV field can identify the TLV field; when the value of the U bit is 0, the node that receives the message carrying the TLV field cannot identify the TLV. Word Segment, and return a response message to the node that sent the message. The F bit is to be recognized by the node, and the U bit needs to be 1. When the value of the F bit is 1, the node that receives the packet carrying the TLV field forwards the packet. When the value of the F bit is not 1, the node that receives the packet carrying the TLV field receives the packet. The message is forwarded. Therefore, in order to forward the message carrying the TLV field to the ingress node of the network, it is necessary to make the values of the U bit and the F bit both 1.
ECMP TLV Type表示该 TLV字段的类型是针对 ECMP等值路径的。 Length表示该 TLV字段的长度。 Path Number表示 ECMP等值路径数量。 Reserve表示预留部分。 FEC表示 ECMP等值路径所属的转发等价类。 Node ID表示存在 ECMP等值路径的节点标识, 可以是节点的编号, 也可以是节 点的 IP地址等。 Interfacel ID、 Interface2 ID至 Interface n ID ( n大于等于 2 ) 分别表示 ECMP等值路径所对应的出接口标识。  The ECMP TLV Type indicates that the type of the TLV field is for the ECMP equivalent path. Length indicates the length of the TLV field. Path Number indicates the number of ECMP equivalent paths. Reserve indicates the reserved portion. FEC indicates the forwarding equivalence class to which the ECMP equivalent path belongs. The Node ID indicates the node identifier of the ECMP equivalent path, which may be the node number or the IP address of the node. Interfacel ID, Interface2 ID, and Interface n ID (n is greater than or equal to 2) respectively indicate the outbound interface identifier corresponding to the ECMP equivalent path.
再例如, 当网络中存在 LAG等值路径时, TLV字段可以具有如表 2所 示的形式。其中携带的信息不仅包括节点标识( Node ID )、转发等价类( FEC ) 和出接口标识( InterfacellD至 Interface n ID )这些等值路径信息, 还包括诸 如 U比特、 F比特、 LAG TLV Type, Length, Path Number之类的可选内容, 以便于对 TLV字段进行处理并指明 LAG等值路径的相关情况等。  For another example, when there is a LAG equivalent path in the network, the TLV field may have the form shown in Table 2. The information carried in the information includes not only the node identifier (Node ID), the forwarding equivalence class (FEC), and the outbound interface identifier (interfacellD to Interface n ID), but also information such as U-bit, F-bit, and LAG TLV Type. Optional content such as Length, Path Number, etc., to facilitate processing of the TLV field and indicate the relevant situation of the LAG equivalent path.
表 2  Table 2
U F LAG TLV Type Length  U F LAG TLV Type Length
Path Number Reserve  Path Number Reserve
FEC  FEC
Node ID  Node ID
Local interface ID  Local interface ID
Remote interface ID  Remote interface ID
Sum bandwidth  Sum bandwidth
Linkl bandwidth  Linkl bandwidth
Link2 bandwidth  Link2 bandwidth
Link n bandwidth Link n bandwidth
在表 2中, U比特和 F比特如表 1所述, 将 U比特和 F比特的值都设 置为 1。 LAG TLV Type表示该 TLV字段的类型是针对 LAG等值路径的。 Length, Path Number, Reserve和 FEC与表 1基本相同。 Local interface ID表示 LAG等值路径在该节点上的出接口标识。 Remote interface ID表示 LAG等值路径在下一跳节点上的入接口标识。 当存在多条 LAG等值路径时, Local interface ID和 Remote interface ID具有多个值, 分 别——对应。 出接口标识和入接口标识可以交替记录以表征——对应的关 系, 也可以先将出接口标识记录完全、 再记录入接口标识, 在两者之间存在 相对应的顺序关系。 In Table 2, the U bit and the F bit are as described in Table 1, and the values of the U bit and the F bit are both set to 1. The LAG TLV Type indicates that the type of the TLV field is for the LAG equivalent path. Length, Path Number, Reserve, and FEC are basically the same as Table 1. The Local interface ID indicates the outbound interface identifier of the LAG equivalent path on the node. The remote interface ID indicates the inbound interface identifier of the LAG equivalent path on the next hop node. When there are multiple LAG equivalent paths, the Local interface ID and the Remote interface ID have multiple values, respectively - corresponding. The outbound interface identifier and the inbound interface identifier can be alternately recorded to represent the corresponding relationship. The outbound interface identifier record can be completely recorded and then recorded into the interface identifier. There is a corresponding order relationship between the two.
Sum bandwidth表示 LAG等值路径的总带宽。 Linkl bandwidth, Link2 bandwidth至 Link n bandwidth ( n大于等于 2 )分别表示相应的 LAG等值路 径的带宽,分别与由入接口标识和出接口标识确定的 LAG等值路径相对应。  Sum bandwidth represents the total bandwidth of the LAG equivalent path. Linkl bandwidth, Link2 bandwidth to Link n bandwidth (n is greater than or equal to 2) respectively indicate the bandwidth of the corresponding LAG equivalent path, corresponding to the LAG equivalent path determined by the inbound interface identifier and the outbound interface identifier.
在 S120中, 节点 M向网络的入口节点发送 S110中生成的消息。 例如, 在具体的发送过程中, 节点 M可以向它的对等(peer )节点发送 S110中生 成的消息, 节点 M 的对等节点再将该消息发送给它自己的对等节点, 通过 对等节点对消息的转发, 可以使该消息最终到达网络的入口节点。 如果节点 M的对等节点恰好是入口节点, 则无需对等节点的转发, 节点 M可以直接 将该消息发送给入口节点。  In S120, the node M transmits the message generated in S110 to the ingress node of the network. For example, in a specific transmission process, the node M may send a message generated in S110 to its peer node, and the peer node of the node M sends the message to its own peer node, through peering. The node forwards the message so that the message eventually reaches the ingress node of the network. If the peer node of node M happens to be the ingress node, then no forwarding of the peer node is required, and node M can directly send the message to the ingress node.
入口节点收到节点 M发送的消息后, 通过将在入口节点的数据库中保 存的最短路径树与消息携带的等值路径信息相比较, 可以确定出以节点 M 为起始节点的等值路径, 也就是入口节点可以知晓以节点 M 为起始节点的 每条等值路径经由了哪些节点并包含了哪些链路。  After receiving the message sent by the node M, the ingress node can determine the equivalence path with the node M as the starting node by comparing the shortest path tree saved in the database of the ingress node with the equivalent path information carried by the message. That is, the ingress node can know which nodes and which links each of the equivalence paths with node M as the starting node has passed.
在入口节点的数据库中保存的最短路径树可以在建立路由的过程(例如 采用开放式最短路径优先 OSFP协议等) 中计算得到, 具体的计算过程可以 与现有技术相同,在此不再赘述。最短路径树包含了网络中的所有转发路径, 数据流在最短路径树上流动。 当入口节点在最短路径树上找到节点 M 时, 结合最短路径树的拓朴和数据流的方向, 可以确定以节点 M 为起始节点的 等值路径。 等值路径的终点节点可以是沿着数据流的方向、 数据流第一次汇 聚时的节点。 入口节点的操作将结合图 4和图 5进行描述, 这里不再展开。  The shortest path tree saved in the database of the ingress node can be calculated in the process of establishing a route (for example, using the open shortest path first OSFP protocol, etc.), and the specific calculation process can be the same as the prior art, and details are not described herein again. The shortest path tree contains all the forwarding paths in the network, and the data flows on the shortest path tree. When the ingress node finds the node M on the shortest path tree, combined with the topology of the shortest path tree and the direction of the data stream, the equivalent path with the node M as the starting node can be determined. The endpoint of the equivalent path can be the node along the direction of the data stream and the first time the data stream is aggregated. The operation of the ingress node will be described in conjunction with Figures 4 and 5, and will not be expanded here.
根据本发明实施例提供的用于在网络中确定等值路径的方法, 中间节点 在自己作为等值路径的起始节点的情况下,通过向入口节点发送等值路径信 息, 可以使入口节点基于等值路径信息和最短路径树来实现对等值路径的定 位, 从而可以在存在等值路径之处部署流标签, 避免在无需使用流标签的路 径上使用流标签而造成资源浪费, 同时等值路径的定位还有利于对等值路径 进行管理和维护。 According to the method for determining an equivalent path in a network according to an embodiment of the present invention, the intermediate node may base the ingress node by sending the equivalent path information to the ingress node if it is the starting node of the equivalent path. The equivalence path information and the shortest path tree are used to locate the equivalence path, so that the flow label can be deployed where the equivalence path exists, avoiding waste of resources when using the flow label on the path without using the flow label, and equivalent The positioning of the path is also beneficial to the equivalent path Manage and maintain.
图 2是根据本发明实施例的用于在网络中确定等值路径的方法 200的流 程图。  2 is a flow diagram of a method 200 for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
在 S205 中, 当同一转发等价类对应至少两个出接口或出标签时, 确定 节点是等值路径的起始节点。  In S205, when the same forwarding equivalence class corresponds to at least two outbound interfaces or outgoing tags, it is determined that the node is the starting node of the equivalent path.
网络可以将不同的数据流划分为不同的转发等价类。 例如, 基于数据流 的目的 IP地址、 携带的数据类型、 优先级、 端口号等, 将数据流分为不同 的 FEC, 对于每一 FEC存在相同的转发路径。 于是, 可以根据 FEC建立路 由转发表。  The network can divide different data streams into different forwarding equivalence classes. For example, based on the destination IP address of the data stream, the type of data carried, the priority, the port number, etc., the data stream is divided into different FECs, and the same forwarding path exists for each FEC. Thus, a route forwarding table can be established based on the FEC.
节点 M可以通过查询自己的路由转发表来确定等值路径的存在。 当发 现同一转发等价类有多个出接口或出标签, 则说明节点 M是与该转发等价 类相应的等值路径的起始节点。  Node M can determine the existence of the equivalent path by querying its own routing forwarding table. When it is found that the same forwarding equivalence class has multiple outgoing interfaces or outgoing labels, it indicates that the node M is the starting node of the equivalent path corresponding to the forwarding equivalence class.
在 S210中, 生成携带有该节点处的等值路径信息的消息。 该步骤与方 法 100中的 S110相同。  In S210, a message carrying the equivalent path information at the node is generated. This step is the same as S110 in the method 100.
在 S220中, 向网络的入口节点发送携带有该节点处的等值路径信息的 消息, 以使入口节点基于等值路径信息和网络的最短路径树, 确定以该节点 为起始节点的等值路径。 该步骤与方法 100中的 S120相同。  In S220, a message carrying the equivalent path information at the node is sent to the ingress node of the network, so that the ingress node determines the equivalent of the node as the starting node based on the equivalent path information and the shortest path tree of the network. path. This step is the same as S120 in method 100.
在 S230中, 接收中间节点发送的携带有该中间节点处的等值路径信息 的消息。  In S230, a message sent by the intermediate node carrying the equivalent path information at the intermediate node is received.
节点 M 可以从它的对等节点接收它的对等节点转发的消息, 该消息由 网络中的其他中间节点发送, 在其中携带有该中间节点处的等值路径信息。 该消息仍然可以是通知消息或标签映射消息, 通过 TLV字段或选项字段来 携带等值路径信息。  A node M may receive a message forwarded by its peer node from its peer node, the message being sent by other intermediate nodes in the network carrying the equivalent path information at the intermediate node. The message can still be a notification message or a label mapping message, carrying the equivalent path information through the TLV field or the option field.
在 S240中, 向入口节点发送所接收的消息, 以使入口节点基于该消息 携带的等值路径信息和最短路径树,确定以该中间节点为起始节点的等值路 径。  In S240, the received message is sent to the ingress node, so that the ingress node determines the equivalent path with the intermediate node as the starting node based on the equivalent path information and the shortest path tree carried by the message.
节点 M可以将 S230中收到的消息向它的对等节点转发, 以送达入口节 点。 入口节点收到 S230中的消息之后, 可以根据该消息携带的等值路径信 息和最短路径树来确定以发送该消息的中间节点为起始节点的等值路径。  Node M can forward the message received in S230 to its peer node for delivery to the ingress node. After receiving the message in S230, the ingress node may determine the equivalent path of the intermediate node that sends the message as the starting node according to the equivalent path information and the shortest path tree carried by the message.
从而, 入口节点通过收集不同节点处的等值路径信息, 可以确定网络中 的等值路径。 在 S250中, 当以节点为起始节点的等值路径变化时, 向入口节点通知 该变化, 以使入口节点基于该变化和最短路径树, 更新所确定的以节点为起 始节点的等值路径。 Thus, the ingress node can determine the equivalence path in the network by collecting the equivalent path information at different nodes. In S250, when the equivalence path with the node as the starting node changes, the ingress node is notified of the change, so that the ingress node updates the determined equivalent value of the node as the starting node based on the change and the shortest path tree. path.
等值路径从无到有、 从有到无、 出接口变化、 下一跳变化等, 都将引起 等值路径的变化。 当以节点 M为起始节点的等值路径变化时, 节点 M生成 用于通知该变化的消息(例如 LDP协议下的通知消息)并向入口节点发送。 例如, 节点 M通过将通知变化的消息发送给节点 M的对等节点, 对等节点 将该消息再转发给它自已的对等节点, 这样继续下去, 直到该消息送达入口 节点。  Equivalent paths change from scratch, from presence to no, outbound interface changes, next hop changes, etc., will cause changes in the equivalent path. When the equivalent path with the node M as the starting node changes, the node M generates a message for notifying the change (for example, a notification message under the LDP protocol) and transmits it to the ingress node. For example, node M sends a message informing the change to the peer node of node M, which forwards the message to its own peer node, and continues until the message is delivered to the ingress node.
入口节点收到该消息后,可以将该消息中指示的变化与保存在入口节点 的数据库中的最短路径树进行比较, 更新在 S220中确定的以节点 M为起始 节点的等值路径。  After receiving the message, the ingress node can compare the change indicated in the message with the shortest path tree stored in the database of the ingress node, and update the equivalence path with the node M as the starting node determined in S220.
虽然在图 2中, S230和 S240在 S220之后执行, 但是 S230和 S240也 可以在其他任何时候执行。 虽然 S250在 S240之后执行, 但是 S250也可以 在 S230、 S240之前执行, 只要在 S220之后执行即可。  Although S230 and S240 are executed after S220 in Fig. 2, S230 and S240 can be executed at any other time. Although S250 is executed after S240, S250 can also be executed before S230 and S240, as long as it is executed after S220.
根据本发明实施例提供的用于在网络中确定等值路径的方法,作为等值 路径的起始节点的中间节点通过各自生成携带等值路径信息的消息,再经由 其他节点帮忙转发, 可以将自己处的等值路径信息告诉给入口节点, 从而使 得入口节点可以收集到关于网络中的等值路径信息, 以确定网络中的等值路 径, 实现等值路径的定位。 从而, 通过传输等值路径信息以使入口节点收集 并利用来确定等值路径, 有利于在存在等值路径之处部署流标签, 而在其他 路径上则无需流标签的应用, 从而减小了不必要的网络开销。 并且由于确定 了等值路径, 有利于对等值路径进行管理和维护。 同时, 当等值路径发生变 化时, 通过及时向入口节点通知该变化, 可以及时更新入口节点对等值路径 的定位, 便于实时掌握网络中哪些地方有等值路径。  According to the method for determining an equal path in a network according to an embodiment of the present invention, an intermediate node that is a starting node of an equivalent path generates a message carrying the equivalent path information, and then facilitates forwarding through other nodes, and may The equivalent path information at itself is told to the ingress node, so that the ingress node can collect information about the equivalence path in the network to determine the equivalent path in the network, and realize the positioning of the equivalence path. Thus, by transmitting the equivalent path information to enable the ingress node to collect and utilize to determine the equivalence path, it is advantageous to deploy the flow label where there is an equivalence path, and on other paths, the application of the flow label is not required, thereby reducing Unnecessary network overhead. And because the equivalent path is determined, it is beneficial to manage and maintain the equivalent path. At the same time, when the equivalent path changes, the notification of the change to the ingress node in time can update the location of the equivalence path of the ingress node in time to facilitate real-time control of where in the network there are equivalent paths.
图 3是根据本发明实施例的用于在网络中确定等值路径的方法 300的流 程图。  3 is a flow diagram of a method 300 for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
在 S305 中, 接收中间节点发送的携带有该中间节点处的等值路径信息 的消息。 该步骤与 S230基本相同。  In S305, a message sent by the intermediate node carrying the equivalent path information at the intermediate node is received. This step is basically the same as S230.
在 S310中, 将节点处的等值路径信息添加到所接收的消息中, 以生成 携带有节点处的等值路径信息的消息。 节点 M收到中间节点发送的携带有等值路径信息的消息之后, 如果节 点 M是等值路径的起始节点, 则节点 M将自己的等值路径信息添加到收到 的消息中, 再将该消息向入口节点发送。 这样, 可以减小网络中携带等值路 径信息的消息的数量, 从而减小网络的资源开销, 避免产生过多的携带等值 路径信息的消息。 In S310, the equivalent path information at the node is added to the received message to generate a message carrying the equivalent path information at the node. After the node M receives the message carrying the equivalent path information sent by the intermediate node, if the node M is the starting node of the equivalent path, the node M adds its own equivalent path information to the received message, and then This message is sent to the ingress node. In this way, the number of messages carrying the equivalent path information in the network can be reduced, thereby reducing the resource overhead of the network and avoiding excessive messages carrying the equivalent path information.
例如, 节点 M收到的消息可以是通知消息或标签映射消息。 节点 M将 自己的等值路径信息添加到通知消息的 TLV字段中或标签映射消息的选项 字段中。 不管是 TLV字段还是选项字段, 添加的等值路径信息可以相同。 仍然以 TLV字段为例来描述添加等值路径信息的例子。  For example, the message received by node M can be a notification message or a label mapping message. Node M adds its own equivalent path information to the TLV field of the notification message or to the option field of the label mapping message. Either the TLV field or the option field, the added equivalent path information can be the same. An example of adding equivalent path information is still described using the TLV field as an example.
例如, 当网络中存在 ECMP等值路径时, TLV字段可以具有如表 3所 示的形式。 其中携带的信息不仅包括多个节点的等值路径信息, 还包括一些 可选内容以便于对 TLV字段进行处理等, 可选内容可以包括 U比特、 F比 特、 ECMP TLV Type、 Length, ECMP Number。  For example, when an ECMP equivalent path exists in the network, the TLV field may have the form shown in Table 3. The information carried in the information includes not only the equivalent path information of multiple nodes, but also some optional content to facilitate processing of the TLV field, and the optional content may include U-bit, F-bit, ECMP TLV Type, Length, and ECMP Number.
表 3  table 3
U F ECMP TLV Type Length  U F ECMP TLV Type Length
ECMP Number Reserve  ECMP Number Reserve
节点 1处的等值路径信息  Equivalent path information at node 1
节点 2处的等值路径信息 节点 n处的等值路径信息  Equivalent path information at node 2 Equivalent path information at node n
其中, U比特、 F比特、 ECMP TLV Type, Length和 Reserve具有和表 1相同的含义。 ECMP Number表示作为不同 ECMP等值路径的起始节点的 节点数。 ECMP Number的初始值可以为 0, 当作为 ECMP等值路径的起始 节点的节点向其中添加自己的等值路径信息时, 将 ECMP Number加 1。 节 点 1处的等值路径信息、节点 2处的等值路径信息至节点 n处的等值路径信 息 (n大于等于 2 )分别表示具有等值路径的节点 1、 节点 2 节点 n 向消息(例如通知消息) 中添加的各自的等值路径信息。 节点处的等值路径 信息可以采用表 1的形式,或者只具有表 1中的 Node ID、 FEC、 Interfacel ID 至 Interface n ID这些内容。  Among them, U bit, F bit, ECMP TLV Type, Length and Reserve have the same meaning as Table 1. The ECMP Number represents the number of nodes that are the starting nodes of different ECMP equivalent paths. The initial value of the ECMP Number can be 0. When the node that is the starting node of the ECMP equivalent path adds its own equivalent path information to it, the ECMP Number is incremented by 1. The equivalent path information at node 1, the equivalent path information at node 2, and the equivalent path information at node n (n is greater than or equal to 2) respectively represent node 1, node 2 node n-direction messages with equivalent paths (eg The respective equivalent path information added in the notification message). The equivalent path information at the node can be in the form of Table 1, or only the Node ID, FEC, Interfacel ID to Interface n ID in Table 1.
再例如, 当网络中存在 LAG等值路径时, TLV字段可以具有如表 4所 示的形式。 其中携带的信息, 不仅包括多个节点的等值路径信息, 还包括一 些可选内容以便于对 TLV字段进行处理并指明 LAG等值路径的相关情况等 等,可选内容可以包括 U比特、 F比特、 LAG TLV Type、 Length、 LAG Number。 For another example, when there is a LAG equivalent path in the network, the TLV field may have the form as shown in Table 4. The information carried therein includes not only the equivalent path information of multiple nodes, but also one The optional content is convenient for processing the TLV field and indicating the correlation of the LAG equivalent path, etc., and the optional content may include U bits, F bits, LAG TLV Type, Length, LAG Number.
表 4  Table 4
U F LAG TLV Type Length  U F LAG TLV Type Length
LAG Number Reserve  LAG Number Reserve
节点 1处的等值路径信息  Equivalent path information at node 1
节点 2处的等值路径信息 节点 n处的等值路径信息  Equivalent path information at node 2 Equivalent path information at node n
其中, U比特、 F比特、 LAG TLV Type, Length和 Reserve具有和表 2 相同的含义。 LAG Number表示作为不同 LAG等值路径的起始节点的节点 数。 LAG Number的初始值可以为 0, 当作为 LAG等值路径的起始节点的节 点向其中添加自己的等值路径信息时, 将 LAG Number加 1。 节点 1处的等 值路径信息、 节点 2处的等值路径信息至节点 n处的等值路径信息 ( n大于 等于 2 )分别表示具有 LAG等值路径的节点 1、 节点 2 节点 n向消 息 (例如通知消息) 中添加的各自的等值路径信息。 节点处的等值路径信息 可以采用表 2的形式,或者只具有表 2中的 Node ID、 FEC、 Local Interface ID 这些内容。  Among them, U bit, F bit, LAG TLV Type, Length and Reserve have the same meaning as Table 2. The LAG Number represents the number of nodes that are the starting nodes of different LAG equivalent paths. The initial value of the LAG Number can be 0. When the node that is the starting node of the LAG equivalent path adds its own equivalent path information to it, the LAG Number is incremented by 1. The equivalent path information at node 1, the equivalent path information at node 2, and the equivalent path information at node n (n is greater than or equal to 2) respectively represent node 1, node 2 node n-direction message with LAG equivalent path ( For example, the corresponding equivalent path information added in the notification message). The equivalent path information at the node can be in the form of Table 2, or only the Node ID, FEC, and Local Interface ID in Table 2.
在 S320中, 向网络的入口节点发送携带有该节点处的等值路径信息的 消息, 以使入口节点基于等值路径信息和网络的最短路径树, 确定以该节点 为起始节点的等值路径。 该步骤与 S220相同。  In S320, a message carrying the equivalent path information at the node is sent to the ingress node of the network, so that the ingress node determines the equivalent of the node as the starting node based on the equivalent path information and the shortest path tree of the network. path. This step is the same as S220.
当然, 由于在该消息中还携带有其他中间节点处的等值路径信息, 因此 入口节点还可以基于网络的最短路径树和消息中携带的其他中间节点处的 等值路径信息, 确定以其他中间节点为起始节点的等值路径。  Of course, since the message also carries the equivalent path information at other intermediate nodes, the ingress node may also determine the other intermediate based on the shortest path tree of the network and the equivalent path information at other intermediate nodes carried in the message. The node is the equivalent path of the starting node.
根据本发明实施例提供的用于在网络中确定等值路径的方法,作为等值 路径的起始节点的中间节点通过向同一消息中添加各自的等值路径信息, 可 以使得入口节点通过一个消息而收集到多个节点处的等值路径信息,每个节 点的等值路径信息对应着以该节点为起始节点的等值路径。 从而, 可以节省 网络资源的开销, 避免生成过多的消息而影响网络性能。  According to the method for determining an equivalent path in a network according to an embodiment of the present invention, an intermediate node that is a starting node of an equivalent path may cause an ingress node to pass a message by adding respective equivalent path information to the same message. The equivalent path information at multiple nodes is collected, and the equivalent path information of each node corresponds to the equivalent path with the node as the starting node. Therefore, the overhead of network resources can be saved, and excessive network messages can be generated to affect network performance.
接下来, 结合图 4描述根据本发明实施例的用于在网络中确定等值路径 的方法 400。 如图 4所示, 方法 400包括: 在 S410中, 接收中间节点发送的携带有 中间节点处的等值路径信息的消息; 在 S420中, 基于等值路径信息和网络 的最短路径树, 确定以该中间节点为起始节点的等值路径。 Next, a method 400 for determining an equivalent path in a network in accordance with an embodiment of the present invention is described in conjunction with FIG. As shown in FIG. 4, the method 400 includes: receiving, in S410, a message that is sent by an intermediate node and carrying the equivalent path information at the intermediate node; in S420, determining, based on the equal path information and the shortest path tree of the network, The intermediate node is the equivalent path of the starting node.
例如, 方法 400可以由网络的入口节点执行。 入口节点通过接收携带有 等值路径信息的消息, 可以收集到关于网络中的等值路径信息, 从而可以通 过将等值路径信息与网络的最短路径树比较来确定等值路径, 实现对等值路 径的定位。  For example, method 400 can be performed by an ingress node of a network. The ingress node can collect the equivalent path information in the network by receiving the message carrying the equivalent path information, so that the equivalent path can be determined by comparing the equivalent path information with the shortest path tree of the network, and the equivalent value is implemented. The location of the path.
在 S410中, 入口节点可以接收多种携带有等值路径信息的消息。 例如, 在 MPLS网络中, 接收到的消息可以是基于 LDP协议的消息。  In S410, the ingress node can receive a plurality of messages carrying the equivalent path information. For example, in an MPLS network, the received message may be a message based on the LDP protocol.
根据本发明的一个实施例, 接收中间节点发送的在类型长度值 TLV字 段中携带等值路径信息的通知消息。 根据本发明的另一实施例, 接收中间节 点发送的在选项字段中携带等值路径信息的标签映射消息。 消息中携带的等 值路径信息可以包括作为等值路径的起始节点的节点标识、等值路径所属的 转发等价类和等值路径对应的出接口标识。如何在消息中携带等值路径信息 的例子可以参考上述方法 100的 S110。  According to an embodiment of the present invention, a notification message carrying the equivalent path information in the type length value TLV field sent by the intermediate node is received. According to another embodiment of the present invention, a label mapping message that carries the equivalent path information in the option field sent by the intermediate node is received. The information about the egress path carried in the message may include the node identifier of the start node of the equivalence path, the forwarding equivalence class to which the equivalence path belongs, and the egress interface identifier corresponding to the equivalence path. For an example of how to carry the equivalent path information in the message, reference may be made to S110 of the above method 100.
在 S420中, 以 OSFP协议为例, 在路由建立过程中, 入口节点可以收 集到关于网络中各节点和各链路的信息, 通过利用计算最短路径的算法, 可 以计算出网络的最短路径树, 数据流在最短路径树上传输。  In S420, taking the OSFP protocol as an example, in the route establishment process, the ingress node can collect information about each node and each link in the network, and by using an algorithm for calculating the shortest path, the shortest path tree of the network can be calculated. The data stream is transmitted on the shortest path tree.
根据本发明的一个实施例,入口节点可以将等值路径信息与最短路径树 进行比较; 基于比较的结果, 确定以中间节点为起始节点的等值路径。  According to an embodiment of the present invention, the ingress node may compare the equivalence path information with the shortest path tree; based on the result of the comparison, determine the equivalence path with the intermediate node as the starting node.
当等值路径信息包含节点标识、 转发等价类和出接口标识时, 入口节点 基于等值路径信息中包含的节点标识, 可以在最短路径树上找到作为等值路 径的起始节点的节点; 入口节点基于等值路径信息中包含的出接口标识, 可 以在最短路径树上确定相应的链路并确定数据流的方向, 当多个数据流在一 个节点汇聚时, 该节点为等值路径的终点节点。 入口节点基于转发等价类, 可以确定找到的等值路径是针对该转发等价类的数据流而言的。  When the equivalent path information includes the node identifier, the forwarding equivalence class, and the outbound interface identifier, the ingress node may find the node that is the starting node of the equivalence path on the shortest path tree based on the node identifier included in the equivalence path information; The ingress node determines the corresponding link and determines the direction of the data flow on the shortest path tree based on the outbound interface identifier included in the equivalence path information. When multiple data streams are aggregated in one node, the node is an equal path. End node. Based on the forwarding equivalence class, the ingress node can determine that the found equivalence path is for the data flow of the forwarding equivalence class.
根据本发明实施例提供的用于在网络中确定等值路径的方法,入口节点 可以基于消息中携带的等值路径信息, 收集到中间节点处的等值路径信息, 通过比对网络的最短路径树, 可以实现等值路径的定位, 从而有利于确定在 存在等值路径之处使用流标签,避免在无需使用流标签的路径上使用流标签 而造成资源浪费, 并且等值路径的确定还有利于对等值路径进行管理和维 护。 According to the method for determining an equivalent path in a network according to an embodiment of the present invention, the ingress node may collect the equivalent path information at the intermediate node based on the equivalent path information carried in the message, by using the shortest path of the comparison network. The tree can realize the positioning of the equivalence path, thereby facilitating the use of the flow label in the presence of the equivalence path, avoiding waste of resources by using the flow label on the path without using the flow label, and determining the equivalent path. Conducive to the management and dimension of the equivalent path Protection.
图 5是根据本发明实施例的用于在网络中确定等值路径的方法 500的流 程图。  Figure 5 is a flow diagram of a method 500 for determining an equivalent path in a network, in accordance with an embodiment of the present invention.
在 S510中, 接收中间节点发送的携带有中间节点处的等值路径信息和 其他中间节点处的等值路径信息的消息。  In S510, a message that is sent by the intermediate node and carries the equivalent path information at the intermediate node and the equivalent path information at the other intermediate node is received.
入口节点接收的消息中可以存在多个节点的等值路径信息。相关内容可 以参考方法 300的 S305和 S310。  Equivalent path information of multiple nodes may exist in the message received by the ingress node. For related content, reference may be made to S305 and S310 of method 300.
在 S520中, 基于中间节点处的等值路径信息和网络的最短路径树, 确 定以该中间节点为起始节点的等值路径。  In S520, based on the equivalent path information at the intermediate node and the shortest path tree of the network, an equivalent path starting from the intermediate node is determined.
该步骤与方法 400的 S420基本相同。  This step is substantially the same as S420 of method 400.
在 S530中, 基于其他中间节点处的等值路径信息和最短路径树, 确定 以其他中间节点为起始节点的等值路径。  In S530, based on the equivalent path information and the shortest path tree at other intermediate nodes, an equivalent path with other intermediate nodes as starting nodes is determined.
虽然在图 5中在 S520之后执行 S530,但是 S530也可以在 S520之前执 行, 或者与 S520同时执行, 其执行顺序对本发明的保护范围没有限制。  Although S530 is executed after S520 in Fig. 5, S530 may be executed before S520 or simultaneously with S520, and the order of execution thereof is not limited to the scope of protection of the present invention.
当入口节点在 S510中收到携带多个节点的等值路径信息的消息时, 入 口节点需要针对其中的每个等值路径信息来确定以每个节点为起始节点的 相应等值路径。 这样, 入口节点可以实现对以多个节点中的每一个为起始节 点的等值路径的定位, 从而可以实现对网络中等值路径的定位。  When the ingress node receives a message carrying the equivalent path information of the plurality of nodes in S510, the ingress node needs to determine a corresponding equivalent path with each node as the starting node for each of the equivalent path information therein. In this way, the ingress node can implement the positioning of the equivalent path with each of the plurality of nodes as the starting node, so that the positioning of the network medium value path can be realized.
在 S540中, 接收中间节点发送的用于指示以该中间节点为起始节点的 等值路径变化的消息。  In S540, a message sent by the intermediate node to indicate an equivalent path change with the intermediate node as a starting node is received.
当中间节点处的等值路径发生变化时, 中间节点可以向入口节点通知该 变化, 以利于入口节点对所确定的以该中间节点为起始节点的等值路径进行 更新。  When the equivalent path at the intermediate node changes, the intermediate node may notify the ingress node of the change to facilitate the ingress node to update the determined equivalent path with the intermediate node as the starting node.
在 S550中, 基于该变化和最短路径树, 更新所确定的以中间节点为起 始节点的等值路径。  In S550, based on the change and the shortest path tree, the determined equivalent path with the intermediate node as the starting node is updated.
入口节点知道中间节点的该变化之后,如果以中间节点为起始节点的等 值路径消失, 入口节点结合最短路径树将 S520中确定的以该中间节点为起 始节点的等值路径删除。如果以中间节点为起始节点的等值路径的出接口改 变或下一跳改变, 则结合最短路径树, 重新确定以中间节点为起始节点的等 值路径, 以对在 S520中确定的等值路径进行更新。 这样, 入口节点可以快 速掌握网络中等值路径的变化情况, 并准确定位网络中现存的等值路径。 虽然在图 5中, S540和 S550在 S530之后执行, 但是 S540和 S550只 要在 S520之后执行即可。 After the ingress node knows the change of the intermediate node, if the equivalent path with the intermediate node as the starting node disappears, the ingress node deletes the equivalent path determined in S520 with the intermediate node as the starting node in combination with the shortest path tree. If the outbound interface of the equivalent path with the intermediate node as the starting node changes or the next hop changes, the equivalent path with the intermediate node as the starting node is re-determined in combination with the shortest path tree to determine the value determined in S520. The value path is updated. In this way, the ingress node can quickly grasp the changes of the network medium value path and accurately locate the existing equivalent path in the network. Although S540 and S550 are executed after S530 in FIG. 5, S540 and S550 may be executed after S520.
根据本发明实施例提供的用于在网络中确定等值路径的方法,入口节点 可以收集到网络中的等值路径信息,基于等值路径信息和最短路径树的比较 结果来确定具体的等值路径, 从而实现对等值路径的定位。 同时, 入口节点 通过接收中间节点发送的指示等值路径变化的消息, 可以快速掌握网络中等 值路径的变化情况, 并准确定位网络中现存的等值路径。 通过对等值路径的 确定, 对于不需要流标签的路径无需进行流标签的相关应用, 可以减少不必 要的协议开销。 另外, 对于等值路径信息的掌握, 有利于后续 MPLS-TP网 络(不支持 ECMP/LAG )和 MPLS网络( ECMP/LAG广泛部署) 的交互, 为它们提供足够的信息, 便于后续网络运营维护和管理。 同时, 等值路径信 息的收集也为后续的网络维护管理提供了足够的信息参考。  According to the method for determining an equivalent path in a network according to an embodiment of the present invention, an ingress node may collect equivalent path information in a network, and determine a specific equivalent based on a comparison result of the equal path information and the shortest path tree. The path, thus achieving the positioning of the equivalent path. At the same time, the ingress node can quickly grasp the change of the network medium value path and accurately locate the existing equivalent path in the network by receiving the message indicating the change of the equivalent path sent by the intermediate node. By determining the path of the equal value, it is not necessary to apply the flow label to the path that does not need the flow label, which can reduce the unnecessary protocol overhead. In addition, the mastery of the equivalent path information facilitates the interaction between the subsequent MPLS-TP network (not supporting ECMP/LAG) and the MPLS network (ECMP/LAG extensive deployment), providing them with sufficient information to facilitate subsequent network operation maintenance and management. At the same time, the collection of equivalent path information provides sufficient information for subsequent network maintenance management.
接下来, 结合图 6和图 7所示的网络拓朴的例子来具体描述如何在网络 中确定等值路径。  Next, how to determine the equivalent path in the network will be specifically described in conjunction with the examples of the network topology shown in Figs. 6 and 7.
图 6是存在 ECMP等值路径的网络拓朴的例子,该网络拓朴对应网络的 最短路径树。 数据流从节点 A发送至节点 J, 节点 A是网络的入口节点。  Figure 6 is an example of a network topology in which an ECMP equivalent path exists, which corresponds to the shortest path tree of the network. The data stream is sent from node A to node J, which is the ingress node of the network.
在该网络中, 节点 B是 ECMP等值路径是 B-C-D和 B-B1-C1-D1-D的 起始节点,节点 F是 ECMP等值路径是 F-G-H和 F-F1-G1-H1-H的起始节地 点。  In this network, Node B is the starting node of ECMP equivalent path BCD and B-B1-C1-D1-D, and node F is the ECMP equivalent path starting from FGH and F-F1-G1-H1-H The beginning of the festival.
入口节点 A可以通过如下过程确定网络中的 ECMP等值路径。  Ingress node A can determine the ECMP equivalent path in the network by the following process.
节点 B通过查询自己的路由转发表, 发现第一 FEC对应了多个出接口 或出标签, 于是确定节点 B是等值路径的起始节点。  By querying its own routing forwarding table, Node B finds that the first FEC corresponds to multiple outbound interfaces or outgoing labels, and then determines that Node B is the starting node of the equivalent path.
节点 B生成携带节点 B处的等值路径信息的消息, 并向节点 A发送。 节点 B处的等值路径信息包括: 节点 B的节点标识、 节点 B的 ECMP等值 路径对应的第一 FEC, 节点 B到节点 C的出接口的接口标识(例如, 该接 口的接口编号或 IP地址) , 节点 B到节点 B1的出接口的接口标识。  Node B generates a message carrying the equivalent path information at Node B and sends it to Node A. The equivalent path information at the node B includes: a node identifier of the node B, a first FEC corresponding to the ECMP equivalent path of the node B, and an interface identifier of the outbound interface of the node B to the node C (for example, an interface number or an IP of the interface) Address), the interface identifier of the outbound interface from Node B to Node B1.
当入口节点 A收到节点 B发送的等值路径信息之后, 入口节点 A可以 在图 6所示的最短路径树上找到节点 B并找到出接口,从而沿着出接口的方 向即数据流的方向找到数据流汇聚的节点 D, 确定节点 D是以节点 B为起 始节点的等值路径的终点节点, 并且节点 B至节点 D的等值路径对应着第 一 FEC。 同理, 节点 F通过查询自己的路由转发表, 发现第二 FEC对应了多个 出接口或出标签, 于是确定节点 F是等值路径的起始节点。 第一 FEC和第 二 FEC可以相同, 也可以不同。 After the ingress node A receives the equivalent path information sent by the node B, the ingress node A can find the node B on the shortest path tree shown in FIG. 6 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node D of the data stream convergence, determine that the node D is the end node of the equivalent path with the node B as the starting node, and the equivalent path of the node B to the node D corresponds to the first FEC. Similarly, the node F searches for its own routing forwarding table, and finds that the second FEC corresponds to multiple outbound interfaces or outbound labels, and then determines that the node F is the starting node of the equivalent path. The first FEC and the second FEC may be the same or different.
节点 F生成携带节点 F处的等值路径信息的消息, 并向节点 A发送。 节点 F处的等值路径信息包括: 节点 F的节点标识、 节点 F的 ECMP等值 路径对应的第二 FEC , 节点 F到节点 G的出接口的接口标识, 节点 F到节 点 F1的出接口的接口标识。 节点 F向节点 A发送的消息, 可以依次经由节 点0、 C、 B转发而到达节点 A, 还可以依次经由节点 D、 Dl、 Cl、 Bl、 B 转发而到达节点 。  Node F generates a message carrying the equivalent path information at node F and sends it to node A. The equivalent path information at the node F includes: a node identifier of the node F, a second FEC corresponding to the ECMP equivalent path of the node F, an interface identifier of the outbound interface of the node F to the node G, and an outbound interface of the node F to the node F1. Interface identifier. The message sent by the node F to the node A may be forwarded to the node A through the nodes 0, C, and B, and may be forwarded to the node through the nodes D, D1, Cl, Bl, and B in sequence.
当入口节点 A收到节点 F发送的等值路径信息之后, 入口节点 A可以 在图 6所示的最短路径树上找到节点 F并找到出接口,从而沿着出接口的方 向即数据流的方向找到数据流汇聚的节点 H,确定节点 H是以节点 F为起始 节点的等值路径的终点节点, 并且节点 F至节点 H的等值路径对应着第二 FEC。  After the ingress node A receives the equivalent path information sent by the node F, the ingress node A can find the node F on the shortest path tree shown in FIG. 6 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node H of the data stream convergence, determine that the node H is the end node of the equivalent path with the node F as the starting node, and the equivalent path of the node F to the node H corresponds to the second FEC.
此外,节点 B和节点 F也可以共享同一个消息来携带各自的等值路径信 息。 由节点 F首先生成消息, 携带节点 F处的等值路径信息。 在向对等节点 转发的过程中到达节点 B, 节点 B将自己的等值路径信息添加到该消息中, 再向入口节点 A发送。  In addition, Node B and Node F can also share the same message to carry their respective equivalent path information. The message is first generated by the node F, carrying the equivalent path information at the node F. Node B arrives in the process of forwarding to the peer node, and Node B adds its own equivalent path information to the message and sends it to the ingress node A.
当入口节点 A收到携带等值路径信息的消息之后, 将节点 B的等值路 径信息和最短路径树进行比较, 找到节点 B 以及节点 B的出接口, 从而找 到 B-C-D和 B-B1-C1-D1-D这两条 ECMP等值路径, 并且这两条 ECMP等 值路径对应第一 FEC。 入口节点 A将节点 F的等值路径信息和最短路径树 进行比较,找到节点 F以及节点 F的出接口,从而找到 F-G-H和 F-F1-G1-H1-H 这两条 ECMP等值路径, 并且这两条 ECMP等值路径对应第二 FEC。  After the ingress node A receives the message carrying the equivalent path information, it compares the equivalent path information of the node B with the shortest path tree, finds the outbound interface of the node B and the node B, thereby finding the BCD and the B-B1-C1- D1-D two ECMP equivalent paths, and the two ECMP equivalent paths correspond to the first FEC. The ingress node A compares the equivalence path information of the node F with the shortest path tree, finds the outbound interface of the node F and the node F, and finds two ECMP equivalent paths of FGH and F-F1-G1-H1-H, and The two ECMP equivalent paths correspond to the second FEC.
图 7是存在 LAG等值路径的网络拓朴的例子, 该网络拓朴对应网络的 最短路径树。 数据流从节点 A发送至节点 J , 节点 A是网络的入口节点。  Figure 7 is an example of a network topology in which a LAG equivalent path exists, which corresponds to the shortest path tree of the network. The data stream is sent from node A to node J, which is the ingress node of the network.
在该网络中,节点 B是节点 B和节点 C之间的 LAG等值路径的起始节 点, 节点 F是节点 F和节点 G之间的 LAG等值路径的起始节点。  In this network, Node B is the starting node of the LAG equivalent path between Node B and Node C, and Node F is the starting node of the LAG equivalent path between Node F and Node G.
入口节点 A可以通过如下过程确定网络中的 LAG等值路径。  Ingress node A can determine the LAG equivalent path in the network by the following process.
节点 B通过查询自己的路由转发表, 发现第一 FEC对应了多个出接口 或出标签, 于是确定节点 B是等值路径的起始节点。 节点 B生成携带节点 B处的等值路径信息的消息, 并向节点 A发送。 节点 B处的等值路径信息包括: 节点 B的节点标识、 节点 B的 LAG等值路 径对应的第一 FEC, 节点 B到节点 C的三个出接口的接口标识。 By querying its own routing forwarding table, the Node B finds that the first FEC corresponds to multiple outbound interfaces or outgoing labels, and then determines that the Node B is the starting node of the equivalent path. The Node B generates a message carrying the equivalent path information at the Node B and transmits it to the Node A. The information of the equivalent path at the node B includes: a node identifier of the node B, a first FEC corresponding to the LAG contour path of the node B, and an interface identifier of the three outbound interfaces of the node B to the node C.
当入口节点 A收到节点 B发送的等值路径信息之后, 入口节点 A可以 在图 7所示的最短路径树上找到节点 B并找到出接口,从而沿着出接口的方 向即数据流的方向找到数据流汇聚的节点 C,确定节点 C是以节点 C为起始 节点的等值路径的终点节点, 并且节点 B至节点 C的等值路径对应着第一 FEC。  After the ingress node A receives the equivalent path information sent by the node B, the ingress node A can find the node B on the shortest path tree shown in FIG. 7 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node C where the data stream is aggregated, determine that node C is the end node of the equivalent path with node C as the starting node, and the equivalent path of node B to node C corresponds to the first FEC.
同理, 节点 F通过查询自己的路由转发表, 发现第二 FEC对应了多个 出接口或出标签, 于是确定节点 F是等值路径的起始节点。 第一 FEC和第 二 FEC可以相同, 也可以不同。  Similarly, the node F searches for its own routing forwarding table, and finds that the second FEC corresponds to multiple outbound interfaces or outgoing labels, and then determines that the node F is the starting node of the equivalent path. The first FEC and the second FEC may be the same or different.
节点 F生成携带节点 F处的等值路径信息的消息, 并向节点 A发送。 节点 F处的等值路径信息包括: 节点 F的节点标识、 节点 F的 LAG等值路 径对应的第二 FEC , 节点 F到节点 G的三个出接口的接口标识。 节点 F向 节点 A发送的消息, 可以依次经由节点 D、 C、 B转发而到达节点 。  Node F generates a message carrying the equivalent path information at node F and sends it to node A. The equivalent path information at the node F includes: a node identifier of the node F, a second FEC corresponding to the LAG equivalent path of the node F, and an interface identifier of the three outbound interfaces of the node F to the node G. The message sent by node F to node A can be forwarded to node by node D, C, and B in turn.
当入口节点 A收到节点 F发送的等值路径信息之后, 入口节点 A可以 在图 7所示的最短路径树上找到节点 F并找到出接口,从而沿着出接口的方 向即数据流的方向找到数据流汇聚的节点 G,确定节点 G是以节点 F为起始 节点的等值路径的终点节点, 并且节点 F至节点 G的等值路径对应着第二 FEC。  After the ingress node A receives the equivalent path information sent by the node F, the ingress node A can find the node F on the shortest path tree shown in FIG. 7 and find the outbound interface, so that the direction along the outbound interface, that is, the direction of the data flow. Find the node G of the data stream convergence, determine that the node G is the end node of the equivalent path with the node F as the starting node, and the equivalent path of the node F to the node G corresponds to the second FEC.
此外,节点 B和节点 F也可以共享同一个消息来携带各自的等值路径信 息。 由节点 F首先生成消息, 携带节点 F处的等值路径信息。 在向对等节点 转发的过程中到达节点 B, 节点 B将自己的等值路径信息添加到该消息中, 再向入口节点 A发送。  In addition, Node B and Node F can also share the same message to carry their respective equivalent path information. The message is first generated by the node F, carrying the equivalent path information at the node F. Node B arrives in the process of forwarding to the peer node, and Node B adds its own equivalent path information to the message and sends it to the ingress node A.
当入口节点 A收到携带等值路径信息的消息之后, 将节点 B的等值路 径信息和最短路径树进行比较, 找到节点 B 以及节点 B的出接口, 从而找 到节点 B和节点 C之间的三条 LAG等值路径, 并且这三条 LAG等值路径 对应第一 FEC。 入口节点 A将节点 F的等值路径信息和最短路径树进行比 较, 找到节点 F以及节点 F的出接口, 从而找到节点 F和节点 G之间的三 条 LAG等值路径, 并且这三条 LAG等值路径对应第二 FEC。  After the ingress node A receives the message carrying the equivalent path information, the node B's equivalent path information is compared with the shortest path tree, and the node B and the outbound interface of the node B are found, thereby finding the relationship between the node B and the node C. Three LAG equivalent paths, and the three LAG equivalent paths correspond to the first FEC. The ingress node A compares the equivalence path information of the node F with the shortest path tree, finds the outbound interface of the node F and the node F, and finds three LAG equivalent paths between the node F and the node G, and the three LAG equivalents The path corresponds to the second FEC.
通过参考图 6和图 7描述的例子,入口节点 A可以收集到网络中等值路 径信息, 并结合网络的最短路径树来确定等值路径, 以实现对等值路径的定 位。 接下来, 将参考图 8和图 12描述根据本发明实施例的用于在网络中确 定等值路径的网络装置的结构框图。 By referring to the examples described in FIG. 6 and FIG. 7, the ingress node A can collect the network median path. The path information is combined with the shortest path tree of the network to determine the equivalence path to achieve positioning of the equivalence path. Next, a structural block diagram of a network device for determining an equivalent path in a network according to an embodiment of the present invention will be described with reference to FIGS. 8 and 12.
图 8是根据本发明实施例的网络装置 800的结构框图。  FIG. 8 is a block diagram showing the structure of a network device 800 according to an embodiment of the present invention.
网络装置 800包括生成模块 810和发送模块 820。 生成模块 810可用于 当网络装置 800是等值路径的起始节点时,生成携带有网络装置 800处的等 值路径信息的消息。发送模块 820可用于向网络的入口节点发送携带有网络 装置 800处的等值路径信息的消息, 以使入口节点基于等值路径信息和网络 的最短路径树, 确定以网络装置 800为起始节点的等值路径。  Network device 800 includes a generation module 810 and a transmission module 820. The generating module 810 can be configured to generate a message carrying the equivalent path information at the network device 800 when the network device 800 is the starting node of the equivalent path. The sending module 820 can be configured to send, to the ingress node of the network, a message carrying the equivalent path information at the network device 800, so that the ingress node determines to use the network device 800 as a starting node based on the equivalent path information and the shortest path tree of the network. The equivalent path.
生成模块 810和发送模块 820的上述和其他操作和 /或功能可以参考上述 方法 100中的 S110和 S120, 为了避免重复, 在此不再赘述。  The foregoing and other operations and/or functions of the generating module 810 and the transmitting module 820 may refer to S110 and S120 in the foregoing method 100. To avoid repetition, details are not described herein again.
本发明实施例提供的网络装置在自己是等值路径的起始节点的情况下, 通过向入口节点通知等值路径信息,可以使入口节点基于等值路径信息和最 短路径树来实现对等值路径的定位,从而有利于在存在等值路径之处部署流 标签, 避免在无需使用流标签的路径上使用流标签而造成资源浪费, 同时等 值路径的定位还有利于对等值路径进行管理和维护。  The network device provided by the embodiment of the present invention can make the ingress node realize the equivalence based on the equivalence path information and the shortest path tree by notifying the ingress path of the equivalence path information. The location of the path is conducive to the deployment of the flow label in the presence of the equivalent path, avoiding the waste of resources by using the flow label on the path without using the flow label, and the positioning of the equivalent path is also beneficial for managing the equivalent path. And maintenance.
图 9是根据本发明实施例的网络装置 900的结构框图。  FIG. 9 is a block diagram showing the structure of a network device 900 according to an embodiment of the present invention.
网络装置 900的生成模块 910和发送模块 820与网络装置 800的生成模 块 810和发送模块 820基本相同。  The generating module 910 and the transmitting module 820 of the network device 900 are substantially identical to the generating module 810 and the transmitting module 820 of the network device 800.
根据本发明的一个实施例, 网络装置 900还可以包括确定模块 905。 确 定模块 905可用于当同一转发等价类对应至少两个出接口或出标签时,确定 网络装置 900是等值路径的起始节点。  Network device 900 may also include a determination module 905, in accordance with an embodiment of the present invention. The determining module 905 can be configured to determine that the network device 900 is the starting node of the equivalent path when the same forwarding equivalence class corresponds to at least two outbound interfaces or outbound tags.
根据本发明的一个实施例, 网络装置 900还可以包括接收模块 930和转 发模块 940。 接收模块 930可用于接收中间节点发送的携带有中间节点处的 等值路径信息的消息。 转发模块 940可用于向入口节点发送所接收的消息, 以使入口节点基于该消息携带的等值路径信息和所述最短路径树,确定以中 间节点为起始节点的等值路径。  Network device 900 may also include a receiving module 930 and a forwarding module 940, in accordance with an embodiment of the present invention. The receiving module 930 can be configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node. The forwarding module 940 can be configured to send the received message to the ingress node, so that the ingress node determines the equivalent path with the intermediate node as the starting node based on the equivalent path information carried by the message and the shortest path tree.
根据本发明的一个实施例, 网络装置 900还可以包括通知模块 950。 通 知模块 950可用于当以网络装置 900为起始节点的等值路径变化时, 向入口 节点通知该变化, 以使入口节点基于该变化和最短路径树, 更新所确定的以 网络装置 900为起始节点的等值路径。 根据本发明的一个实施例, 网络是 MPLS网络, 携带等值路径信息的消 息是基于标签分发协议的消息。 Network device 900 may also include notification module 950, in accordance with an embodiment of the present invention. The notification module 950 can be configured to notify the ingress node of the change when the equivalent path changes with the network device 900 as a starting node, so that the ingress node updates the determined network device 900 based on the change and the shortest path tree. The equivalent path of the starting node. According to an embodiment of the invention, the network is an MPLS network, and the message carrying the equivalent path information is a message based on a label distribution protocol.
根据本发明的一个实施例, 生成模块 910可以包括第一生成单元 912和 /或第二生成单元 914。 第一生成单元 912可用于生成在类型长度值 TLV字 段中携带等值路径信息的通知消息。 第二生成单元 914可用于生成在选项字 段中携带等值路径信息的标签映射消息。  According to an embodiment of the present invention, the generating module 910 may include a first generating unit 912 and/or a second generating unit 914. The first generating unit 912 can be configured to generate a notification message carrying the equivalent path information in the type length value TLV field. The second generating unit 914 can be configured to generate a label mapping message carrying the equivalent path information in the option field.
根据本发明的实施例, 等值路径信息可以包括等值路径的起始节点的节 点标识、 等值路径对应的转发等价类和等值路径对应的出接口标识。  According to the embodiment of the present invention, the equivalent path information may include a node identifier of the start node of the equivalence path, a forwarding equivalence class corresponding to the equivalence path, and an outbound interface identifier corresponding to the equivalence path.
确定模块 905、 接收模块 930、 转发模块 940、 通知模块 950、 第一生成 单元 912和第二生成单元 914的上述和其他操作和 /或功能可以参考上述方法 200中的 S205、 S230、 S240和 S250以及方法 100中的 S110,为了避免重复, 在此不再赘述。  The foregoing and other operations and/or functions of the determining module 905, the receiving module 930, the forwarding module 940, the notification module 950, the first generating unit 912, and the second generating unit 914 may refer to S205, S230, S240, and S250 in the foregoing method 200. And S110 in the method 100, in order to avoid repetition, no further details are provided herein.
根据本发明实施例提供的网络装置,作为等值路径的起始节点的网络装 置通过各自生成携带等值路径信息的消息, 再经由其他节点帮忙转发, 可以 将自己处的等值路径信息告诉给入口节点,从而使得入口节点可以收集到关 于网络中的等值路径信息,以确定网络中的等值路径,实现等值路径的定位。 从而, 通过定位等值路径, 有利于在存在等值路径之处部署流标签, 而在其 他路径上则无需流标签的应用, 从而减小了不必要的网络开销。 并且由于确 定了等值路径, 有利于对等值路径进行管理和维护。 同时, 当等值路径发生 变化时, 通过及时向入口节点通知该变化, 可以及时更新入口节点对等值路 径的定位, 便于实时掌握网络中哪些地方有等值路径。  According to the network device provided by the embodiment of the present invention, the network device that is the starting node of the equivalence path can generate the equivalent path information by sending a message carrying the equivalent path information and then forwarding the message through other nodes. The ingress node, such that the ingress node can collect information about the equivalence path in the network to determine an equivalence path in the network, and achieve positioning of the equivalence path. Thus, by locating the equivalent path, it is advantageous to deploy the flow label where there is an equivalent path, and on other paths, the application of the flow label is not required, thereby reducing unnecessary network overhead. And because the equivalent path is determined, it is beneficial to manage and maintain the equivalent path. At the same time, when the equivalent path changes, the notification of the change to the ingress node in time can update the location of the equivalent path of the ingress node in time to facilitate real-time control of where in the network there is an equivalent path.
图 10是根据本发明实施例的网络装置 1000的结构框图。  FIG. 10 is a block diagram showing the structure of a network device 1000 according to an embodiment of the present invention.
网络装置 1000的生成模块 1010和发送模块 1020与网络装置 800的生 成模块 810和发送模块 820基本相同。  The generating module 1010 and the transmitting module 1020 of the network device 1000 are substantially the same as the generating module 810 and the transmitting module 820 of the network device 800.
根据本发明的一个实施例, 网络装置 1000还可以包括接收模块 1005。 接收模块 1005可用于接收中间节点发送的携带有中间节点处的等值路径信 息的消息。 此时, 生成模块 1010可用于将网络装置 1000处的等值路径信息 添加到所接收的消息中, 以生成携带有网络装置 1000处的等值路径信息的 消息。  Network device 1000 may also include receiving module 1005, in accordance with an embodiment of the present invention. The receiving module 1005 is configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node. At this time, the generating module 1010 can be configured to add the equivalent path information at the network device 1000 to the received message to generate a message carrying the equivalent path information at the network device 1000.
接收模块 1005和生成模块 1010的上述和其他操作和 /或功能可以参考上 述方法 300中的 S305和 S310, 为了避免重复, 在此不再赘述。 根据本发明实施例提供的网络装置,作为等值路径的起始节点的网络装 置通过向同一消息中添加各自的等值路径信息, 可以使得消息到达入口节点 时,入口节点可以通过一个消息而收集到多个作为等值路径的起始节点的节 点处的等值路径信息。 从而, 可以节省网络资源的开销, 避免生成过多的消 息而影响网络性能。 For the above operations and/or functions of the receiving module 1005 and the generating module 1010, reference may be made to S305 and S310 in the foregoing method 300. To avoid repetition, details are not described herein again. According to the network apparatus provided by the embodiment of the present invention, the network device that is the starting node of the equivalence path can add the respective equivalent path information to the same message, so that when the message arrives at the ingress node, the ingress node can collect through a message. Equivalent path information to a plurality of nodes that are the starting nodes of the equivalent path. Therefore, the overhead of network resources can be saved, and excessive network messages can be generated to affect network performance.
图 11是根据本发明实施例的网络装置 1100的结构框图。  FIG. 11 is a block diagram showing the structure of a network device 1100 according to an embodiment of the present invention.
网络装置 1100可以包括第一接收模块 1110和第一确定模块 1120。第一 接收模块 1110可用于接收中间节点发送的携带有中间节点处的等值路径信 息的消息。 第一确定模块 1120可用于基于等值路径信息和网络的最短路径 树, 确定以中间节点为起始节点的等值路径。  The network device 1100 can include a first receiving module 1110 and a first determining module 1120. The first receiving module 1110 is configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node. The first determining module 1120 can be configured to determine an equivalent path starting from the intermediate node based on the equal path information and the shortest path tree of the network.
第一接收模块 1110和第一确定模块 1120的上述和其他操作和 /或功能可 以参考上述方法 400中的 S410和 S420, 为了避免重复, 在此不再赘述。  The foregoing and other operations and/or functions of the first receiving module 1110 and the first determining module 1120 may refer to S410 and S420 in the foregoing method 400. To avoid repetition, details are not described herein again.
本发明实施例提供的网络装置可以基于消息中携带的等值路径信息和 网络的最短路径树, 实现等值路径的定位, 从而有利于确定在存在等值路径 之处使用流标签,避免在无需使用流标签的路径上使用流标签而造成资源浪 费, 并且等值路径的确定还有利于对等值路径进行管理和维护。  The network device provided by the embodiment of the present invention can implement the location of the equivalence path based on the equivalence path information carried in the message and the shortest path tree of the network, thereby facilitating determining that the flow label is used where the equivalence path exists, thereby avoiding The use of flow labels on the path using the flow label causes waste of resources, and the determination of the equivalent path also facilitates the management and maintenance of the equivalent path.
图 12是根据本发明实施例提供的网络装置 1200的结构框图。  FIG. 12 is a structural block diagram of a network device 1200 according to an embodiment of the present invention.
网络装置 1200的第一接收模块 1210和第一确定模块 1220与网络装置 1100的第一接收模块 1110和第一确定模块 1120基本相同。  The first receiving module 1210 and the first determining module 1220 of the network device 1200 are substantially identical to the first receiving module 1110 and the first determining module 1120 of the network device 1100.
根据本发明的一个实施例, 第一接收模块 1210可用于接收中间节点发 送的携带有中间节点处的等值路径信息和其他中间节点处的等值路径信息 的消息。 此时, 网络装置 1200还可以包括第二确定模块 1230。 第二确定模 块 1230可用于基于其他中间节点处的等值路径信息和最短路径树, 确定以 其他中间节点为起始节点的等值路径。  According to an embodiment of the present invention, the first receiving module 1210 is configured to receive a message sent by the intermediate node that carries the equivalent path information at the intermediate node and the equivalent path information at the other intermediate node. At this time, the network device 1200 may further include a second determining module 1230. The second determining module 1230 can be configured to determine an equivalent path starting with other intermediate nodes based on the equivalent path information and the shortest path tree at the other intermediate nodes.
根据本发明的一个实施例, 网络装置 1200 还可以包括第二接收模块 According to an embodiment of the present invention, the network device 1200 may further include a second receiving module.
1240和更新模块 1250。 第二接收模块 1240可用于接收中间节点发送的用于 指示以中间节点为起始节点的等值路径变化的消息。 更新模块 1250可用于 基于该变化和最短路径树, 更新所确定的以中间节点为起始节点的等值路 径。 1240 and update module 1250. The second receiving module 1240 is configured to receive a message sent by the intermediate node to indicate an equivalent path change with the intermediate node as the starting node. The update module 1250 can be configured to update the determined equivalent path with the intermediate node as the starting node based on the change and the shortest path tree.
根据本发明的一个实施例, 第一确定模块 1220可以包括比较单元 1222 和确定单元 1224。 比较单元 1222可用于将等值路径信息与最短路径树进行 比较。 确定单元 1224可用于基于比较的结果, 确定以中间节点为起始节点 的等值路径。 According to an embodiment of the present invention, the first determining module 1220 may include a comparing unit 1222 and a determining unit 1224. Comparison unit 1222 can be used to perform the equivalent path information with the shortest path tree. Comparison. The determining unit 1224 can be configured to determine an equivalent path starting with the intermediate node based on the result of the comparison.
根据本发明的实施例, 网络可以是 MPLS网络, 携带等值路径信息的消 息可以是基于标签分发协议的消息。 另外, 根据本发明的实施例, 等值路径 信息可以包括作为等值路径的起始节点的节点标识、等值路径对应的转发等 价类和等值路径对应的出接口标识。  According to an embodiment of the invention, the network may be an MPLS network, and the message carrying the equivalent path information may be a message based on a label distribution protocol. In addition, according to an embodiment of the present invention, the equivalent path information may include a node identifier that is a starting node of the equivalent path, a forwarding equivalence class corresponding to the equivalence path, and an outbound interface identifier corresponding to the equivalence path.
根据本发明的一个实施例, 第一接收模块 1210可以包括第一接收单元 1212和 /或第二接收单元 1214。第一接收单元 1212可用于接收中间节点发送 的在类型长度值 TLV字段中携带等值路径信息的通知消息。 第二接收单元 1214 可用于接收中间节点发送的在选项字段中携带等值路径信息的标签映 射消息。  According to an embodiment of the present invention, the first receiving module 1210 may include a first receiving unit 1212 and/or a second receiving unit 1214. The first receiving unit 1212 is configured to receive a notification message that is sent by the intermediate node and that carries the equivalent path information in the type length value TLV field. The second receiving unit 1214 is configured to receive a label mapping message sent by the intermediate node that carries the equivalent path information in the option field.
第一接收模块 1210、 第二确定模块 1230、 第二接收模块 1240、 更新模 块 1250、 比较单元 1222、 确定单元 1224、 第一接收单元 1212和第二接收单 元 1214的上述和其他操作和 /或功能可以参考上述方法 500中的 S510、 S530 至 S550和方法 400的 S410和 S420, 为了避免重复, 在此不再赘述。  The above and other operations and/or functions of the first receiving module 1210, the second determining module 1230, the second receiving module 1240, the updating module 1250, the comparing unit 1222, the determining unit 1224, the first receiving unit 1212, and the second receiving unit 1214 Reference may be made to S510, S530 to S550 in the above method 500 and S410 and S420 of the method 400. To avoid repetition, details are not described herein again.
本发明实施例提供的网络装置可以收集到网络中的等值路径信息,基于 等值路径信息和最短路径树的比较结果来确定具体的等值路径 ,从而实现对 等值路径的定位。 同时, 该网络装置通过接收中间节点发送的指示等值路径 变化的消息, 可以快速掌握网络中等值路径的变化情况, 并准确定位网络中 现存的等值路径。 通过对等值路径的确定, 对于不需要流标签的路径无需进 行流标签的相关应用, 可以减少不必要的协议开销。 另外, 对于等值路径信 息的掌握, 有利于后续 MPLS-TP网络(不支持 ECMP/LAG )和 MPLS网络 ( ECMP/LAG 广泛部署) 的交互, 为它们提供足够的信息, 便于后续网络 运营维护和管理。 同时, 等值路径信息的收集也为后续的网络维护管理提供 了足够的信息参考。  The network device provided by the embodiment of the present invention may collect the equivalence path information in the network, and determine a specific equivalence path based on the comparison result of the equivalence path information and the shortest path tree, thereby realizing the positioning of the equivalence path. At the same time, the network device can quickly grasp the change of the network medium value path and accurately locate the existing equivalent path in the network by receiving the message indicating the change of the equivalent path sent by the intermediate node. By determining the path of the equal value, it is not necessary to apply the flow label to the path that does not need the flow label, which can reduce unnecessary protocol overhead. In addition, the mastery of the equivalent path information facilitates the interaction between the subsequent MPLS-TP network (not supporting ECMP/LAG) and the MPLS network (ECMP/LAG extensive deployment), providing them with sufficient information to facilitate subsequent network operation and maintenance. management. At the same time, the collection of equivalent path information also provides sufficient information for subsequent network maintenance management.
图 13是根据本发明实施例的用于在网络中确定等值路径的*** 1300的 结构框图。  Figure 13 is a block diagram showing the structure of a system 1300 for determining an equivalent path in a network in accordance with an embodiment of the present invention.
*** 1300可以包括至少一个第一网络装置 1310和第二网络装置 1320。 第一网络装置 1310可用于当第一网络装置 1310是等值路径的起始节点 时, 生成携带有第一网络装置 1310处的等值路径信息的消息; 向第二网络 装置 1320发送携带有第一网络装置 1310处的等值路径信息的消息。 第二网络装置 1320可用于接收第一网络装置 1310发送的携带有第一网 络装置 1310处的等值路径信息的消息; 基于等值路径信息和网络的最短路 径树, 确定以第一网络装置 1310为起始节点的等值路径。 System 1300 can include at least one first network device 1310 and a second network device 1320. The first network device 1310 can be configured to generate a message carrying the equivalent path information at the first network device 1310 when the first network device 1310 is the starting node of the equivalent path; and send the carried message to the second network device 1320. A message of the equivalent path information at the network device 1310. The second network device 1320 is configured to receive a message that is sent by the first network device 1310 and that carries the equivalent path information at the first network device 1310; and determine the first network device 1310 based on the equivalent path information and the shortest path tree of the network. Is the equivalent path of the starting node.
第一网络装置 1310的上述和其他操作和 /或功能可以参考上述网络装置 800、 网络装置 900和网络装置 1000的相关描述, 第二网络装置 1320的上 述和其他操作和 /或功能可以参考上述网络装置 1100和网络装置 1200的相关 描述, 为了避免重复, 在此不再赘述。  The foregoing and other operations and/or functions of the first network device 1310 may be referred to the related descriptions of the network device 800, the network device 900, and the network device 1000, and the above and other operations and/or functions of the second network device 1320 may refer to the network described above. The related descriptions of the device 1100 and the network device 1200 are not described herein again in order to avoid redundancy.
根据本发明实施例提供的用于在网络中确定等值路径的***, 第一网络 装置在自己是等值路径的起始节点的情况下,通过向第二网络装置通知等值 路径信息,使第二网络装置基于等值路径信息和最短路径树来实现对等值路 径的定位, 从而有利于在存在等值路径之处部署流标签, 避免在无需使用流 标签的路径上使用流标签而造成资源浪费, 同时等值路径的定位还有利于对 等值路径进行管理和维护。  According to the system for determining an equivalent path in a network according to an embodiment of the present invention, the first network device, by notifying the second network device of the equivalent path information, in the case that it is the starting node of the equivalent path, The second network device implements positioning of the equi-path based on the equi-path information and the shortest path tree, thereby facilitating deployment of the flow label in the presence of the equi-path, avoiding the use of the flow label on the path that does not need to use the flow label. The waste of resources, and the positioning of the equivalent path is also conducive to the management and maintenance of the equivalent path.
本领域技术人员可以意识到,结合本文中所公开的实施例中描述的各方 法步骤和单元, 能够以电子硬件、 计算机软件或者二者的结合来实现, 为了 清楚地说明硬件和软件的可互换性,在上述说明中已经按照功能一般性地描 述了各实施例的步骤及组成。 这些功能究竟以硬件还是软件方式来执行, 取 决于技术方案的特定应用和设计约束条件。本领域技术人员可以对每个特定 的应用使用不同方法来实现所描述的功能,但是这种实现不应认为超出本发 明的范围。  Those skilled in the art will appreciate that the various method steps and elements described in connection with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of both, in order to clearly illustrate the interworking of hardware and software. In the above description, the steps and compositions of the various embodiments have been generally described in terms of function. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the solution. Those skilled in the art can use different methods for implementing the described functions for each particular application, but such implementations should not be considered to be beyond the scope of the present invention.
结合本文中所公开的实施例描述的方法步骤可以用硬件、处理器执行的 软件程序、 或者二者的结合来实施。 软件程序可以置于随机存取存储器 ( RAM ), 内存、 只读存储器 (ROM )、 电可编程 ROM、 电可擦除可编程 ROM, 寄存器、 硬盘、 可移动磁盘、 CD-ROM或技术领域内所公知的任意 其它形式的存储介质中。  The method steps described in connection with the embodiments disclosed herein may be implemented in hardware, a software program executed by a processor, or a combination of both. Software programs can be placed in random access memory (RAM), memory, read only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM or technology Any other form of storage medium known.
尽管已示出和描述了本发明的一些实施例, 但本领域技术人员应该理 解,在不脱离本发明的原理和精神的情况下,可对这些实施例进行各种修改, 这样的修改应落入本发明的范围内。  While some embodiments of the present invention have been shown and described, it will be understood by those skilled in the art It is within the scope of the invention.

Claims

权利要求 Rights request
1. 一种用于在网络中确定等值路径的方法, 其特征在于, 包括: 当节点是等值路径的起始节点时, 生成携带有所述节点处的等值路径信 息的消息; A method for determining an equivalent path in a network, the method comprising: generating a message carrying the equivalent path information at the node when the node is a starting node of the equivalent path;
向网络的入口节点发送所述携带有所述节点处的等值路径信息的消息, 以使所述入口节点基于所述等值路径信息和所述网络的最短路径树,确定以 所述节点为起始节点的等值路径。  Sending, to the ingress node of the network, the message carrying the equivalent path information at the node, so that the ingress node determines, based on the equivalence path information and the shortest path tree of the network, that the node is The equivalent path of the starting node.
2. 根据权利要求 1所述的方法, 其特征在于, 所述生成携带有所述节 点处的等值路径信息的消息之前, 还包括:  The method according to claim 1, wherein before the generating the message carrying the equivalent path information at the node, the method further includes:
当同一转发等价类对应至少两个出接口或出标签时,确定所述节点是等 值路径的起始节点。  When the same forwarding equivalence class corresponds to at least two outbound interfaces or outgoing tags, it is determined that the node is the starting node of the equal path.
3. 根据权利要求 1所述的方法, 其特征在于, 还包括:  3. The method according to claim 1, further comprising:
接收中间节点发送的携带有所述中间节点处的等值路径信息的消息; 向所述入口节点发送所接收的消息, 以使所述入口节点基于该消息携带 的等值路径信息和所述最短路径树,确定以所述中间节点为起始节点的等值 路径。  Receiving, by the intermediate node, a message carrying the equivalent path information at the intermediate node; sending the received message to the ingress node, so that the ingress node is based on the equivalent path information carried by the message and the shortest The path tree determines an equivalent path starting from the intermediate node.
4. 根据权利要求 1所述的方法, 其特征在于, 还包括:  4. The method according to claim 1, further comprising:
接收中间节点发送的携带有所述中间节点处的等值路径信息的消息; 其中, 所述生成携带有所述节点处的等值路径信息的消息包括: 将所述节点处的等值路径信息添加到所接收的消息中, 以生成所述携带 有所述节点处的等值路径信息的消息。  Receiving, by the intermediate node, a message carrying the equivalent path information at the intermediate node, where the generating the message carrying the equivalent path information at the node includes: using the equivalent path information at the node Adding to the received message to generate the message carrying the equivalent path information at the node.
5. 根据权利要求 1所述的方法, 其特征在于, 还包括:  5. The method according to claim 1, further comprising:
当以所述节点为起始节点的等值路径变化时, 向所述入口节点通知所述 变化, 以使所述入口节点基于所述变化和所述最短路径树, 更新所确定的以 所述节点为起始节点的等值路径。  Notifying the ingress node of the change when the peer path with the node as a starting node changes, so that the ingress node updates the determined to be based on the change and the shortest path tree The node is the equivalent path of the starting node.
6. 根据权利要求 1所述的方法, 其特征在于, 所述网络是多协议标签 交换 MPLS网络, 所述消息是基于标签分发协议的消息。  6. The method according to claim 1, wherein the network is a multi-protocol label switching MPLS network, and the message is a message based on a label distribution protocol.
7. 根据权利要求 6所述的方法, 其特征在于, 所述生成携带有所述节 点处的等值路径信息的消息包括如下之一:  The method according to claim 6, wherein the generating the message carrying the equivalent path information at the node comprises one of the following:
生成在类型长度值 TLV字段中携带所述等值路径信息的通知消息; 生成在选项字段中携带所述等值路径信息的标签映射消息。 Generating a notification message carrying the equivalent path information in a type length value TLV field; A tag mapping message carrying the equivalent path information in the option field is generated.
8. 根据权利要求 1至 7中任一项所述的方法, 其特征在于, 所述等值 路径信息包括等值路径的起始节点的节点标识、该等值路径对应的转发等价 类和该等值路径对应的出接口标识。  The method according to any one of claims 1 to 7, wherein the equal path information includes a node identifier of a start node of the equivalence path, and a forwarding equivalence class corresponding to the equivalence path. The outbound interface identifier corresponding to the equivalence path.
9. 一种用于在网络中确定等值路径的方法, 其特征在于, 包括: 接收中间节点发送的携带有所述中间节点处的等值路径信息的消息; 基于所述等值路径信息和网络的最短路径树,确定以所述中间节点为起 始节点的等值路径。  A method for determining an equivalent path in a network, comprising: receiving a message sent by an intermediate node carrying the equivalent path information at the intermediate node; and based on the equivalent path information and The shortest path tree of the network determines the equivalent path with the intermediate node as the starting node.
10. 根据权利要求 9所述的方法, 其特征在于, 所述接收中间节点发送 的携带有所述中间节点处的等值路径信息的消息包括:  The method according to claim 9, wherein the receiving, by the receiving intermediate node, the message carrying the equivalent path information at the intermediate node comprises:
接收中间节点发送的携带有所述中间节点处的等值路径信息和其他中 间节点处的等值路径信息的消息;  Receiving, by the intermediate node, a message carrying the equivalent path information at the intermediate node and the equivalent path information at the other intermediate node;
所述方法还包括:  The method further includes:
基于所述其他中间节点处的等值路径信息和所述最短路径树,确定以所 述其他中间节点为起始节点的等值路径。  An equivalent path starting with the other intermediate node as a starting node is determined based on the equivalent path information at the other intermediate nodes and the shortest path tree.
11. 根据权利要求 9所述的方法, 其特征在于, 还包括:  The method according to claim 9, further comprising:
接收所述中间节点发送的用于指示以所述中间节点为起始节点的等值 路径变化的消息;  Receiving a message sent by the intermediate node to indicate an equivalent path change with the intermediate node as a starting node;
基于所述变化和所述最短路径树, 更新所确定的以所述中间节点为起始 节点的等值路径。  Based on the change and the shortest path tree, the determined equivalent path with the intermediate node as a starting node is updated.
12. 根据权利要求 9所述的方法, 其特征在于, 所述基于所述等值路径 信息和所述网络的最短路径树、确定以所述中间节点为起始节点的等值路径 包括:  The method according to claim 9, wherein the determining the equivalent path with the intermediate node as a starting node based on the equal path information and the shortest path tree of the network includes:
将所述等值路径信息与所述最短路径树进行比较;  Comparing the equivalent path information with the shortest path tree;
基于所述比较的结果, 确定以所述中间节点为起始节点的等值路径。 Based on the result of the comparison, an equivalent path with the intermediate node as a starting node is determined.
13. 根据权利要求 9所述的方法, 其特征在于, 所述网络是多协议标签 交换 MPLS网络, 所述消息是基于标签分发协议的消息。 13. The method according to claim 9, wherein the network is a multi-protocol label switching MPLS network, and the message is a message based on a label distribution protocol.
14. 根据权利要求 13所述的方法, 其特征在于, 所述接收中间节点发 送的携带有所述中间节点处的等值路径信息的消息包括如下之一:  The method according to claim 13, wherein the receiving, by the intermediate node, the message carrying the equivalent path information at the intermediate node comprises one of the following:
接收中间节点发送的在类型长度值 TLV字段中携带所述等值路径信息 的通知消息; 接收中间节点发送的在选项字段中携带所述等值路径信息的标签映射 消息。 Receiving, by the intermediate node, a notification message that carries the equivalent path information in a type length value TLV field; And receiving, by the intermediate node, a label mapping message that carries the equivalent path information in an option field.
15. 根据权利要求 9至 14中任一项所述的方法, 其特征在于, 所述等 值路径信息包括作为等值路径的起始节点的节点标识、该等值路径对应的转 发等价类和该等值路径对应的出接口标识。  The method according to any one of claims 9 to 14, wherein the equivalent path information includes a node identifier that is a starting node of the equivalent path, and a forwarding equivalence class corresponding to the equal value path. The outbound interface identifier corresponding to the equal value path.
16. 一种网络装置, 其特征在于, 包括:  16. A network device, comprising:
生成模块, 用于当所述网络装置是等值路径的起始节点时, 生成携带有 所述网络装置处的等值路径信息的消息;  a generating module, configured to: when the network device is a starting node of an equal path, generate a message carrying the equivalent path information at the network device;
发送模块, 用于向网络的入口节点发送所述携带有所述网络装置处的等 值路径信息的消息, 以使所述入口节点基于所述等值路径信息和所述网络的 最短路径树, 确定以所述网络装置为起始节点的等值路径。  a sending module, configured to send, to an ingress node of the network, the message carrying the equivalent path information at the network device, so that the ingress node is based on the equal path information and a shortest path tree of the network, An equivalent path is determined with the network device as a starting node.
17. 根据权利要求 16所述的网络装置, 其特征在于, 还包括: 确定模块, 用于当同一转发等价类对应至少两个出接口或出标签时, 确 定所述网络装置是等值路径的起始节点。  The network device according to claim 16, further comprising: a determining module, configured to determine that the network device is an equivalent path when the same forwarding equivalence class corresponds to at least two outbound interfaces or outgoing tags The starting node.
18. 根据权利要求 16所述的网络装置, 其特征在于, 还包括: 接收模块, 用于接收中间节点发送的携带有所述中间节点处的等值路径 信息的消息;  The network device according to claim 16, further comprising: a receiving module, configured to receive a message that is sent by the intermediate node and carries the equivalent path information at the intermediate node;
转发模块, 用于向所述入口节点发送所接收的消息, 以使所述入口节点 基于该消息携带的等值路径信息和所述最短路径树,确定以所述中间节点为 起始节点的等值路径。  a forwarding module, configured to send the received message to the ingress node, so that the ingress node determines, according to the equivalence path information carried by the message and the shortest path tree, that the intermediate node is used as a starting node, and the like Value path.
19. 根据权利要求 16所述的网络装置, 其特征在于, 还包括: 接收模块, 用于接收中间节点发送的携带有所述中间节点处的等值路径 信息的消息;  The network device according to claim 16, further comprising: a receiving module, configured to receive a message that is sent by the intermediate node and carries the equivalent path information at the intermediate node;
其中, 所述生成模块用于将所述网络装置处的等值路径信息添加到所接 收的消息中, 以生成所述携带有所述网络装置处的等值路径信息的消息。  The generating module is configured to add the equivalent path information at the network device to the received message to generate the message carrying the equivalent path information at the network device.
20. 根据权利要求 16所述的网络装置, 其特征在于, 还包括: 通知模块, 用于当以所述网络装置为起始节点的等值路径变化时, 向所 述入口节点通知所述变化, 以使所述入口节点基于所述变化和所述最短路径 树, 更新所确定的以所述网络装置为起始节点的等值路径。  The network device according to claim 16, further comprising: a notification module, configured to notify the ingress node of the change when an equivalent path of the network device is changed as a starting node And causing the ingress node to update the determined equivalent path starting with the network device based on the change and the shortest path tree.
21. 根据权利要求 16所述的网络装置, 其特征在于, 所述网络是多协 议标签交换 MPLS网络, 所述消息是基于标签分发协议的消息。 21. The network device according to claim 16, wherein the network is a multi-protocol label switching MPLS network, and the message is a message based on a label distribution protocol.
22. 根据权利要求 21所述的网络装置, 其特征在于, 所述生成模块包 括如下之一: 22. The network device according to claim 21, wherein the generating module comprises one of the following:
第一生成单元, 用于生成在类型长度值 TLV字段中携带所述等值路径 信息的通知消息;  a first generating unit, configured to generate a notification message that carries the equivalent path information in a type length value TLV field;
第二生成单元, 用于生成在选项字段中携带所述等值路径信息的标签映 射消息。  And a second generating unit, configured to generate a label mapping message that carries the equivalent path information in the option field.
23. 根据权利要求 16至 22中任一项所述的网络装置, 其特征在于, 所 述等值路径信息包括等值路径的起始节点的节点标识、该等值路径对应的转 发等价类和所该等值路径对应的出接口标识。  The network device according to any one of claims 16 to 22, wherein the equal path information includes a node identifier of a start node of the equivalence path, and a forwarding equivalence class corresponding to the equivalence path The outbound interface identifier corresponding to the equivalent path.
24. 一种网络装置, 其特征在于, 包括:  24. A network device, comprising:
第一接收模块, 用于接收中间节点发送的携带有所述中间节点处的等值 路径信息的消息;  a first receiving module, configured to receive, by the intermediate node, a message that carries the equivalent path information at the intermediate node;
第一确定模块, 用于基于所述等值路径信息和网络的最短路径树, 确定 以所述中间节点为起始节点的等值路径。  And a first determining module, configured to determine an equivalent path starting from the intermediate node based on the equivalence path information and a shortest path tree of the network.
25. 根据权利要求 24所述的网络装置, 其特征在于, 所述第一接收模 块用于接收中间节点发送的携带有所述中间节点处的等值路径信息和其他 中间节点处的等值路径信息的消息;  The network device according to claim 24, wherein the first receiving module is configured to receive the equivalent path information carried by the intermediate node and the equivalent path at the intermediate node Information message
所述网络装置还包括:  The network device further includes:
第二确定模块, 用于基于所述其他中间节点处的等值路径信息和所述最 短路径树, 确定以所述其他中间节点为起始节点的等值路径。  And a second determining module, configured to determine an equivalent path starting from the other intermediate node based on the equivalent path information and the shortest path tree at the other intermediate nodes.
26. 根据权利要求 24所述的网络装置, 其特征在于, 还包括: 第二接收模块, 用于接收所述中间节点发送的用于指示以所述中间节点 为起始节点的等值路径变化的消息;  The network device according to claim 24, further comprising: a second receiving module, configured to receive an equivalent path change sent by the intermediate node to indicate that the intermediate node is a starting node News
更新模块, 用于基于所述变化和所述最短路径树, 更新所确定的以所述 中间节点为起始节点的等值路径。  And an update module, configured to update the determined equivalent path with the intermediate node as a starting node based on the change and the shortest path tree.
27. 根据权利要求 24所述的网络装置, 其特征在于, 所述第一确定模 块包括:  The network device according to claim 24, wherein the first determining module comprises:
比较单元, 用于将所述等值路径信息与所述最短路径树进行比较; 确定单元, 用于基于所述比较的结果, 确定以所述中间节点为起始节点 的等值路径。  a comparison unit, configured to compare the equal path information with the shortest path tree; and a determining unit, configured to determine an equivalent path starting from the intermediate node based on a result of the comparing.
28. 根据权利要求 24所述的网络装置, 其特征在于, 所述网络是多协 议标签交换 MPLS网络, 所述消息是基于标签分发协议的消息。 28. The network device according to claim 24, wherein the network is multi-coordinate The label exchanges the MPLS network, and the message is a message based on a label distribution protocol.
29. 根据权利要求 28所述的装置, 其特征在于, 所述第一接收模块包 括如下之一:  29. The apparatus according to claim 28, wherein the first receiving module comprises one of the following:
第一接收单元, 用于接收中间节点发送的在类型长度值 TLV字段中携 带所述等值路径信息的通知消息;  a first receiving unit, configured to receive, by the intermediate node, a notification message that carries the equivalent path information in a type length value TLV field;
第二接收单元, 用于接收中间节点发送的在选项字段中携带所述等值路 径信息的标签映射消息。  And a second receiving unit, configured to receive a label mapping message that is sent by the intermediate node and that carries the equivalent path information in the option field.
30. 根据权利要求 24至 29中任一项所述的网络装置, 其特征在于, 所 述等值路径信息包括作为等值路径的起始节点的节点标识、该等值路径对应 的转发等价类和该等值路径对应的出接口标识。  The network device according to any one of claims 24 to 29, wherein the equivalent path information includes a node identifier that is a starting node of an equivalent path, and a forwarding equivalent corresponding to the equal value path The outbound interface identifier corresponding to the class and the equivalent path.
31. 一种用于在网络中确定等值路径的***, 其特征在于, 所述***包 括至少一个第一网络装置和第二网络装置, 其中:  31. A system for determining an equivalent path in a network, the system comprising at least one first network device and a second network device, wherein:
所述第一网络装置用于当所述第一网络装置是等值路径的起始节点时, 生成携带有所述第一网络装置处的等值路径信息的消息; 向所述第二网络装 置发送所述携带有所述第一网络装置处的等值路径信息的消息;  The first network device is configured to: when the first network device is a start node of an equal path, generate a message carrying the equivalent path information at the first network device; to the second network device Sending the message carrying the equivalent path information at the first network device;
所述第二网络装置用于接收所述第一网络装置发送的所述携带有所述 第一网络装置处的等值路径信息的消息;基于所述等值路径信息和网络的最 短路径树, 确定以所述第一网络装置为起始节点的等值路径。  The second network device is configured to receive, by the first network device, the message carrying the equivalent path information at the first network device; based on the equal path information and a shortest path tree of the network, An equivalent path is determined with the first network device as a starting node.
32. 根据权利要求 31所述的***, 所述网络是多协议标签交换 MPLS 网络, 所述消息是基于标签分发协议的通知消息或标签映射消息。  32. The system of claim 31, the network is a multi-protocol label switching MPLS network, and the message is a notification message or a label mapping message based on a label distribution protocol.
PCT/CN2011/076898 2011-07-06 2011-07-06 Method, network device and system for determining equal-cost paths in network WO2012159316A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2011/076898 WO2012159316A1 (en) 2011-07-06 2011-07-06 Method, network device and system for determining equal-cost paths in network
CN201180001237.6A CN103004149B (en) 2011-07-06 2011-07-06 For the method in certainty equivalents path in a network, network equipment and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2011/076898 WO2012159316A1 (en) 2011-07-06 2011-07-06 Method, network device and system for determining equal-cost paths in network

Publications (1)

Publication Number Publication Date
WO2012159316A1 true WO2012159316A1 (en) 2012-11-29

Family

ID=47216557

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/076898 WO2012159316A1 (en) 2011-07-06 2011-07-06 Method, network device and system for determining equal-cost paths in network

Country Status (2)

Country Link
CN (1) CN103004149B (en)
WO (1) WO2012159316A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116192966A (en) * 2023-03-01 2023-05-30 北京天弛网络有限公司 Service path calculation method, system, medium and equipment based on routing table

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1689279A (en) * 2002-01-30 2005-10-26 艾利森公司 Method and apparatus for obtaining information about one or more paths terminating at a node
CN101325584A (en) * 2007-06-15 2008-12-17 华为技术有限公司 Method for tracing route, MPLS network system and entry node thereof
CN101557347A (en) * 2009-05-20 2009-10-14 华为技术有限公司 Creation method, device and system for label forward path during fast reroute switch
WO2010104434A1 (en) * 2009-03-12 2010-09-16 Telefonaktiebolaget L M Ericsson (Publ) Global provisioning of zero-bandwidth traffic engineering label switched paths

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101729391B (en) * 2008-10-23 2012-09-19 华为技术有限公司 Method, node and system for acquiring link aggregation group information
CN101741709B (en) * 2008-11-06 2012-08-22 华为技术有限公司 Method and system for establishing label switched path and network node

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1689279A (en) * 2002-01-30 2005-10-26 艾利森公司 Method and apparatus for obtaining information about one or more paths terminating at a node
CN101325584A (en) * 2007-06-15 2008-12-17 华为技术有限公司 Method for tracing route, MPLS network system and entry node thereof
WO2010104434A1 (en) * 2009-03-12 2010-09-16 Telefonaktiebolaget L M Ericsson (Publ) Global provisioning of zero-bandwidth traffic engineering label switched paths
CN101557347A (en) * 2009-05-20 2009-10-14 华为技术有限公司 Creation method, device and system for label forward path during fast reroute switch

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
R. ASATI ET AL.: "Signaling LDP Lable Advertisement Completion", IETF, RFC5919, August 2010 (2010-08-01), pages 3 - 8 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116192966A (en) * 2023-03-01 2023-05-30 北京天弛网络有限公司 Service path calculation method, system, medium and equipment based on routing table

Also Published As

Publication number Publication date
CN103004149B (en) 2015-08-19
CN103004149A (en) 2013-03-27

Similar Documents

Publication Publication Date Title
US9860163B2 (en) MPLS traffic engineering for point-to-multipoint label switched paths
US9699087B2 (en) System and method for reporting out-of-resources (OOR) conditions in a data network
US7602702B1 (en) Fast reroute of traffic associated with a point to multi-point network tunnel
WO2021170092A1 (en) Message processing method and apparatus, and network device and storage medium
CN101741709B (en) Method and system for establishing label switched path and network node
US7787380B1 (en) Resource reservation protocol with traffic engineering point to multi-point label switched path hierarchy
US9350650B2 (en) Switching to a backup traffic path by a label switching router in a multi-protocol label switching network
US8488614B1 (en) Upstream label assignment for the label distribution protocol
US20100061366A1 (en) Method and apparatus for link sharing among logical routers
US20060268739A1 (en) Tracking of traffic engineering topology in an autonomous system
JP4109692B2 (en) Session establishment method and label switch node in label switch network
EP2625829A1 (en) System and method for computing a backup egress of a point-to-multi-point label switched path
EP3697038A1 (en) Support for multiple virtual networks over an underlay network topology
WO2012062091A1 (en) Method and system for automatically identifying status attribute of path commputation element (pce)
WO2011103759A1 (en) Method for establishing associated bidirectional label switching path and system thereof
WO2010034225A1 (en) Method for generating item information of transfer table, label switching router and system thereof
WO2007019758A1 (en) A method, system and apparatus for implementing traffic engineering
WO2006102851A1 (en) A method for informing and negotiating the monitor ability of the label switching capability
WO2011127849A2 (en) Method and network device for transmitting data stream
WO2012088977A1 (en) Method, device and system for establishing lsp
WO2012159316A1 (en) Method, network device and system for determining equal-cost paths in network
US20140269737A1 (en) System, method and apparatus for lsp setup using inter-domain abr indication
WO2012016392A1 (en) Method and system for multi-segment pseudo wire sharing bandwidth and provider edge node thereof

Legal Events

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

Ref document number: 11866092

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11866092

Country of ref document: EP

Kind code of ref document: A1