WO2013107245A1 - 在透明多链路互联（trill）网络中实现组播的方法、装置及系统 - Google Patents

在透明多链路互联（trill）网络中实现组播的方法、装置及系统 Download PDF

Info

Publication number
WO2013107245A1
WO2013107245A1 PCT/CN2012/087222 CN2012087222W WO2013107245A1 WO 2013107245 A1 WO2013107245 A1 WO 2013107245A1 CN 2012087222 W CN2012087222 W CN 2012087222W WO 2013107245 A1 WO2013107245 A1 WO 2013107245A1
Authority
WO
WIPO (PCT)
Prior art keywords
vlan
distribution tree
layer
multicast group
ingres
Prior art date
Application number
PCT/CN2012/087222
Other languages
English (en)
French (fr)
Inventor
郝卫国
厉益舟
Original Assignee
华为技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2013107245A1 publication Critical patent/WO2013107245A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/02—Details
    • H04L12/16—Arrangements for providing special services to substations
    • H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
    • H04L12/185—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with management of multicast group membership
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/14—Multichannel or multilink protocols
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate

Definitions

  • TRILL transparent multi-link interconnection
  • TRILL Transparent Interconnecting of Lots of Links
  • the RB learns the topology of the entire network and the distribution tree information through the TRILL protocol.
  • the RB uses the device itself as the source node to generate a unicast forwarding table to other RBs through the shortest path tree algorithm.
  • the RB uses the root of each distribution tree as the source node.
  • the shortest path tree algorithm generates a distribution tree forwarding table to other RBs.
  • the entire network can generate multiple distribution trees.
  • Each distribution tree has a unique tree.
  • the distribution tree can be identified by the nickname (nickname). .
  • RB is divided into three roles: Ingres s, RB, Trans RB and Egres RB.
  • the Ingres s RB sends the traditional Layer 2 traffic in the VLAN to the TRILL network through the TRILL protocol.
  • the Egres RB receives the TRILL data traffic forwarded by the TRILL network.
  • the TRILL decapsulation is restored to the traditional Layer 2 traffic and forwarded to the local site connected to the RB.
  • the Transit RB does not perform TRILL encapsulation and decapsulation, and directly forwards the TRILL data packet to the next RB according to the lookup distribution tree forwarding table.
  • the RB can serve as the Ingress RB, the Transit RB, and the Egress RB.
  • the Ingress RB needs to access the VLAN, or the Layer 2 multicast group in the VLAN, or at least one of the Layer 3 multicast group information in the VLAN and the selected one.
  • the distribution tree information is advertised and used for other RBs in the TRILL network (Transit
  • RB and Egress RB perform distribution tree pruning calculations.
  • the multicast traffic in the VLAN is sent to other RBs that are also connected to the VLAN on demand. This avoids the waste of the multicast traffic sent by the broadcast to the TRILL network.
  • the distribution tree pruning technology of the existing TRILL network all the ingress RBs in the TRILL network advertise the VLANs that they access and the distribution tree selected by themselves, and other RBs (Transit RBs and Egress RBs) in the network receive the notifications. It is known which VLANs are selected by the Ingress RBs in the network, and which distribution tree is selected respectively. Based on these distribution trees and VLAN information, the distribution tree pruning calculation is performed to generate a local distribution tree forwarding table.
  • Figure 1 shows a typical data center fat tree (FatTree) networking.
  • the entire TRILL network has two distribution trees.
  • the distribution tree roots are the distribution tree root RB1 and the distribution tree root RB2.
  • the cost of each link is equal, so each RB is equidistant from the distance of the two distribution tree root RBs.
  • Each RB accesses 2000 VLANs, selecting the distribution tree root RBI for VLAN 1-1000 and the distribution tree for RB2 for VLAN 1001-2000.
  • Ingress RB publishes the locally accessed V AN through Interested VLANs and Spanning Tree Roots Sub_TlV, through The
  • Sub_TLV publishes the selected distribution tree information.
  • the RB Based on the VLAN and distribution tree information advertised by the Ingress RB, the RB performs the distribution tree pruning calculation to generate the pruned distribution tree forwarding table.
  • the other RBs consider that each VLAN on the ingress RB uses the two distribution trees selected by the ingress RB to forward traffic. Therefore, a total of 4000 distribution tree entry forwarding records are generated for the 2000 VLANs.
  • the Ingress RB when the Ingress RB selects the distribution tree based on the VLAN, the Ingress RB can advertise all the distribution tree roots selected by the Ingress RB in the distribution tree information, and other RBs can only be based on the RB.
  • All the distribution trees selected by the ingress RB perform VLAN prune calculation, which creates redundant forwarding records and occupies the resources of the distribution tree forwarding table.
  • the ingress RB is selected based on the Layer 2 multicast group in the VLAN or the Layer 3 multicast group in the VLAN.
  • the Ingres s RB does not advertise the distribution tree based on the Layer 2 multicast group in the VLAN or the Layer 3 multicast group in the VLAN. Therefore, other RBs can only perform Layer 2 multicast groups in the VLAN based on all the distribution trees selected by the Ingres s RB.
  • the calculation of the Layer 3 multicast group prune in the VLAN also creates redundant forwarding records, which occupy the resources of the distribution tree forwarding table.
  • Embodiments of the present invention provide a method, apparatus, and system for implementing multicast in a transparent multi-link interconnect (TRILL) network, which can reduce the number of forwarding records of a distribution tree forwarding table and save resources of a distribution tree forwarding table.
  • TRILL transparent multi-link interconnect
  • an embodiment of the present invention provides a method for implementing multicast in a transparent multi-link interconnect (TRILL) network, including:
  • the ingress routing bridge device Ingres s RB determines at least one of the following correspondences: a correspondence between the first virtual local area network VLAN and the distribution tree, a correspondence between the second layer multicast group and the distribution tree in the second VLAN, and a third VLAN Corresponding relationship between the Layer 3 multicast group and the distribution tree, the first VLAN, the second VLAN, and the third VLAN are VLANs accessed by the Ingres RB;
  • the Ingres s RB advertises the determined correspondence to the other RBs in the TRILL network through the extended intermediate system to the intermediate system IS-IS protocol, so that the other RBs prune the distribution tree according to the notification of the Ingres s RB.
  • the distribution tree forwarding table after pruning.
  • an embodiment of the present invention further provides a method for implementing multicast in a transparent multi-link interconnect (TRILL) network, including:
  • the routing bridge device RB receives at least one of the following correspondences advertised by the ingress Ingres s RB: a correspondence between the first virtual local area network VLAN and the distribution tree, a correspondence between the second layer multicast group and the distribution tree in the second VLAN, Correspondence between the Layer 3 multicast group and the distribution tree in the three VLANs;
  • the RB prune the distribution tree according to the advertisement of the Ingres s RB, and establishes a pruned distribution tree forwarding table.
  • an embodiment of the present invention further provides a method for implementing multicast in a transparent multi-link interconnect (TRILL) network, including: The highest root-priority routing bridge device RB selects a corresponding distribution tree for at least one of all the virtual local area network VLANs in the TRILL network, the Layer 2 multicast group in the VLAN, and the Layer 3 multicast group in the VLAN; Corresponding relationship between the VLAN and the distribution tree, the mapping between the Layer 2 multicast group and the distribution tree in the VLAN, and the Layer 3 multicast group and distribution in the VLAN through the extended intermediate system to the intermediate system IS-IS protocol The at least one corresponding relationship in the tree correspondence is advertised to the other RBs in the TRILL network, so that the ingress advertised by the Ingres s RB is the first VLAN, the second VLAN in the second VLAN, At least one of the Layer 3 multicast groups in the third VLAN selects a corresponding distribution tree and advertises the selected distribution tree to other RBs in the TRILL network through the
  • an embodiment of the present invention further provides an ingress LSP bridging device, Ingres s RB, including:
  • a processor configured to determine at least one of the following correspondences: a correspondence between a first virtual local area network VLAN and a distribution tree, a correspondence between a layer 2 multicast group and a distribution tree in the second VLAN, and a third layer in the third VLAN Corresponding relationship between the multicast group and the distribution tree, where the first VLAN, the second VLAN, and the third VLAN are VLANs accessed by the Ingres RB;
  • a transmitter configured to advertise the determined correspondence to the other RBs in the TRILL network by using the extended intermediate system to the intermediate system IS-IS protocol, so that the other RBs prune the distribution tree according to the advertisement of the Ingres s RB. Establish a pruned distribution tree forwarding table.
  • the embodiment of the present invention further provides a routing bridging device RB, including: a receiver, configured to receive at least one of the following correspondences advertised by the ingress Ingres s RB: a first virtual local area network VLAN and a distribution tree Correspondence relationship, the correspondence between the Layer 2 multicast group and the distribution tree in the second VLAN, and the correspondence between the Layer 3 multicast group and the distribution tree in the third VLAN;
  • the processor is configured to prune the distribution tree according to the advertisement of the Ingres s RB, and establish a pruned distribution tree forwarding table.
  • the embodiment of the present invention further provides a highest root priority routing bridge device RB, including: a processor, configured to select a corresponding distribution tree for at least one of a virtual local area network (VLAN) VLAN, a Layer 2 multicast group in a VLAN, and a Layer 3 multicast group in a VLAN in the TRILL network;
  • VLAN virtual local area network
  • a sender configured to associate the VLAN with a distribution tree, an association between a Layer 2 multicast group and a distribution tree in the VLAN, and a Layer 3 multicast in the VLAN by using an extended intermediate system to an intermediate system IS-IS protocol
  • At least one corresponding relationship between the group and the distribution tree is advertised to other RBs in the TRILL network, so that the ingress Ingres s RB is advertised according to the highest root-priority RB as the first VLAN, and the second-layer group in the second VLAN
  • At least one of the multicast group and the Layer 3 multicast group in the third VLAN selects a corresponding distribution tree and advertises the selected distribution tree to other RBs in the TRILL network through the extended IS-IS protocol, so that other RBs are
  • the advertisement of the Ingres s RB prune the distribution tree, and establishes a pruned distribution tree forwarding table.
  • the first VLAN, the second VLAN, and the third VLAN are VLANs accessed by the Ingres RB.
  • an embodiment of the present invention provides a system for implementing multicast in a transparent multi-link interconnect (TRILL) network, including:
  • the ingress routing bridge device Ingres s RB is configured to determine at least one of the following correspondences: a correspondence between the first virtual local area network VLAN and the distribution tree, a correspondence between the second layer multicast group and the distribution tree in the second VLAN, and a Corresponding relationship between the Layer 3 multicast group and the distribution tree in the three VLANs, where the first VLAN, the second VLAN, and the third VLAN are VLANs accessed by the Ingres RB, and the extended intermediate system to the intermediate system I S-
  • the 1 S protocol advertises the determined correspondence to other RBs in the TR I LL network, so that other RBs prune the distribution tree according to the advertisement of the Ingres s RB, and establish a prune distribution tree forwarding table;
  • the RB is configured to receive the advertisement of the Ingres s RB, prune the distribution tree according to the advertisement of the Ingres s RB, and establish a prune distribution tree forwarding table.
  • the method, device, and system for implementing multicast in a transparent multi-link interconnection (TRILL) network can carry a VLAN (or a Layer 2 multicast group in a VLAN) in the extended IS-IS packet. Or the relationship between the Layer 3 multicast group in the VLAN and the distribution tree selected for the VLAN (or the Layer 2 multicast group in the VLAN or the Layer 3 multicast group in the VLAN).
  • the other RBs receive the extended IS-IS.
  • the protocol packet must be a VLAN (or a Layer 2 multicast group in a VLAN or a Layer 3 multicast group in a VLAN) and the VLAN.
  • the distribution tree selected by the Layer 2 multicast group in the VLAN or the Layer 3 multicast group in the VLAN to establish the forwarding record. That is, the problem that the forwarding record needs to be established in all the distribution trees selected in the VLAN (or the Layer 2 multicast group in the VLAN or the Layer 3 multicast group in the VLAN) and the Ingres s RB is solved in the prior art, and the distribution tree is reduced.
  • the number of forwarding records in the forwarding table saves resources of the distribution tree forwarding table.
  • FIG. 1 is a schematic structural diagram of a TRILL network in the prior art
  • FIG. 2 is a flowchart of a method for implementing multicast in a TRILL network according to an embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of a TRILL network according to an embodiment of the present invention
  • FIG. 5 is a distribution tree forwarding table established by an RB in the prior art
  • FIG. 6 is a flowchart of a method for implementing multicast in a TRILL network according to another embodiment of the present invention
  • FIG. 7 is a distribution tree forwarding table established by a distribution tree root RB according to an embodiment of the present invention; a distribution tree forwarding table established by the distribution tree root RB;
  • FIG. 9 is a schematic structural diagram of a TRILL network in a scenario where new and old RBs are compatible in an embodiment of the present invention.
  • FIG. 10 is a distribution tree forwarding table established by a new RB in a new and old RB compatible scenario according to an embodiment of the present invention
  • 11 is a distribution tree forwarding table established by an old RB in a scenario of a new and old RB compatible in an embodiment of the present invention
  • FIG. 12 is a schematic structural diagram of a TRILL network in another application scenario according to an embodiment of the present invention.
  • FIG. 13 is a flowchart of a method for implementing multicast in a TRILL network according to another embodiment of the present invention
  • FIG. 14 is a schematic structural diagram of a TRILL network according to another embodiment of the present invention
  • FIG. 15 is a flowchart of a method for implementing multicast in a TRILL network according to another embodiment of the present invention
  • 16 is a flow chart of a method for implementing multicast in a TRILL network according to another embodiment of the present invention.
  • FIG. 17 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • FIG. 18 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • FIG. 19 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • FIG. 20 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • 21 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • FIG. 22 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • FIG. 23 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • 24 is a schematic diagram showing a simplified structure of an RB according to an embodiment of the present invention.
  • Figure 25 is a schematic diagram showing the simplified structure of an RB in an embodiment of the present invention.
  • the VLAN in the embodiment of the present invention can divide the physical Layer 2 network into multiple logical subnets, and each logical subnet constitutes a Layer 2 broadcast domain, and users in the logical subnet can perform Layer 2 interworking. Layer 2 traffic between logical subnets is isolated from each other. Sites in the network can flexibly join different logical subnets as needed. Through the TRILL network, users in the same VLAN at different sites can be connected to each other through Layer 2.
  • the embodiment of the invention provides a method for implementing multicast in a transparent multi-link interconnection (TRILL) network.
  • the method includes: 201.
  • the Ingres s RB determines at least one of the following correspondences: a correspondence between the first VLAN and the distribution tree, a correspondence between the Layer 2 multicast group and the distribution tree in the second VLAN, and Layer 3 multicast in the third VLAN.
  • the first VLAN, the second VLAN, and the third VLAN are the VLANs that the Ingres RB accesses.
  • RB1, RB2, RB3, and RB4 are respectively connected to the same 2000 VLANs.
  • the RBI determines the correspondence between 2000 VLANs and the distribution tree.
  • One VLAN corresponds to a distribution tree.
  • the corresponding relationship can be a VLAN with an ID ID of 1 to 1000.
  • the VLAN with the VLAN ID of 1001 to 2000 corresponds to the distribution tree of the distribution tree tree and RB6.
  • RB2, RB3, and RB4 are used as Ingres s RBs, it is also necessary to determine the correspondence between 2000 VLANs (the same as 2000 VLANs of RB1) and the distribution tree.
  • the RB1 is used as the Ingres s RB as an example.
  • each RB in the TRILL network can be used as the Ingres s RB, that is, the RB2 and the RB3 in FIG. RB4 can also perform the action of RB1.
  • RB1 also receives the extended IS-IS protocol message advertised by RB2, RB3, and RB4.
  • the Ingres s RB advertises the determined correspondence to the other RBs in the TRILL network by using the extended IS-S S protocol packet.
  • RB1 advertises the correspondence between 2000 VLANs and distribution trees to RB2, RB 3, and RB4 through the extended I S-IS protocol.
  • RB2 after receiving the extended I S-IS protocol message advertised by RB1, RB2 establishes a distribution tree forwarding table, and a forwarding record in the distribution tree forwarding table represents a VLAN and a distribution tree root RB. Relationship, thereby completing the pruning calculation for the distribution tree.
  • the RB1 is the RB1 VLAN with the VLAN ID of 1 to 1000 and the tree is the RB5 distribution tree.
  • the VLAN with the VLAN ID of 1001 to 2000 is associated with the distribution tree of the RB6.
  • the distribution tree forwarding table established by RB2 contains 2000 forwarding records, and the 2000 forwarding records respectively describe the relationship between 2000 VLANs and the distribution tree root RB.
  • RB3 and RB4 also establish a distribution tree forwarding table as shown in FIG. 4, and details are not described herein again.
  • the RB1 notification information does not include the correspondence between the VLAN and the distribution tree root RB, so the TRILL shown in FIG.
  • RB2 (or RB3 or RB4) establishes two forwarding records for each VLAN (corresponding to the two distribution tree root RBs in Figure 3), and the two forwarding records respectively describe the Correspondence between VLAN and distribution tree root RB5 and distribution tree root RB6.
  • RB2 is 2000 VLANs—a total of 4000 forwarding records are established.
  • the VLANs with the VLAN IDs of 1 to 1000 in RB1 are not associated with the distribution tree of the RB6.
  • the VLANs whose VLAN IDs are from 1001 to 2000 are not associated with the distribution tree whose root is RB5.
  • the embodiment of the present invention reduces 2000 redundant forwarding records compared with the prior art, and saves the recording resources of the distribution tree forwarding table.
  • the embodiment of the present invention is described by taking two distribution tree root RBs in the TRILL network as an example. If there are more distribution trees in the TRILL network, the present invention The benefits of the embodiment over the prior art are even more apparent. For example, if there are ten distribution trees in the TRILL network, there will be 20,000 forwarding records in the distribution tree forwarding table established by RB2. In the implementation manner of the embodiment of the present invention, only 2,000 forwardings are generated in the distribution tree forwarding table established by RB2. Recording, compared to the prior art, saves 90% of the forwarding record resources.
  • the embodiment of the present invention uses the VLAN as an example to describe step 201 and step 202 of the embodiment of the present invention.
  • a VLAN can have at least one Layer 2 multicast group, and the Layer 2 multicast group feature is used to implement the mapping between the Layer 2 multicast group and the distribution tree in the VLAN.
  • the specific characteristics of the Layer 2 multicast group are The techniques that are well known to those skilled in the art are not described in detail in the embodiments of the present invention.
  • a VLAN may have at least one Layer 3 multicast group.
  • the specific characteristics of the multicast group are implemented to implement the correspondence between the Layer 3 multicast group and the distribution tree in the VLAN. Specific features are well known to those skilled in the art, and the embodiments of the present invention are not described again.
  • the user can perform the branch tree prune for the Layer 2 multicast group in the VLAN or the VLAN or the Layer 3 multicast group in the VLAN, or the Layer 2 multicast group in the VLAN, the VLAN, and the VLAN.
  • Two or three types of layer multicast groups perform distribution tree pruning, which is not limited in this embodiment of the present invention.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network provided by the embodiment of the present invention can carry the relationship between a VLAN and a distribution tree selected for the VLAN in the extended IS-IS protocol packet, and the like.
  • the RB After receiving the extended IS-IS protocol packet, the RB only needs to establish a forwarding record for the VLAN and the distribution tree selected for the VLAN, and solves all the distribution trees that need to be selected for the VLAN and the Ingres RB in the prior art.
  • the problem of forwarding records is established, which reduces the number of forwarding records of the distribution tree forwarding table and saves resources of the distribution tree forwarding table.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can also implement a distribution tree forwarding table implementation manner for a VLAN to a layer 2 multicast group and a layer 3 in a VLAN.
  • the multicast group establishes a distribution tree forwarding table, which further saves the resources of the distribution tree forwarding table on the basis of refining the traffic forwarding mode in the VLAN.
  • Another embodiment of the present invention provides a method for implementing multicast in a transparent multi-link interconnect (TRILL) network. As shown in FIG. 6, the method is a further extension of the embodiment shown in FIG. 2. The method includes the following:
  • the Ingres s RB selects a corresponding distribution tree for at least one of a first VLAN, a Layer 2 multicast group in the second VLAN, and a Layer 3 multicast group in the third VLAN, where the first VLAN, the second VLAN,
  • the third VLAN is a VLAN accessed by the Ingres RB.
  • RB1, RB2, RB3, and RB4 are respectively connected to the same 2000 VLANs.
  • RB1 as the Ingres s RB as an example: RBI selects the corresponding distribution tree for the accessed VLAN.
  • One VLAN corresponds to a distribution tree.
  • the VLAN with the VLAN ID of 1 to 1000 can be selected as the distribution tree of the RB5.
  • the VLAN selection tree whose VLAN ID is from 1001 to 2000 is the distribution tree of RB6.
  • the RB1 is used as the Ingres s RB as an example.
  • each RB in the TRILL network can be used as the Ingres s RB, that is, the RB2 and the RB3 in FIG. RB4 can also perform the action of RB1.
  • RB1 can also receive RB2 and RB3.
  • the extended I SI S protocol of the RB4 announcement can also be used as the Ingres s RB.
  • the VLANs described in the embodiments of the present invention may be distinguished by using a VLAN identifier.
  • the VLAN identifier can be a VLAN ID.
  • the VLAN identifier may also be a refinement label (F ineLabe l).
  • the traditional VLAN ID value has 12 bits and can only identify up to 4096 VLANs (2 to the power of 12;).
  • the value of the F ineLabe l value is 24 bits, which can identify up to 16,777,216 VLANs (2 to the power of 24), which greatly increases the number of VLANs that can be accessed.
  • the Ingres s RB can statically configure the distribution tree corresponding to the distribution tree root RB for the VLAN.
  • the network administrator statically configures the VLAN according to the current network conditions of the TR I LL network.
  • the Ingres s RB may also select a distribution tree corresponding to the distribution tree root RB for the VLAN by using a VLAN identifier and a predetermined algorithm. Take the VLAN ID as the VLAN ID as an example: Ingres s RB first sorts the distribution tree root RBs in the TRILL network. According to the existing method of the TRILL basic protocol (RFC6325), the distribution tree is numbered from 1 and then corresponds to The distribution tree root RB of the distribution tree is numbered. For example, as shown in FIG. 3, the distribution tree root RB5 has the number 1 and the distribution tree root RB6 has the number 2.
  • the predetermined algorithm may be a VLAN ID module (MOD) algorithm: dividing the VLAN ID value by the number of the distribution tree root RBs in the TRILL network, and adding a remainder to add 1 to obtain the VLAN selection.
  • the distribution tree corresponding to the number of distribution tree root RBs. For example, as shown in FIG. 3, it is assumed that RB1 accesses 5 VLANs, and the VLAN IDs of the 5 VLANs are 1, 1, 3, 4, and 5, respectively.
  • the VLAN selection with the VLAN ID value of 1 is selected and numbered as The distribution tree corresponding to the distribution tree root RB of 1 (that is, the distribution tree root RB6 in FIG. 3).
  • the VLAN with VLAN IDs 3 and 5 can be calculated as the distribution tree corresponding to the root tree RB of the distribution tree root number 2.
  • the purpose of adding 1 to the remainder of the algorithm is to select the distribution tree root RB with the number 1 for the VLAN ID of the VLAN ID when the VLAN ID value is divisible by the number of the distribution tree root RB (the remainder is 0).
  • the distribution tree corresponding to the distribution tree root RB of number 1 is selected for the VLANs with VLAN IDs 2 and 4.
  • the VLAN ID modulo algorithm can also be applied to the VLAN ID with FineLabe l. In the scenario, the modulo algorithm can be used only by replacing the VLAN ID with FineLabel in the scenario. The specific implementation is not repeated here.
  • the VLAN ID module algorithm is used as a predetermined algorithm, and the predetermined algorithm in the actual application is not limited thereto.
  • the implementation method described in step 601 is used, but the VLAN ID or FineLabel described in step 601 is replaced with the Layer 2 multicast group.
  • the Media Acces s Control (MAC) address is sufficient.
  • you select a distribution tree for a Layer 3 multicast group in a VLAN you can use the implementation described in step 601 instead of replacing the VLAN ID or FineLabel described in step 601 with the inter-network protocol of the Layer 3 multicast group. (Internet Protocol, IP) address can be.
  • IP Internet Protocol
  • the Ingres s RB passes the extended IS-IS link state (Link State).
  • Packet, LSP advertises the selected correspondence to other RBs.
  • the extended IS-IS LSP includes a newly defined type length value (type length va lue, TLV).
  • TLV type length va lue
  • RB1 advertises the relationship between 2000 VLANs and distribution tree to RB2, RB3, and RB4 through TLV.
  • RB2, RB3, and RB4 also distribute 2000 VLANs through TLVs.
  • the tree correspondence is advertised to other RBs other than itself.
  • the TLV carries a VLAN ID (or FineLabel) of the VLAN and a correspondence relationship between the VLAN and the distribution tree selected for the VLAN. For example, when a distribution tree is selected for a Layer 2 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 2 multicast group.
  • the TLV when a distribution tree is selected for a Layer 3 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 3 multicast group.
  • the IP address can be used as the identifier of the Layer 3 multicast group.
  • the RB may carry an identifier of multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) and an alias of a distribution tree root RB in one TLV.
  • the identifier carrying multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) is used to describe multiple VLANs (or Layer 2 multicast groups or three) in one TLV.
  • Layer multicast group The selected distribution tree (same distribution tree), which reduces the number of TLVs sent and saves TRILL network resources.
  • the VLAN ID and the VLAN ID are used as the VLAN ID.
  • the RB can carry two VLAN IDs and one alias of the distribution tree root RB in one TLV.
  • the two VLAN IDs are all in the ID value interval.
  • the VLAN corresponding to the VLAN ID selects the distribution tree root RB as the distribution tree.
  • the RB may carry a bitmap (bi tmap map) and an alias of the distribution tree root RB in one TLV, and each bit in the bitmap represents a VLAN accessed in the RB.
  • the bit is 1
  • the VLAN corresponding to the bit selects the distribution tree root RB as the distribution tree.
  • the bit is G
  • the VLAN corresponding to the bit does not select the distribution tree root RB as the distribution tree.
  • a batch advertisement of a Layer 2 multicast group selection distribution tree can be implemented in a TLV through a MAC address + mask.
  • a batch advertisement of a Layer 3 multicast group selection distribution tree can be implemented in a TLV by using an IP address + mask.
  • RB2 After receiving the extended I SI S LSP advertised by RB1, RB2 establishes a distribution tree forwarding table.
  • One record in the forwarding table represents a VLAN and a distribution tree. The correspondence between the root RBs, thereby completing the pruning calculation for the distribution tree.
  • the RB1 is the distribution tree of the RB5 with the VLAN ID of 1 to 1000, and the distribution tree of the RB6 is selected for the VLAN with the VLAN ID of 1001 to 2000. Therefore, as shown in Figure 4, the RB2 is established.
  • the publication contains 2000 forwarding records, which describe the relationship between 2000 VLANs and the distribution tree root RB.
  • RB1, RB2, and RB3 also establish a distribution tree forwarding table as shown in Figure 4, which is not described here.
  • the RB1 notification information does not include the correspondence between the VLAN and the distribution tree root RB, as shown in FIG. 3, after receiving the advertisement information, RB2 (or RB3, RB4) is used for each VLAN. Two forwarding records are created, and the two forwarding records respectively describe the correspondence between the VLAN and the distribution tree root RB5 and the distribution tree root RB6.
  • RB2 is 2000 VLANs—a total of 4000 forwarding records are established.
  • the RB1 does not select the distribution tree corresponding to the distribution tree root RB5 for the VLAN with the VLAN ID of 1 to 1000, and does not select the distribution tree corresponding to the distribution tree root RB6 for the VLAN with the VLAN ID of 1001 to 2000.
  • Extra forwarding records As shown in FIG. 4 and FIG. 5, the embodiment of the present invention reduces the establishment of 2000 forwarding records compared with the prior art, and saves resources of the distribution tree forwarding table.
  • the embodiment of the present invention is described by taking two distribution tree root RBs in the TRILL network as an example. If there are more distribution trees in the TRILL network, the present invention The benefits of the embodiment over the prior art are even more apparent. For example, if there are ten distribution trees in the TRILL network, there will be 20,000 forwarding records in the distribution tree forwarding table established by RB2. In the implementation manner of the embodiment of the present invention, only 2,000 forwardings are generated in the distribution tree forwarding table established by RB2. Recording, compared to the prior art, saves 90% of the forwarding record resources.
  • the distribution tree root RB also receives the extended IS-IS LSP advertised by the Ingres s RB and establishes a distribution tree forwarding table.
  • the network shown in Figure 3 Take the distribution tree root RB5 as an example: The distribution tree root RB5 receives the extended IS-IS LSP advertised by RB1 and establishes the distribution tree forwarding table as shown in Figure 7. Since only the VLANs of VLAN IDs 1 to 1000 in RB1 select the distribution tree root RB5, there are only 1000 forwarding records in the distribution tree forwarding table shown in Figure 7. In the prior art, as shown in FIG.
  • the distribution tree root RB5 needs to establish a forwarding record for 2000 VLANs of VLAN IDs 1 to 2000 in RB1, and a forwarding record established for 1000 VLANs of VLAN IDs 1001 to 2000 in RB1. It is an extra forwarding record.
  • the distribution tree root RB in the embodiment of the present invention reduces 1000 forwarding records.
  • the application scenario when there are still old RBs in the TRILL network that do not support the extended IS-IS LSP, the application scenario also provides an implementation manner that supports the new and old RB compatibility.
  • FIG. 9 there are one distribution tree root RB (RB5 and RB6) and RB1, RB2, RB3, and RB4 in the TRILL network, and RB1, RB2, and RB4 all access 2000 of VLAN IDs 1 to 2000.
  • VLAN, VLAN ID 1 to 1000 1000 VLANs are selected as the distribution tree of the distribution tree root RB5
  • 1000 VLANs of VLAN IDs 1001 to 2000 are selected as the distribution tree of the distribution tree root RB6.
  • RB3 accesses 100 VLANs of VLAN IDs 1 to 100, 50 VLANs of VLAN IDs 1 to 50 select the distribution tree of the distribution tree root RB5, and 50 VLANs of VLAN IDs 51 to 100 select the distribution tree of the distribution tree root RB6.
  • RB3 is an old-fashioned RB that does not support extended IS-IS LSP.
  • RB1, RB2, and RB4 perform 603 at the same time as step 602, and correspondingly allocate the selected distribution tree to the accessed VLAN (or Layer 2 multicast group or Layer 3 multicast group) through the TRILL existing protocol packet format. Relationships are advertised to other RBs.
  • the other RBs include a new RB and an old RB.
  • Older RBs only use the TRILL existing protocol packet format to select the distribution tree and the access VLAN (or Layer 2 multicast group or Layer 3 multicast). Group) is advertised to other RBs, which include new RBs and old RBs.
  • the distribution tree forwarding table is established, there are three ways to establish a distribution tree forwarding table for the new and old RBs. 1) The new RB establishes a distribution tree forwarding table according to the extended IS-IS LSP advertised by the new RB. 1) The new RB establishes a distribution tree forwarding table according to the existing protocol packet format of the old RB.
  • the old-fashioned RB establishes a distribution tree forwarding table according to the existing protocol packet format of the old RB, and the existing protocol message format is from the old-fashioned RB or the new-type RB.
  • the old-fashioned RB does not support the extended IS-IS LSP.
  • the old-fashioned RB After receiving the extended IS-IS LSP advertised by the new RB, the old-fashioned RB will discard and do nothing, and only process the received TRILL existing protocol packet format.
  • the distribution tree forwarding table established by RB1, RB2, or RB4 according to the extended IS-IS LSP and the existing protocol packet format is shown in Figure 10. A total of 2100 forwarding records are established.
  • the forwarding records of the 50 VLANs of the VLAN IDs 1 to 50 and the distribution tree root RB6 and the 50 VLANs of the VLAN IDs 51 to 100 and the forwarding records of the distribution tree root RB5 are redundant forwarding caused by the existing protocol packet format. Recording, but compared to the prior art, this new and old compatible application scenario still saves forwarding records. If RB1 to RB4 in Figure 9 are both old-fashioned RBs, the forwarding table established by RB1, RB2 or RB4 is as shown in Fig. 11, and a total of 4000 forwarding records are established. This scenario still saves 1900 forwarding records compared to the prior art. This implementation scenario provides support for new and old RB-compatible implementations.
  • the forwarding table resource is highly saved (because the old RB follows the existing protocol packet).
  • the format of the distribution tree forwarding table is established.
  • the implementation provided by this application scenario is still improved compared with the prior art. As long as there are at least two new RBs in the TRILL network, there are advantages compared with the prior art.
  • the ingress RB when the ingress RB does not select a distribution tree for the layer 2 multicast group, the ingress RB broadcasts the layer 2 group in the VLAN range to which the layer 2 multicast group belongs. Broadcast message. For example, when the ingress RB does not select a distribution tree for the Layer 3 multicast group, the ingress RB broadcasts the four layers of the multicast group within the VLAN to which the Layer 3 multicast group belongs. Ensure that Layer 2 multicast groups or Layer 3 multicast group traffic can be forwarded in the TRILL network under any conditions.
  • the TRILL network has both RBs that support prune for the VLAN and both the prune and the support for the VLAN are supported.
  • the embodiment of the present invention further provides a compatible implementation manner of establishing a distribution tree forwarding table when performing prune RBs on a Layer 2 multicast group or a Layer 3 multicast group.
  • RB1 and RB2 support prune for VLANs and pruning for Layer 2 multicast groups or Layer 3 multicast groups.
  • RB3 and RB4 only support pruning for VLANs.
  • RB3 and RB4 advertise the VLAN-selected distribution tree to other RBs only through the extended I S-IS LSP, and RB1 and RB2 advertise the VLAN selection of the distribution tree to the other RBs through the extended IS-IS LSP.
  • Distribution tree selected by group or Layer 3 multicast group When receiving the extended IS-IS LSP, RB3 and RB4 establish a VLAN distribution tree forwarding table only according to the distribution tree selected by the VLAN in the extended IS-IS LSP, and RB1 and RB2 are based on the received extension.
  • the distribution tree of the VLAN selected in the IS-IS LSP establishes a distribution tree forwarding table of the VLAN, and is also established according to the distribution tree selected by the Layer 2 multicast group or the Layer 3 multicast group in the extended IS-IS LSP. Distribution tree forwarding table of a Layer 2 multicast group or a Layer 3 multicast group.
  • the RB For the distribution tree selected by the RB as the access VLAN (or the Layer 2 multicast group or the Layer 3 multicast group), the RB is the Egres of the VLAN (or Layer 2 multicast group or Layer 3 multicast group). s RB is also the Ingres s RB of the packet traffic of the VLAN (or the Layer 2 multicast group or the Layer 3 multicast group).
  • the TRILL network-side packet that the RB accesses the tree root alias and VLAN are distributed according to the destination in the packet. After the RB entry is searched, the TRILL packet is decapsulated, and the local forwarding table is used to send the packet to the local egress port.
  • the distribution tree root alias corresponding to the VLAN is found, and then the distribution tree entry is found according to the distribution tree root alias and the VLAN, and after the entry is recorded, the multicast replication is performed to the TRILL network side and sent out from the corresponding outbound interface.
  • the concept of the Egres s RB and the Ingres s RB in the embodiment of the present invention is defined in the function of the RB to forward the packet traffic.
  • the RB receives the packet traffic sent by the TRILL network and re-encapsulates the packet traffic by TRILL.
  • the RB is Egres s RB.
  • the RB receives the traditional Layer 2 traffic and sends the traditional Layer 2 traffic to the TRILL network
  • the RB is the Ingres s RB.
  • the embodiment of the present invention takes a VLAN as an example for description.
  • a VLAN may have at least one Layer 2 multicast group, and the implementation of the Layer 2 multicast component splicing is the same as that of the foregoing embodiment, and the specific characteristics of the Layer 2 multicast group are implemented to implement the VLAN.
  • Medium Layer 2 multicast group and distribution tree The corresponding characteristics of the Layer 2 multicast group are well known to those skilled in the art, and are not described in detail in the embodiments of the present invention.
  • a VLAN can have at least one Layer 3 multicast group.
  • the specific characteristics of the Layer 3 multicast group and the distribution tree in the VLAN are implemented.
  • the specific characteristics of the Layer 3 multicast group are also not described in detail in the embodiments of the present invention.
  • the user can perform the branch tree prune for the Layer 2 multicast group in the VLAN or the VLAN or the Layer 3 multicast group in the VLAN, or the Layer 2 multicast group in the VLAN, the VLAN, and the VLAN.
  • Two or three types of layer multicast groups perform distribution tree pruning, which is not limited in this embodiment of the present invention.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can carry the relationship between a VLAN and a distribution tree selected for the VLAN in the extended IS-IS LSP, and other RBs are in the After receiving the extended IS-IS LSP, it is only necessary to establish a forwarding record for the VLAN and the distribution tree selected for the VLAN. This solves the problem that the forwarding between the distribution trees selected for the VLAN and the Ingres RB is required in the prior art. The recorded problem reduces the number of forwarding records of the distribution tree forwarding table and saves resources of the distribution tree forwarding table.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can also implement a distribution tree forwarding table implementation manner for a VLAN to a layer 2 multicast group and a layer 3 in a VLAN.
  • the multicast group establishes a distribution tree forwarding table, which further saves the resources of the distribution tree forwarding table on the basis of refining the traffic forwarding mode in the VLAN.
  • the method for implementing multicast in a transparent multi-link interconnect (TRILL) network can also notify other RBs as multiple VLANs or in batches in an extended IS-IS LSP.
  • the distribution tree selected by the Layer 2 multicast group or the Layer 3 multicast group can reduce the number of extended IS-IS LSPs in the TRILL network and save TRILL network resources.
  • Another embodiment of the present invention provides a method for implementing multicast in a transparent multi-link interconnect (TRILL) network. As shown in FIG. 13, the method is a further extension to the embodiment shown in FIG. 2. The method includes:
  • the Ingres s RB corresponds to the mapping between all VLANs and distribution trees in the TRILL network advertised by the highest root-priority RB, the mapping between Layer 2 multicast groups and distribution trees in the VLAN, and Layer 3 multicast in the VLAN. Selecting at least one of the correspondence between the group and the distribution tree is to select a corresponding distribution tree for at least one of the first VLAN, the Layer 2 multicast group in the second VLAN, and the Layer 3 multicast group in the third VLAN, The first VLAN, the second VLAN, and the third VLAN are VLANs that the Ingres RB accesses.
  • the highest priority RB is the highest root priority RB. If there are at least two RBs with the same priority, the RBs are sorted according to the sys tern ID value of each RB, and the RBs with large sys tern ID values are ranked first. If there are cases where the sys tem ID values of at least two RBs are the same, the RBs are sorted according to the ni ckname value of the RB, and the RBs with large ni ckname values are ranked first. After sorting the RBs, the RB with the highest ranking position is the highest root priority RB.
  • the highest root priority RB may specify any RB (including itself) as a distribution tree root RB.
  • the distribution tree root RB5 accesses 100 VLANs of VLAN IDs 1 to 100, and RB2, RB3, and RB4 access 2000 of VLAN ID1 to 2000 respectively.
  • VLAN the distribution tree root RB5 is the highest root priority RB.
  • the distribution tree root RB5 selects the distribution tree for the 2000 VLANs connected to the TRILL network.
  • the specific implementation is the same as the implementation of the Ingres ss RB for the VLAN selection distribution tree in step 601 of Figure 6. It can be implemented with reference to 601 of FIG. 6.
  • the distribution tree root RB5 selects the distribution tree tree for the 1000 VLANs of VLAN IDs 1 to 1000, RB5, and selects the distribution tree tree 4 ⁇ RB6 for 1000 VLANs of VLAN ID1 001 to 2000.
  • the RBI After receiving the extended I S-I S LSP advertised by the RB5, the RBI selects the VLAN advertised to other RBs and the corresponding relationship between the VLAN and the distribution tree. For example, because RB1 is connected to VLANs with VLAN IDs 1 to 100, and the distribution tree root RB5 selects the distribution tree tree for RB 5 for VLANs ID 1 to 100, RB1 is 100 of VLAN IDs 1 to 100. VLAN selection distribution tree root RB5. RB2, RB3, or RB4 is connected to 2000 VLANs of VLAN IDs 1 to 2000, so RB2, RB3, or RB4 is based on the distribution tree tree. The extended I SI S LSP of RB5 is selected for 1000 VLANs of VLAN ID 1 to 1000. The distribution tree is only RB5, and the distribution tree is selected for 1000 VLANs of VLAN IDs 1001 to 2000.
  • the Ingres ss RB selects the distribution tree for the VLAN according to the extended I SI S LSP advertised by the highest root priority RB, only the extended I SI S LSP advertised by the highest root priority RB is carried.
  • the VLAN that the Ingres ss RB accesses selects the distribution tree.
  • a VLAN is taken as an example for description.
  • the distribution tree pruning can be performed on a Layer 2 multicast group or a Layer 3 multicast group in a VLAN by referring to the method of performing the distribution tree pruning on the VLAN.
  • the implementation of Figure 13 is implemented in combination with the characteristics of a Layer 2 multicast group or a Layer 3 multicast group, and is not described here.
  • the Ingres s RB advertises the selected correspondence to the other by using the extended IS-IS LSP.
  • Step 1302 is the same as the implementation of 602 in the embodiment shown in FIG. 6, and details are not described herein again.
  • the Ingres s RB can also advertise the selected correspondence to other RBs through the TRILL existing protocol format.
  • the TRILL existing message protocol format and the implementation process of the advertisement used by the Ingres s RB are the same as the TRILL existing protocol format and the notification implementation process of the old RB in the old and new RB compatible scenarios in the previous embodiment. You can refer to the implementation of the old RB.
  • the user can perform the branch tree prune for the Layer 2 multicast group in the VLAN or the VLAN or the Layer 3 multicast group in the VLAN, or the Layer 2 multicast group in the VLAN, the VLAN, and the Layer 3 in the VLAN.
  • the distribution tree pruning is performed by two or three types in the multicast group, which is not limited in this embodiment of the present invention.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can carry the relationship between a VLAN and a distribution tree selected for the VLAN in the extended IS-IS LSP, and other RBs are in the After receiving the extended IS-IS LSP, it is only necessary to establish a forwarding record for the VLAN and the distribution tree selected for the VLAN. This solves the problem that the forwarding between the distribution trees selected for the VLAN and the Ingres RB is required in the prior art. The recorded problem reduces the number of forwarding records of the distribution tree forwarding table and saves resources of the distribution tree forwarding table.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can also implement a distribution tree forwarding table implementation manner for a VLAN to a layer 2 multicast group and a layer 3 in a VLAN.
  • the multicast group establishes a distribution tree forwarding table, which further saves the resources of the distribution tree forwarding table on the basis of refining the traffic forwarding mode in the VLAN.
  • the embodiment of the invention provides a method for implementing multicast in a transparent multi-link interconnection (TRILL) network. As shown in FIG. 15, the method includes:
  • the RB receives at least one of the following correspondences advertised by the Ingres s RB: the first VLAN Correspondence between the relationship with the distribution tree, the mapping between the Layer 2 multicast group and the distribution tree in the second VLAN, and the mapping between the Layer 3 multicast group and the distribution tree in the third VLAN, the first VLAN, the second VLAN, and the first The three VLANs are the VLANs that the Ingres s RB accesses.
  • the RB includes Ingres s RB, Egres s RB, Trans i t RB.
  • the Ingres s RB advertises the selected correspondence to the RB through the extended IS-IS LSP.
  • the extended IS-IS LSP includes a newly defined TLV.
  • RB2, RB3, and RB4 respectively receive the correspondence between 2000 VLANs and distribution trees that RB1 advertises through TLV.
  • the TLV carries the VLAN ID (or FineLabe l ) of the VLAN and the alias ( Nickname ) of the distribution tree root RB corresponding to the distribution tree selected for the VLAN, thereby describing the VLAN and the distribution tree selected for the VLAN.
  • the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 2 multicast group.
  • the MAC address can be used as the identifier of the Layer 2 multicast group.
  • the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 3 multicast group.
  • the IP address can be used as the identifier of the Layer 2 multicast group.
  • the Ingres s RB can carry the identifiers of multiple VLANs (or Layer 2 multicast groups or Layer 3 multicast groups) and the alias of one distribution tree root RB in one TLV.
  • the identifier carrying multiple VLANs is used to describe a distribution tree selected by multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) in one TLV. (Distribution tree corresponding to the same distribution tree root RB), thereby reducing the number of TLVs sent and saving TRILL network resources.
  • the VLAN ID is used as the VLAN ID.
  • the Ingres s RB can carry two VLAN IDs and one alias of the distribution tree root RB in one TLV.
  • the two VLAN IDs form an ID value interval.
  • the VLAN corresponding to all the VLAN IDs in the VLAN is selected as the distribution tree.
  • the Ingres s RB may carry a bitmap (bi tmap map) and an alias of the distribution tree root RB in one TLV, and each bit in the bitmap represents a VLAN accessed in the RB. When the bit is 1, it indicates that the VLAN corresponding to the bit selects the distribution tree root RB as a distribution tree. When the bit is 0, The VLAN corresponding to the bit does not select the distribution tree root RB as the distribution tree.
  • a batch advertisement of a Layer 2 multicast group selection distribution tree can be implemented in a TLV through a MAC address + mask.
  • a batch advertisement of a Layer 3 multicast group selection distribution tree can be implemented in a TLV by using an IP address + mask.
  • the RB prune the distribution tree according to the advertisement of the Ingres s RB, and establishes a pruned distribution tree forwarding table.
  • RB2 After receiving the extended I SI S LSP advertised by RB1, RB2 establishes a distribution tree forwarding table.
  • One record in the forwarding table represents a VLAN and a distribution tree. The correspondence between the root RBs, thereby completing the pruning calculation for the distribution tree.
  • the RB1 is the distribution tree of the RB5 with the VLAN ID of 1 to 1000, and the distribution tree of the RB6 is selected for the VLAN with the VLAN ID of 1001 to 2000. Therefore, as shown in Figure 4, the RB2 is established.
  • the publication contains 2000 forwarding records, which describe the relationship between 2000 VLANs and the distribution tree root RB.
  • the RB2 (or RB3, RB4) establishes two forwarding records for each VLAN after receiving the notification information.
  • the two forwarding records respectively describe the correspondence between the VLAN and the distribution tree root RB5 and the distribution tree root RB6.
  • RB2 is 2000 VLANs—a total of 4000 forwarding records are established.
  • the RB1 does not select the distribution tree corresponding to the distribution tree root RB5 for the VLAN with the VLAN ID of 1 to 1000, and does not select the distribution tree corresponding to the distribution tree root RB6 for the VLAN with the VLAN ID of 1001 to 2000.
  • Extra forwarding records As can be seen from FIG. 4 and FIG. 5, the embodiment of the present invention reduces the establishment of 2000 forwarding records compared with the prior art, and saves resources of the distribution tree forwarding table.
  • the embodiment of the present invention is described by taking two distribution tree root RBs in the TRILL network as an example. If there are more distribution trees in the TRILL network, the present invention The benefits of the embodiment over the prior art are even more apparent. For example, if there are ten distribution trees in the TRILL network, there will be 20,000 forwarding records in the distribution tree forwarding table established by RB2. In the implementation manner of the embodiment of the present invention, only 2,000 forwardings are generated in the distribution tree forwarding table established by RB2. Recording, compared to the prior art, saves 90% of the forwarding record resources.
  • the distribution tree root RB also receives the extended IS-IS LSP advertised by the Ingres s RB and establishes a distribution tree forwarding table. Take the network shown in Figure 3 as an example. Take the distribution tree root RB5 as an example. The distribution tree root RB5 receives the extended IS-IS LSP advertised by RB1 and establishes a distribution tree forwarding table as shown in Figure 7. Since only the VLANs of VLAN IDs 1 to 1000 in RB1 select the distribution tree root RB5, there are only 1000 forwarding records in the distribution tree forwarding table shown in FIG. In the prior art, as shown in FIG.
  • the distribution tree root RB5 needs to establish a forwarding record for 2000 VLANs of VLAN IDs 1 to 2000 in RB1, and a forwarding record established for 1000 VLANs of VLAN IDs 1001 to 2000 in RB1. It is an extra forwarding record.
  • the distribution tree root RB in the embodiment of the present invention reduces 1000 forwarding records.
  • the user can perform the branch tree prune for the Layer 2 multicast group in the VLAN or the VLAN or the Layer 3 multicast group in the VLAN, or the Layer 2 multicast group in the VLAN, the VLAN, and the Layer 3 in the VLAN.
  • the distribution tree pruning is performed by two or three types in the multicast group, which is not limited in this embodiment of the present invention.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can carry the relationship between a VLAN and a distribution tree selected for the VLAN in the extended IS-IS LSP, and the RB is receiving After the extended IS-IS LSP, it is only necessary to establish a forwarding record for the VLAN and the distribution tree selected for the VLAN.
  • the problem is that the number of forwarding records of the distribution tree forwarding table is reduced, and the resources of the distribution tree forwarding table are saved.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can also implement a distribution tree forwarding table implementation manner for a VLAN to a layer 2 multicast group and a layer 3 in a VLAN.
  • the multicast group establishes a distribution tree forwarding table, which further saves the resources of the distribution tree forwarding table on the basis of refining the traffic forwarding mode in the VLAN.
  • the method for implementing multicast in a transparent multi-link interconnect (TRILL) network can also notify the RB as multiple VLANs or two in batches in an extended IS-IS LSP.
  • the distribution tree selected by the layer multicast group or the Layer 3 multicast group can reduce the number of extended IS-IS LSPs in the TRILL network and save TRILL network resources.
  • the embodiment of the invention provides a method for implementing multicast in a transparent multi-link interconnection (TRILL) network. As shown in FIG. 16, the method includes: 1601. The highest root-priority RB selects a corresponding distribution tree for at least one of all the VLANs in the TRILL network, the Layer 2 multicast group in the VLAN, and the Layer 3 multicast group in the VLAN.
  • TRILL transparent multi-link interconnection
  • the highest priority RB is the highest root priority RB. If there are at least two RBs with the same priority, the RBs are sorted according to the sys tern ID value of each RB, and the RBs with large sys tern ID values are ranked first. If there are cases where the sys tem ID values of at least two RBs are the same, the RBs are sorted according to the ni ckname value of the RB, and the RBs with large ni ckname values are ranked first. After sorting the RBs, the RB with the highest ranking position is the highest root priority RB.
  • the highest root priority RB may specify any RB (including itself) as a distribution tree root RB.
  • RB1 accesses 100 VLANs of VLAN IDs 1 to 100
  • RB2, RB3, and RB4 access VLAN ID1 respectively.
  • distribution tree root RB5 is the highest root priority RB.
  • the distribution tree root RB5 selects the distribution tree for the 2000 VLANs connected to the TRILL network
  • the distribution tree root RB5 selects the distribution tree for the 1000 VLANs of VLAN IDs 1 to 1000.
  • the highest root-root priority RB through the extended I SI S protocol packet, the correspondence between all the VLANs in the TRILL network and the distribution tree, the correspondence between the Layer 2 multicast group and the distribution tree in the VLAN, and the Layer 3 multicast group in the VLAN. At least one correspondence in the distribution tree correspondence is advertised to other RBs in the TRILL network.
  • the Ingres s RB After receiving the notification of the root tree RB of the distribution tree, the Ingres s RB selects the corresponding distribution tree and associates the VLAN with the distribution tree and the mapping between the Layer 2 multicast group and the distribution tree in the VLAN through the extended I SI S protocol. At least one of the mappings between the three-layer multicast group and the distribution tree in the VLAN is advertised to the other RBs, so that the other RBs prune the distribution tree according to the extended I S-IS protocol packet, and establish a distribution tree switch. Published.
  • the user can perform the branch tree prune for the Layer 2 multicast group in the VLAN or the VLAN or the Layer 3 multicast group in the VLAN, or the Layer 2 multicast group in the VLAN, the VLAN, and the Layer 3 in the VLAN.
  • the distribution tree pruning is performed by two or three types in the multicast group, which is not limited in this embodiment of the present invention.
  • the method for implementing multicast in a transparent multi-link interconnect (TRILL) network can select a distribution tree by using a highest root-priority RB for a VLAN, and report the extended I SI S protocol.
  • the advertisement advertises the relationship between the VLAN and the distribution tree selected for the VLAN to the Ingres RB, so that the Ingres s RB selects the VLAN and advertises the selected VLAN and the distribution tree corresponding to the VLAN to other RBs, and the other RBs receive
  • a forwarding record is established for the VLAN and the distribution tree selected for the VLAN.
  • the problem that the forwarding records need to be established between all the distribution trees selected by the VLAN and the Ingres RB in the prior art is solved, the number of forwarding records of the distribution tree forwarding table is reduced, and the resources of the distribution tree forwarding table are saved.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can also implement a distribution tree forwarding table implementation manner for a VLAN to a layer 2 multicast group and a layer 3 in a VLAN.
  • the multicast group establishes a distribution tree forwarding table, which further saves the resources of the distribution tree forwarding table on the basis of refining the traffic forwarding mode in the VLAN.
  • Another embodiment of the present invention provides a method for implementing multicast in a transparent multi-link interconnect (TRILL) network. As shown in FIG. 17, the method is a further extension of the embodiment shown in FIG. 16. The method includes:
  • the highest tree root priority RB selects the corresponding distribution tree for at least one of the VLANs in the TRILL network, the Layer 2 multicast group in the VLAN, and the Layer 3 multicast group in the VLAN.
  • the highest priority RB is the highest root priority RB. If there are at least two RBs with the same priority, the RBs are sorted according to the sys tern ID value of each RB, and the RBs with large sys tern ID values are ranked first. If there are cases where the sys tem ID values of at least two RBs are the same, the RBs are sorted according to the ni ckname value of the RB, and the RBs with large ni ckname values are ranked first. After sorting the RBs, the RB with the highest ranking position is the highest root priority RB.
  • the highest root priority RB may specify any RB (including itself) as a distribution tree root RB.
  • RB1 accesses 100 VLANs of VLAN IDs 1 to 100
  • RB2, RB3, and RB4 access VLAN ID1 respectively.
  • distribution tree root RB5 is the highest root priority RB.
  • the distribution tree root RB5 selects the distribution tree for the 2000 VLANs connected to the TRILL network
  • the distribution tree root RB5 selects the distribution tree for the 1000 VLANs of VLAN IDs 1 to 1000.
  • the RB5 of the distribution tree can be statically configured as a VLAN.
  • the distribution tree corresponding to the root RB of the distribution tree is selected.
  • the network administrator statically configures the VLAN according to the current network conditions of the TRILL network.
  • the distribution tree root RB5 may also select a distribution tree corresponding to the distribution tree root RB for the VLAN by using a VLAN identifier and a predetermined algorithm.
  • the VLAN ID is used as the VLAN ID as an example.
  • the distribution tree root RBs in the TRILL network are sorted. The distribution tree is numbered starting from 1 according to the existing method of the TRILL basic protocol (RFC6325), and then corresponding to the distribution tree.
  • the distribution tree root RB is numbered. For example, as shown in Figure 14, the distribution tree root RB5 is numbered 1 and the distribution tree root RB 6 is numbered 2.
  • the predetermined algorithm may be a VLAN ID modulo (MOD) algorithm: dividing the VLAN ID value by the number of the distribution tree root RBs in the TRILL network, and adding the remainder to add 1 to obtain the VLAN selection.
  • the distribution tree corresponding to the distribution tree root RB of the number is distributed. For example, as shown in Figure 3, RB1 is connected to five VLANs, and the VLAN IDs of the five VLANs are 1, 2, 3, 4, and 5.
  • VLAN ID with the VLAN ID value of 1 is selected and numbered as The distribution tree corresponding to the distribution tree root RB of 2 (that is, the distribution tree root RB6 in FIG. 3). Similarly, a VLAN with VLAN IDs 3 and 5 can be calculated. The same distribution tree as the distribution tree root RB numbered 2 is also selected.
  • the purpose of adding 1 to the remainder of the algorithm is to select the distribution tree root RB with the number 1 for the VLAN ID of the VLAN ID when the VLAN ID value is divisible by the number of the distribution tree root RB (the remainder is 0).
  • the VLAN with the VLAN IDs 2 and 4 is selected as the distribution tree corresponding to the root tree RB of the distribution tree.
  • the VLAN ID modulo algorithm can also be applied to the scenario where FineLabe l is used as the VLAN identifier. In this scenario, you can use the FineLabe l instead of the VLAN ID to use the modulo algorithm. The specific implementation is not mentioned here.
  • the VLAN ID module algorithm is used as a predetermined algorithm, and the predetermined algorithm in the actual application is not limited thereto.
  • mapping between the VLAN and the distribution tree, the mapping between the Layer 2 multicast group and the distribution tree in the VLAN, and the mapping between the Layer 3 multicast group and the distribution tree in the VLAN are performed in the extended I-S-IS LSP. At least one corresponding relationship is advertised to other RBs in the TR I LL network.
  • the extended extended IS-IS LSP includes a newly defined TLV.
  • the TLV carries the VLAN ID (or FineLabe l ) of the VLAN and the alias ( Nickname ) of the distribution tree root RB corresponding to the distribution tree selected for the VLAN, thereby describing the VLAN and the distribution tree selected for the VLAN.
  • Correspondence relationship For example, when a distribution tree is selected for a Layer 2 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 2 multicast group.
  • the MAC address can be used as the identifier of the Layer 2 multicast group.
  • the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 3 multicast group.
  • the IP address can be used as the identifier of the Layer 3 multicast group.
  • the highest root-priority RB may carry an identifier of multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) and an alias of a distribution tree root RB in one TLV.
  • the identifier carrying multiple VLANs is used to describe a distribution tree selected by multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) in one TLV. (Same distribution tree) to reduce the number of TLVs sent and save TRILL network resources.
  • the VLAN ID is used as the VLAN ID as an example:
  • the RB can carry two VLAN IDs and one alias of the distribution tree root RB in one TLV, and the two VLAN IDs are all in the ID value interval.
  • the VLAN corresponding to the VLAN ID selects the distribution tree root RB as the distribution tree.
  • the highest root priority RB may carry a bitmap (bi tmap map) and an alias of a distribution tree root RB in one TLV, where each bit in the bitmap represents a VLAN accessed in the RB. . When the bit is 1, the VLAN corresponding to the bit selects the distribution tree root RB as the distribution tree.
  • the VLAN corresponding to the bit does not select the distribution tree root RB as the distribution tree.
  • a batch advertisement of a Layer 2 multicast group selection distribution tree can be implemented in a TLV through a MAC address + mask.
  • Layer 3 multicast can be implemented in a TLV by IP address + mask. The group selects the batch notification of the distribution tree.
  • the ingress RB After receiving the advertisement of the highest root-priority RB, the ingress RB selects the corresponding distribution tree and associates the VLAN with the distribution tree through the extended IS-IS LSP or the mapping between the Layer 2 multicast group and the distribution tree in the VLAN. Or the corresponding relationship between the Layer 3 multicast group and the distribution tree in the VLAN is advertised to other RBs, so that the other RBs prune the distribution tree according to the advertised extended IS-IS LSP, and establish a distribution tree forwarding table.
  • the ingress RB when the ingress RB selects the distribution tree for the VLAN according to the extended IS-IS LSP advertised by the highest root priority RB, the ingress RB carries only the extended IS-IS LSP advertised by the highest root-priority RB.
  • the VLAN of the ingress RB accesses the distribution tree root RB.
  • the user can perform the branch tree prune for the Layer 2 multicast group in the VLAN or the VLAN or the Layer 3 multicast group in the VLAN, or the Layer 2 multicast group in the VLAN, the VLAN, and the Layer 3 in the VLAN.
  • the distribution tree pruning is performed by two or three types in the multicast group, which is not limited in this embodiment of the present invention.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can select a distribution tree by using a highest root-priority RB for the VLAN, and the VLAN is the extended IS-IS LSP.
  • the relationship between the VLANs selected by the VLAN is advertised to other RBs, so that the Ingress RB selects the VLAN and advertises the selected VLAN and the distribution tree corresponding to the VLAN to other RBs.
  • the other RBs are VLANs after receiving the advertisement of the Ingress RB.
  • Establish a forwarding record for the distribution tree selected by the VLAN The problem that the forwarding records are set up in all the distribution trees selected by the VLAN and the ingress RB in the prior art is solved, the number of forwarding records of the distribution tree forwarding table is reduced, and the resources of the distribution tree forwarding table are saved.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can also implement a distribution tree forwarding table implementation manner for a VLAN to a layer 2 multicast group and a layer 3 in a VLAN.
  • the multicast group establishes a distribution tree forwarding table, which further saves the resources of the distribution tree forwarding table on the basis of refining the traffic forwarding mode in the VLAN.
  • the method for implementing multicast in a transparent multi-link interconnection (TRILL) network can also be statically selected by a distribution tree for a VLAN (or a Layer 2 multicast group or a Layer 3 multicast group).
  • the configuration or algorithm is migrated to the highest root priority RB.
  • the highest tree root priority RB is used to select the distribution tree for the VLAN (or Layer 2 multicast group or Layer 3 multicast group).
  • Embodiments of the present invention are relative to the present The technology can further reduce the resource cost of static configuration or algorithm coordination in each Ingres RB, and improve the intelligence of distribution tree pruning in the TRILL network.
  • an embodiment of the present invention provides an Ingres s RB, as shown in FIG. 18, to implement the method embodiment shown in FIG.
  • the Ingres s RB includes: a processor 1801 and a transmitter 1802, where
  • the processor 1801 is configured to determine at least one of the following correspondences: a correspondence between a first VLAN and a distribution tree, a correspondence between a layer 2 multicast group and a distribution tree in the second VLAN, and a third VLAN
  • the first VLAN, the second VLAN, and the third VLAN are the VLANs that the Ingres RB accesses.
  • the transmitter 1802 is configured to advertise the determined correspondence to the other RBs in the TRILL network by using the extended IS-IS protocol packet, so that the other RBs prune the distribution tree according to the advertisement, and establish a pruned distribution tree. Forwarding table.
  • the processor 1801 may include:
  • the first selecting unit 1901 is configured to select a corresponding distribution tree for at least one of a first VLAN, a Layer 2 multicast group in the second VLAN, and a Layer 3 multicast group in the third VLAN.
  • the extended IS-IS protocol message advertised by the transmitter 1802 includes an extended IS-IS LSP, where the extended IS-IS LSP includes a newly defined TLV, and the TLV is used to describe the processing. At least one of the correspondences determined by the device 1801.
  • the TLV carries a VLAN ID (or FineLabe l ) of the VLAN and a correspondence relationship between the distribution tree selected for the VLAN and the VLAN. For example, when a distribution tree is selected for a Layer 2 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 2 multicast group.
  • the TLV when a distribution tree is selected for a Layer 3 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 3 multicast group.
  • the IP address can be used as the identifier of the Layer 3 multicast group.
  • the transmitter 1802 may carry identifiers of multiple VLANs (or Layer 2 multicast groups or Layer 3 multicast groups) and an alias of a distribution tree root RB in one TLV.
  • the identifier carrying multiple VLANs is used to describe a distribution tree selected by multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) in one TLV. (Same distribution tree) to reduce the number of TLVs sent and save TRILL network resources.
  • the VLAN ID is used as the VLAN identifier as an example: the sender 1802 can carry two VLAN IDs and an alias of a distribution tree root RB in one TLV, and the two VLAN IDs form an ID.
  • the VLAN corresponding to all VLAN IDs in the value range selects the distribution tree root RB as the distribution tree.
  • the transmitter 1802 may carry a bitmap (bi tmap map) and an alias of a distribution tree root RB in one TLV, and each bit in the bitmap represents a VLAN accessed in the RB.
  • bit When the bit is 1, the VLAN corresponding to the bit selects the distribution tree root RB as the distribution tree.
  • the bit is G, the VLAN corresponding to the bit does not select the distribution tree root RB as the distribution tree.
  • a batch advertisement of a Layer 2 multicast group selection distribution tree can be implemented in a TLV through a MAC address + mask.
  • a batch advertisement of a Layer 3 multicast group selection distribution tree can be implemented in a TLV by using an IP address + mask.
  • the first selecting unit 1901 is specifically configured to select a distribution tree for the first VLAN according to the VLAN identifier of the first VLAN and the number of the distribution tree according to a predetermined algorithm, according to the Layer 2 multicast group in the second VLAN. Select the distribution tree for the Layer 2 multicast group in the second VLAN according to the number of the MAC address and the distribution tree, and according to the predetermined algorithm, according to the IP address of the Layer 3 multicast group in the third VLAN and the number of the distribution tree.
  • the predetermined algorithm selects a distribution tree for the Layer 3 multicast group in the third VLAN.
  • the transmitter 1802 is further configured to advertise at least one of the selected distribution tree and the following information to other RBs in the TRILL network by using a TRILL existing protocol format: a VLAN of the first VLAN ID, the MAC address of the Layer 2 multicast group and the VLAN ID of the second VLAN in the second VLAN, the IP address of the Layer 3 multicast group and the VLAN ID of the third VLAN in the third VLAN, so that the extended IS-I is not supported.
  • the RB of the S protocol prune the distribution tree and establish a pruned distribution tree forwarding table.
  • the Ingres s RB may include:
  • the broadcast unit 2001 is configured to: when the processor 1801 does not determine the correspondence between the layer 2 multicast group and the distribution tree in the second VLAN, broadcast the information of the layer 2 multicast group in the second VLAN. Further, the broadcast unit 2001 is further configured to: when the processor 1801 does not determine the correspondence between the Layer 3 multicast group and the distribution tree in the third VLAN, broadcast the packet of the Layer 3 multicast group in the third VLAN. .
  • the Ingres s RB provided by the embodiment of the present invention can carry the relationship between the VLAN and the distribution tree selected for the VLAN in the extended IS-IS LSP. Other RBs only need to receive the extended I S-IS LSP protocol.
  • the forwarding record can be established for the VLAN and the distribution tree selected for the VLAN, which solves the problem that the forwarding records are required to be established between all the distribution trees selected by the VLAN and the Ingres RB in the prior art, and the distribution tree forwarding table is reduced. The number of records forwarded saves resources of the distribution tree forwarding table.
  • the Ingres s RB provided by the embodiment of the present invention can also establish a distribution tree forwarding table for the Layer 2 multicast group and the Layer 3 multicast group in the VLAN by implementing the distribution tree forwarding table in the VLAN. Based on the traffic forwarding mode in the VLAN, the resources of the distribution tree forwarding table are further saved.
  • the Ingres s RB provided by the embodiment of the present invention can also advertise the distribution of multiple VLANs or Layer 2 multicast groups or Layer 3 multicast groups to other RBs in batches in an extended IS-IS LSP.
  • the tree can reduce the number of extended IS-IS LSPs in the TRILL network and save TRILL network resources.
  • an embodiment of the present invention provides an Ingres s RB, as shown in FIG. 21, to implement the method embodiment shown in FIG.
  • the Ingres s RB includes: a processor 2101 and a transmitter 2102, where
  • the processor 2101 is configured to determine at least one of the following correspondences: a correspondence between a first VLAN and a distribution tree, a correspondence between a Layer 2 multicast group and a distribution tree in a second VLAN, and a third VLAN
  • the first VLAN, the second VLAN, and the third VLAN are the VLANs that the Ingres RB accesses.
  • the transmitter 2102 is configured to advertise the determined correspondence to the other RBs in the TRILL network by using the extended IS-IS protocol packet, so that the other RBs prune the distribution tree according to the advertisement, and establish a pruned distribution tree. Forwarding table.
  • the processor 2101 may include:
  • the receiving unit 2201 is configured to receive the correspondence between all VLANs and the distribution tree in the TRILL network advertised by the highest root-priority RB, the correspondence between the Layer 2 multicast group and the distribution tree in the VLAN, and the third layer in the VLAN. At least one correspondence between the multicast group and the distribution tree.
  • the second selecting unit 2202 is configured to, according to the highest tree root priority RB, the correspondence between all VLANs and the distribution tree in the TRILL network, the correspondence between the Layer 2 multicast group and the distribution tree in the VLAN, and the Layer 3 multicast group and the distribution in the VLAN.
  • the at least one of the corresponding relationships in the tree correspondence is a first VLAN, a Layer 2 multicast group in the second VLAN, and a Layer 3 multicast group in the third VLAN, and the corresponding VLAN is selected.
  • the second VLAN and the third VLAN are the VLANs that the Ingres RB accesses.
  • the extended IS-IS protocol message advertised by the transmitter 2102 includes an extended IS-IS LSP, and the extended IS-IS LSP includes a newly defined TLV, and the TLV is used to describe the processing. At least one of the correspondences determined by the device 2101.
  • the TLV carries a VLAN ID (or F ineLabe l ) of the VLAN and a correspondence relationship between the VLAN and the distribution tree selected for the VLAN. For example, when a distribution tree is selected for a Layer 2 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 2 multicast group.
  • the TLV when a distribution tree is selected for a Layer 3 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 3 multicast group.
  • the IP address can be used as the identifier of the Layer 3 multicast group.
  • the transmitter 2102 can carry identifiers of multiple VLANs (or Layer 2 multicast groups or Layer 3 multicast groups) and an alias of a distribution tree root RB in one TLV.
  • the identifier carrying multiple VLANs is used to describe a distribution tree selected by multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) in one TLV. (Same distribution tree) to reduce the number of TLVs sent and save TRILL network resources.
  • the VLAN ID is used as the VLAN identifier as an example: the sender 2102 can carry two VLAN IDs and an alias of a distribution tree root RB in one TLV, and the two VLAN IDs form an ID.
  • the VLAN corresponding to all VLAN IDs in the value range selects the distribution tree root RB as the distribution tree.
  • the transmitter 2102 may carry a bitmap (bi tmap map) and an alias of a distribution tree root RB in one TLV. Each bit in the bitmap represents a VLAN accessed within the RB. When the bit is 1, the VLAN corresponding to the bit selects the distribution tree root RB as the distribution tree.
  • a batch advertisement of a Layer 2 multicast group selection distribution tree can be implemented in a TLV through a MAC address + mask.
  • a batch advertisement of a Layer 3 multicast group selection distribution tree can be implemented in a TLV by using an IP address + mask.
  • the transmitter 2102 is further configured to advertise at least one of the selected distribution tree and the following information to other RBs in the TRILL network by using a TRILL existing protocol format: a VLAN of the first VLAN ID, the MAC address of the Layer 2 multicast group and the VLAN ID of the second VLAN in the second VLAN, the IP address of the Layer 3 multicast group and the VLAN ID of the third VLAN in the third VLAN, so that the extended IS-I is not supported.
  • the RB of the S protocol prune the distribution tree and establish a pruned distribution tree forwarding table.
  • the Ingres s RB may include:
  • the broadcast unit 2301 is configured to: when the processor 2101 does not determine the correspondence between the layer 2 multicast group and the distribution tree in the second VLAN, broadcast the message of the layer 2 multicast group in the second VLAN.
  • broadcast unit 2301 is further configured to: when the processor 2101 does not determine the third
  • the packets of the Layer 3 multicast group are broadcast in the third VLAN.
  • the Ingres s RB provided by the embodiment of the present invention can carry the relationship between the VLAN and the distribution tree selected for the VLAN in the extended IS-IS LSP. Other RBs only need to receive the extended I S-IS LSP protocol.
  • the forwarding record can be established for the VLAN and the distribution tree selected for the VLAN, which solves the problem that the forwarding records are required to be established between all the distribution trees selected by the VLAN and the Ingres RB in the prior art, and the distribution tree forwarding table is reduced. The number of records forwarded saves resources of the distribution tree forwarding table.
  • the Ingres s RB provided by the embodiment of the present invention can also establish a distribution tree forwarding table for the Layer 2 multicast group and the Layer 3 multicast group in the VLAN by implementing the distribution tree forwarding table in the VLAN. Based on the traffic forwarding mode in the VLAN, the resources of the distribution tree forwarding table are further saved.
  • the Ingres s RB provided by the embodiment of the present invention can also advertise the distribution of multiple VLANs or Layer 2 multicast groups or Layer 3 multicast groups to other RBs in batches in an extended IS-IS LSP. Tree, which can reduce the number of IS-IS LSPs sent in the TRILL network and save TRILL. Network resources.
  • an embodiment of the present invention provides an RB, as shown in FIG. 24, to implement the method embodiment shown in FIG.
  • the RB includes: a receiver 2401 and a processor 2402, where
  • the receiver 2401 is configured to receive at least one of the following correspondences advertised by the Ingres s RB: a correspondence between the first VLAN and the distribution tree, a correspondence between the Layer 2 multicast group and the distribution tree in the second VLAN, The corresponding relationship between the Layer 3 multicast group and the distribution tree in the third VLAN, where the first VLAN, the second VLAN, and the third VLAN are VLANs accessed by the Ingres RB.
  • the processor 2402 is configured to prune the distribution tree according to the advertisement of the Ingres s RB, and establish a pruned distribution tree forwarding table.
  • the RBs in the embodiments of the present invention include Ingres s RB, Egres s RB, and Trans i t RB.
  • the RB provided by the embodiment of the present invention can only establish a forwarding record for the VLAN and the distribution tree selected for the VLAN after receiving the extended IS-IS LSP, which solves the need for the VLAN and the Ingres RB to be selected in the prior art.
  • the problem of forwarding records is established between all distribution trees, which reduces the number of forwarding records of the distribution tree forwarding table and saves resources of the distribution tree forwarding table.
  • the RB provided by the embodiment of the present invention can also establish a distribution tree forwarding table for the Layer 2 multicast group and the Layer 3 multicast group in the VLAN by implementing the distribution tree forwarding table in the VLAN, and the VLAN is refined in the VLAN. Based on the traffic forwarding method, the resources of the distribution tree forwarding table are further saved.
  • the embodiment of the present invention provides a highest tree root priority RB, as shown in FIG. 25, to implement the method embodiment shown in FIG.
  • the highest tree root priority RB includes: a processor 2501 and a transmitter 2502, wherein
  • the processor 2501 is configured to select a corresponding distribution tree for at least one of a VLAN in a TRILL network, a Layer 2 multicast group in a VLAN, and a Layer 3 multicast group in a VLAN.
  • the transmitter 2502 is configured to associate a VLAN with a distribution tree, a mapping between a Layer 2 multicast group and a distribution tree in a VLAN, and a mapping between a Layer 3 multicast group and a distribution tree in a VLAN by using an extended IS-IS protocol. At least one of the correspondences is advertised to the other RBs in the TR I LL network, so that the advertised RBs according to the notification of the sender 2502 are VLANs, Layer 2 multicast groups in the VLAN, and Layer 3 multicast groups in the VLAN.
  • At least one of the corresponding distribution trees and the selected points will be selected by the extended IS-IS protocol message
  • the RB is advertised to other RBs in the TRILL network, so that other RBs prune the distribution tree according to the advertisement of the I ngre ss RB, and establish a prune distribution tree forwarding table.
  • the extended I S-IS protocol advertised by the transmitter 2502 includes an extended I S- IS LSP, where the extended I SI S LSP includes a newly defined TLV, and the TLV is used to describe the highest tree. At least one of the correspondences determined by the root priority RB.
  • the TLV carries a VLAN ID (or F ineLabe l ) of the VLAN and a correspondence relationship between the VLAN and the distribution tree selected for the VLAN. For example, when a distribution tree is selected for a Layer 2 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 2 multicast group.
  • the MAC address of the Layer 2 multicast group and the VLAN ID of the VLAN to which the Layer 2 multicast group belongs (or FineLabe l). The MAC address can be used as the identifier of the Layer 2 multicast group.
  • the TLV when a distribution tree is selected for a Layer 3 multicast group, the TLV carries the alias of the distribution tree root RB corresponding to the distribution tree selected for the Layer 3 multicast group.
  • the IP address can be used as the identifier of the Layer 3 multicast group.
  • the transmitter 2502 may carry identifiers of multiple VLANs (or Layer 2 multicast groups or Layer 3 multicast groups) and an alias of a distribution tree root RB in one TLV.
  • the identifier carrying multiple VLANs is used to describe a distribution tree selected by multiple VLANs (or a Layer 2 multicast group or a Layer 3 multicast group) in one TLV. (Same distribution tree) to reduce the number of TLVs sent and save TRILL network resources.
  • the VLAN and the VLAN ID are used as the VLAN identifier as an example: the sender 2502 can carry two VLAN IDs and an alias of a distribution tree root RB in one TLV, and the two VLAN IDs form an ID.
  • the VLAN corresponding to all VLAN IDs in the value range selects the distribution tree root RB as the distribution tree.
  • the transmitter 2502 may carry a bitmap (bi tmap map) and an alias of a distribution tree root RB in one TLV, and each bit in the bitmap represents a VLAN accessed in the RB. When the bit is 1, the VLAN corresponding to the bit selects the distribution tree root RB as the distribution tree.
  • the VLAN corresponding to the bit does not select the distribution tree root RB as the distribution tree.
  • a batch advertisement of a Layer 3 multicast group selection distribution tree can be implemented in a TLV by using an IP address + mask.
  • the processor 2501 is specifically configured to select a distribution tree for the VLAN according to the VLAN identifier of the VLAN and the number of the distribution tree according to a predetermined algorithm, according to the MAC address of the Layer 2 multicast group in the VLAN and the distribution tree. According to the predetermined algorithm, the distribution tree is selected for the Layer 2 multicast group in the VLAN. According to the IP address of the Layer 3 multicast group in the VLAN and the number of the distribution tree, the Layer 3 multicast group in the VLAN is used according to a predetermined algorithm. Select the distribution tree.
  • the highest tree root priority RB provided by the embodiment of the present invention can select a distribution tree for the VLAN, and advertise the relationship between the VLAN and the distribution tree selected for the VLAN to other RBs through the extended IS-IS LSP, so that Ingres s RB selects a VLAN and advertises the selected VLAN and the distribution tree corresponding to the VLAN to other RBs.
  • the other RBs After receiving the advertisement of the Ingres s RB, the other RBs establish a forwarding record for the VLAN and the distribution tree selected for the VLAN.
  • the problem of establishing forwarding records between all distribution trees selected for VLANs and Ingres s RBs in the prior art is solved, the number of forwarding records of the distribution tree forwarding table is reduced, and the resources of the distribution tree forwarding table are saved.
  • the highest tree root priority RB provided by the embodiment of the present invention can also establish a distribution tree forwarding table for the layer 2 multicast group and the layer 3 multicast group in the VLAN by implementing the distribution tree forwarding table in the VLAN.
  • the resources of the distribution tree forwarding table are further saved on the basis of refining the traffic forwarding mode in the VLAN.
  • an embodiment of the present invention provides a system for implementing multicast in a transparent multi-link interconnect (TRILL) network, and the system covers the implementation of the foregoing method and apparatus embodiment.
  • TRILL transparent multi-link interconnect
  • the Ingres s RB is configured to determine at least one of the following correspondences: a correspondence between the first VLAN and the distribution tree, a correspondence between the Layer 2 multicast group and the distribution tree in the second VLAN, and a Layer 3 group in the third VLAN.
  • Corresponding relationship between the broadcast group and the distribution tree, the first VLAN, the second VLAN, and the third VLAN are the VLANs accessed by the Ingres RB, and the corresponding relationship is advertised to the TRILL network by using the extended IS-IS protocol.
  • the other RBs so that other RBs prune the distribution tree according to the notification of the Ingres s RB, and establish a pruned distribution tree forwarding table.
  • the RB configured to receive at least one of the following correspondences of the Ingres s RB advertisement: the first VLAN Correspondence between the relationship with the distribution tree, the mapping between the Layer 2 multicast group and the distribution tree in the second VLAN, and the mapping between the Layer 3 multicast group and the distribution tree in the third VLAN, the first VLAN, the second VLAN, and the first
  • the third VLAN is the VLAN that the Ingres s RB accesses, and the distribution tree is prune according to the advertisement of the Ingres s RB, and the prune distribution tree forwarding table is established.
  • the highest root-priority RB is used to select the corresponding distribution tree for at least one of the VLANs in the TRILL network, the Layer 2 multicast group in the VLAN, and the Layer 3 multicast group in the VLAN.
  • the extended I S-IS protocol is adopted. Notifying the correspondence between the VLAN and the distribution tree, the mapping between the Layer 2 multicast group and the distribution tree in the VLAN, and the mapping between the Layer 3 multicast group and the distribution tree in the VLAN to the other RBs in the TRILL network.
  • the Ingres s RB selects a corresponding distribution tree according to the highest tree root priority RB advertisement, and selects a corresponding distribution tree for at least one of the Layer 2 multicast group in the second VLAN and the Layer 3 multicast group in the third VLAN.
  • the IS-I S protocol advertises the selected distribution tree to other RBs in the TRILL network, so that other RBs prune the distribution tree according to the advertisement of the Ingres s RB, and establish a prune distribution tree forwarding table, the first VLAN.
  • the second VLAN and the third VLAN are the VLANs that the Ingres RB accesses.
  • the system for implementing multicast in a transparent multi-link interconnection (TRILL) network can carry the relationship between a VLAN and a distribution tree selected for the VLAN in the extended IS-IS protocol, and other RBs are in the After receiving the extended IS-IS LSP protocol, it is only necessary to establish a forwarding record for the VLAN and the distribution tree selected for the VLAN, which solves the problem that all distribution trees selected for the VLAN and the Ingres RB are required to be established in the prior art.
  • the problem of forwarding records reduces the number of forwarding records in the distribution tree forwarding table and saves resources of the distribution tree forwarding table.
  • the system for implementing multicast in a transparent multi-link interconnection (TRILL) network can also implement a distribution tree forwarding table implementation manner for a VLAN to a layer 2 multicast group and a layer 3 in a VLAN.
  • the multicast group establishes a distribution tree forwarding table, which further saves the resources of the distribution tree forwarding table on the basis of refining the traffic forwarding mode in the VLAN.
  • the present invention can be implemented by means of software plus necessary general hardware, and of course, by hardware, but in many cases, the former is a better implementation. .
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a readable storage medium, such as a floppy disk of a computer. , hard drive or CD And, a number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform the methods described in various embodiments of the present invention.

