Rochester Institute of Technology RIT Scholar Works Articles 2014 Performance of Meshed Tree Protocols for Loop Avoidance in Switched Networks Kuhu Sharma Bill Stackpole Daryl Johnson Nirmala Shenoy Bruce Hartpence Follow this and additional works at: http://scholarworks.rit.edu/article Recommended Citation Sharma, Kuhu; Stackpole, Bill; Johnson, Daryl; Shenoy, Nirmala; and Hartpence, Bruce, "Performance of Meshed Tree Protocols for Loop Avoidance in Switched Networks" (2014). The International Journal on Advances in Networks and Services, 7 (3&4), 228-239. Accessed from http://scholarworks.rit.edu/article/1806 This Article is brought to you for free and open access by RIT Scholar Works. It has been accepted for inclusion in Articles by an authorized administrator of RIT Scholar Works. For more information, please contact
[email protected]. Performance of Meshed Tree Protocols for Loop Avoidance in Switched Networks Kuhu Sharma, Bill Stackpole, Daryl Johnson, Nirmala Shenoy and Bruce Hartpence College of Computing and Information Sciences Rochester Institute of Technology, Rochester, NY, USA
[email protected],
[email protected],
[email protected],
[email protected],
[email protected] Abstract—Loop free frame forwarding in layer 2 switched through the root and a second is the root re-election on networks that use meshed topologies to provision for link and topology changes. Radia Perlman then proposed path redundancy is a continuing challenge. The challenge is Transparent Interconnection of Lots of Links (TRILL) on addressed through special protocols at layer 2 that build RBridges (router bridges) to overcome the disadvantages of logical trees over the physically meshed topologies, along which STA-based loop avoidance.