Annotated edit history of
SpanningTree version 1, including all changes.
View license author blame.
| Rev |
Author |
# |
Line |
| 1 |
PerryLorier |
1 |
A Spanning tree is a graph which has no cycles. |
| |
|
2 |
|
| |
|
3 |
[Ethernet] cannot handle a loop, as it would mean that switches will forward packets around the loop continously. However, without loops you cannot have redundancy, so a protocol called SpanningTree was invented. Switches that participate in spanning tree shut down links that would cause a loop, until whatever was causing the loop "goes away". This is often used for redundancy. |
