Multicast load sharing method of label network, network equipment and readable storage medium

Abstract

The invention discloses a multicast load sharing method of a label network, network equipment and a readable storage medium, and the method comprises the steps: responding to a multi-point forwarding equivalence class corresponding to a target multicast service, searching a route for a root node, and obtaining an upstream node, corresponding to the target multicast service, of a current node; the multipoint forwarding equivalence class comprises opaque data corresponding to the target multicast service; and under the condition that the plurality of equivalent upstream nodes are found, determining a target upstream node in the plurality of equivalent upstream nodes according to the non-transparent data. According to the method and the device, different point-to-multipoint label switching forwarding paths can be established for different multicast services, so that network resources are fully utilized in the multicast services to reduce network congestion, and effective load sharing is realized under the condition that a plurality of equivalent paths exist between the root node and the leaf node.

Description

Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a multicast load sharing method for a label network, a network device, and a readable storage medium. Background Art

[0002] mLDP (multipoint Label Distribution Protocol) is an extension of LDP (Label Distribution Protocol) to adapt to multicast services. However, the related art cannot solve the load sharing problem when there are multiple equal-cost paths between the root node and the leaf nodes. Summary of the invention

[0003] The main purpose of this application is to provide a multicast load sharing method, network device and readable storage medium for a label network, aiming to solve the current technical problem that it is difficult to achieve load sharing when there are multiple equal-cost paths between the root node and the leaf nodes.

[0004] To achieve the above object, the present application provides a multicast load sharing method for a label network, comprising:

[0005] In response to a multipoint forwarding equivalence class corresponding to a target multicast service, an upstream node of a current node corresponding to the target multicast service is obtained by searching a route for a root node; the multipoint forwarding equivalence class includes opaque data corresponding to the target multicast service;

[0006] In the case where a plurality of equivalent upstream nodes are found, a target upstream node is determined from the plurality of equivalent upstream nodes according to the opaque data.

[0007] The embodiment of the present application obtains the upstream node of the current node corresponding to the target multicast service by responding to the multipoint forwarding equivalence class corresponding to the target multicast service and searching the route for the root node; the multipoint forwarding equivalence class includes opaque data corresponding to the target multicast service; then, when multiple equivalent upstream nodes are found, the target upstream node is determined from the multiple equivalent upstream nodes according to the opaque data, and different point-to-multipoint label switching forwarding paths can be established for different multicast services, thereby making full use of network resources in the multicast service to reduce network congestion, and realizing effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] Figure 1 A schematic diagram of a point-to-multipoint label switching path in the related art;

[0009] Figure 2 This is a flow chart of a first embodiment of a method for multicast load sharing in a label network according to an embodiment of the present application;

[0010] Figure 3 A schematic structural diagram of the data structure of the multipoint forwarding equivalence class in an embodiment of the present application;

[0011] Figure 4 A schematic structural diagram of the data structure of opaque data in a multipoint forwarding equivalence class in an embodiment of the present application;

[0012] Figure 5 Another schematic structural diagram of the data structure of opaque data in the multipoint forwarding equivalence class in the embodiment of the present application;

[0013] Figure 6 This is a schematic scenario diagram of a point-to-multipoint label switching path in an embodiment of the present application;

[0014] Figure 7 This is a flow chart of a second embodiment of the method for multicast load sharing in a label network according to an embodiment of the present application;

[0015] Figure 8 This is a flow chart of a third embodiment of the method for multicast load sharing in a label network according to an embodiment of the present application;

[0016] Fig. 9 This is a flowchart of a fourth embodiment of the method for multicast load sharing in a label network according to an embodiment of the present application;

[0017] Fig.10 This is a flowchart of a fifth embodiment of the method for multicast load sharing in a label network according to an embodiment of the present application;

[0018] Fig.11 It is a schematic diagram of the structure of the network device in the hardware operating environment involved in the embodiment of the present application.

[0019] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

[0020] It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0021] In order to facilitate understanding of the problem to be solved by this application, a brief introduction to multicast forwarding in label networks is first given as follows:

[0022] At present, unlike the label distribution protocol that establishes P2P LSP (Point-to-Point Label Switched Path) for unicast forwarding by the source node, the P2MP LSP (Point-to-multipoint Label Switched Path) of the multipoint label distribution protocol is triggered and generated by a group of leaf nodes. The sender of multicast traffic is the root node, and the receiver of multicast traffic is the leaf node. A point-to-multipoint label switching path consists of a root node, zero or one or more intermediate nodes, and one or more leaf nodes. The leaf node generates the corresponding mLDP FEC (mldp forwarding equivalent class) according to the multicast service, and then uses the multipoint label mapping (mLDP Label Mapping) message to notify the upstream intermediate node in the direction of the root node of the label allocated for the multipoint forwarding equivalent class. After receiving the multipoint label mapping message, the intermediate node continues to notify the upstream node in the direction of the root node until the message reaches the root node.

[0023] During the transmission of multicast services through mLDP, leaf nodes and intermediate nodes use the optimal upstream node of the unicast route to the root node when selecting the upstream node of the multicast service. Therefore, in the case of the same root node, the same point-to-multipoint label switching path is established. The selection of the upstream node has nothing to do with the multicast service. Even if there are multiple equal-cost paths between the leaf node and the root node (there are multiple equal-cost upstream nodes), different multicast services will only choose the same path.

[0024] For example, refer to Figure 1 , Figure 1 FIG. 1 is a schematic diagram of a point-to-multipoint label switching path in the related art. Figure 1 As shown, network node R1 is connected to the multicast source, R7 and R8 are connected to the multicast receivers, and a point-to-multipoint label switching path is established with R1 as the root node and R7 and R8 as leaf nodes. Figure 1 In the network topology diagram, the cost of each link is equal. There are two equal-cost paths between R7 and R1, namely R7-R3-R2-R1 and R7-R4-R2-R1. There are also two equal-cost paths between R8 and R1, namely R8-R5-R2-R1 and R8-R6-R2-R1. For example, 200 multicast services are deployed in the network, namely Generic LSP id (the structure of opaque data refers to Figure 4 ) from 1 to 100 and MVPN MDT (structure reference for opaque data Figure 5) VPN-ID: ID ranges from 1 to 100. 200 different opaque data information are generated according to the 200 multicast services, and the root node address information in the corresponding 200 multipoint forwarding equivalence classes is R1. Leaf node R7 searches for unicast routes for root node R1 and obtains two equivalent upstream nodes R3 and R4. The unicast preferential rule selects the node with the smaller address as the actual upstream node by default. R7 notifies R3 of all the multipoint label mapping messages of the 200 multicast services. Similarly, R8 notifies R5 of all the multicast services. Intermediate nodes R3, R5, and R2 continue to notify R1 of the multipoint label mapping messages, and finally generate 200 point-to-multipoint label switching paths. All multicast service traffic is forwarded through {sub-label switching path 1: R1-R2-R3-R7, sub-label switching path 2: R1-R2-R5-R8}, while path R2-R4-R7 and path R2-R6-R8 do not forward any multicast service traffic.

[0025] Although it is possible to load-balance multicast traffic among the member interfaces of a link aggregation group by encapsulating an entropy label in the inner layer of a multipoint label distribution protocol label when R1 and R2 are connected in a link aggregation group, it cannot solve the load-balancing problem when there are multiple equal-cost paths between the root node and the leaf nodes.

[0026] Based on the problems existing in the above-mentioned related technologies, the present application provides a multicast load sharing method for a label network, which can search for a route to a root node. When multiple equivalent upstream nodes are found, the target upstream node is determined from multiple equivalent upstream nodes according to the opaque data corresponding to the target multicast service included in the multi-point forwarding equivalence class. Since the opaque data of different multicast services are different, different point-to-multipoint label switching forwarding paths can be established for different multicast services, thereby making full use of network resources, reducing network congestion, and achieving effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0027] For ease of understanding, the multicast load sharing method for a label network provided in an embodiment of the present application is described in detail in combination with the accompanying drawings and application scenarios.

[0028] Reference Figure 2 , Figure 2 This is a flow chart of the first embodiment of the multicast load sharing method for a label network according to an embodiment of the present application.

[0029] like Figure 2 As shown, the multicast load sharing method of the above-mentioned label network may include:

[0030] Step S101, in response to a multipoint forwarding equivalence class corresponding to a target multicast service, obtaining an upstream node of a current node corresponding to the target multicast service by searching a route for a root node; the multipoint forwarding equivalence class includes opaque data corresponding to the target multicast service;

