17
Step Command
Remarks
3.
Enable the pseudonode
bypass feature.
trill
bypass-pseudonode
enable
By default, the pseudonode
bypass feature is disabled.
Setting the SPF algorithm parameters
The RB uses the SPF algorithm to calculate a shortest path tree with itself as the root based on the
LSDB. The RB uses the shortest path tree to determine the next hop to a destination network. By
adjusting the SPF calculation intervals, you can prevent resource overconsumption when the
network is unstable.
When the network is stable, the SPF calculation interval for continuous calculations is reduced to
minimum-interval
. When the network is unstable, the SPF calculation interval is added by
incremental-interval
× 2
n-2
(n is the number of continuous SPF calculation times) for each SPF
calculation until the maximum interval is reached.
To set the SPF algorithm parameters:
Step Command
Remarks
1.
Enter system view.
system-view
N/A
2.
Enter TRILL view.
trill
N/A
3.
Set the SPF
calculation interval for
TRILL.
timer
spf
maximum-interval
[
minimum-interval
[
incremental-interval
] ]
By default, the maximum SPF calculation
interval is 10 seconds, the minimum SPF
calculation interval is 10 milliseconds, and
the SPF calculation incremental interval is
20 milliseconds.
Configuring TRILL distribution trees
Setting basic distribution tree parameters
In a TRILL network, RBs perform the following operations:
•
Compute TRILL distribution trees according to the LSDB.
•
Use the TRILL distribution trees to guide the forwarding of multidestination frames.
An RB with a higher priority is selected as the root bridge of a TRILL distribution tree.
An LSP sent by an RB carries the following TRILL distribution tree information:
•
The number of TRILL distribution trees that the RB wants all RBs to compute.
•
The maximum number of TRILL distribution trees that the RB can compute (this number is fixed
at 15).
•
The number of TRILL distribution trees that the RB has computed.
Each RB can compute a maximum of
m
TRILL distribution trees. An RB determines the number of
TRILL distribution trees to compute (
n
) by selecting the lower value from the following values:
•
The number of TRILL distribution trees that the highest-priority RB wants all RBs to compute.
•
The smallest
m
value across the TRILL network.
The RB selects the first
n
nicknames from the nickname list advertised by the highest-priority RB.
The RB uses the selected nicknames as the root nicknames for computing distribution trees.
