In this video we're going to discuss spanning tree spanning tree was developed to stop a layer two loops
occurring in switched environments.
In transparent switching or transparent bridging, which is what Ethernet uses redundant links, introduce
loops and spanning trees used to stop those loops.
Spanning tree has been around for many years and there have been multiple developments and enhancements.
So this is one of the challenges that you're going to face.
They are different implementations and versions of Spanning Tree and you'll need to know some of those
differences.
Spending.
Trees are very important protocol in traditional networks, and once again, its primary purpose is
to stop loops in a switched environment and not necessarily to stop them as quickly as we would like.
Spanning Tree was developed many years ago, originally being developed for bridges rather than switches,
and thus at times is very slow to converge.
In other words, it takes a long time for traffic to be rerouted if there's a change in the network
topology.
Spanning Tree was once again originally developed for bridges, and bridges did their calculations in
software rather than in hardware, which is what switches do today.
So in the past, slower convergence was fine, but that's a major problem in today's environments where
we run voice over IP or other protocols that require very quick convergence.
Thus the original standard spanning tree or ADA 2.1 dx spanning tree has been superseded by newer versions
such as rapid spanning tree and multiple spanning tree.
Because spending trees of great importance for the CCNA certification as well as for real deployments.
I'm going to start off with the original version of spanning three 802 to 1 DX and then we'll build
on those concepts looking at more and more complex topologies and other versions of Spanning Tree.