From: Jeff Kesemeyer (jeffkesemeyer@xxxxxxx)
Date: Thu Dec 21 2000 - 22:27:18 GMT-3
Algorhyme
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 packet 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
Innterconnections
----- Original Message -----
From: David M Anderson
Sent: Tuesday, December 19, 2000 12:12 PM
To: Lykourgiotis Paraskevas; ccielab@groupstudy.com
Subject: Re: Spanning Tree Algorithm
Have you tried searching the IEEE website for 802.1d (spanning tree)? If=
you would like a good reference book, "Interconnections" by Radia Perlma=
n is an excellent source.
Thanks,
David
At 06:02 PM 12/19/2000 +0200, Lykourgiotis Paraskevas wrote:
>Hello,
>
>Can anybody provide me with a site describing IEEE Spanning Tree Algorit=
hm?
>(How port-path-cost and port-priority do affect the root port selection?=
)
>
>TIA
>Paraskevas
>
This archive was generated by hypermail 2.1.4 : Thu Jun 13 2002 - 08:26:09 GMT-3