Landscapes

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

Abstract

本发明实施例公开了一种在透明多链路互联（TRILL）网络中实现组播的方法、装置及系统，涉及信息交换领域，为减少TRILL 网络中剪枝后的分发树的数目而发明。所述方法包括：Ingress RB确定下述对应关系中的至少一种：第一VLAN 和分发树的对应关系、第二VLAN 中二层组播组和分发树的对应关系、第三VLAN 中三层组播组和分发树的对应关系，所述第一VLAN、第二VLAN、第三VLAN为所述Ingress RB接入的VLAN；Ingress RB通过扩展的IS-IS协议将确定的对应关系通告给TRILL网络中的其他RB，以便其他RB按照Ingress RB的通告对分发树进行剪枝，建立剪枝后的分发树转发表。

Description

在透明多链路互联 （ TRILL ) 网络中实现组播的方法 装置及系统 本申请要求于 2012 年 1 月 16 日提交中国专利局、 申请号为 CN 201210012741.2、 发明名称为 "在透明多链路互联（ TRILL ) 网络中实现组播 的方法、 装置及系统" 的中国专利申请的优先权， 其全部内容通过引用结合 在本申请中。 技术领域 本发明涉及通信技术领域， 尤其涉及一种在透明多链路互联（TRILL ) 网 络中实现组播的方法、 装置及系统。
皆景技术 透明多链路互联 (Transparent Interconnect ion of Lots of Links , TRILL) 是一种在二层网络上基于链路状态计算的路由协议， 它通过中间系统到中间 系统 ( Intermediate Sys tem t o Intermediate Sys tem, IS-IS )协议来实现 , 运行 TRILL协议的设备叫做路由桥接设备（Route Br idge, RB ), 由 RB组成 的网络叫做 TRILL网络（TRILL Campus )。 RB通过 TRILL协议获知整网拓朴、 分发树信息， RB以设备自身作为源节点， 通过最短路径树算法生成到其他 RB 的单播转发表； RB 以每棵分发树树根为源节点， 通过最短路径树算法生成到 其他 RB的分发树转发表， 整网可以生成多棵分发树， 每棵分发树都有一个唯 一的树才艮， 可以通过树才艮别名 （nickname ) 标识该棵分发树。 RB 分为入口 ( Ingres s ) RB, 中间 （ Trans i t ) RB和出口 （ Egres s ) RB三种角色。 Ingres s RB将自身接入的虚拟局域网 （Vir tua l Loca l Area Network, VLAN ) 内传统 二层流量，通过 TRILL协议封装发送到 TRILL网络内部； Egres s RB接收 TRILL 网络转发过来的 TRILL数据流量， 进行 TRILL解封装恢复成传统二层流量， 转发到连接 RB的本地站点； Trans i t RB不进行 TRILL的封装和解封装， 直接 根据查找分发树转发表将 TRILL数据报文转发到下一个 RB。 举例来说， 一台 RB可以充当 Ingress RB、 Transit RB、 Egress RB三种角色， Ingress RB需 要将接入的 VLAN、 或 VLAN中二层组播组、 或 VLAN中三层组播组信息中的至 少一种以及选择的分发树信息通告出去， 用于 TRILL网络中其他 RB (Transit
RB和 Egress RB )进行分发树剪枝计算。
为节省网络带宽可以针对每个 RB接入的 VLAN进行分发树剪枝树计算，
VLAN内的组播流量只向同样接入了该 VLAN的其他 RB按需发送， 避免了广播 发送组播流量对 TRILL网络带宽的浪费。
现有 TRILL网络的分发树剪枝技术， 由 TRILL网络中所有 Ingress RB将 自身接入的 VLAN和自身选择的分发树通告出去， 网络中其他 RB (Transit RB 和 Egress RB )在接收到通告后，获知网络中 Ingress RB分别接入了哪些 VLAN、 分别选择了哪棵分发树， 从而基于这些分发树和 VLAN信息进行分发树剪枝计 算， 生成本地分发树转发表。
例如， 图 1为典型的数据中心胖树（FatTree)组网方式， 整个 TRILL网 络有两棵分发树， 分发树树根分别为分发树树根 RB1和分发树树根 RB2。每条 链路 cost值相等， 因此每个 RB距离两个分发树树根 RB的距离相等。
每个 RB接入了 2000个 VLAN, 分别为 VLAN 1-1000选择分发树树根 RBI、 为 VLAN 1001- 2000选择分发树树才艮 RB2。 Ingress RB通过 Interested VLANs and Spanning Tree Roots Sub_TlV将本地接入的 V AN发布出去， 通过 The
Trees Used Identifiers Sub_TLV将选择的分发树信息发布出去。
其他 RB基于 Ingress RB通告的 VLAN和分发树信息， 进行分发树剪枝计 算， 生成剪枝后的分发树转发表。 其他 RB认为 Ingress RB上的每个 VLAN会 使用该 Ingress RB选择的两棵分发树转发流量， 因此为这 2000个 VLAN总共 生成 4000条分发树表项转发记录。
上述现有技术中， 在 Ingress RB基于 VLAN选择分发树时， 由于 Ingress RB在分发树信息中将自身选择的所有分发树树根发布出去，其他 RB只能基于
Ingress RB选择的所有分发树进行 VLAN剪枝计算， 这样就会建立多余的转发 记录， 占用了分发树转发表的资源。
如果 Ingress RB基于 VLAN中二层组播组、 或 VLAN中三层组播组选择分发 树， 也存在同样的问题。 Ingres s RB没有基于 VLAN中二层组播组、 或 VLAN中 三层组播组发布分发树信息， 因此其他 RB只能基于 Ingres s RB选择的所有分 发树进行 VLAN中二层组播组、 或 VLAN中三层组播组剪枝计算， 也会建立多余 的转发记录， 占用了分发树转发表的资源。 发明内容 本发明的实施例提供一种在透明多链路互联（TRILL ) 网络中实现组播的 方法、 装置及系统， 能够减少分发树转发表的转发记录数量， 节省分发树转 发表的资源。
一方面， 本发明实施例提供了一种在透明多链路互联（TRILL ) 网络中实 现组播的方法， 包括：
入口路由桥接设备 Ingres s RB确定下述对应关系中的至少一种： 第一虚 拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和分发树的对 应关系、 第三 VLAN中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN, 第三 VLAN为所述 Ingres s RB接入的 VLAN;
所述 Ingres s RB通过扩展的中间系统到中间系统 IS-IS协议将确定的对 应关系通告给 TRILL网络中的其他 RB, 以便其他 RB按照所述 Ingres s RB的 通告对分发树进行剪枝， 建立剪枝后的分发树转发表。
另一方面， 本发明实施例还提供了一种在透明多链路互联（TRILL ) 网络 中实现组播的方法， 包括：
路由桥接设备 RB接收入口 Ingres s RB通告的下述对应关系中的至少一 种： 第一虚拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和 分发树的对应关系、 第三 VLAN中三层组播组和分发树的对应关系；
所述 RB根据所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的 分发树转发表。
另一方面， 本发明实施例还提供了一种在透明多链路互联（TRILL ) 网络 中实现组播的方法， 包括： 最高树根优先级路由桥接设备 RB为 TRILL网络中所有虚拟局域网 VLAN、 VLAN中二层组播组、 VLAN中三层组播组中的至少一种选择相应的分发树； 所述最高树根优先级 RB通过扩展的中间系统到中间系统 IS-IS 协议将所述 VLAN和分发树对应关系、 所述 VLAN 中二层组播组和分发树对应关系、 所述 VLAN中三层组播组和分发树对应关系中的至少一种对应关系通告给 TRILL网 络中的其他 RB, 以便入口 Ingres s RB根据所述最高树根优先级 RB的通告为 第一 VLAN、 第二 VLAN中二层组播组、 第三 VLAN中三层组播组中的至少一种 选择相应的分发树并通过扩展的 IS-IS协议将选择的分发树通告给 TRILL网 络中的其他 RB, 使其他 RB根据所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的分发树转发表， 所述第一 VLAN、 第二 VLAN、 第三 VLAN为所述 Ingres s RB接入的 V AN。
另一方面， 本发明实施例还提供了一种入口路由桥接设备 Ingres s RB, 包括：
处理器， 用于确定下述对应关系中的至少一种： 第一虚拟局域网 VLAN和 分发树的对应关系、 第二 VLAN中二层组播组和分发树的对应关系、 第三 VLAN 中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN 为所述 Ingres s RB接入的 VLAN;
发送器， 用于通过扩展的中间系统到中间系统 IS-I S协议将确定的对应 关系通告给 TRILL网络中的其他 RB, 以便其他 RB按照所述 Ingres s RB的通 告对分发树进行剪枝， 建立剪枝后的分发树转发表。
另一方面， 本发明实施例还提供了一种路由桥接设备 RB, 包括： 接收器， 用于接收入口 Ingres s RB通告的下述对应关系中的至少一种： 第一虚拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和分发 树的对应关系、 第三 VLAN中三层组播组和分发树的对应关系；
处理器， 用于根据所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝 后的分发树转发表。
另一方面，本发明实施例还提供了一种最高树根优先级路由桥接设备 RB, 包括： 处理器，用于为 TRILL网络中所有虚拟局域网 VLAN、 VLAN中二层组播组、 VLAN中三层组播组中的至少一种选择相应的分发树；
发送器， 用于通过扩展的中间系统到中间系统 IS-IS协议将所述 VLAN和 分发树对应关系、 所述 VLAN中二层组播组和分发树对应关系、 所述 VLAN中 三层组播组和分发树对应关系中的至少一种对应关系通告给 TRILL 网络中的 其他 RB, 以便入口 Ingres s RB根据所述最高树根优先级 RB 的通告为第一 VLAN, 第二 VLAN中二层组播组、 第三 VLAN中三层组播组中的至少一种选择 相应的分发树并通过扩展的 IS-IS协议将选择的分发树通告给 TRILL网络中 的其他 RB, 使其他 RB根据所述 Ingres s RB的通告对分发树进行剪枝， 建立 剪枝后的分发树转发表，所述第一 VLAN、第二 VLAN、第三 VLAN为所述 Ingres s RB接入的 VLAN。
另一方面， 本发明实施例还提供了一种在透明多链路互联（TRILL ) 网络 中实现组播的系统， 包括：
入口路由桥接设备 Ingres s RB, 用于确定下述对应关系中的至少一种： 第一虚拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和分发 树的对应关系、第三 VLAN中三层组播组和分发树的对应关系，所述第一 VLAN、 第二 VLAN、 第三 VLAN为所述 Ingres s RB接入的 VLAN, 通过扩展的中间系统 到中间系统 I S- 1 S协议将确定的对应关系通告给 TR I LL网络中的其他 RB , 以 便其他 RB按照所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的分 发树转发表；
RB, 用于接收所述 Ingres s RB的通告， 根据所述 Ingres s RB的通告对 分发树进行剪枝， 建立剪枝后的分发树转发表。
本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的方法、 装置及系统， 能够在扩展的 IS-IS协议的报文中携带 VLAN (或 VLAN内二层组 播组或 VLAN内三层组播组）和为该 VLAN (或 VLAN内二层组播组或 VLAN内三 层组播组）选择的分发树之间的关系， 其他 RB在接收到扩展的 IS-IS协议的 报文后只需为 VLAN(或 VLAN内二层组播组或 VLAN内三层组播组）和为该 VLAN
(或 VLAN内二层组播组或 VLAN内三层组播组）选择的分发树建立转发记录 即可， 解决了现有技术中需要为 VLAN (或 VLAN内二层组播组或 VLAN内三层 组播组）和 Ingres s RB选择的所有分发树都建立转发记录的问题， 减少了分 发树转发表的转发记录数量， 节省了分发树转发表的资源。 附图说明 为了更清楚地说明本发明实施例或现有技术中的技术方案， 下面将对实 施例或现有技术描述中所需要使用的附图作简单地介绍， 显而易见地， 下面 描述中的附图仅仅是本发明的一些实施例， 对于本领域普通技术人员来讲， 在不付出创造性劳动的前提下， 还可以根据这些附图获得其他的附图。
图 1为现有技术中 TRILL网络的结构示意图；
图 2为本发明一个实施例中在 TRILL网络中实现组播的方法的流程图； 图 3为本发明一个实施例中 TRILL网络的结构示意图；
图 4为本发明一个实施例中 RB建立的分发树转发表；
图 5为现有技术中 RB建立的分发树转发表；
图 6为本发明另一个实施例中在 TRILL网络中实现组播的方法的流程图； 图 7为本发明一个实施例中分发树树根 RB建立的分发树转发表； 图 8为现有技术中分发树树根 RB建立的分发树转发表；
图 9为本发明一个实施例中新旧 RB兼容的场景里 TRILL网络的结构示意 图；
图 10为本发明一个实施例中新旧 RB兼容的场景里新式 RB建立的分发树 转发表；
图 11为本发明一个实施例中新旧 RB兼容的场景里老式 RB建立的分发树 转发表；
图 12为本发明一个实施例中另一个应用场景里的 TRILL网络的结构示意 图；
图 13 为本发明另一个实施例中在 TRILL 网络中实现组播的方法的流程 图； 图 14为本发明另一个实施例中 TRILL网络的结构示意图； 图 15 为本发明另一个实施例中在 TRILL 网络中实现组播的方法的流程 图；
图 16 为本发明另一个实施例中在 TRILL 网络中实现组播的方法的流程 图；
图 17为本发明一个实施例中 RB的简化结构示意图；
图 18为本发明一个实施例中 RB的简化结构示意图；
图 19为本发明一个实施例中 RB的简化结构示意图；
图 20为本发明一个实施例中 RB的简化结构示意图；
图 21为本发明一个实施例中 RB的简化结构示意图；
图 22为本发明一个实施例中 RB的简化结构示意图；
图 23为本发明一个实施例中 RB的简化结构示意图；
图 24为本发明一个实施例中 RB的简化结构示意图；
图 25为本发明一个实施例中 RB的简化结构示意图。
具体实施方式 下面将结合本发明实施例中的附图， 对本发明实施例中的技术方案进行 清楚、 完整地描述， 显然， 所描述的实施例仅仅是本发明一部分实施例， 而 不是全部的实施例。 基于本发明中的实施例， 本领域普通技术人员在没有作 出创造性劳动前提下所获得的所有其他实施例 , 都属于本发明保护的范围。
本发明实施例中的 VLAN可以将物理二层网络划分为多个逻辑子网， 每个 逻辑子网构成一个二层广播域， 该逻辑子网内用户可以进行二层互通。 逻辑 子网之间二层流量互相隔离， 网络中的站点可以根据需要灵活地加入不同的 逻辑子网。 通过 TRILL网络， 可以将处于不同站点的同一个 VLAN内用户通过 二层互相连接。
本发明实施例提供了一种在透明多链路互联（TRILL ) 网络中实现组播的 方法， 如图 2所示， 所述方法包括： 201、 Ingres s RB确定下述对应关系中的至少一种： 第一 VLAN和分发树 的对应关系、 第二 VLAN中二层组播组和分发树的对应关系、 第三 VLAN中三 层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN, 为所 述 Ingres s RB接入的 VLAN。
以图 3所示的网络为例， TRILL网络中有 4台 RB , RB1、 RB2、 RB3和 RB4 , 以及 2台分发树树根 RB, RB5和 RB6。 RB1、 RB2、 RB3以及 RB4分别接入相同 的 2000个 VLAN。 以 RB1作为 Ingres s RB为例： RBI确定 2000个 VLAN和分 发树的对应关系， 一个 VLAN对应一棵分发树， 该对应关系可以是 VLAN ID ( Ident i ty,身份标识）为 1到 1000的 VLAN与分发树树根 RB5的分发树对应， VLAN ID为 1001到 2000的 VLAN与分发树树才艮 RB6的分发树对应。 同样， 当 RB2、 RB3以及 RB4作为 Ingres s RB时， 也需要确定 2000个 VLAN (与 RB1的 2000个 VLAN相同）和分发树的对应关系。
本发明实施例是以 RB1作为 Ingres s RB为例进行说明的， 举例来说， 实 际应用中 TRILL网络为例中的每一台 RB都可以作为 Ingres s RB, 即图 3中的 RB2、 RB3以及 RB4也可以执行 RB1的动作， 同理 RB1也会接收到 RB2、 RB3以 及 RB4通告的扩展的 IS-IS协议 文。
202、 Ingres s RB通过扩展的 IS-I S协议报文将确定的对应关系通告给 TRILL网络中的其他 RB。
以图 3所示的网络为例， 以 VLAN为例， RB1通过扩展的 I S-IS协议 ^艮文 将 2000个 VLAN和分发树对应关系通告给 RB2、 RB 3以及 RB4。 以 RB2为例， RB2接收到 RB1通告的扩展的 I S-IS协议报文后， 建立分发树转发表， 该分发 树转发表中的一条转发记录代表一个 VLAN与一个分发树树根 RB的对应关系， 由此完成对分发树的剪枝计算。由于 RB1为 RB1中 VLAN ID为 1至 1000的 VLAN 与树才艮为 RB5的分发树建立对应关系， VLAN ID为 1001至 2000的 VLAN与树 根为 RB6的分发树建立对应关系， 所以如图 4所示， RB2建立的分发树转发表 中含有 2000条转发记录， 这 2000条转发记录分别描述 2000个 VLAN与分发 树树根 RB的关系。 同理， RB3和 RB4也会建立如图 4所示的分发树转发表， 此处不再赘述。 现有技术中， 由于 RBI只将自身接入的 VLAN和选择的分发树信息分别通 告出去， RB1的通告信息中不含有 VLAN与分发树树根 RB的对应关系， 所以在 图 3所示的 TRILL网络中， RB2 (或 RB3或 RB4 )在接收到通告信息后， 为每 一个 VLAN都建立两条转发记录（对应图 3中的 2个分发树树根 RB ), 这两条 转发记录分别描述该 VLAN和分发树树根 RB5和分发树树根 RB6的对应关系。 如图 5所示， RB2为 2000个 VLAN—共建立了 4000条转发记录。 由于 RB1中 VLAN ID为 1至 1000的 VLAN并未与树根为 RB6的分发树建立对应关系， VLAN ID为 1001至 2000的 VLAN也未与树根为 RB5的分发树建立对应关系，所以如 图 5所示，按照现有技术建立的分发树转发表中存在 2000条多余的转发记录。 图 4与图 5相比较可以看出， 本发明实施例相对现有技术减少了 2000条多余 的转发记录， 节省了分发树转发表的记录资源。
需要说明的是， 在图 3示例的网络中， 本发明实施例是以 TRILL网络中 有两个分发树树根 RB为例进行说明的， 如果 TRILL网络中有更多的分发树， 则本发明实施例相对现有技术的有益效果则更加明显。 例如 TRILL 网络中有 十棵分发树， 则 RB2建立的分发树转发表中会有 20000条转发记录， 而按照 本发明实施例的实现方式， RB2建立的分发树转发表中只会有 2000条转发记 录， 相对现有技术节省了 90%的转发记录资源。
本发明实施例以 VLAN为例对本发明实施例的步骤 201和步骤 202进行了 说明。 举例来说， 一个 VLAN中可以有至少一个二层组播组， 进行二层组播组 体特性来实现 VLAN中二层组播组和分发树的对应关系， 二层组播组的具体特 性为本领域技术人员所熟知的技术， 本发明实施例不再赘述。
又举例来说， 一个 VLAN中可以有至少一个三层组播组， 同样的， 进行三 播组的具体特性来实现 VLAN中三层组播组和分发树的对应关系， 三层组播组 的具体特性为本领域技术人员所熟知的技术， 本发明实施例同样不再赘述。
再举例来说， 本实施例可以为 VLAN或 VLAN中二层组播组或 VLAN中三层 组播组进行分发树剪枝， 也可以同时为 VLAN、 VLAN中二层组播组、 VLAN中三 层组播组中的两种或三种进行分发树剪枝， 本发明实施例对此不做限制。 本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的方法， 能够在扩展的 IS-IS协议报文中携带 VLAN和为该 VLAN选择的分发树之间的 关系， 其他 RB在接收到扩展的 IS-IS协议报文后只需为 VLAN和为该 VLAN选 择的分发树建立转发记录即可， 解决了现有技术中需要为 VLAN和 Ingres s RB 选择的所有分发树之间都建立转发记录的问题， 减少了分发树转发表的转发 记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够以对 VLAN建立分发树转发表的实现方式对 VLAN中的二层组 播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基 础上进一步节省了分发树转发表的资源。
本发明实施例提供了另一种在透明多链路互联（TRILL ) 网络中实现组播 的方法， 如图 6所示， 所述方法是对图 2所示实施例的进一步扩展。 所述方 法包括如下：
601、 Ingres s RB为第一 VLAN、 第二 VLAN中二层组播组、 第三 VLAN中 三层组播组中的至少一种选择相应的分发树， 所述第一 VLAN、 第二 VLAN、 第 三 VLAN为所述 Ingres s RB接入的 VLAN。
以图 3所示的网络为例， TRILL网络中有 4台 RB, RB1、 RB2、 RB3和 RB4 以及 2台分发树树根 RB, RB5和 RB6。 RB1、 RB2、 RB3以及 RB4分别接入相同 的 2000个 VLAN。 以 RB1作为 Ingres s RB为例： RBI为接入的 VLAN选择相应 的分发树， 一个 VLAN对应一棵分发树， 比如可以为 VLAN ID为 1到 1000的 VLAN选择树根为 RB5的分发树， 为 VLAN ID为 1001到 2000的 VLAN选择树根 为 RB6的分发树。 同理， RB2、 RB3以及 RB4作为 Ingres s RB时也需要为接入 的 2000个 VLAN (与 RB1的 2000个 VLAN相同）选择相应的分发树， 选择方式 与 RB1的选择方式相同， 此处不再赘述。
本发明实施例是以 RB1作为 Ingres s RB为例进行说明的， 举例来说， 实 际应用中 TRILL网络为例中的每一台 RB都可以作为 Ingres s RB, 即图 3中的 RB2、 RB3以及 RB4也可以执行 RB1的动作， 同理 RB1也可以接收到 RB2、 RB3 以及 RB4通告的扩展的 I S-I S协议 ^艮文。
举例来说， 本发明实施例中可以通过 VLAN标识对本发明实施例中所述的 VLAN进行区分。 所述 VLAN标识可以是 VLAN ID。 优选的， 所述 VLAN标识也 可以是细化标签（F ineLabe l )。 传统 VLAN ID值的位数为 12比特， 最多只能 标识 4096个 VLAN ( 2的 12次方；)。 而 F ineLabe l值的位数为 24比特， 最多 能够标识 16777216个 VLAN ( 2的 24次方 ), 极大的增加了可接入 VLAN的数 量。
可选的， Ingres s RB可以通过静态配置的方式为 VLAN选择对应分发树树 根 RB的分发树， 由网络管理员根据 TR I LL网络的现网条件对 VLAN进行静态 配置。
进一步可选的， Ingres s RB还可以通过 VLAN标识和预定的算法为 VLAN 选择对应分发树树根 RB的分发树。 以 VLAN I D作为 VLAN标识为例： Ingres s RB 首先对 TRILL 网络中的分发树树根 RB进行排序， 按照 TRILL基础协议 ( RFC6325 )的现有方法从 1开始对分发树进行编号， 然后对对应于分发树的 分发树树根 RB进行编号。 例如， 如图 3所示分发树树根 RB5的编号为 1 , 分 发树树根 RB6的编号为 2。举例来说，所述预定的算法可以是 VLAN ID模（MOD ) 算法： 以 VLAN ID值除以 TRILL网络中分发树树根 RB的个数， 取余数再加 1 , 便得出为该 VLAN选择几号分发树树根 RB所对应的分发树。 例如， 如图 3所 示， 假设 RB1接入 5个 VLAN, 这 5个 VLAN的 VLAN ID分别为 1、 1、 3、 4和 5。 用 1除以 1 ( TRILL中分发树树根 RB的个数 ), 得 0余 1 , 以余数 1再加上 1就等于 2 , 由此得出为 VLAN ID值为 1的 VLAN选择与编号为 1的分发树树 根 RB (即图 3中分发树树根 RB6 )对应的分发树。 同理可算出 VLAN ID为 3 和 5的 VLAN同样选择与编号为 2的分发树树根 RB对应的分发树。 本算法中 余数加 1的目的在于， 当 VLAN ID值与分发树树根 RB的个数整除时（余数为 0 ), 可以为该 VLAN ID的 VLAN选择编号为 1的分发树树根 RB (即图中分发树 树根 RB5 )对应的分发树（ 0+1=1 ), 从而不会出现分发树树根 RB编号为 0的 情况。 本例中为 VLAN ID为 2和 4的 VLAN选择与编号为 1的分发树树根 RB 对应的分发树。 VLAN ID模算法同样可以应用于以 F ineLabe l作为 VLAN标识 的场景中， 该场景中只要用 FineLabel替代 VLAN ID即可釆用模算法， 具体 实现方式不再赘述。 此外， 本发明实施例中以 VLAN ID模算法作为预定的算 法进行说明， 实际应用中所述预定的算法并不限定于此。
举例来说， 当为 VLAN中的二层组播组选择分发树时， 同样釆用步骤 601 所述的实现方式， 只是将步骤 601 中所述的 VLAN ID或 FineLabel替换为二 层组播组的媒体访问控制（Media Acces s Control , MAC )地址即可。 当为 VLAN 中的三层组播组选择分发树时， 同样可以釆用步骤 601 所述的实现方式， 只 是将步骤 601 中所述的 VLAN ID或 FineLabel替换为三层组播组的网间协议 ( Internet Protocol , IP )地址即可。 具体实现方式此处不再赞述。
602、 Ingres s RB 通过扩展的 IS- IS 链路状态才艮文 （ Link State
Packet, LSP )将选择的对应关系通告给其他 RB。
所述扩展的 IS-IS LSP包括新定义的类型长度值（type length va lue, TLV )。 以图 3所示的网络为例， 以 VLAN为例， RB1通过 TLV将 2000个 VLAN 和分发树对应关系通告给 RB2、 RB3以及 RB4 , RB2、 RB3以及 RB4分别也通过 TLV将 2000个 VLAN和分发树对应关系通告给除自身之外的其他 RB。
举例来说， 所述 TLV中携带有 VLAN的 VLAN ID (或 FineLabel )和为该 和为该 VLAN选择的分发树的对应关系。 又举例来说， 当为二层组播组选择分 发树时， 所述 TLV 中除携带为该二层组播组选择的分发树所对应的分发树树 根 RB的别名以外， 还要携带该二层组播组的 MAC地址以及该二层组播组所属 的 VLAN的 VLAN ID (或 FineLabel ), MAC地址可以作为二层组播组的标识。 再举例来说， 当为三层组播组选择分发树时， 所述 TLV 中除携带为该三层组 播组选择的分发树所对应的分发树树根 RB的别名以外， 还要携带该三层组播 组的 IP地址以及该三层组播组所属的 VLAN的 VLAN ID (或 FineLabel ), IP 地址可以作为三层组播组的标识。
可选的， RB可以在一个 TLV中携带多个 VLAN (或二层组播组或三层组播 组）的标识和一个分发树树根 RB的别名。 所述携带多个 VLAN (或二层组播组 或三层组播组） 的标识用于在一个 TLV中描述多个 VLAN (或二层组播组或三 层组播组）选择的分发树（同一个分发树）， 以此减少发送 TLV的数量， 节省 TRILL网络资源。 举例来说， 以 VLAN并且以 VLAN ID作为 VLAN标识为例： RB 可以在一个 TLV中携带两个 VLAN ID和一个分发树树根 RB的别名， 所述两个 VLAN ID所组成 ID值区间中所有的 VLAN ID所对应的 VLAN都选择该分发树树 根 RB作为分发树。 或者， RB可以在一个 TLV中携带一个位图 （ b i tmap图） 和一个分发树树根 RB的别名， 所述位图中的每一比特位代表 RB内接入的一 个 VLAN。 当比特位为 1时， 表示该比特位对应的 VLAN选择该分发树树根 RB 作为分发树， 当比特位为 G时， 表示该比特位对应的 VLAN不选择该分发树树 根 RB作为分发树。 对于二层组播组， 还可以在一个 TLV中通过 MAC地址 +掩 码实现二层组播组选择分发树的批量通告。 同理， 对于三层组播组， 可以在 一个 TLV中通过 IP地址 +掩码的方式实现三层组播组选择分发树的批量通告。
以图 3所示的网络为例 ,以 VLAN为例： RB2接收到 RB1通告的扩展的 I S-I S LSP后， 建立分发树转发表， 该转发表中的一条记录代表一个 VLAN与一个分 发树树根 RB的对应关系， 由此完成对分发树的剪枝计算。由于 RB1为 VLAN ID 为 1至 1000的 VLAN选择树才艮为 RB5的分发树， 为 VLAN ID为 1001至 2000 的 VLAN选择树根为 RB6的分发树， 所以如图 4所示， RB2建立的转发表中含 有 2000条转发记录， 这 2000条转发记录分别用描述 2000个 VLAN与分发树 树根 RB的关系。 同样， RB1、 RB2以及 RB3也会建立如图 4所示的分发树转发 表， 此处不再赘述。
现有技术中， 由于 RB1的通告信息中不含有 VLAN与分发树树根 RB的对 应关系， 所以如图 3所示， RB2 (或 RB3、 RB4 )在接收到通告信息后， 为每一 个 VLAN都建立两条转发记录， 这两条转发记录分别描述该 VLAN和分发树树 根 RB5和分发树树根 RB6的对应关系。 如图 5所示， RB2为 2000个 VLAN—共 建立了 4000条转发记录。 由于 RB1并未为 VLAN ID为 1至 1000的 VLAN选择 对应分发树树根 RB5的分发树， 也未为 VLAN ID为 1001至 2000的 VLAN选择 对应分发树树根 RB6的分发树， 所以存在 2000条多余的转发记录。 图 4与图 5相比较可以看出， 本发明实施例相对现有技术减少了 2000条转发记录的建 立， 节省了分发树转发表的资源。 需要说明的是， 在图 3示例的网络中， 本发明实施例是以 TRILL网络中 有两个分发树树根 RB为例进行说明的， 如果 TRILL网络中有更多的分发树， 则本发明实施例相对现有技术的有益效果则更加明显。 例如 TRILL 网络中有 十棵分发树， 则 RB2建立的分发树转发表中会有 20000条转发记录， 而按照 本发明实施例的实现方式， RB2建立的分发树转发表中只会有 2000条转发记 录， 相对现有技术节省了 90%的转发记录资源。
此外， 分发树树根 RB作为 RB的一种， 也会接收 Ingres s RB通告的扩展 的 IS-IS LSP, 并建立分发树转发表。 以图 3所示的网络为例， 以分发树树根 RB5为例： 分发树树根 RB5接收到 RB1通告的扩展的 IS-IS LSP后建立如图 7 所示的分发树转发表。 由于 RB1中只有 VLAN ID 1至 1000的 VLAN选择分发 树树根 RB5 , 所以图 7所示的分发树转发表中只有 1000条转发记录。 而现有 技术中， 如图 8所示分发树树根 RB5需要为 RB1中 VLAN ID 1至 2000的 2000 个 VLAN都建立转发记录， 而为 RB1中 VLAN ID1001至 2000的 1000个 VLAN 建立的转发记录是多余的转发记录。 与现有技术相比， 本发明实施例中的分 发树树根 RB减少了 1000条转发记录。
在本发明实施例的一个应用场景中， 当 TRILL 网络中还存在不支持扩展 的 IS-IS LSP的老式 RB时， 本应用场景还提供一种支持新旧 RB兼容的实现 方式。 举例来说， 如图 9所示， TRILL网络中存在 1台分发树树根 RB ( RB5和 RB6 )和 RB1、 RB2、 RB3以及 RB4 , RB1、 RB2和 RB4都接入 VLAN ID1至 2000 的 2000个 VLAN, VLAN ID1至 1000的 1000个 VLAN选择分发树树根 RB5的分 发树， VLAN ID1001至 2000的 1000个 VLAN选择分发树树根 RB6的分发树。 RB3接入 VLAN ID1至 100的 100个 VLAN, VLAN ID1至 50的 50个 VLAN选择 分发树树根 RB5的分发树， VLAN ID51至 100的 50个 VLAN选择分发树树根 RB6的分发树。 其中， RB3为不支持扩展的 IS-IS LSP的老式 RB。 RB1、 RB2 和 RB4在执行上述步骤 602的同时还执行 603 ,通过 TRILL现有协议报文格式 将选择的分发树和接入的 VLAN (或二层组播组或三层组播组） 的对应关系通 告给其他 RB。 所述其他 RB包括新式 RB和老式 RB。 而老式 RB只通过 TRILL 现有协议报文格式将选择的分发树和接入的 VLAN (或二层组播组或三层组播 组）通告给其他 RB, 所述其他 RB包括新式 RB和老式 RB。 在建立分发树转发 表时， 针对新老 RB 的排列组合会出现三种建立分发树转发表的方式： 1 )新 式 RB根据新式 RB通告的扩展的 IS-IS LSP建立分发树转发表。 1 )新式 RB 根据老式 RB的现有协议报文格式建立分发树转发表。 3 )老式 RB根据老式 RB 的现有协议报文格式建立分发树转发表， 该现有协议报文格式来自老式 RB或 者新式 RB。 由于老式 RB不支持扩展的 IS-IS LSP, 所以老式 RB接收到新式 RB通告的扩展的 IS-IS LSP后， 会进行丟弃不做任何处理， 只处理接收到的 TRILL现有协议报文格式。 图 9 中， RB1、 RB2或 RB4根据扩展的 IS-IS LSP 以及现有协议报文格式建立的分发树转发表如图 10 所示， 一共建立了 2100 个转发记录。 其中， VLAN ID1至 50的 50条 VLAN与分发树树根 RB6的转发记 录以及 VLAN ID51至 100的 50条 VLAN与分发树树根 RB5的转发记录是由现 有协议报文格式导致的多余的转发记录， 但是与现有技术相比， 本新旧兼容 的应用场景仍然节省了转发记录。如果图 9中 RB1至 RB4都为老式 RB,则 RB1、 RB2或 RB4建立的转发表如图 11所示， 一共建立了 4000条转发记录。 本场景 相对现有技术仍然节省了 1900条转发记录。 本应用场景提供的支持新旧 RB 兼容的实现方式， 在 RB格式相同的情况下， 虽然不如 TRILL网络中不存在老 式 RB的场景对转发表资源节省的程度高 （因为老式 RB按照现有协议报文格 式建立分发树转发表 ), 但本应用场景提供的实现方式相对现有技术仍存在改 进， 只要 TRILL网络中存在至少两台新式 RB, 就会存在相对现有技术的有益 效果。
又举例来说， 在本发明实施例的另一个应用场景中， 当 Ingress RB没有 为二层组播组选择分发树时， Ingress RB在二层组播组所属的 VLAN范围内广 播该二层组播组的报文。 再例如， 当 Ingress RB没有为三层组播组选择分发 树时， Ingress RB在三层组播组所属的 VLAN范围内广播该三层组播组的 4艮文。 保证了在任何条件下二层组播组或三层组播组流量都能够在 TRILL 网络中进 行转发。
再举例来说， 在本发明实施例的另一个应用场景中， 当 TRILL 网络中同 时存在只支持针对 VLAN进行剪枝的 RB和既支持针对 VLAN进行剪枝又支持针 对二层组播组或三层组播组进行剪枝的 RB时， 本发明实施例还提供一种兼容 的建立分发树转发表的实现方式。 如图 12所示， TRILL网络中有 2台分发树 树根 RB和 4台 RB, 其中 RB1和 RB2既支持针对 VLAN进行剪枝又支持针对二 层组播组或三层组播组进行剪枝， RB3和 RB4只支持针对 VLAN进行剪枝。 RB3 和 RB4只通过扩展的 I S-IS LSP向其他 RB通告 VLAN选择的分发树， 而 RB1 和 RB2则通过扩展的 IS-IS LSP向其他 RB既通告 VLAN选择的分发树也通告 二层组播组或三层组播组选择的分发树。 在接收扩展的 IS-IS LSP时， RB3和 RB4只根据接收到的扩展的 IS-IS LSP中的 VLAN选择的分发树建立 VLAN的分 发树转发表， 而 RB1和 RB2则既根据接收到的扩展的 IS-IS LSP中的 VLAN选 择的分发树建立 VLAN的分发树转发表， 也根据接收到的扩展的 IS-I S LSP中 的二层组播组或三层组播组选择的分发树建立二层组播组或三层组播组的分 发树转发表。
对于 RB为接入的 VLAN (或二层组播组或三层组播组）选择的分发树， 该 RB既是该 VLAN (或二层组播组或三层组播组）报文流量的 Egres s RB也是该 VLAN (或二层组播组或三层组播组）报文流量的 Ingres s RB, 对于 RB接入的 TRILL网络侧报文，根据报文中目的分发树树根别名和 VLAN查找分发树表项， 并且命中表项记录之后， 进行 TRILL报文解封装， 根据内层 VLAN再查找本地 转发表将报文发送到本地出端口； 对于 RB接入的本地二层报文， 首先查找到 VLAN对应的分发树树根别名，然后根据分发树树根别名和 VLAN查找分发树表 项， 并且命中表项记录之后， 向 TRILL 网络侧进行组播复制， 从对应出接口 发送出去。 本发明实施例中 Egres s RB和 Ingres s RB的概念是在 RB转发报 文流量的功能角度上定义的， 当 RB接收 TRILL网络发送的报文流量并将该报 文流量进行 TRILL解封装恢复成传统二层流量送出 TRILL 网络时， 该 RB为 Egres s RB。 当 RB接收到传统二层流量并将该传统二层流量进行 TRILL封装 发送入 TRILL网络内部时， 该 RB为 Ingres s RB。
本发明实施例以 VLAN为例进行了说明。 举例来说， 一个 VLAN中可以有 至少一个二层组播组， 进行二层组播组分发树剪枝的实现方式与上述实施例 的原理相同， 结合二层组播组的具体特性来实现 VLAN中二层组播组和分发树 的对应关系， 二层组播组的具体特性为本领域技术人员所熟知的技术， 本发 明实施例不再赘述。
又举例来说， 一个 VLAN中可以有至少一个三层组播组， 同样的， 进行三 的具体特性来实现 VLAN中三层组播组和分发树的对应关系， 三层组播组的具 体特性为本领域技术人员所熟知的技术， 本发明实施例同样不再赘述。
再举例来说， 本实施例可以为 VLAN或 VLAN中二层组播组或 VLAN中三层 组播组进行分发树剪枝， 也可以同时为 VLAN、 VLAN中二层组播组、 VLAN中三 层组播组中的两种或三种进行分发树剪枝， 本发明实施例对此不做限制。
本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的方法， 能够在扩展的 IS-IS LSP中携带 VLAN和为该 VLAN选择的分发树之间的关系， 其他 RB在接收到扩展的 IS-IS LSP后只需为 VLAN和为该 VLAN选择的分发树 建立转发记录即可， 解决了现有技术中需要为 VLAN和 Ingres s RB选择的所 有分发树之间都建立转发记录的问题， 减少了分发树转发表的转发记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够以对 VLAN建立分发树转发表的实现方式对 VLAN中的二层组 播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基 础上进一步节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够在一个扩展的 IS-I S LSP中以批量的方式向其他 RB通告为多 个 VLAN或二层组播组或三层组播组选择的分发树， 可以减少 TRILL网络中发 送扩展的 IS-IS LSP的数量， 节省 TRILL的网络资源。
本发明实施例提供了另一种在透明多链路互联（TRILL ) 网络中实现组播 的方法， 如图 13所示， 所述方法是对图 2所示实施例的进一步扩展。 所述方 法包括：
1301、 Ingres s RB根据最高树根优先级 RB通告的 TRILL网络中所有 VLAN 和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中三层组播 组和分发树对应关系中的至少一种对应关系为第一 VLAN、第二 VLAN中二层组 播组、 第三 VLAN 中三层组播组中的至少一种选择相应的分发树， 所述第一 VLAN、 第二 VLAN、 第三 VLAN为所述 Ingres s RB接入的 VLAN。
优先级最高的 RB为最高树根优先级 RB。 如果存在至少两个 RB的优先级 相同的情况， 则根据每个 RB的 sys tern ID值对 RB进行排序， sys tern ID值大 的 RB排序在前。 如果存在至少两个 RB的 sys tem ID值相同的情况， 则再根 据 RB的 ni ckname值对 RB进行排序， ni ckname值大的 RB排序在前。对 RB进 行排序后，排序位置最靠前的 RB为最高树根优先级 RB。 所述最高树根优先级 RB可以指定任意 RB (包括自身）为分发树树根 RB。
如图 14所示， TRILL网络中有 2台分发树树根 RB以及 4台 RB, 其中 RB1 接入 VLAN ID1至 100的 100个 VLAN , RB2、 RB3以及 RB4分别接入 VLAN ID1 至 2000的 2000个 VLAN , 分发树树根 RB5为最高树根优先级 RB。 以 RB1为 Ingres s s RB为例： 分发树树根 RB5为 TRILL网络中接入的 2000个 VLAN选择 分发树， 具体的实现方式与图 6步骤 601中 Ingres s s RB为 VLAN选择分发树 的实现方式相同，可以参考图 6的 601进行实现。分发树树根 RB5为 VLAN ID1 至 1000的 1000个 VLAN选择分发树树才艮 RB5 ,为 VLAN ID1 001至 2000的 1000 个 VLAN选择分发树树 4艮 RB6。
RBI在接收到分发树树根 RB5通告的扩展的 I S-I S LSP后， 结合自身接入 的 VLAN选择向其他 RB通告的 VLAN以及该 VLAN与分发树的对应关系。 举例 来说， 由于 RB1中接入了 VLAN ID1至 100的 VLAN, 而分发树树根 RB5为 VLAN ID1至 100的 VLAN选择了分发树树才艮 RB 5 ,所以 RB1为 VLAN ID1至 100的 100 个 VLAN选择分发树树根 RB5。 RB2、 RB3或 RB4由于接入了 VLAN ID1至 2000 的 2000个 VLAN,所以 RB2、RB3或 RB4才艮据分发树树才艮 RB5的扩展的 I S-I S LSP 为 VLAN ID1至 1000的 1000个 VLAN选择分发树树才艮 RB5 , 为 VLAN ID1001至 2000的 1000个 VLAN选择分发树树才艮 RB 6。
需要说明的是， Ingres s s RB 在根据最高树根优先级 RB 通告的扩展的 I S-I S LSP为 VLAN选择分发树时，只将最高树根优先级 RB通告的扩展的 I S-I S LSP中携带的本 Ingres s s RB接入的 VLAN选择该分发树。 本发明实施例以 VLAN为例进行说明， 此外还可以参照对 VLAN进行分发 树剪枝的方式对 VLAN中的二层组播组或三层组播组进行分发树剪枝， 具体实 现过程可以参考图 13的实现方式并结合二层组播组或三层组播组的特点进行 实施， 此处不再赘述。
1302、 Ingres s RB通过扩展的 IS-IS LSP将选择的对应关系通告给其他
RB。
步骤 1302与图 6所示实施例中的 602的实现方式相同， 此处不再赘述。 此外， 在 1302中， Ingres s RB还可以通过 TRILL现有 ^艮文协议格式将选 择的对应关系通告给其他 RB。 Ingres s RB使用的 TRILL现有报文协议格式以 及通告的实现过程与上一实施例中新旧 RB兼容场景里老式 RB釆用的 TRILL 现有 ^艮文协议格式以及通告的实现过程相同， 此处可以参考老式 RB的实现方 式。
举例来说， 本实施例可以为 VLAN或 VLAN中二层组播组或 VLAN中三层组 播组进行分发树剪枝， 也可以同时为 VLAN、 VLAN中二层组播组、 VLAN中三层 组播组中的两种或三种进行分发树剪枝， 本发明实施例对此不做限制。
本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的方法， 能够在扩展的 IS-IS LSP中携带 VLAN和为该 VLAN选择的分发树之间的关系， 其他 RB在接收到扩展的 IS-IS LSP后只需为 VLAN和为该 VLAN选择的分发树 建立转发记录即可， 解决了现有技术中需要为 VLAN和 Ingres s RB选择的所 有分发树之间都建立转发记录的问题， 减少了分发树转发表的转发记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够以对 VLAN建立分发树转发表的实现方式对 VLAN中的二层组 播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基 础上进一步节省了分发树转发表的资源。
本发明实施例提供了一种在透明多链路互联（TRILL ) 网络中实现组播的 方法， 如图 15所示， 所述方法包括：
1501、 RB接收 Ingres s RB通告的下述对应关系中的至少一种： 第一 VLAN 和分发树的对应关系、第二 VLAN中二层组播组和分发树的对应关系、第三 VLAN 中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN 为所述 Ingres s RB接入的 VLAN。
所述 RB包括 Ingres s RB、 Egres s RB、 Trans i t RB。 Ingres s RB通过扩 展的 IS-IS LSP将选择的对应关系通告给 RB。
所述扩展的 IS-IS LSP 包括新定义的 TLV。 以图 3所示的网络为例， 以 VLAN为例， RB2、 RB3以及 RB4分别接收 RB1通过 TLV通告的 2000个 VLAN和 分发树对应关系。 所述 TLV中携带有 VLAN的 VLAN ID (或 FineLabe l )和为 该 VLAN选择的分发树所对应的分发树树根 RB的别名 （ Nickname ), 以此描述 VLAN和为该 VLAN选择的分发树的对应关系。 又举例来说， 当为二层组播组选 择分发树时， 所述 TLV 中除携带为该二层组播组选择的分发树所对应的分发 树树根 RB的别名以外， 还要携带该二层组播组的 MAC地址以及该二层组播组 所属的 VLAN的 VLAN ID (或 FineLabe l ), MAC地址可以作为二层组播组的标 识。 再举例来说， 当为三层组播组选择分发树时， 所述 TLV 中除携带为该三 层组播组选择的分发树所对应的分发树树根 RB的别名以外， 还要携带该三层 组播组的 IP地址以及该三层组播组所属的 VLAN的 VLAN ID (或 FineLabe l ), I P地址可以作为二层组播组的标识。
可选的， Ingres s RB可以在一个 TLV中携带多个 VLAN (或二层组播组或 三层组播组）的标识和一个分发树树根 RB的别名。 所述携带多个 VLAN (或二 层组播组或三层组播组） 的标识用于在一个 TLV中描述多个 VLAN (或二层组 播组或三层组播组）选择的分发树（同一个分发树树根 RB对应的分发树）， 以此减少发送 TLV的数量， 节省 TRILL网络资源。 举例来说， 以 VLAN并且以 VLAN ID作为 VLAN标识为例： Ingres s RB可以在一个 TLV中携带两个 VLAN ID 和一个分发树树根 RB的别名， 所述两个 VLAN ID所组成 ID值区间中所有的 VLAN ID所对应的 VLAN都选择该分发树树根 RB作为分发树。或者， Ingres s RB 可以在一个 TLV中携带一个位图 （bi tmap图）和一个分发树树根 RB的别名， 所述位图中的每一比特位代表 RB内接入的一个 VLAN。 当比特位为 1时，表示 该比特位对应的 VLAN选择该分发树树根 RB作为分发树， 当比特位为 0时， 表示该比特位对应的 VLAN不选择该分发树树根 RB作为分发树。 对于二层组 播组， 还可以在一个 TLV中通过 MAC地址 +掩码实现二层组播组选择分发树的 批量通告。 同理， 对于三层组播组， 可以在一个 TLV中通过 IP地址 +掩码的 方式实现三层组播组选择分发树的批量通告。
1502、 RB根据 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的分发 树转发表。
以图 3所示的网络为例 ,以 VLAN为例： RB2接收到 RB1通告的扩展的 I S-I S LSP后， 建立分发树转发表， 该转发表中的一条记录代表一个 VLAN与一个分 发树树根 RB的对应关系， 由此完成对分发树的剪枝计算。由于 RB1为 VLAN ID 为 1至 1000的 VLAN选择树才艮为 RB5的分发树， 为 VLAN ID为 1001至 2000 的 VLAN选择树根为 RB6的分发树， 所以如图 4所示， RB2建立的转发表中含 有 2000条转发记录， 这 2000条转发记录分别用描述 2000个 VLAN与分发树 树根 RB的关系。
现有技术中， 由于 RB1的通告信息中不含有 VLAN与分发树树根 RB的对 应关系， 所以 RB2 (或 RB3、 RB4 )在接收到通告信息后， 为每一个 VLAN都建 立两条转发记录， 这两条转发记录分别描述该 VLAN和分发树树根 RB5和分发 树树根 RB6的对应关系。 如图 5所示， RB2为 2000个 VLAN—共建立了 4000 条转发记录。 由于 RB1并未为 VLAN ID为 1至 1000的 VLAN选择对应分发树 树根 RB5的分发树， 也未为 VLAN ID为 1001至 2000的 VLAN选择对应分发树 树根 RB6的分发树， 所以存在 2000条多余的转发记录。 图 4与图 5相比较可 以看出， 本发明实施例相对现有技术减少了 2000条转发记录的建立， 节省了 分发树转发表的资源。
需要说明的是， 在图 3示例的网络中， 本发明实施例是以 TRILL网络中 有两个分发树树根 RB为例进行说明的， 如果 TRILL网络中有更多的分发树， 则本发明实施例相对现有技术的有益效果则更加明显。 例如 TRILL 网络中有 十棵分发树， 则 RB2建立的分发树转发表中会有 20000条转发记录， 而按照 本发明实施例的实现方式， RB2建立的分发树转发表中只会有 2000条转发记 录， 相对现有技术节省了 90%的转发记录资源。 此外， 分发树树根 RB作为 RB的一种， 也会接收 Ingres s RB通告的扩展 的 IS-IS LSP, 并建立分发树转发表。 以图 3所示的网络为例， 以分发树树根 RB5为例： 分发树树根 RB5接收到 RB1通告的扩展的 IS-IS LSP后建立如图 7 所示的分发树转发表。 由于 RB1中只有 VLAN ID 1至 1000的 VLAN选择分发 树树根 RB5 , 所以图 7所示的分发树转发表中只有 1000条转发记录。 而现有 技术中， 如图 8所示分发树树根 RB5需要为 RB1中 VLAN ID 1至 2000的 2000 个 VLAN都建立转发记录， 而为 RB1中 VLAN ID1001至 2000的 1000个 VLAN 建立的转发记录是多余的转发记录。 与现有技术相比， 本发明实施例中的分 发树树根 RB减少了 1000条转发记录。
举例来说， 本实施例可以为 VLAN或 VLAN中二层组播组或 VLAN中三层组 播组进行分发树剪枝， 也可以同时为 VLAN、 VLAN中二层组播组、 VLAN中三层 组播组中的两种或三种进行分发树剪枝， 本发明实施例对此不做限制。
本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的方法， 能够在扩展的 IS-IS LSP中携带 VLAN和为该 VLAN选择的分发树之间的关系， RB在接收到扩展的 IS-IS LSP后只需为 VLAN和为该 VLAN选择的分发树建立 转发记录即可， 解决了现有技术中需要为 VLAN和 Ingres s RB选择的所有分 发树之间都建立转发记录的问题， 减少了分发树转发表的转发记录数量， 节 省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够以对 VLAN建立分发树转发表的实现方式对 VLAN中的二层组 播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基 础上进一步节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法，还能够在一个扩展的 IS-I S LSP中以批量的方式向 RB通告为多个 VLAN 或二层组播组或三层组播组选择的分发树， 可以减少 TRILL 网络中发送扩展 的 IS-IS LSP的数量， 节省 TRILL的网络资源。
本发明实施例提供了一种在透明多链路互联（TRILL ) 网络中实现组播的 方法， 如图 16所示， 所述方法包括： 1601、 最高树根优先级 RB为 TRILL网络中所有 VLAN、 VLAN中二层组播 组、 VLAN中三层组播组中的至少一种选择相应的分发树。
优先级最高的 RB为最高树根优先级 RB。 如果存在至少两个 RB的优先级 相同的情况， 则根据每个 RB的 sys tern ID值对 RB进行排序， sys tern ID值大 的 RB排序在前。 如果存在至少两个 RB的 sys tem ID值相同的情况， 则再根 据 RB的 ni ckname值对 RB进行排序， ni ckname值大的 RB排序在前。对 RB进 行排序后，排序位置最靠前的 RB为最高树根优先级 RB。 所述最高树根优先级 RB可以指定任意 RB (包括自身）为分发树树根 RB。
以图 14所示的网络为例， TRILL网络中有 2台分发树树根 RB和 4台 RB, 其中 RB1接入 VLAN ID1至 100的 100个 VLAN, RB2、 RB3以及 RB4分别接入 VLAN ID1至 2000的 2000个 VLAN , 分发树树根 RB5为最高树根优先级 RB。 以 RB1为 Ingres s s RB为例：分发树树根 RB5为 TRILL网络中接入的 2000个 VLAN 选择分发树， 分发树树根 RB5为 VLAN ID1至 1000的 1000个 VLAN选择分发 树树才艮 RB5 , 为 VLAN ID1001至 2000的 1000个 VLAN选择分发树树才艮 RB6。
1602、 最高树根优先级 RB通过扩展的 I S-I S协议报文将 TRILL网络中所 有 VLAN和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中 三层组播组和分发树对应关系中的至少一种对应关系通告给 TRILL 网络中的 其他 RB。
Ingres s RB在接收到分发树树根 RB的通告后选择相应的分发树并通过扩 展的 I S-I S协议 文将 VLAN和分发树的对应关系、 VLAN中二层组播组和分发 树的对应关系、 VLAN 中三层组播组和分发树的对应关系中的至少一种对应关 系通告给其他 RB,以便其他 RB根据扩展的 I S- I S协议报文对分发树进行剪枝， 建立分发树转发表。
举例来说， 本实施例可以为 VLAN或 VLAN中二层组播组或 VLAN中三层组 播组进行分发树剪枝， 也可以同时为 VLAN、 VLAN中二层组播组、 VLAN中三层 组播组中的两种或三种进行分发树剪枝， 本发明实施例对此不做限制。
本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的方法， 能够由最高树根优先级 RB为 VLAN选择分发树， 并通过扩展的 I S-I S协议报 文将 VLAN 和为该 VLAN选择的分发树之间的关系通告给 Ingre s s RB , 以便 Ingres s RB选择 VLAN并将选择的 VLAN和与该 VLAN对应的分发树通告给其他 RB, 其他 RB在接收到 Ingre s s RB的通告后为 VLAN和为该 VLAN选择的分发 树建立转发记录。 解决了现有技术中需要为 VLAN和 Ingres s RB选择的所有 分发树之间都建立转发记录的问题， 减少了分发树转发表的转发记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够以对 VLAN建立分发树转发表的实现方式对 VLAN中的二层组 播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基 础上进一步节省了分发树转发表的资源。
本发明实施例提供了另一种在透明多链路互联（TRILL ) 网络中实现组播 的方法， 如图 17所示， 所述方法是对图 16所示实施例的进一步扩展。 所述 方法包括：
1701、 最高树根优先级 RB为 TRILL网络中所有 VLAN、 VLAN中二层组播 组、 VLAN中三层组播组中的至少一种选择相应的分发树。
优先级最高的 RB为最高树根优先级 RB。 如果存在至少两个 RB的优先级 相同的情况， 则根据每个 RB的 sys tern ID值对 RB进行排序， sys tern ID值大 的 RB排序在前。 如果存在至少两个 RB的 sys tem ID值相同的情况， 则再根 据 RB的 ni ckname值对 RB进行排序， ni ckname值大的 RB排序在前。对 RB进 行排序后，排序位置最靠前的 RB为最高树根优先级 RB。 所述最高树根优先级 RB可以指定任意 RB (包括自身）为分发树树根 RB。
以图 14所示的网络为例， TRILL网络中有 2台分发树树根 RB和 4台 RB, 其中 RB1接入 VLAN ID1至 100的 100个 VLAN, RB2、 RB3以及 RB4分别接入 VLAN ID1至 2000的 2000个 VLAN , 分发树树根 RB5为最高树根优先级 RB。 以 RB1为 Ingres s s RB为例：分发树树根 RB5为 TRILL网络中接入的 2000个 VLAN 选择分发树， 分发树树根 RB5为 VLAN ID1至 1000的 1000个 VLAN选择分发 树树才艮 RB5 , 为 VLAN ID1001至 2000的 1000个 VLAN选择分发树树才艮 RB6。
可选的， 以 VLAN为例， 分发树树根 RB5可以通过静态配置的方式为 VLAN 选择对应分发树树根 RB的分发树， 由网络管理员根据 TRILL网络的现网条件 对 VLAN进行静态配置。
进一步可选的， 分发树树根 RB5 还可以通过 VLAN标识和预定的算法为 VLAN选择对应分发树树根 RB的分发树。 以 VLAN ID作为 VLAN标识为例： 首 先对 TRILL网络中的分发树树根 RB进行排序，按照 TRILL基础协议（ RFC6325 ) 的现有方法从 1 开始对分发树进行编号， 然后对对应于分发树的分发树树根 RB进行编号。例如，如图 14所示分发树树根 RB5的编号为 1 ,分发树树根 RB 6 的编号为 2。 举例来说， 所述预定的算法可以是 VLAN ID模 ( MOD )算法： 以 VLAN ID值除以 TRILL网络中分发树树根 RB的个数， 取余数再加 1 , 便得出 为该 VLAN选择几号分发树树根 RB所对应的分发树了。 例如， 如图 3所示， 殳设 RB1接入 5个 VLAN, 这五个 VLAN的 VLAN ID分别为 1、 2、 3、 4和 5。 用 1除以 2 ( TRILL中分发树树根 RB的个数）， 得 0余 1 , 以余数 1再加上 1 就等于 2 , 由此得出为 VLAN ID值为 1的 VLAN选择与编号为 2的分发树树根 RB (即图 3中分发树树根 RB6 )对应的分发树。 同理可算出 VLAN ID为 3和 5 的 VLAN同样选择与编号为 2的分发树树根 RB对应的分发树。 本算法中余数 加 1的目的在于， 当 VLAN ID值与分发树树根 RB的个数整除时 （余数为 0 ), 可以为该 VLAN ID的 VLAN选择编号为 1的分发树树根 RB (即图中分发树树根 RB5 )对应的分发树（ 0+1=1 ), 从而不会出现分发树树根 RB编号为 0的情况。 本例中为 VLAN ID为 2和 4的 VLAN选择与编号为 1的分发树树根 RB对应的 分发树。 VLAN ID模算法同样可以应用于以 FineLabe l作为 VLAN标识的场景 中， 该场景中只要用 FineLabe l替代 VLAN ID即可釆用模算法， 具体实现方 式不再赘述。 此外， 本发明实施例中以 VLAN ID模算法作为预定的算法进行 说明， 实际应用中所述预定的算法并不限定于此。
举例来说， 当为 VLAN中的二层组播组选择分发树时， 同样釆用 1601所 述的实现方式， 只是将 1601中所述的 VLAN ID或 FineLabe l替换为二层组播 组的 MAC地址即可。 又举例来说， 当为 VLAN中的三层组播组选择分发树时， 同样可以釆用 1601 所述的实现方式， 只是将 1601 中所述的 VLAN ID 或 FineLabe l替换为三层组播组的 IP地址即可。 具体实现方式此处不再赘述。 1702、 最高树根优先级 RB通过扩展的 I S-IS LSP将 VLAN和分发树对应 关系、 VLAN中二层组播组和分发树对应关系、 VLAN中三层组播组和分发树对 应关系中的至少一种对应关系通告给 TR I LL网络中的其他 RB。
举例来说， 所述扩展的扩展的 IS-IS LSP包括新定义的 TLV。 所述 TLV中 携带有 VLAN的 VLAN ID (或 FineLabe l )和为该 VLAN选择的分发树所对应的 分发树树根 RB的别名 （ Nickname ) , 以此描述 VLAN和为该 VLAN选择的分发 树的对应关系。 又举例来说， 当为二层组播组选择分发树时， 所述 TLV 中除 携带为该二层组播组选择的分发树所对应的分发树树根 RB的别名以外， 还要 携带该二层组播组的 MAC地址以及该二层组播组所属的 VLAN的 VLAN ID (或 FineLabe l ), MAC地址可以作为二层组播组的标识。 再举例来说， 当为三层组 播组选择分发树时， 所述 TLV 中除携带为该三层组播组选择的分发树所对应 的分发树树根 RB的别名以外， 还要携带该三层组播组的 IP地址以及该三层 组播组所属的 VLAN的 VLAN ID (或 FineLabe l ), IP地址可以作为三层组播组 的标识。
可选的， 最高树根优先级 RB可以在一个 TLV中携带多个 VLAN (或二层组 播组或三层组播组）的标识和一个分发树树根 RB的别名。 所述携带多个 VLAN (或二层组播组或三层组播组） 的标识用于在一个 TLV中描述多个 VLAN (或 二层组播组或三层组播组）选择的分发树（同一个分发树 ),以此减少发送 TLV 的数量， 节省 TRILL网络资源。 举例来说， 以 VLAN并且以 VLAN ID作为 VLAN 标识为例： RB可以在一个 TLV中携带两个 VLAN ID和一个分发树树根 RB的别 名， 所述两个 VLAN ID所组成 ID值区间中所有的 VLAN ID所对应的 VLAN都 选择该分发树树根 RB作为分发树。 或者， 最高树根优先级 RB可以在一个 TLV 中携带一个位图 （bi tmap图）和一个分发树树根 RB的别名， 所述位图中的每 一比特位代表 RB内接入的一个 VLAN。 当比特位为 1时，表示该比特位对应的 VLAN选择该分发树树根 RB作为分发树， 当比特位为 G时，表示该比特位对应 的 VLAN不选择该分发树树根 RB作为分发树。 对于二层组播组， 还可以在一 个 TLV中通过 MAC地址 +掩码实现二层组播组选择分发树的批量通告。 同理， 对于三层组播组， 可以在一个 TLV中通过 IP地址 +掩码的方式实现三层组播 组选择分发树的批量通告。
Ingress RB在接收到最高树根优先级 RB的通告后选择相应的分发树并通 过扩展的 IS-IS LSP将 VLAN和分发树的对应关系、 或者 VLAN中二层组播组 和分发树的对应关系、 或者 VLAN中三层组播组和分发树的对应关系通告给其 他 RB, 以便所述其他 RB根据通告的扩展的 IS-IS LSP对分发树进行剪枝， 建 立分发树转发表。
需要说明的是， Ingress RB在根据最高树根优先级 RB通告的扩展的 IS-IS LSP为 VLAN选择分发树时， Ingress RB只为最高树根优先级 RB通告的扩展 的 IS-IS LSP中携带的本 Ingress RB接入的 VLAN选择分发树树根 RB。
举例来说， 本实施例可以为 VLAN或 VLAN中二层组播组或 VLAN中三层组 播组进行分发树剪枝， 也可以同时为 VLAN、 VLAN中二层组播组、 VLAN中三层 组播组中的两种或三种进行分发树剪枝， 本发明实施例对此不做限制。
本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的方法， 能够由最高树根优先级 RB为 VLAN选择分发树， 并通过扩展的 IS-IS LSP将 VLAN和为该 VLAN选择的分发树之间的关系通告给其他 RB, 以便 Ingress RB 选择 VLAN并将选择的 VLAN和与该 VLAN对应的分发树通告给其他 RB, 其他 RB在接收到 Ingress RB的通告后为 VLAN和为该 VLAN选择的分发树建立转发 记录。 解决了现有技术中需要为 VLAN和 Ingress RB选择的所有分发树之间 都建立转发记录的问题， 减少了分发树转发表的转发记录数量， 节省了分发 树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够以对 VLAN建立分发树转发表的实现方式对 VLAN中的二层组 播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基 础上进一步节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的方法， 还能够由将为 VLAN (或二层组播组或三层组播组）选择分发树的静 态配置或算法迁移到最高树根优先级 RB上进行， 由最高树根优先级 RB预先 为 VLAN (或二层组播组或三层组播组）选择分发树。 本发明实施例相对于现 有技术， 还能进一步减少在各个 Ingres s RB中进行静态配置或算法协调的资 源成本， 提高了 TRILL网络中分发树剪枝的智能化程度。
参考图 2所示方法实施例的实现， 本发明实施例提供了一种 Ingres s RB, 如图 18所示， 用以实现图 1所示的方法实施例。 所述 Ingres s RB包括： 处 理器 1801和发送器 1802 , 其中，
所述处理器 1801 , 用于确定下述对应关系中的至少一种： 第一 VLAN和分 发树的对应关系、 第二 VLAN 中二层组播组和分发树的对应关系、 第三 VLAN 中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN 为所述 Ingres s RB接入的 VLAN。
所述发送器 1802 , 用于通过扩展的 IS-IS协议报文将确定的对应关系通 告给 TRILL网络中的其他 RB, 以便其他 RB按照通告对分发树进行剪枝， 建立 剪枝后的分发树转发表。
进一步的， 如图 19所示， 所述处理器 1801可以包括：
第一选择单元 1901 , 用于为第一 VLAN、 第二 VLAN中二层组播组、 第三 VLAN中三层组播组中的至少一种选择相应的分发树。
进一步的， 所述发送器 1802 通告的扩展的 IS-IS 协议报文包括扩展的 IS-IS LSP , 所述扩展的 IS-I S LSP包括新定义的 TLV, 所述 TLV用于描述所 述处理器 1801确定的对应关系中的至少一个对应关系。
举例来说， 所述 TLV中携带有 VLAN的 VLAN ID (或 F ineLabe l )和为该 和为该 VLAN选择的分发树的对应关系。 又举例来说， 当为二层组播组选择分 发树时， 所述 TLV 中除携带为该二层组播组选择的分发树所对应的分发树树 根 RB的别名以外， 还要携带该二层组播组的 MAC地址以及该二层组播组所属 的 VLAN的 VLAN ID (或 FineLabe l ), MAC地址可以作为二层组播组的标识。 再举例来说， 当为三层组播组选择分发树时， 所述 TLV 中除携带为该三层组 播组选择的分发树所对应的分发树树根 RB的别名以外， 还要携带该三层组播 组的 IP地址以及该三层组播组所属的 VLAN的 VLAN ID (或 F ineLabe l ), IP 地址可以作为三层组播组的标识。 可选的， 所述发送器 1802可以在一个 TLV中携带多个 VLAN (或二层组播 组或三层组播组） 的标识和一个分发树树根 RB 的别名。 所述携带多个 VLAN (或二层组播组或三层组播组） 的标识用于在一个 TLV中描述多个 VLAN (或 二层组播组或三层组播组）选择的分发树（同一个分发树 ),以此减少发送 TLV 的数量， 节省 TRILL网络资源。 举例来说， 以 VLAN并且以 VLAN ID作为 VLAN 标识为例： 所述发送器 1802可以在一个 TLV中携带两个 VLAN ID和一个分发 树树根 RB的别名， 所述两个 VLAN ID所组成 ID值区间中所有的 VLAN ID所 对应的 VLAN都选择该分发树树根 RB作为分发树。 或者， 所述发送器 1802可 以在一个 TLV中携带一个位图 （ bi tmap图）和一个分发树树根 RB的别名， 所 述位图中的每一比特位代表 RB内接入的一个 VLAN。 当比特位为 1时，表示该 比特位对应的 VLAN选择该分发树树根 RB作为分发树， 当比特位为 G时， 表 示该比特位对应的 VLAN不选择该分发树树根 RB作为分发树。 对于二层组播 组， 还可以在一个 TLV中通过 MAC地址 +掩码实现二层组播组选择分发树的批 量通告。 同理， 对于三层组播组， 可以在一个 TLV中通过 IP地址 +掩码的方 式实现三层组播组选择分发树的批量通告。
进一步的， 所述第一选择单元 1901具体用于根据第一 VLAN的 VLAN标识 与分发树的个数并按照预定的算法， 为第一 VLAN选择分发树， 根据第二 VLAN 中二层组播组的 MAC地址与分发树的个数并按照预定的算法， 为第二 VLAN中 二层组播组选择分发树， 根据第三 VLAN中三层组播组的 IP地址与分发树的 个数并按照预定的算法， 为第三 VLAN中三层组播组选择分发树。
进一步的， 所述发送器 1802还用于将选择的分发树以及下述信息中的至 少一种通过 TRILL现有协议 ^艮文格式通告给所述 TRILL网络中的其他 RB: 第 一 VLAN的 VLAN标识，第二 VLAN中二层组播组的 MAC地址和第二 VLAN的 VLAN 标识， 第三 VLAN中三层组播组的 IP地址和第三 VLAN的 VLAN标识， 以便不 支持扩展的 IS-I S协议的 RB对分发树进行剪枝，建立剪枝后的分发树转发表。
进一步的， 如图 20所示， 所述 Ingres s RB可以包括：
广播单元 2001 , 用于当所述处理器 1801没有确定第二 VLAN中二层组播 组和分发树的对应关系时， 在第二 VLAN内广播二层组播组的 ^艮文。 进一步的， 所述广播单元 2001还用于当所述处理器 1801没有确定第三 VLAN中三层组播组和分发树的对应关系时，在第三 VLAN内广播三层组播组的 报文。
本发明实施例提供的 Ingres s RB, 能够在扩展的 IS-IS LSP中携带 VLAN 和为该 VLAN选择的分发树之间的关系， 其他 RB在接收到扩展的 I S-IS LSP 协议后只需为 VLAN和为该 VLAN选择的分发树建立转发记录即可， 解决了现 有技术中需要为 VLAN和 Ingres s RB选择的所有分发树之间都建立转发记录 的问题， 减少了分发树转发表的转发记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的 Ingres s RB, 还能够以对 VLAN建立分发树转 发表的实现方式对 VLAN中的二层组播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基础上进一步节省了分发树转发表的资源。
此外， 本发明实施例提供的 Ingres s RB, 还能够在一个扩展的 IS-IS LSP 中以批量的方式向其他 RB通告为多个 VLAN或二层组播组或三层组播组选择 的分发树， 可以减少 TRILL网络中发送扩展的 IS-IS LSP的数量， 节省 TRILL 的网络资源。
参考图 2所示方法实施例的实现， 本发明实施例提供了一种 Ingres s RB, 如图 21所示， 用以实现图 1所示的方法实施例。 所述 Ingres s RB包括： 处 理器 2101和发送器 2102 , 其中，
所述处理器 2101 , 用于确定下述对应关系中的至少一种： 第一 VLAN和分 发树的对应关系、 第二 VLAN 中二层组播组和分发树的对应关系、 第三 VLAN 中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN 为所述 Ingres s RB接入的 VLAN。
所述发送器 2102 , 用于通过扩展的 IS-IS协议报文将确定的对应关系通 告给 TRILL网络中的其他 RB, 以便其他 RB按照通告对分发树进行剪枝， 建立 剪枝后的分发树转发表。
进一步的， 如图 22所示， 所述处理器 2101可以包括：
接收单元 2201 , 用于接收最高树根优先级 RB通告的 TRILL 网络中所有 VLAN和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中三层 组播组和分发树对应关系中的至少一种对应关系。
第二选择单元 2202 ,用于根据最高树根优先级 RB通告的 TRILL网络中所 有 VLAN和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中 三层组播组和分发树对应关系中的至少一种对应关系为第一 VLAN、 第二 VLAN 中二层组播组、 第三 VLAN中三层组播组中的至少一种选择相应的分发树， 所 述第一 VLAN、 第二 VLAN、 第三 VLAN为所述 Ingres s RB接入的 VLAN。
进一步的， 所述发送器 2102 通告的扩展的 IS-IS 协议报文包括扩展的 IS-IS LSP , 所述扩展的 IS-I S LSP包括新定义的 TLV, 所述 TLV用于描述所 述处理器 2101确定的对应关系中的至少一个对应关系。
举例来说， 所述 TLV中携带有 VLAN的 VLAN ID (或 F ineLabe l )和为该 和为该 VLAN选择的分发树的对应关系。 又举例来说， 当为二层组播组选择分 发树时， 所述 TLV 中除携带为该二层组播组选择的分发树所对应的分发树树 根 RB的别名以外， 还要携带该二层组播组的 MAC地址以及该二层组播组所属 的 VLAN的 VLAN ID (或 FineLabe l ), MAC地址可以作为二层组播组的标识。 再举例来说， 当为三层组播组选择分发树时， 所述 TLV 中除携带为该三层组 播组选择的分发树所对应的分发树树根 RB的别名以外， 还要携带该三层组播 组的 IP地址以及该三层组播组所属的 VLAN的 VLAN ID (或 F ineLabe l ), IP 地址可以作为三层组播组的标识。
可选的， 所述发送器 2102可以在一个 TLV中携带多个 VLAN (或二层组播 组或三层组播组） 的标识和一个分发树树根 RB 的别名。 所述携带多个 VLAN (或二层组播组或三层组播组） 的标识用于在一个 TLV中描述多个 VLAN (或 二层组播组或三层组播组）选择的分发树（同一个分发树 ),以此减少发送 TLV 的数量， 节省 TRILL网络资源。 举例来说， 以 VLAN并且以 VLAN ID作为 VLAN 标识为例： 所述发送器 2102可以在一个 TLV中携带两个 VLAN ID和一个分发 树树根 RB的别名， 所述两个 VLAN ID所组成 ID值区间中所有的 VLAN ID所 对应的 VLAN都选择该分发树树根 RB作为分发树。 或者， 所述发送器 2102可 以在一个 TLV中携带一个位图 （ bi tmap图）和一个分发树树根 RB的别名， 所 述位图中的每一比特位代表 RB内接入的一个 VLAN。 当比特位为 1时，表示该 比特位对应的 VLAN选择该分发树树根 RB作为分发树， 当比特位为 G时， 表 示该比特位对应的 VLAN不选择该分发树树根 RB作为分发树。 对于二层组播 组， 还可以在一个 TLV中通过 MAC地址 +掩码实现二层组播组选择分发树的批 量通告。 同理， 对于三层组播组， 可以在一个 TLV中通过 IP地址 +掩码的方 式实现三层组播组选择分发树的批量通告。
进一步的， 所述发送器 2102还用于将选择的分发树以及下述信息中的至 少一种通过 TRILL现有协议 ^艮文格式通告给所述 TRILL网络中的其他 RB: 第 一 VLAN的 VLAN标识，第二 VLAN中二层组播组的 MAC地址和第二 VLAN的 VLAN 标识， 第三 VLAN中三层组播组的 IP地址和第三 VLAN的 VLAN标识， 以便不 支持扩展的 IS-I S协议的 RB对分发树进行剪枝，建立剪枝后的分发树转发表。
进一步的， 如图 23所示， 所述 Ingres s RB可以包括：
广播单元 2301 , 用于当所述处理器 2101没有确定第二 VLAN中二层组播 组和分发树的对应关系时， 在第二 VLAN内广播二层组播组的 ^艮文。
进一步的， 所述广播单元 2301还用于当所述处理器 2101没有确定第三
VLAN中三层组播组和分发树的对应关系时，在第三 VLAN内广播三层组播组的 报文。
本发明实施例提供的 Ingres s RB, 能够在扩展的 IS-IS LSP中携带 VLAN 和为该 VLAN选择的分发树之间的关系， 其他 RB在接收到扩展的 I S-IS LSP 协议后只需为 VLAN和为该 VLAN选择的分发树建立转发记录即可， 解决了现 有技术中需要为 VLAN和 Ingres s RB选择的所有分发树之间都建立转发记录 的问题， 减少了分发树转发表的转发记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的 Ingres s RB, 还能够以对 VLAN建立分发树转 发表的实现方式对 VLAN中的二层组播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基础上进一步节省了分发树转发表的资源。
此外， 本发明实施例提供的 Ingres s RB, 还能够在一个扩展的 IS-IS LSP 中以批量的方式向其他 RB通告为多个 VLAN或二层组播组或三层组播组选择 的分发树， 可以减少 TRILL网络中发送扩展的 IS-IS LSP的数量， 节省 TRILL 的网络资源。
参考图 15 所示方法实施例的实现， 本发明实施例提供了一种 RB, 如图 24所示， 用以实现图 15所示的方法实施例。 所述 RB包括： 接收器 2401和处 理器 2402 , 其中，
所述接收器 2401 , 用于接收 Ingres s RB通告的下述对应关系中的至少一 种： 第一 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和分发树的对 应关系、 第三 VLAN中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN, 第三 VLAN为所述 Ingres s RB接入的 VLAN。
所述处理器 2402 , 用于根据 Ingres s RB的通告对分发树进行剪枝， 建立 剪枝后的分发树转发表。
本发明实施例所述的 RB包括 Ingres s RB、 Egres s RB和 Trans i t RB。 本发明实施例提供的 RB, 能够在接收到扩展的 IS-IS LSP后只需为 VLAN 和为该 VLAN选择的分发树建立转发记录， 解决了现有技术中需要为 VLAN和 Ingres s RB选择的所有分发树之间都建立转发记录的问题， 减少了分发树转 发表的转发记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的 RB,还能够以对 VLAN建立分发树转发表的实 现方式对 VLAN中的二层组播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基础上进一步节省了分发树转发表的资源。
参考图 17所示方法实施例的实现， 本发明实施例提供了一种最高树根优 先级 RB, 如图 25所示， 用以实现图 17所示的方法实施例。 所述最高树根优 先级 RB包括： 处理器 2501和发送器 2502 , 其中，
所述处理器 2501 , 用于为 TRILL网络中所有 VLAN、 VLAN中二层组播组、 VLAN中三层组播组中的至少一种选择相应的分发树。
所述发送器 2502 ,用于通过扩展的 IS-I S协议 文将 VLAN和分发树对应 关系、 VLAN中二层组播组和分发树对应关系、 VLAN中三层组播组和分发树对 应关系中的至少一种对应关系通告给 TR I LL网络中的其他 RB ,以便 I ng r e s s RB 根据所述发送器 2502的通告为 VLAN、 VLAN中二层组播组、 VLAN中三层组播 组中的至少一种选择相应的分发树并通过扩展的 IS-I S协议报文将选择的分 发树通告给 TRILL网络中的其他 RB , 使其他 RB根据 I ngre s s RB的通告对分 发树进行剪枝， 建立剪枝后的分发树转发表。
进一步的， 所述发送器 2502通告的扩展的 I S- I S协议包括扩展的 I S- I S LSP , 所述扩展的 I S-I S LSP包括新定义的 TLV , 所述 TLV用于描述所述最高 树根优先级 RB确定的对应关系中的至少一个对应关系。
举例来说， 所述 TLV中携带有 VLAN的 VLAN ID (或 F ineLabe l )和为该 和为该 VLAN选择的分发树的对应关系。 又举例来说， 当为二层组播组选择分 发树时， 所述 TLV 中除携带为该二层组播组选择的分发树所对应的分发树树 根 RB的别名以外， 还要携带该二层组播组的 MAC地址以及该二层组播组所属 的 VLAN的 VLAN ID (或 F ineLabe l ), MAC地址可以作为二层组播组的标识。 再举例来说， 当为三层组播组选择分发树时， 所述 TLV 中除携带为该三层组 播组选择的分发树所对应的分发树树根 RB的别名以外， 还要携带该三层组播 组的 IP地址以及该三层组播组所属的 VLAN的 VLAN ID (或 F ineLabe l ), IP 地址可以作为三层组播组的标识。
可选的， 所述发送器 2502可以在一个 TLV中携带多个 VLAN (或二层组播 组或三层组播组） 的标识和一个分发树树根 RB 的别名。 所述携带多个 VLAN (或二层组播组或三层组播组） 的标识用于在一个 TLV中描述多个 VLAN (或 二层组播组或三层组播组）选择的分发树（同一个分发树 ),以此减少发送 TLV 的数量， 节省 TRILL网络资源。 举例来说， 以 VLAN并且以 VLAN ID作为 VLAN 标识为例： 所述发送器 2502可以在一个 TLV中携带两个 VLAN ID和一个分发 树树根 RB的别名， 所述两个 VLAN ID所组成 ID值区间中所有的 VLAN ID所 对应的 VLAN都选择该分发树树根 RB作为分发树。 或者， 所述发送器 2502可 以在一个 TLV中携带一个位图 （ b i tmap图）和一个分发树树根 RB的别名， 所 述位图中的每一比特位代表 RB内接入的一个 VLAN。 当比特位为 1时，表示该 比特位对应的 VLAN选择该分发树树根 RB作为分发树， 当比特位为 0时， 表 示该比特位对应的 VLAN不选择该分发树树根 RB作为分发树。 对于二层组播 组， 还可以在一个 TLV中通过 MAC地址 +掩码实现二层组播组选择分发树的批 量通告。 同理， 对于三层组播组， 可以在一个 TLV中通过 IP地址 +掩码的方 式实现三层组播组选择分发树的批量通告。
进一步的， 所述处理器 2501具体用于根据 VLAN的 VLAN标识与分发树的 个数并按照预定的算法， 为 VLAN选择分发树，根据 VLAN中二层组播组的 MAC 地址与分发树的个数并按照预定的算法， 为 VLAN中二层组播组选择分发树， 根据 VLAN中三层组播组的 IP地址与分发树的个数并按照预定的算法，为 VLAN 中三层组播组选择分发树。
本发明实施例提供的最高树根优先级 RB, 能够为 VLAN选择分发树， 并通 过扩展的 IS-I S LSP将 VLAN和为该 VLAN选择的分发树之间的关系通告给其 他 RB, 以便 Ingres s RB选择 VLAN并将选择的 VLAN和与该 VLAN对应的分发 树通告给其他 RB,其他 RB在接收到 Ingres s RB的通告后为 VLAN和为该 VLAN 选择的分发树建立转发记录。 解决了现有技术中需要为 VLAN和 Ingres s RB 选择的所有分发树之间都建立转发记录的问题， 减少了分发树转发表的转发 记录数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的最高树根优先级 RB,还能够以对 VLAN建立分 发树转发表的实现方式对 VLAN中的二层组播组以及三层组播组建立分发树转 发表， 在细化了 VLAN内流量转发方式的基础上进一步节省了分发树转发表的 资源。
进一步的， 本发明实施例提供了一种在透明多链路互联（TRILL ) 网络中 实现组播的系统， 所述系统涵盖了上述方法和装置实施例的实现。 所述系统 包括：
Ingres s RB, 用于确定下述对应关系中的至少一种： 第一 VLAN和分发树 的对应关系、 第二 VLAN中二层组播组和分发树的对应关系、 第三 VLAN中三 层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN为所 述 Ingres s RB接入的 VLAN, 通过扩展的 IS-IS协议将确定的对应关系通告给 TRILL网络中的其他 RB, 以便其他 RB按照 Ingres s RB的通告对分发树进行 剪枝， 建立剪枝后的分发树转发表。
RB, 用于接收 Ingres s RB通告的下述对应关系中的至少一种： 第一 VLAN 和分发树的对应关系、第二 VLAN中二层组播组和分发树的对应关系、第三 VLAN 中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN 为所述 Ingres s RB接入的 VLAN, 根据 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的分发树转发表。
最高树根优先级 RB, 用于为 TRILL网络中的 VLAN、 VLAN中二层组播组、 VLAN中三层组播组中的至少一种选择相应的分发树， 通过扩展的 I S-IS协议 将 VLAN和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中 三层组播组和分发树对应关系中的至少一种对应关系通告给 TRILL 网络中的 其他 RB, 以便 Ingres s RB根据最高树根优先级 RB的通告为第一 VLAN、 第二 VLAN中二层组播组、第三 VLAN中三层组播组中的至少一种选择相应的分发树 并通过扩展的 IS-I S协议将选择的分发树通告给 TRILL网络中的其他 RB, 使 其他 RB根据 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的分发树转 发表， 所述第一 VLAN、第二 VLAN、第三 VLAN为所述 Ingres s RB接入的 VLAN。
本发明实施例提供的在透明多链路互联（ TRILL )网络中实现组播的系统， 能够在扩展的 IS-IS协议中携带 VLAN和为该 VLAN选择的分发树之间的关系 , 其他 RB在接收到扩展的 IS- IS LSP协议后只需为 VLAN和为该 VLAN选择的分 发树建立转发记录即可， 解决了现有技术中需要为 VLAN和 Ingres s RB选择 的所有分发树之间都建立转发记录的问题， 减少了分发树转发表的转发记录 数量， 节省了分发树转发表的资源。
此外， 本发明实施例提供的在透明多链路互联（TRILL ) 网络中实现组播 的系统， 还能够以对 VLAN建立分发树转发表的实现方式对 VLAN中的二层组 播组以及三层组播组建立分发树转发表， 在细化了 VLAN内流量转发方式的基 础上进一步节省了分发树转发表的资源。
通过以上的实施方式的描述， 所属领域的技术人员可以清楚地了解到本 发明可借助软件加必需的通用硬件的方式来实现， 当然也可以通过硬件， 但 很多情况下前者是更佳的实施方式。 基于这样的理解， 本发明的技术方案本 质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来， 该 计算机软件产品存储在可读取的存储介质中， 如计算机的软盘， 硬盘或光盘 等， 包括若干指令用以使得一台计算机设备（可以是个人计算机， 服务器， 或者网络设备等）执行本发明各个实施例所述的方法。
以上所述， 仅为本发明的具体实施方式， 但本发明的保护范围并不局限 于此， 任何熟悉本技术领域的技术人员在本发明揭露的技术范围内， 可轻易 想到变化或替换， 都应涵盖在本发明的保护范围之内。 因此， 本发明的保护 范围应所述以权利要求的保护范围为准。

Claims

权 利 要 求
1、 一种在透明多链路互联 TRILL网络中实现组播的方法， 其特征在于， 包括：
入口路由桥接设备 Ingres s RB确定下述对应关系中的至少一种： 第一虚 拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和分发树的对 应关系、 第三 VLAN中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN, 第三 VLAN为所述 Ingres s RB接入的 VLAN;
所述 Ingres s RB通过扩展的中间系统到中间系统 IS-IS协议将确定的对 应关系通告给 TRILL网络中的其他 RB, 以便其他 RB按照所述 Ingres s RB的 通告对分发树进行剪枝， 建立剪枝后的分发树转发表。
2、 根据权利要求 1所述的方法， 其特征在于， 所述 Ingres s RB确定下 述对应关系中的至少一种： 第一 VLAN和分发树的对应关系、 第二 VLAN中二 层组播组和分发树的对应关系、第三 VLAN中三层组播组和分发树的对应关系， 包括：
所述 Ingres s RB为所述第一 VLAN、 所述第二 VLAN中二层组播组、 所述 第三 VLAN中三层组播组中的至少一种选择相应的分发树； 或者，
所述 Ingres s RB根据最高树根优先级 RB通告的 TRILL网络中所有 VLAN 和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中三层组播 组和分发树对应关系中的至少一种对应关系为所述第一 VLAN、 所述第二 VLAN 中二层组播组、所述第三 VLAN中三层组播组中的至少一种选择相应的分发树。
3、 根据权利要求 1或 1所述的方法， 其特征在于， 所述 Ingres s RB通 过扩展的 IS-IS协议将确定的对应关系通告给 TRILL网络中的其他 RB,包括： 所述扩展的 I S-IS协议包括扩展的 IS-I S链路状态报文 LSP,所述扩展的 IS-IS LSP包括新定义的类型长度值 TLV, 所述 TLV用于描述所述 Ingres s RB 确定的对应关系中的至少一个对应关系。
4、 根据权利要求 1所述的方法， 其特征在于， 所述 Ingres s RB为所述 第一 VLAN、 所述第二 VLAN中二层组播组、 所述第三 VLAN中三层组播组中的 至少一种选择相应的分发树， 包括：
所述 Ingres s RB根据所述第一 VLAN的 VLAN标识与分发树的个数并按照 预定的算法， 为所述第一 VLAN选择分发树， 根据所述第二 VLAN中二层组播 组的媒体访问控制 MAC地址与分发树的个数并按照预定的算法， 为所述第二 VLAN中二层组播组选择分发树，根据所述第三 VLAN中三层组播组的网间协议 IP地址与分发树的个数并按照预定的算法，为所述第三 VLAN中三层组播组选 择分发树。
5、 根据权利要求 1至 4中任意一项所述的方法， 其特征在于， 所述方法 还包括：
所述 Ingres s RB将选择的分发树以及下述信息中的至少一种通过 TRILL 现有协议报文格式通告给所述 TRILL网络中的其他 RB:所述第一 VLAN的 VLAN 标识，所述第二 VLAN中二层组播组的 MAC地址和所述第二 VLAN的 VLAN标识， 所述第三 VLAN中三层组播组的 IP地址和所述第三 VLAN的 VLAN标识， 以便 不支持所述扩展的 IS-IS协议的 RB对分发树进行剪枝， 建立剪枝后的分发树 转发表。
6、 根据权利要求 1 至 4 中任意一项所述的方法， 其特征在于， 当所述 Ingres s RB没有确定第二 VLAN中二层组播组和分发树的对应关系时， 所述方 法还包括：
所述 Ingres s RB在所述第二 VLAN内广播所述二层组播组的 4艮文。
7、 根据权利要求 1 至 4 中任意一项所述的方法， 其特征在于， 当所述 Ingres s RB没有确定第三 VLAN中三层组播组和分发树的对应关系时， 所述方 法还包括：
所述 Ingres s RB在所述第三 VLAN内广播所述三层组播组的 4艮文。
8、 一种在透明多链路互联 TRILL网络中实现组播的方法， 其特征在于， 包括：
路由桥接设备 RB接收入口 Ingres s RB通告的下述对应关系中的至少一 种： 第一虚拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和 分发树的对应关系、 第三 VLAN中三层组播组和分发树的对应关系； 所述 RB根据所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的 分发树转发表。
9、 一种在透明多链路互联 TRILL网络中实现组播的方法， 其特征在于， 包括：
最高树根优先级路由桥接设备 RB为 TRILL网络中所有虚拟局域网 VLAN、 VLAN中二层组播组、 VLAN中三层组播组中的至少一种选择相应的分发树； 所述最高树根优先级 RB通过扩展的中间系统到中间系统 IS-I S协议将所 述 VLAN和分发树对应关系、 所述 VLAN中二层组播组和分发树对应关系、 所 述 VLAN中三层组播组和分发树对应关系中的至少一种对应关系通告给 TRILL 网络中的其他 RB , 以便入口 Ingres s RB根据所述最高树根优先级 RB的通告 为第一 VLAN、 第二 VLAN中二层组播组、 第三 VLAN中三层组播组中的至少一 种选择相应的分发树并通过扩展的 I S-I S协议将选择的分发树通告给 TRILL 网络中的其他 RB, 使其他 RB根据所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的分发树转发表， 所述第一 VLAN、 第二 VLAN、 第三 VLAN为所述 Ingres s RB接入的 V AN。
10、 根据权利要求 9所述的方法， 其特征在于， 所述最高树根优先级 RB 通过扩展的中间系统到中间系统 IS-IS协议将所述 VLAN和分发树对应关系、 所述 VLAN中二层组播组和分发树对应关系、 所述 VLAN中三层组播组和分发 树对应关系中的至少一种对应关系通告给 TRILL网络中的其他 RB, 包括： 所述扩展的 I S-IS协议包括扩展的 IS-I S链路状态报文 LSP,所述扩展的 IS-IS LSP包括新定义的类型长度值 TLV, 所述 TLV用于描述所述最高树根优 先级 RB选择的对应关系中的至少一个对应关系。
11、 根据权利要求 9或 10所述的方法， 其特征在于， 所述最高树根优先 级 RB为 VLAN、 VLAN中二层组播组、 VLAN中三层组播组中的至少一种选择相 应的分发树， 包括：
所述最高树根优先级 RB根据 VLAN的 VLAN标识与分发树的个数并按照预 定的算法， 为 VLAN选择分发树，根据 VLAN中二层组播组的媒体访问控制 MAC 地址与分发树的个数并按照预定的算法， 为 VLAN中二层组播组选择分发树， 根据 VLAN中三层组播组的网间协议 IP地址与分发树的个数并按照预定的算 法， 为 VLAN中三层组播组选择分发树。
12、 一种入口路由桥接设备 Ingres s RB, 其特征在于， 包括：
处理器， 用于确定下述对应关系中的至少一种： 第一虚拟局域网 VLAN和 分发树的对应关系、 第二 VLAN中二层组播组和分发树的对应关系、 第三 VLAN 中三层组播组和分发树的对应关系， 所述第一 VLAN、 第二 VLAN、 第三 VLAN 为所述 Ingres s RB接入的 VLAN;
发送器， 用于通过扩展的中间系统到中间系统 IS-I S协议将确定的对应 关系通告给 TRILL网络中的其他 RB, 以便其他 RB按照所述 Ingres s RB的通 告对分发树进行剪枝， 建立剪枝后的分发树转发表。
13、根据权利要求 12所述的 Ingres s RB,其特征在于， 所述处理器包括： 第一选择单元， 用于为所述第一 VLAN、 所述第二 VLAN中二层组播组、 所 述第三 VLAN中三层组播组中的至少一种选择相应的分发树； 或者
接收单元， 用于接收最高树根优先级 RB通告的 TRILL 网络中所有 VLAN 和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中三层组播 组和分发树对应关系中的至少一种对应关系；
第二选择单元， 用于根据最高树根优先级 RB通告的 TRILL 网络中所有
VLAN和分发树对应关系、 VLAN中二层组播组和分发树对应关系、 VLAN中三层 组播组和分发树对应关系中的至少一种对应关系， 为所述第一 VLAN、 所述第 二 VLAN中二层组播组、 所述第三 VLAN中三层组播组中的至少一种选择相应 的分发树。
14、 根据权利要求 12或 13所述的 Ingres s RB, 其特征在于， 所述扩展 的 IS-IS协议包括扩展的 IS-IS链路状态 ^艮文 LSP, 所述扩展的 IS-IS LSP包 括新定义的类型长度值 TLV, 所述 TLV用于描述所述 Ingres s RB确定的对应 关系中的至少一个对应关系。
15、 根据权利要求 13所述的 Ingres s RB, 其特征在于， 所述第一选择单 元具体用于根据所述第一 VLAN的 VLAN标识与分发树的个数并按照预定的算 法， 为所述第一 VLAN选择分发树， 根据所述第二 VLAN中二层组播组的媒体 访问控制 MAC地址与分发树的个数并按照预定的算法， 为所述第二 VLAN中二 层组播组选择分发树， 根据所述第三 VLAN中三层组播组的网间协议 IP地址 与分发树的个数并按照预定的算法， 为所述第三 VLAN中三层组播组选择分发 树。
16、 根据权利要求 12至 15中任意一项所述的 Ingres s RB, 其特征在于， 所述发送器还用于将选择的分发树以及下述信息中的至少一种通过 TRILL现 有协议报文格式通告给所述 TRILL网络中的其他 RB: 所述第一 VLAN的 VLAN 标识，所述第二 VLAN中二层组播组的 MAC地址和所述第二 VLAN的 VLAN标识， 所述第三 VLAN中三层组播组的 IP地址和所述第三 VLAN的 VLAN标识， 以便 不支持所述扩展的 IS-IS协议的 RB对分发树进行剪枝， 建立剪枝后的分发树 转发表。
17、 根据权利要求 12至 15中任意一项所述的 Ingres s RB, 其特征在于， 还包括：
广播单元， 用于当所述处理器没有确定第二 VLAN中二层组播组和分发树 的对应关系时， 在所述第二 VLAN内广播所述二层组播组的 文。
18、 根据权利要求 12至 15中任意一项所述的 Ingres s RB, 其特征在于， 所述广播单元还用于当所述处理器没有确定第三 VLAN中三层组播组和分发树 的对应关系时， 在所述第三 VLAN内广播所述三层组播组的 文。
19、 一种路由桥接设备 RB, 其特征在于， 包括：
接收器， 用于接收入口 Ingres s RB通告的下述对应关系中的至少一种： 第一虚拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和分发 树的对应关系、 第三 VLAN中三层组播组和分发树的对应关系；
处理器， 用于根据所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝 后的分发树转发表。
20、 一种最高树根优先级路由桥接设备 RB, 其特征在于， 包括： 处理器，用于为 TRILL网络中所有虚拟局域网 VLAN、 VLAN中二层组播组、 VLAN中三层组播组中的至少一种选择相应的分发树；
发送器， 用于通过扩展的中间系统到中间系统 IS-IS协议将所述 VLAN和 分发树对应关系、 所述 VLAN中二层组播组和分发树对应关系、 所述 VLAN中 三层组播组和分发树对应关系中的至少一种对应关系通告给 TRILL 网络中的 其他 RB, 以便入口 Ingres s RB根据所述最高树根优先级 RB 的通告为第一 VLAN, 第二 VLAN中二层组播组、 第三 VLAN中三层组播组中的至少一种选择 相应的分发树并通过扩展的 IS-IS协议将选择的分发树通告给 TRILL网络中 的其他 RB, 使其他 RB根据所述 Ingres s RB的通告对分发树进行剪枝， 建立 剪枝后的分发树转发表，所述第一 VLAN、第二 VLAN、第三 VLAN为所述 Ingres s RB接入的 VLAN。
21、 根据权利要求 20所述的最高树根优先级 RB, 其特征在于， 所述发送 器通告的扩展的 IS-IS协议包括扩展的 IS-IS链路状态报文 LSP ,所述扩展的 IS-IS LSP包括新定义的类型长度值 TLV, 所述 TLV用于描述所述处理器选择 的对应关系中的至少一个对应关系。
22、 根据权利要求 20或 21所述的最高树根优先级 RB, 其特征在于， 所 述处理器具体用于根据 VLAN的 VLAN标识与分发树的个数并按照预定的算法， 为 VLAN选择分发树， 根据 VLAN中二层组播组的媒体访问控制 MAC地址与分 发树的个数并按照预定的算法， 为 VLAN中二层组播组选择分发树，根据 VLAN 中三层组播组的网间协议 IP地址与分发树的个数并按照预定的算法，为 VLAN 中三层组播组选择分发树。
23、 一种在透明多链路互联 TR I LL网络中实现组播的系统， 其特征在于， 包括：
入口路由桥接设备 Ingres s RB, 用于确定下述对应关系中的至少一种： 第一虚拟局域网 VLAN和分发树的对应关系、 第二 VLAN中二层组播组和分发 树的对应关系、第三 VLAN中三层组播组和分发树的对应关系，所述第一 VLAN、 第二 VLAN、 第三 VLAN为所述 Ingres s RB接入的 VLAN, 通过扩展的中间系统 到中间系统 I S- 1 S协议将确定的对应关系通告给 TR I LL网络中的其他 RB , 以 便其他 RB按照所述 Ingres s RB的通告对分发树进行剪枝， 建立剪枝后的分 发树转发表；
RB, 用于接收所述 Ingres s RB的通告， 根据所述 Ingres s RB的通告对 分发树进行剪枝， 建立剪枝后的分发树转发表。
24、 根据权利要求 23所述的系统， 其特征在于， 所述系统还包括： 最高树根优先级 RB,用于为 TRILL网络中所有 VLAN、VLAN中二层组播组、
VLAN中三层组播组中的至少一种选择相应的分发树， 通过扩展的 I S-IS协议 将所述 VLAN和分发树对应关系、 所述 VLAN中二层组播组和分发树对应关系、 所述 VLAN 中三层组播组和分发树对应关系中的至少一种对应关系通告给
TRILL网络中的其他 RB。
相应地， 所述 Ingres s RB具体用于根据所述最高树根优先级 RB的通告 为所述第一 VLAN、 所述第二 VLAN中二层组播组、 所述第三 VLAN中三层组播 组中的至少一种选择相应的分发树并通过扩展的 IS-I S协议将选择的分发树 通告给 TRILL网络中的其他 RB, 以便其他 RB根据所述 Ingres s RB的通告对 分发树进行剪枝， 建立剪枝后的分发树转发表。
PCT/CN2012/087222 2012-01-16 2012-12-22 在透明多链路互联（trill）网络中实现组播的方法、装置及系统 WO2013107245A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201210012741.2A CN103209132B (zh) 2012-01-16 2012-01-16 在透明多链路互联（trill）网络中实现组播的方法、装置及系统
CN201210012741.2 2012-01-16

Publications (1)

Publication Number Publication Date
WO2013107245A1 true WO2013107245A1 (zh) 2013-07-25

Family

ID=48756221

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/087222 WO2013107245A1 (zh) 2012-01-16 2012-12-22 在透明多链路互联（trill）网络中实现组播的方法、装置及系统

Country Status (2)

Country Link
CN (1) CN103209132B (zh)
WO (1) WO2013107245A1 (zh)

Families Citing this family (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103501289B (zh) * 2013-09-17 2017-01-18 神州数码网络(北京)有限公司 一种多链接透明互联网络中组播分发树的剪切方法及装置
CN103560964B (zh) * 2013-10-28 2017-02-15 杭州华三通信技术有限公司 一种基于多链接半透明互联trill协议的vlan负载分担方法和装置
CN104702506B (zh) * 2013-12-09 2018-10-19 华为技术有限公司 一种报文传输方法、网络节点及报文传输系统
CN103685031B (zh) * 2013-12-31 2017-01-25 杭州华三通信技术有限公司 一种报文转发装置和方法
CN105024901A (zh) * 2014-04-16 2015-11-04 中兴通讯股份有限公司 跨虚拟局域网的报文转发方法、装置及系统
CN105493454B (zh) * 2014-05-13 2019-04-05 华为技术有限公司 用于实现双活接入trill园区边缘的方法和设备
CN105323084B (zh) * 2014-07-01 2020-03-10 中兴通讯股份有限公司 三层网管管理trill网络的方法、装置及系统
CN104639344B (zh) * 2015-02-10 2017-12-15 新华三技术有限公司 一种用户组播报文发送方法和装置
CN109561022B (zh) * 2017-09-27 2020-09-08 华为技术有限公司 一种组播转发方法及组播路由器
CN111432044B (zh) * 2020-03-17 2021-10-15 腾讯科技（深圳）有限公司 多链路设备mac地址管理方法、装置和多链路设备
CN113766432A (zh) * 2020-06-04 2021-12-07 华为技术有限公司 适用于多链路的组播业务传输方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2011144079A2 (zh) * 2011-05-25 2011-11-24 华为技术有限公司 一种分发树生成方法、装置及路由网桥
US20110299527A1 (en) * 2010-06-08 2011-12-08 Brocade Communications Systems, Inc. Supporting multiple multicast trees in trill networks
US20110299528A1 (en) * 2010-06-08 2011-12-08 Brocade Communications Systems, Inc. Network layer multicasting in trill networks
CN102299845A (zh) * 2011-09-20 2011-12-28 神州数码网络(北京)有限公司 多链路透明互联多播帧传输方法和系统
CN102307144A (zh) * 2011-08-19 2012-01-04 杭州华三通信技术有限公司 一种trill网络中dhcp报文转发方法和路由桥

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20110299527A1 (en) * 2010-06-08 2011-12-08 Brocade Communications Systems, Inc. Supporting multiple multicast trees in trill networks
US20110299528A1 (en) * 2010-06-08 2011-12-08 Brocade Communications Systems, Inc. Network layer multicasting in trill networks
WO2011144079A2 (zh) * 2011-05-25 2011-11-24 华为技术有限公司 一种分发树生成方法、装置及路由网桥
CN102307144A (zh) * 2011-08-19 2012-01-04 杭州华三通信技术有限公司 一种trill网络中dhcp报文转发方法和路由桥
CN102299845A (zh) * 2011-09-20 2011-12-28 神州数码网络(北京)有限公司 多链路透明互联多播帧传输方法和系统

Also Published As

Publication number Publication date
CN103209132B (zh) 2017-06-27
CN103209132A (zh) 2013-07-17

Similar Documents

Publication Publication Date Title
WO2013107245A1 (zh) 在透明多链路互联（trill）网络中实现组播的方法、装置及系统
JP7208386B2 (ja) パケット転送方法、パケット送信装置、およびパケット受信装置
US9419817B2 (en) Stitching multicast trees
US9948574B2 (en) Bit indexed explicit replication packet encapsulation
US8953590B1 (en) Layer two virtual private network having control plane address learning supporting multi-homed customer networks
WO2017162095A1 (zh) 基于流规则协议的通信方法、设备和系统
US8694664B2 (en) Active-active multi-homing support for overlay transport protocol
US8743875B2 (en) Extension of the interpretation and definition of the IS-IS TLV/sub-TLV
WO2016066072A1 (zh) 实现nvo3网络与mpls网络之间通信的方法和装置
US20120170578A1 (en) Multicast vpn support for ip-vpn lite
WO2022100554A1 (zh) Bier报文转发的方法、设备以及系统
CN107026796B (zh) 一种vpn路由通告方法、数据流转发方法及相关设备
JP2015523788A (ja) 個別管理方式を使用する仮想転送インスタンスの遠端アドレスへのｖｌａｎタグ付きパケットのルーティング
WO2018214809A1 (zh) 消息发送方法及装置、存储介质
JP2018191290A (ja) 負荷分散を実現するための方法、装置、およびネットワークシステム
WO2011113393A2 (zh) 一种实现虚拟局域网标识转换的方法及装置
WO2013026384A1 (zh) 业务数据传输的方法、网络节点及系统
US11362954B2 (en) Tunneling inter-domain stateless internet protocol multicast packets
WO2013139270A1 (zh) 实现三层虚拟专用网络的方法、设备及系统
WO2018014767A1 (zh) 一种信息确定方法、装置及存储介质
WO2018068588A1 (zh) 提供组播业务的方法和软件定义网络控制器
WO2014186978A1 (zh) 用于以太虚拟专用网的方法和设备
WO2014056412A1 (zh) 一种报文发送的方法、路由器桥及系统
US8559431B2 (en) Multiple label based processing of frames
EP3396897B1 (en) Multicast load balancing in multihoming evpn networks

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

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

Country of ref document: EP

Kind code of ref document: A1