[0031] Step S102: when a plurality of equivalent upstream nodes are found, a target upstream node is determined from the plurality of equivalent upstream nodes according to the opaque data.

[0032] In this embodiment, the current node can be a leaf node or an intermediate node. When the current node is a leaf node, the current node generates a multipoint forwarding equivalence class according to the target multicast service; when the current node is an intermediate node, the downstream node corresponding to the target multicast service of the current node sends a multipoint label mapping message to the current node, and the current node obtains the multipoint forwarding equivalence class according to the multipoint label mapping message. Among them, the multipoint forwarding equivalence class includes the root node information corresponding to the target multicast service.

[0033] In response to the multipoint forwarding equivalence class corresponding to the target multicast service, the upstream node corresponding to the target multicast service of the current node is obtained by searching the route of the root node. Specifically, the current node searches the unicast route of the root node according to the root node information to obtain the upstream node corresponding to the target multicast service of the current node. In the case of finding multiple equivalent upstream nodes, the current node determines the target upstream node from the multiple equivalent upstream nodes according to the opaque data. Specifically, the current node obtains the opaque data of the target multicast service included in the multipoint forwarding equivalence class (the data of the Opaque Value field in the multipoint forwarding equivalence class), and determines the target upstream node from the multiple equivalent upstream nodes according to the opaque data. For example, the hash value corresponding to the target multicast service is calculated according to the opaque data, and the target upstream node is determined from the multiple equivalent upstream nodes according to the hash value corresponding to the target multicast service, or the corresponding hash value is calculated according to the opaque data and the characteristic information of the multiple equivalent upstream nodes, and the target upstream node is determined from the multiple equivalent upstream nodes according to the corresponding hash value.

[0034] Reference Figure 3 , Figure 4 as well as Figure 5 , Figure 3 is a schematic structural diagram of the data structure of the multipoint forwarding equivalence class in an embodiment of the present application, Figure 4 : is a schematic structural diagram of the data structure of opaque data in the multipoint forwarding equivalence class when the multicast service type is Generic LSP id in the embodiment of the present application, Figure 51 is another schematic structural diagram of the data structure of opaque data in the multipoint forwarding equivalence class when the multicast service type is MVPN MDT in the embodiment of the present application. Figure 3 As shown, the multipoint forwarding equivalence class includes root node information (root node address information) and opaque data (Opaque Value), and the leaf node and the intermediate node notify the upstream node in the direction of the root node of the multipoint label mapping message.<Root,Opaque Value> Uniquely identifies a point-to-multipoint label switching path in a label network. Figure 4 as well as Figure 5 As shown, Figure 4 as well as Figure 5 To be filled in the attached Figure 3 The data structure of the opaque data in the Opaque Value field in FIG. 8 . Of course, for other different multicast service types, the opaque data can also be other data structures.

[0035] In this embodiment, opaque data is used to determine the target upstream node among multiple equivalent upstream nodes. Since the opaque data of different multicast services are different, different point-to-multipoint label switching forwarding paths can be established for different multicast services, thereby fully utilizing network resources in multicast services to reduce network congestion, and achieving effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0036] Reference Figure 6 , Figure 6 This is a schematic scenario diagram of a point-to-multipoint label switching path in an embodiment of the present application.

[0037] Exemplarily, 200 multicast services are deployed in the label network, which are Generic LSP id from 1 to 100 and VPN-ID: ID of MVPN MDT from 1 to 100. 200 different opaque data information are generated according to the 200 multicast services, and the root node address information in the corresponding 200 multipoint forwarding equivalence classes is R1. Leaf node R7 searches for unicast routing for root node R1 and obtains two equivalent upstream nodes R3 and R4. Leaf node R7 selects the target upstream node of the multicast service from upstream nodes R3 and R4 according to the opaque data information of each multicast service, and notifies the upstream node of the multipoint label mapping message. Similarly, leaf node R8 searches for unicast routing for root node R1 and obtains two equivalent upstream nodes R5 and R6. Leaf node R8 selects the target upstream node of the multicast service from upstream nodes R5 and R6 according to the opaque data information of each multicast service, and notifies the upstream node of the multipoint label mapping message. The intermediate node R23 receives the multipoint label mapping message announced by R3, R4, R5 and R6, and searches for the unicast route for the root node R1. The intermediate node R23 obtains two equivalent upstream nodes R21 and R22, and selects the target upstream node of the multicast service from the upstream nodes R21 and R22 according to the opaque data information of each multicast service. Different point-to-multipoint label switching forwarding paths can be established for different multicast services, so as to make full use of network resources in multicast services to reduce network congestion, and realize effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0038] In a possible implementation, the current node is a leaf node, and before step S101, the multicast load sharing method of the label network further includes:

