Abstract:
Switched networks use meshed topologies. Loop avoidance is essential in these networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical m...Show MoreMetadata
Abstract:
Switched networks use meshed topologies. Loop avoidance is essential in these networks to avoid broadcast storms. Logical Spanning Trees are constructed on the physical meshed topologies to address the broadcast storm problem. However, during topology changes, networks take time to re-converge and identify new spanning tree paths for frame forwarding. Link State routing was introduced to speed up convergence and reduce convergence delays on root failures experienced with spanning tree protocols (STP). Meshed Tree algorithms (MTA) offer a new approach. They support multiple tree branches from a single root to cut down convergence delays on link failures. Multi Meshed Tree algorithm an enhancement to MTA supports multiple roots each with its own meshed trees. A Meshed Tree Protocol (MTP) based on MTA is currently under development as an IEEE standard. In this article, MTP is evaluated for convergence delay in comparison with Rapid STP.
Date of Conference: 18-21 February 2019
Date Added to IEEE Xplore: 11 April 2019
ISBN Information:
Print on Demand(PoD) ISSN: 2325-2626