Abstract
We present a novel approach, named Fault Recovery Port-Based Fast Spanning Tree Algorithm (FRP-FAST), of the Fault-Tolerant Ethernet (FTE) extension method to the arbitrary switched network topology with providing a significant improvement of failure detection and the spanning tree rebuilding time on the switched Ethernet. We provide a mechanism that expedites failure detection time using peer-based hello message algorithm and eliminates the chance of any transient loop creation during the spanning tree reconstruction using a pre-configured recovery port. As a result, unlike IEEE 802.1D, the scheme does not block data transmission on unaffected data path during the spanning tree discovery phase. The FRP-FAST algorithm has been implemented in the kernel mode of Windows NT-based PC using 3 NICs (3 port switch). The measured failure detection and recovery time meets control industry's 2 seconds requirement.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
