CN102316033B - A kind of method and system of specified distribution tree - Google Patents
A kind of method and system of specified distribution tree Download PDFInfo
- Publication number
- CN102316033B CN102316033B CN201110261762.3A CN201110261762A CN102316033B CN 102316033 B CN102316033 B CN 102316033B CN 201110261762 A CN201110261762 A CN 201110261762A CN 102316033 B CN102316033 B CN 102316033B
- Authority
- CN
- China
- Prior art keywords
- distribution
- distribution tree
- rbridge
- tree
- trees
- Prior art date
- Legal status (The legal status 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 status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 21
- 238000005516 engineering process Methods 0.000 abstract description 3
- 238000004364 calculation method Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000005457 optimization Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses itself, when Rbridge has found that itself does not specify distribution tree or specified distribution tree mistake, is expected that the distribution tree for using is updated to by a kind of method and system of specified distribution tree：The distribution tree being included in k distribution tree list；The k is the number of the calculative distribution tree of all Rbridge in the TRILL network that Rbridge is located；Rbridge refreshes itself LSP in a network according to the distribution tree after renewal.The technology of the specified distribution tree of the present invention, expects the notice procedures of the distribution tree for using by optimizing local Rbridge itself so that on the distribution tree used during Rbridge forwardings and other Rbridge, control information is consistent.
Description
Technical Field
The invention relates to the field of communication, in particular to a method and a system for specifying a distribution tree.
Background
Transparent Interconnection over Lots of Links (TRILL) is a connection layer (L2) network standard recommended by IETF (internet engineering task force) for solving the deficiencies of STP (Spanning Tree protocol) in large data centers. In an L2 network, STP avoids loops by blocking redundant links (links), but also wastes redundant Link bandwidth. TRILL solves the L2 loop problem by introducing an IS-IS (Intermediate System to Intermediate System) routing protocol into the L2 network, while preserving L2 multipath. The L2 multipath may also be referred to as ECMP (equal cost Multiple Path).
In a TRILL network, a device running the TRILL protocol is called a Routing Bridge (RB), and the Rbridge uses a Distribution tree (Distribution trees) to forward multicast packets. Although theoretically one distribution tree would be sufficient for a TRILL network, multiple distribution trees would typically need to be computed in a TRILL network in order to implement multi-routing of multicast packets and to be able to select a distribution tree whose tree root is closer to itself for distribution of multicast packets. When a distribution tree is selected for a multicast packet, a distribution tree whose root is closest to itself is generally selected.
When the Rbridge uses the distribution tree to forward the multicast packet, in order to avoid the packet from generating a loop, a Reverse Path checking (RPF Check) is required, and the Rbridge discards the packet that fails the Reverse Path checking. When one Rbridge (set as RB3) is calculating the distribution tree X, RB3 calculates RPF information for each Rbridge (set as RB2) that selects X to distribute multicast packets, that is, on the distribution tree X, it is legal to receive multicast packets imported from RB2 from any link.
At the control plane, the other Rbridge acquires the reverse path check information of the RB2 by: each Rbridge informs the other rbridges of the number j of distribution trees it expects to use, as well as the tree roots and priorities of these trees, via Link State Packets (LSPs). Through the priority algorithm, the Rbridge in the network will eventually determine the k distribution trees that need all Rbridge computations. If the distribution tree (e.g., Tx) that RB2 expects to use is contained in the k distribution trees described above, other Rbridge in the network will compute RPF information for RB2 at Tx; conversely, if the distribution tree Tx that RB2 desires to use is not in the k distribution trees described above or RB2 does not specify the root of the distribution tree that RB2 desires to use, the other Rbridge selects a higher priority distribution tree (such as Ty) from the k trees described above and calculates RPF information for RB 2.
At the forwarding level, by default (for example, RB2 does not specifically specify the root of the distribution tree expected to be used or specifies that the root is not in the k distribution trees), the RBridge (for example, RB2) selects a distribution tree (for example, Tz) whose root is closest to itself from the k distribution trees for multicast packet distribution. Under a default condition (the RB2 does not specify the root of the distribution tree expected to be used) or under the condition that the specified distribution tree is not included in k distribution trees, the distribution tree Tz selected by the RB2 at the forwarding level may be inconsistent with the distribution tree Ty for calculating RPF information for the RB2 at the control level by other Rbridge, which causes failure of reverse path check of the packet, and further causes packet discarding.
It can be seen that if no distribution tree is specified or if a distribution tree is specified incorrectly, the following situations may exist:
when other Rbridge selects a distribution tree that may be used for RB2, based on performance considerations, it is not possible to perform SPF calculation for RB2 with RB2 as a root node to obtain a distribution tree list with the tree root closer to RB2, so that other Rbridge can only calculate reverse path check information for all k trees for RB 2. When the network is large, the reverse path check information is huge, and more redundant information exists, which is not beneficial to forwarding the message.
In addition, when the RB2 forwards the packet, the optimal distribution tree is selected according to the priority, but this causes the traffic in the TRILL network to be concentrated on some distribution trees with higher priorities, which is not favorable for traffic load sharing of the entire network.
Disclosure of Invention
In view of the above, the main object of the present invention is to provide a method and a system for specifying a distribution tree, which solve the problem of inconsistency between TRILL distribution tree selection and reverse path check information.
In order to achieve the purpose, the technical scheme of the invention is realized as follows:
a method of specifying a distribution tree, the method comprising:
when the Rbridge finds that the distribution tree is not specified or the specified distribution tree is wrong, the distribution tree expected to be used by the Rbridge is updated to be: distribution trees contained in a list of k distribution trees; the k is the number of distribution trees required to be calculated by all the Rbridges in the TRILL network where the Rbridges are located;
and the Rbridge refreshes the LSP of the Rbridge in the network according to the updated distribution tree.
The distribution trees contained in the k distribution tree lists are:
among the k distribution tree lists, the distribution tree whose root is closest to the Rbridge that has no specified distribution tree or a specified distribution tree error.
The process of refreshing the LSP includes:
and updating the appointed distribution tree information in the LSP into an updated distribution tree, and announcing the updated distribution tree to other Rbridge in the network.
The method further comprises the following steps:
upon receipt of the LSP, other Rbridge in the TRILL network re-enumerate the distribution tree that may be used by the Rbridge that updated the distribution tree.
The method further comprises the following steps:
other Rbridge in the TRILL network calculate correct reverse path check information for the Rbridge updating the distribution tree.
The specified distribution tree error is: the designated distribution tree is not or not completely in the k distribution trees;
the distribution trees contained in the k distribution tree lists with tree roots nearest to the Rbridge without the specified distribution tree or the specified distribution tree error are: j (up to a minimum of { j, k } distribution trees contained in the list of k distribution trees and having a tree root nearest to the Rbridge that does not have the specified distribution tree or the specified distribution tree error.
A system for assigning a distribution tree includes a distribution tree processing unit, an LSP updating unit; wherein,
the distribution tree processing unit is used for updating the distribution tree expected to be used to be: distribution trees contained in a list of k distribution trees; the k is the number of distribution trees required to be calculated by all the Rbridges in the TRILL network where the Rbridges are located;
and the LSP updating unit is used for updating the LSP of the Rbridge to which the LSP belongs in the network according to the updated distribution tree.
The distribution trees contained in the k distribution tree lists are:
among the k distribution tree lists, the distribution tree whose root is closest to the Rbridge that has no specified distribution tree or a specified distribution tree error.
The LSP updating unit, when refreshing the LSP, is configured to:
and updating the appointed distribution tree information in the LSP into an updated distribution tree, and announcing the updated distribution tree to other Rbridge in the network.
Other Rbridge in the TRILL network are also included in the system for:
re-enumerating distribution trees that may be used by the Rbridge updating distribution trees upon receipt of the LSP.
The other Rbridge in the TRILL network, further to:
correct reverse path check information is calculated for the Rbridge updating the distribution tree.
The specified distribution tree error is: the designated distribution tree is not or not completely in the k distribution trees;
the distribution trees contained in the k distribution tree lists with tree roots nearest to the Rbridge without the specified distribution tree or the specified distribution tree error are: j (up to a minimum of { j, k } distribution trees contained in the list of k distribution trees and having a tree root nearest to the Rbridge that does not have the specified distribution tree or the specified distribution tree error.
The technology of the appointed distribution tree ensures that the distribution tree used when the Rbridge is forwarded keeps consistent with the control information on other Rbridges by optimizing the announcement flow of the distribution tree expected to be used by the local Rbridge, so that the Rbridge without the appointed distribution tree can select the distribution tree with the root closer to the Rbridge to send a message, and other Rbridges can also carry out correct reverse path check on the multicast message sent by the Rbridge; the reverse path check information is prevented from being too huge and the flow in the TRILL network is prevented from being too concentrated, so that the forwarding of the message and the flow load sharing of the whole network are facilitated.
Drawings
Fig. 1 is a TRILL network topology diagram according to an embodiment of the present invention;
fig. 2 is a TRILL network SPF tree obtained by performing SPF algorithm calculation with RB4 as a root in the embodiment of the present invention;
FIG. 3 is a simplified flow diagram of specifying a distribution tree according to an embodiment of the present invention;
FIG. 4 is a system diagram of specifying a distribution tree according to an embodiment of the present invention.
Detailed Description
In practical application, when the Rbridge finds that the distribution tree itself does not specify the distribution tree or the specified distribution tree is wrong, the distribution tree that the Rbridge desires to use is updated as: distribution trees contained in the k distribution tree lists and having tree roots closest to the distribution trees; k is the number of distribution trees required to be calculated by all the Rbridges in the TRILL network where the Rbridges are located;
then, the Rbridge may refresh its own LSP in the network according to the updated distribution tree.
For example, after learning k distribution trees that all Rbridge in the network need to calculate, if a certain Rbridge (for example, RB2) finds that its own designated distribution tree is incorrect (the designated distribution tree is not or not completely in the k distribution trees) or the distribution tree is not designated, the distribution tree that is expected to be used by itself in the LSP is updated to: j distribution trees (up to a minimum value of { j, k } which are contained in the list of k distribution trees and whose tree root is closest to itself) and refreshing the LSP of itself in the network. Thus, when receiving the LSP updated by RB2, other Rbridge in the network will re-enumerate the distribution tree that RB2 may use, and calculate the correct RPF check information for RB 2.
The following describes the processing flow of TRILL distribution tree selection and reverse path check information calculation in several cases with reference to the drawings.
Referring to fig. 1, the network configuration information shown in fig. 1 is as follows:
RB 1: configure an alias (nickname) { T11 };
RB 2: configuring nickname { T21 };
RB 3: configuring nickname { T31, T32 };
RB 4: configuring nickname { T41 };
RB 5: configuring nickname { T51, T52 };
RB 6: configuring nickname { T61 };
RB 7: the nickname T71 is configured.
The k value (referring to the number of distribution trees required to be calculated by all the Rbridges in the TRILL network where the Rbridges are located) is 3, RB5 has the highest tree root priority, and all nicknames have the priorities of T51 > T52 > T21 > T11 > T31 > T41 > T71 > T61.
The process flow for electing optimization in a TRILL distribution tree when RB4 does not specify a distribution tree is described below using a simple TRILL network as an example in fig. 1. Since RB4 does not specify a distribution tree, j (the number of distribution trees RB4 may use) defaults to 1.
Firstly, the RB5 receives all LSPs, enumerates k distribution trees { T51, T52 and T21} which are calculated by all Rbridges, and announces the k distribution trees to all the Rbridges;
next, all other Rbridges elect a possible distribution tree for RB4, since RB4 does not specify a distribution tree, so j defaults to 1. In k distribution trees { T51, T52 and T21} finally selected by RB5, obtaining a distribution tree { T51} which is possibly used finally by RB4 according to the priority, and calculating reverse path check information on a T51 distribution tree for RB 4;
after k highest priority distribution trees announced by RB5 are received, since RB4 does not specify a distribution tree, j defaults to 1, and by performing SPF calculation with RB4 as a root, RB4 obtains an SPF tree of the TRILL network as shown in fig. 2; according to the SPF tree, RB4 selects j distribution trees { T21} with the root of the tree closest to the RB 8925 from k distribution trees { T51, T52 and T21}, updates the designated distribution tree information in the LSP to { T21}, and announces the designated distribution tree information to other Rbridge in the network;
in this way, other Rbridge receives the LSP updated by RB4, and accordingly reselects the distribution tree that may be used by RB4 as { T21}, and calculates the reverse path check information for RB4 again.
Taking a simple TRILL network in fig. 1 as an example, a process flow for selecting optimization from a TRILL distribution tree when RB4 specifies a distribution tree error is described below. Let j be 2 as advertised by R4 and the assigned distribution tree nickname be { T51, T61 }.
Firstly, the RB5 receives all LSPs, enumerates k distribution trees { T51, T52 and T21} which are calculated by all Rbridges, and announces the k distribution trees to all the Rbridges;
next, all other Rbridge elect a distribution tree that may be used for RB4, since distribution trees { T51, T61} designated by RB4 are not all in the finally selected k distribution trees { T51, T52, T21}, the distribution trees that may be used finally are { T51, T52} according to priority, and reverse path check information is calculated on the { T51, T52} distribution tree for RB 4;
after RB4 receives the k highest priority distribution trees advertised by RB5, it finds that only one of its designated distribution trees is among the k finally selected distribution trees. Since j is 2, RB4 further selects the closest 1 distribution tree from the k distribution trees announced by RB5, and performs SPF calculation with RB4 as the root to obtain the SPF tree of the TRILL network, which is shown in fig. 2; according to the SPF tree, RB4 selects another distribution tree { T21} with the root of the tree closest to the RB 8925 from the k distribution trees { T51, T52 and T21}, updates the designated distribution tree information in the LSP to { T51 and T21}, and announces the designated distribution tree information to other Rbridge in the network;
in this way, other Rbridge receives the updated LSP from RB4, and accordingly reselects the distribution tree that may be used by RB4 as { T51, T21}, and calculates the reverse path check information for RB4 again.
As can be appreciated in conjunction with the above technical description, the operational idea of the present invention for specifying a distribution tree can be represented by a flow shown in FIG. 3, which includes the following steps:
step 310: when the Rbridge finds that the distribution tree is not specified or the specified distribution tree is wrong, the distribution tree expected to be used by the Rbridge is updated to be: distribution trees contained in a list of k distribution trees; such as: distribution trees contained in the k distribution tree lists and having tree roots closest to the distribution trees;
and k is the number of the distribution trees required to be calculated by all the Rbridges in the TRILL network where the Rbridges are located.
Step 320: and the Rbridge refreshes the LSP of the Rbridge in the network according to the updated distribution tree.
In order to ensure that the aforementioned technical description and the aforementioned operation idea can be implemented smoothly, an arrangement as shown in fig. 4 can be performed. Referring to fig. 4, fig. 4 is a system diagram of specifying a distribution tree according to an embodiment of the present invention, where the system includes a distribution tree processing unit and an LSP updating unit that are connected to each other. The distribution tree processing unit and the LSP updating unit can be arranged in the Rbridge.
In actual application, when finding that the Rbridge to which the distribution tree processing unit belongs does not specify the distribution tree or the specified distribution tree is incorrect, the distribution tree processing unit updates the distribution tree expected to be used to: distribution trees contained in a list of k distribution trees; such as: distribution trees contained in the k distribution tree lists with the tree root nearest to itself.
And k is the number of the distribution trees required to be calculated by all the Rbridges in the TRILL network where the Rbridges are located.
The LSP updating unit can refresh the LSP of the Rbridge which the LSP belongs to in the network according to the updated distribution tree.
In summary, in both the method and the system, the technology of assigning the distribution tree of the present invention optimizes the notification flow of the distribution tree expected to be used by the local Rbridge itself, so that the control information on the distribution tree used in Rbridge forwarding is consistent with that on other rbridges, therefore, an Rbridge without the assigned distribution tree can select a distribution tree with a tree root closer to itself to send a message, and other rbridges can also perform correct reverse path check on the multicast message sent by the Rbridge; the reverse path check information is prevented from being too huge and the flow in the TRILL network is prevented from being too concentrated, so that the forwarding of the message and the flow load sharing of the whole network are facilitated.
The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention.
Claims (10)
1. A method of specifying a distribution tree, the method comprising:
when the routing bridge Rbridge finds that the distribution tree is not specified by the routing bridge or the specified distribution tree is wrong, the distribution tree expected to be used by the routing bridge Rbridge is updated to be: distribution trees contained in a list of k distribution trees; the k is the number of distribution trees required to be calculated by all the Rbridges in the multilink transparent interconnection TRILL network where the Rbridges are located; wherein the distribution trees contained in the k distribution tree lists are: in the k distribution tree lists, the distribution tree whose root is nearest to the Rbridge that has no specified distribution tree or a specified distribution tree error;
and the Rbridge refreshes the link state data packet LSP of the Rbridge in the network according to the updated distribution tree.
2. The method of claim 1, wherein refreshing the LSP comprises:
and updating the appointed distribution tree information in the LSP into an updated distribution tree, and announcing the updated distribution tree to other Rbridge in the network.
3. The method according to any one of claims 1 to 2, characterized in that the method further comprises:
upon receipt of the LSP, other Rbridge in the TRILL network re-enumerate the distribution tree that may be used by the Rbridge that updated the distribution tree.
4. The method of claim 3, further comprising:
other Rbridge in the TRILL network calculate correct reverse path check information for the Rbridge updating the distribution tree.
5. The method according to claim 1 or 2,
the specified distribution tree error is: the designated distribution tree is not or not completely in the k distribution trees;
the distribution trees contained in the k distribution tree lists with tree roots nearest to the Rbridge without the specified distribution tree or the specified distribution tree error are: j (up to a minimum of { j, k } distribution trees contained in a list of k distribution trees and having a tree root nearest to the Rbridge that does not have the specified distribution tree or the specified distribution tree error; the j is the number of distribution trees expected to be used by the Rbridge.
6. A system for assigning a distribution tree is characterized in that the system comprises a distribution tree processing unit and an LSP updating unit; wherein,
the distribution tree processing unit is used for updating the distribution tree expected to be used to be: distribution trees contained in a list of k distribution trees; the k is the number of distribution trees required to be calculated by all the Rbridges in the TRILL network where the Rbridges are located; wherein the distribution trees contained in the k distribution tree lists are: in the k distribution tree lists, the distribution tree whose root is nearest to the Rbridge that has no specified distribution tree or a specified distribution tree error;
and the LSP updating unit is used for updating the LSP of the Rbridge to which the LSP belongs in the network according to the updated distribution tree.
7. The system of claim 6, wherein the LSP update unit, when refreshing the LSP, is configured to:
and updating the appointed distribution tree information in the LSP into an updated distribution tree, and announcing the updated distribution tree to other Rbridge in the network.
8. A system according to any one of claims 6 to 7, further comprising a further Rbridge in the TRILL network for:
re-enumerating distribution trees that may be used by the Rbridge updating distribution trees upon receipt of the LSP.
9. The system of claim 8, wherein the other Rbridge in the TRILL network is further configured to:
correct reverse path check information is calculated for the Rbridge updating the distribution tree.
10. The system of claim 7,
the specified distribution tree error is: the designated distribution tree is not or not completely in the k distribution trees;
the distribution trees contained in the k distribution tree lists with tree roots nearest to the Rbridge without the specified distribution tree or the specified distribution tree error are: j (up to a minimum of { j, k } distribution trees contained in a list of k distribution trees and having a tree root nearest to the Rbridge that does not have the specified distribution tree or the specified distribution tree error; the j is the number of distribution trees expected to be used by the Rbridge.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110261762.3A CN102316033B (en) | 2011-09-06 | 2011-09-06 | A kind of method and system of specified distribution tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110261762.3A CN102316033B (en) | 2011-09-06 | 2011-09-06 | A kind of method and system of specified distribution tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102316033A CN102316033A (en) | 2012-01-11 |
| CN102316033B true CN102316033B (en) | 2017-04-05 |
Family
ID=45428865
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110261762.3A Active CN102316033B (en) | 2011-09-06 | 2011-09-06 | A kind of method and system of specified distribution tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102316033B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103428088B (en) * | 2012-05-14 | 2018-11-06 | 中兴通讯股份有限公司 | A kind of distribution of tree root, the method for Message processing and route-bridge |
| CN102710522B (en) * | 2012-06-08 | 2017-09-12 | 神州数码网络(北京)有限公司 | The collocation method and device of RPF rules in multilink transparent internet |
| CN102780623B (en) * | 2012-07-26 | 2015-09-02 | 杭州华三通信技术有限公司 | Multicast routing table item update method and device in a kind of multilink transparent internet |
| CN103560964B (en) * | 2013-10-28 | 2017-02-15 | 杭州华三通信技术有限公司 | Method and device for sharing VLAN load based on multilink semi-transparent TRILL protocol |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101136843A (en) * | 2006-08-30 | 2008-03-05 | 华为技术有限公司 | Method of generating symmetrical tree in the shortest path bridge |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7944860B2 (en) * | 2009-06-04 | 2011-05-17 | Cisco Technology, Inc. | Preventing loss of network traffic due to inconsistent configurations within the network |
-
2011
- 2011-09-06 CN CN201110261762.3A patent/CN102316033B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101136843A (en) * | 2006-08-30 | 2008-03-05 | 华为技术有限公司 | Method of generating symmetrical tree in the shortest path bridge |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102316033A (en) | 2012-01-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114615198B (en) | Method and node for message of state of flooding link with minimized internal gateway protocol flooding | |
| EP3195538B1 (en) | Automated determination of tree attributes and assignment of receiver identifiers by distributed election in multicast architectures relying on packets identifying intended receivers | |
| EP3259887B1 (en) | Method and system for automatic optimal route reflector root address assignemt to route reflector clients | |
| US10158558B1 (en) | Segment routing of packets according to a multicast distribution tree in a network | |
| CN102884767B (en) | 2nd layer of multi-path network link cost is by figure distribution | |
| US10791053B2 (en) | Service function chain SFC-based communication method, and apparatus | |
| US8817798B2 (en) | Constraining topology size and recursively calculating routes in large networks | |
| US10461998B2 (en) | PE device and method for advertising information about PE device | |
| US9699077B2 (en) | Method for determining a packet forwarding path, network device, and control device | |
| US8948051B2 (en) | System and method for efficient MVPN source redundancy with S-PMSI | |
| EP2173069A1 (en) | Path selection method and network system, path computation element | |
| US20180324097A1 (en) | Method for Implementing Load Balancing, Apparatus, and Network System | |
| CN104335537A (en) | System and method for layer-2 multicast multipathing | |
| CN101237399A (en) | Method, system and device for getting label switching path | |
| US20130208624A1 (en) | Link State Fast Flood with Computed Multi-Protocol-Label-Switching (MPLS) Broadcast Tree | |
| US8902794B2 (en) | System and method for providing N-way link-state routing redundancy without peer links in a network environment | |
| US11805047B2 (en) | Method and apparatus for controlling network traffic path | |
| CN102316033B (en) | A kind of method and system of specified distribution tree | |
| US9306856B2 (en) | Optimal tree root selection for trees spanning multiple sites | |
| US8072908B2 (en) | Partitioned forwarding of packets originated on a broadcast link among layer 2 forwarding devices of different adjacency networks | |
| JP2015514374A (en) | Method for receiving information, method for transmitting information and apparatus thereof | |
| CN111464441A (en) | Communication method and device | |
| CN103650453A (en) | Method of communicating in path computation element communication protocol and network apparatus | |
| US9942126B2 (en) | Distributing non-unicast routes information in a TRILL network | |
| CN105591940B (en) | TRILL network distribution tree selection method and TRILL network node |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |