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.
| Original language | English (US) |
|---|---|
| Pages | 325-332 |
| Number of pages | 8 |
| State | Published - 2001 |
| Externally published | Yes |
| Event | 8th International Conference on Emerging Technologies and Factory Automation (ETFA 2001) - Antibes-Juan les Pins, France Duration: Oct 15 2001 → Oct 18 2001 |
Conference
| Conference | 8th International Conference on Emerging Technologies and Factory Automation (ETFA 2001) |
|---|---|
| Country/Territory | France |
| City | Antibes-Juan les Pins |
| Period | 10/15/01 → 10/18/01 |
ASJC Scopus subject areas
- General Engineering
Fingerprint
Dive into the research topics of 'Fault recovery port-based fast spanning tree algorithm (FRP-FAST) for the fault-tolerant ethernet on the arbitrary switched network topology'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS