The inventor of the
spanning tree protocol, Radia Perlman, wrote a poem to describe how it works.11
When reading the poem it helps to know that in math terms, a network can be
represented as a type of graph called a mesh, and that the goal of the spanning
tree protocol is to turn any given network mesh into a tree structure with no
loops that spans the entire set of network segments.
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 that 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.
—
Radia Perlman
No comments:
Post a Comment