[0039] Step S103: Generate the multipoint forwarding equivalence class according to the target multicast service, wherein the multipoint forwarding equivalence class includes root node information corresponding to the target multicast service.

[0040] In this embodiment, when the current node is a leaf node, the current node generates a multipoint forwarding equivalence class according to the target multicast service. Specifically, the multipoint forwarding equivalence class includes the root node information corresponding to the target multicast service and the opaque data corresponding to the target multicast service. The route is searched according to the root node information, and when multiple equivalent upstream nodes are found, the target upstream node is determined among the multiple equivalent upstream nodes according to the opaque data.

[0041] In another possible implementation, the current node is an intermediate node, and before step S101, the multicast load sharing method of the label network further includes:

[0042] Step S104, receiving a multipoint label mapping message, wherein the multipoint label mapping message is sent by a downstream node of the current node corresponding to the target multicast service, and the multipoint label mapping message includes a multipoint forwarding equivalence class corresponding to the target multicast service;

[0043] Step S105: parsing the multipoint label mapping message to obtain the multipoint forwarding equivalence class, wherein the multipoint forwarding equivalence class includes the root node information corresponding to the target multicast service.

[0044] In this embodiment, when the downstream node corresponding to the target multicast service determines that the current node is the target upstream node, the downstream node sends a multi-point label mapping message, which includes the multi-point forwarding equivalence class corresponding to the target multicast service, and the current node receives the multi-point label mapping message.

[0045] Next, the current node parses the multi-point label mapping message to obtain a multi-point forwarding equivalence class, which includes the root node information corresponding to the target multicast service, searches for unicast routing based on the root node information, and when multiple equivalent upstream nodes are found, determines the target upstream node among the multiple equivalent upstream nodes based on the opaque data.

[0046] The multicast load sharing method for a label network proposed in this embodiment obtains the upstream node of the current node corresponding to the target multicast service by searching the route of the root node in response to the multipoint forwarding equivalence class corresponding to the target multicast service; the multipoint forwarding equivalence class includes opaque data corresponding to the target multicast service; then, when multiple equivalent upstream nodes are found, the target upstream node is determined from the multiple equivalent upstream nodes according to the opaque data, and different point-to-multipoint label switching forwarding paths can be established for different multicast services, thereby fully utilizing network resources in the multicast service to reduce network congestion, and achieving effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0047] Based on the first embodiment, a second embodiment of the multicast load sharing method of the label network of the present application is proposed, referring to Figure 7 In this embodiment, step S102 includes:

[0048] Step S201, calculating a hash value corresponding to the target multicast service according to the opaque data;

[0049] Step S202: determining the target upstream node from the plurality of equivalent upstream nodes according to the hash value corresponding to the target multicast service.

[0050] In this embodiment, when multiple equivalent upstream nodes are found, the current node obtains the opaque data of the target multicast service included in the multipoint forwarding equivalence class (the data of the Opaque Value field in the multipoint forwarding equivalence class), and calculates the hash value corresponding to the target multicast service based on the opaque data. For example, the current node uses a related hash algorithm to calculate the hash value corresponding to the target multicast service based on the opaque data.

[0051] Next, based on the hash value corresponding to the target multicast service, the target upstream node is determined from multiple equivalent upstream nodes. For example, a preset hash value range corresponding to each upstream node can be set in advance, and the preset hash value range corresponding to each upstream node is different. After obtaining the hash value corresponding to the target multicast service, among multiple equivalent upstream nodes, the upstream node corresponding to the preset hash value range to which the hash value corresponding to the target multicast service belongs is used as the target upstream node.

