โค๏ธ In love with Open Source
๐ญ Iโm currently working on JAEN
๐ฏ Iโm looking to collaborate with other coding enthusiasts
๐ซ ย Ask me anything on my discussion page
๐ป Connect with me on LinkedIn
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 paths are placed.A mesh is made by folks like me.
Then bridges find a spanning tree. 1
Footnotes
-
Radia Perlman. "An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN". ACM SIGCOMM Computer Communication Review 15 (4): 44โ53 โฉ