An enterprise network engineer is designing a redundant Layer 2 topology with MSTP across Juniper EX switches. Two switches have identical bridge priorities and MAC addresses that result in a tie for regional root. How does MSTP deterministically break the tie to select the regional root bridge?
MSTP breaks an identical bridge-priority tie by comparing the bridge MAC address, and the numerically lowest value wins the regional root election. This satisfies the stem's constraint: two switches share equal priorities, so the deterministic lowest-MAC comparison elects one regional root and prevents a loop.
Why this answer
Spanning tree tie-breaking checks the bridge priority first, and if tied, compares the lowest MAC address of the switches.