[0052] The multicast load sharing method for a label network proposed in this embodiment calculates the hash value corresponding to the target multicast service according to the opaque data; then determines the target upstream node from multiple equivalent upstream nodes according to the hash value corresponding to the target multicast service, and can accurately determine the target upstream node according to the hash value corresponding to the target multicast service, and then establish different point-to-multipoint label switching forwarding paths for different multicast services, thereby fully utilizing network resources in the multicast service to reduce network congestion, and realizing effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0053] Based on the first embodiment, a third embodiment of the multicast load sharing method of the label network of the present application is proposed, referring to Figure 8 In this embodiment, step S102 includes:

[0054] Step S301, calculating a hash value corresponding to the target multicast service according to the opaque data and a preset mask;

[0055] Step S302: determining the target upstream node from the multiple equivalent upstream nodes according to the hash value corresponding to the target multicast service.

[0056] In this embodiment, when multiple equivalent upstream nodes are found, the current node obtains the opaque data of the target multicast service included in the multipoint forwarding equivalence class (the data of the Opaque Value field in the multipoint forwarding equivalence class), and obtains the preset mask, and calculates the hash value corresponding to the target multicast service according to the opaque data and the preset mask. For example, the current node uses a related hash algorithm to calculate the hash value corresponding to the target multicast service according to the opaque data and the preset mask. Among them, the preset mask can be a hash mask, and the preset mask can be used to control the granularity of load sharing. For example, the mask length can be set to 1 byte. At this time, the type field of the target multicast service in the opaque data participates in the hash calculation, that is, load sharing is performed according to the type of the target multicast service; the mask length can also be set to the full length. At this time, all fields of the opaque data will participate in the hash calculation, that is, load sharing is performed according to each multicast service.

[0057] Next, based on the hash value corresponding to the target multicast service, the target upstream node is determined from multiple equivalent upstream nodes. For example, a preset hash value range corresponding to each upstream node can be set in advance, and the preset hash value range corresponding to each upstream node is different. After obtaining the hash value corresponding to the target multicast service, the upstream node corresponding to the preset hash value range to which the hash value corresponding to the target multicast service belongs among multiple equivalent upstream nodes is used as the target upstream node.

[0058] The multicast load sharing method for a label network proposed in this embodiment calculates a hash value corresponding to a target multicast service based on opaque data and a preset mask; then, based on the hash value corresponding to the target multicast service, a target upstream node is determined from a plurality of equivalent upstream nodes. The target upstream node can be accurately determined based on the hash value corresponding to the target multicast service, and different point-to-multipoint label switching forwarding paths can be established for different multicast services, thereby making full use of network resources in multicast services to reduce network congestion, and achieving effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0059] Based on the first embodiment, a fourth embodiment of the multicast load sharing method of the label network of the present application is proposed. In this embodiment, step S102 includes:

[0060] Step S401 : determining the target upstream node from the multiple equivalent upstream nodes according to the opaque data and the characteristic information of each equivalent upstream node.

[0061] In this embodiment, when multiple equivalent upstream nodes are found, the current node obtains the opaque data of the target multicast service included in the multi-point forwarding equivalence class, as well as the characteristic information of multiple equivalent upstream nodes, wherein the characteristic information of the upstream node is the identification information of the upstream node or the interface address information of the upstream node.

[0062] Next, based on the opaque data and the characteristic information of multiple equivalent upstream nodes, the target upstream node is determined from the multiple equivalent upstream nodes. For example, the hash value of each equivalent upstream node on the target multicast service is calculated based on the opaque data and the characteristic information of the upstream nodes, and the target upstream node is determined from the multiple equivalent upstream nodes based on the hash values ​​corresponding to the multiple equivalent upstream nodes.

[0063] In one possible implementation, refer to Fig. 9 , step S401 includes:

[0064] Step S4011, calculating a hash value corresponding to each equivalent upstream node according to the opaque data and feature information of each equivalent upstream node;

[0065] Step S4012: Determine the target upstream node from the multiple equivalent upstream nodes according to the hash value corresponding to each of the equivalent upstream nodes.

[0066] In this embodiment, when characteristic information of multiple equivalent upstream nodes is obtained, a hash value corresponding to each equivalent upstream node is calculated based on the opaque data and the characteristic information of each equivalent upstream node. An exemplary hash value calculation formula can be: Value(OV,M,R(i))=(1103515245*((1103515245*(OV&M)+12345)XOR R(i))+12345)mod 2^31, wherein Value(OV,M,R(i)) is the hash value corresponding to the upstream node, OV is the opaque data of the target multicast service, M is a preset mask, and in the formula, M is the full length, and R(i) is the characteristic information corresponding to the upstream node.

