#algorhyme

[illustratediem]

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 

[nonrouted]

Algorhyme v2

by Ray Perlner I hope that we shall one day see A graph more lovely than a tree. A graph to boost efficiency While still configuration-free. A network where RBridges can Route packets to their target LAN. The paths they find, to our elation, Are least cost paths to destination! With packet hop count we now see, The network need not be loop-free! RBridges work transparently. Without a common spanning tree.