[AusNOG] Outage that costs Millions

[Lincoln Dale]

On 30/06/2010, at 6:32 PM, Narelle wrote:
> Might be time for some poetry to sooth our souls...
> 
> 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 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


Algorhyme V2 

   I hope that we shall one day see 
 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 counts we now see, 
   The network need not be loop-free! 
    
   RBridges work transparently. 
   Without a common spanning tree. 
 
                                 Ray Perlner



cheers,

lincoln.