[0067] Next, according to the hash value corresponding to each equivalent upstream node, a target upstream node of the multicast service is determined from multiple equivalent upstream nodes. In a possible implementation, step S4012 includes:

[0068] Step S4121, according to the hash values ​​corresponding to each of the equivalent upstream nodes, determine the upstream node corresponding to the maximum hash value as the target upstream node; or,

[0069] Step S4122: According to the hash values ​​corresponding to each of the equivalent upstream nodes, determine the upstream node corresponding to the minimum hash value as the target upstream node.

[0070] In this embodiment, in response to the hash values ​​corresponding to multiple equivalent upstream nodes obtained, the maximum hash value among the hash values ​​corresponding to the upstream nodes is determined, and the upstream node corresponding to the maximum hash value is determined as the target upstream node, or, in response to the hash values ​​corresponding to multiple equivalent upstream nodes obtained, the minimum hash value among the hash values ​​corresponding to the upstream nodes is determined, and the upstream node corresponding to the minimum hash value is determined as the target upstream node, so as to accurately determine the target upstream node according to the maximum hash value or the minimum hash value, and then establish different point-to-multipoint label switching forwarding paths for different multicast services, thereby achieving effective load sharing.

[0071] The multicast load sharing method for a label network proposed in this embodiment determines the target upstream node from multiple equivalent upstream nodes based on the opaque data and the characteristic information of each equivalent upstream node. The target upstream node can be accurately determined based on the opaque data and the characteristic information, and then different point-to-multipoint label switching forwarding paths are established for different multicast services, thereby fully utilizing network resources in multicast services to reduce network congestion, and achieving effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0072] Based on the first embodiment, a fifth embodiment of the multicast load sharing method of the label network of the present application is proposed, referring to Fig.10 In this embodiment, step S102 includes:

[0073] Step S501, calculating a hash value corresponding to each equivalent upstream node according to the opaque data, a preset mask and feature information of each equivalent upstream node;

[0074] Step S502: determining the target upstream node from the multiple equivalent upstream nodes according to the hash value corresponding to each of the equivalent upstream nodes.

[0075] In this embodiment, when multiple equivalent upstream nodes are found, the current node obtains the opaque data of the target multicast service included in the multi-point forwarding equivalence class, a preset mask and the characteristic information of each equivalent upstream node, wherein the characteristic information of the upstream node is the identification information of the upstream node or the interface address information of the upstream node.

[0076] Next, hash values ​​corresponding to multiple equivalent upstream nodes are calculated based on the opaque data, the preset mask and the characteristic information of each equivalent upstream node. An exemplary hash value calculation formula can be: Value(OV,M,R(i))=(1103515245*((1103515245*(OV&M)+12345)XOR R(i))+12345)mod 2^31, wherein Value(OV,M,R(i)) is the hash value corresponding to the upstream node, OV is the opaque data of the target multicast service, M is the preset mask, and R(i) is the characteristic information corresponding to the upstream node. The preset mask can be a hash mask, which can be used to control the granularity of load sharing. For example, the mask length can be set to 1 byte. At this time, the type field of the target multicast service in the opaque data participates in the hash calculation, that is, load sharing is performed according to the type of the target multicast service. The mask length can also be set to the full length. Referring to the fourth embodiment, all fields of the opaque data will participate in the hash calculation, that is, load sharing is performed according to each multicast service.

[0077] Next, according to the hash value corresponding to each equivalent upstream node, a target upstream node of the multicast service is determined from multiple equivalent upstream nodes. In a possible implementation, step S502 includes:

[0078] Step S5021, according to the hash values ​​corresponding to each of the equivalent upstream nodes, determine the upstream node corresponding to the maximum hash value as the target upstream node; or,

[0079] Step S5022: According to the hash values ​​corresponding to each of the equivalent upstream nodes, determine the upstream node corresponding to the minimum hash value as the target upstream node.

