In this video we're going to discuss spending tree spending 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 she's going to face.
There 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.
Spending 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 the 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 todays environments where we
run voice of IP or other protocols that require a very quick convergence.
Thus the original standard spending three or eight or two to one d spanning tree has been superseded
by newer versions such as rapid a spanning tree and multiple spanning tree because spending trees are
of great importance for the CC and a certification as well as for real deployments.
I'm going to start off with the original version of spanning tree Ada to the one d.
And then we'll build on those concepts.
Looking at more and more complex typologies and other versions of spanning tree.