Spanning tree: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 18: | Line 18: | ||
Then bridges find a spanning tree. | Then bridges find a spanning tree. | ||
He is apparently a geek. It's based on | He is apparently a geek. It's based on "[http://en.wikipedia.org/wiki/Joyce_Kilmer#.22Trees.22 Trees]" by Joyce Kilmer. | ||
== External Links == | == External Links == | ||
[http://www.cisco.com/univercd/cc/td/doc/product/rtrmgmt/sw_ntman/cwsimain/cwsi2/cwsiug2/vlan2/stpapp.htm Understanding Spanning-Tree Protocol] | [http://www.cisco.com/univercd/cc/td/doc/product/rtrmgmt/sw_ntman/cwsimain/cwsi2/cwsiug2/vlan2/stpapp.htm Understanding Spanning-Tree Protocol] | ||
Latest revision as of 17:19, 6 September 2008
Spanning tree is a protocol used in a LAN environment with multiple switches connected to each other by multiple links. Its main function is to prevent loops in the network by only enabling ports that will not result in a loop. It's based on a loop-free undirected graph where all vertexes are connected.
Development
Spanning tree was developed by Dr. Radia Perlman from Sun Microsystems. He wrote a poem about it:
I think that I shall never see A graph more lovely than a tree. A tree whose crucial property Is loop-free connectivity. A tree which must be sure to span. So packets can reach every LAN. First the Root must be selected By ID it is elected. Least cost paths from Root are traced In the tree these paths are placed. A mesh is made by folks like me Then bridges find a spanning tree.
He is apparently a geek. It's based on "Trees" by Joyce Kilmer.