[0080] In this embodiment, in response to the hash values ​​corresponding to multiple equivalent upstream nodes obtained, the maximum hash value among the hash values ​​corresponding to the upstream nodes is determined, and the upstream node corresponding to the maximum hash value is determined as the target upstream node, or, in response to the hash values ​​corresponding to multiple equivalent upstream nodes obtained, the minimum hash value among the hash values ​​corresponding to the upstream nodes is determined, and the upstream node corresponding to the minimum hash value is determined as the target upstream node, so as to accurately determine the target upstream node according to the maximum hash value or the minimum hash value, and then establish different point-to-multipoint label switching forwarding paths for different multicast services, thereby achieving effective load sharing.

[0081] The multicast load sharing method for a label network proposed in this embodiment calculates a hash value corresponding to each equivalent upstream node according to opaque data, a preset mask and characteristic information of each equivalent upstream node; then, according to the hash value corresponding to each equivalent upstream node, the target upstream node is determined from multiple equivalent upstream nodes, and the hash value corresponding to the upstream node is calculated according to the opaque data, the preset mask and characteristic information, and the target upstream node is accurately determined according to the hash value corresponding to the upstream node, thereby establishing different point-to-multipoint label switching forwarding paths for different multicast services, thereby fully utilizing network resources in multicast services to reduce network congestion, and achieving effective load sharing when there are multiple equivalent paths between the root node and the leaf nodes.

[0082] like Fig.11 As shown, Fig.11 It is a structural diagram of a network device in a hardware operating environment involved in an embodiment of the present application.

[0083] The terminal in the embodiment of the present application may be a network device. Fig.11 As shown, the network device may include: a processor 1001, such as a CPU, a network interface 1004, a user interface 1003, a memory 1005, and a communication bus 1002. Among them, the communication bus 1002 is used to realize the connection and communication between these components. The user interface 1003 may include a display screen (Display), an input unit such as a keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface and a wireless interface. The network interface 1004 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface). The memory 1005 may be a high-speed RAM memory, or a stable memory (non-volatile memory), such as a disk memory. The memory 1005 may also be a storage device independent of the aforementioned processor 1001.

[0084] Optionally, the network device may also include a camera, a RF (Radio Frequency) circuit, a sensor, an audio circuit, a WiFi module, and the like.

[0085] Those skilled in the art will understand that Fig.11 The terminal structure shown in the figure does not constitute a limitation on the network device, and may include more or less components than shown in the figure, or combine certain components, or arrange the components differently.

[0086] like Fig.11 As shown, the memory 1005 as a computer storage medium may include an operating system, a network communication module, a user interface module, and a multicast load sharing program for a label network.

[0087] exist Fig.11 In the network device shown, the network interface 1004 is mainly used to connect to the background server and communicate data with the background server; the user interface 1003 is mainly used to connect to the client (user end) and communicate data with the client; and the processor 1001 can be used to call the multicast load sharing program of the label network stored in the memory 1005.

[0088] In this embodiment, the network device includes: a memory 1005, a processor 1001, and a multicast load sharing program for a label network stored in the memory 1005 and executable on the processor 1001, wherein the processor 1001 calls the multicast load sharing program for a label network stored in the memory 1005 and executes the steps of the multicast load sharing method for a label network in the above embodiments.

[0089] In addition, an embodiment of the present application also proposes a computer-readable storage medium, on which a multicast load sharing program for a label network is stored. When the multicast load sharing program for a label network is executed by a processor, the steps of the multicast load sharing method for a label network as described above are implemented.

[0090] In addition, the present application also proposes a multicast load sharing device for a label network, and the multicast load sharing device for the label network includes:

[0091] A search module, configured to obtain an upstream node of a current node corresponding to a target multicast service by searching a route for a root node in response to a multipoint forwarding equivalence class corresponding to the target multicast service; the multipoint forwarding equivalence class includes opaque data corresponding to the target multicast service;

[0092] A determination module is used to determine a target upstream node from among the multiple equivalent upstream nodes according to the opaque data when multiple equivalent upstream nodes are found.

[0093] The methods executed by the above-mentioned program units can refer to the various embodiments of the multicast load sharing method for the label network of the present application, and will not be repeated here.

[0094] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.

[0095] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0096] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as described above, and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, air conditioner, or network device, etc.) to execute the methods described in each embodiment of the present application.

