kMastaFlash wrote: » Well I will give you a hint. It prevents layer 2 switching loops by putting ports into certain states and exchanges frames called BPDUs. Until there is a solid effort on the OPs part, I don't think anyone else will give any effort to help.
volume wrote: » 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 (source, Algoryhme by Radia Perlman - EtherealMind )