[0097] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A multicast load sharing method for a label network, characterized in that: include: In response to a multipoint forwarding equivalence class corresponding to a target multicast service, an upstream node of a current node corresponding to the target multicast service is obtained by searching a route for a root node; the multipoint forwarding equivalence class includes opaque data corresponding to the target multicast service; In the case where a plurality of equivalent upstream nodes are found, a target upstream node is determined from the plurality of equivalent upstream nodes according to the opaque data.

2. The multicast load sharing method for a label network according to claim 1, characterized in that: Determining a target upstream node from among the plurality of equivalent upstream nodes according to the opaque data includes: Calculate a hash value corresponding to the target multicast service according to the opaque data; The target upstream node is determined from the multiple equivalent upstream nodes according to the hash value corresponding to the target multicast service.

3. The multicast load sharing method for a label network according to claim 1, characterized in that: Determining a target upstream node from among the plurality of equivalent upstream nodes according to the opaque data includes: Calculating a hash value corresponding to the target multicast service according to the opaque data and a preset mask; The target upstream node is determined from the multiple equivalent upstream nodes according to the hash value corresponding to the target multicast service.

4. The multicast load sharing method of the label network according to claim 1, characterized in that: Determining a target upstream node from among the plurality of equivalent upstream nodes according to the opaque data includes: The target upstream node is determined from among the multiple equivalent upstream nodes according to the opaque data and the characteristic information of each equivalent upstream node.

5. The multicast load sharing method of the label network as claimed in claim 4, characterized in that: The step of determining the target upstream node from the plurality of equivalent upstream nodes according to the opaque data and the characteristic information of each equivalent upstream node includes: Calculate a hash value corresponding to each equivalent upstream node according to the opaque data and feature information of each equivalent upstream node; The target upstream node is determined from the multiple equivalent upstream nodes according to the hash value corresponding to each equivalent upstream node.

6. The multicast load sharing method of the label network according to claim 1, characterized in that: Determining a target upstream node from among the plurality of equivalent upstream nodes according to the opaque data includes: Calculate a hash value corresponding to each equivalent upstream node according to the opaque data, the preset mask and the feature information of each equivalent upstream node; The target upstream node is determined from the multiple equivalent upstream nodes according to the hash value corresponding to each equivalent upstream node.

7. The multicast load sharing method of a label network according to any one of claims 5 to 6, characterized in that: The step of determining a target upstream node from the plurality of equivalent upstream nodes according to a hash value corresponding to each of the equivalent upstream nodes includes: According to the hash values ​​corresponding to each of the equivalent upstream nodes, determining the upstream node corresponding to the maximum hash value as the target upstream node; or, According to the hash values ​​corresponding to each of the equivalent upstream nodes, the upstream node corresponding to the minimum hash value is determined as the target upstream node.

8. The multicast load sharing method for a label network according to any one of claims 4 to 7, characterized in that: The characteristic information of the upstream node is identification information of the upstream node or interface address information of the upstream node.

9. The multicast load sharing method of the label network according to claim 1, characterized in that: The current node is a leaf node, and before the upstream node of the current node corresponding to the target multicast service is obtained by searching the route of the root node, the method further includes: The multipoint forwarding equivalence class is generated according to the target multicast service, and the multipoint forwarding equivalence class includes root node information corresponding to the target multicast service.

10. The multicast load sharing method of the label network according to claim 1, characterized in that: The current node is an intermediate node, and before the upstream node of the current node corresponding to the target multicast service is obtained by searching the route of the root node, the method further includes: Receiving a multipoint label mapping message, the multipoint label mapping message is sent by a downstream node of the current node corresponding to the target multicast service, the multipoint label mapping message includes a multipoint forwarding equivalence class corresponding to the target multicast service; The multipoint label mapping message is parsed to obtain the multipoint forwarding equivalence class, where the multipoint forwarding equivalence class includes the root node information corresponding to the target multicast service.

11. A network device, characterized in that: The network device includes: a memory, a processor, and a multicast load sharing program for a label network stored in the memory and executable on the processor. When the multicast load sharing program for the label network is executed by the processor, the steps of the multicast load sharing method for a label network as described in any one of claims 1 to 10 are implemented.

12. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a multicast load sharing program for a label network, and when the multicast load sharing program for a label network is executed by a processor, the steps of the multicast load sharing method for a label network as described in any one of claims 1 to 10 are implemented.

Images