Efficient distributed restoration path selection for shared mesh restoration
IEEE/ACM Transactions on Networking (TON)
Traffic Engineering in Enterprise Ethernet with Multiple Spanning Tree Regions
ICW '05 Proceedings of the 2005 Systems Communications
Differentiated Survivability in Ethernet-Based MAN/WAN
AICCSA '06 Proceedings of the IEEE International Conference on Computer Systems and Applications
Issues and approaches on extending Ethernet beyond LANs
IEEE Communications Magazine
Handling double-link failures in metro ethernet networks using fast spanning tree reconnection
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Fast spanning tree reconnection for resilient metro ethernet networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Fast spanning tree reconnection mechanism for resilient Metro Ethernet networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Local restoration with multiple spanning trees in metro ethernet networks
IEEE/ACM Transactions on Networking (TON)
Simple protocol enhancements of Rapid Spanning Tree Protocol over ring topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Restoration in Ethernet has evolved over the years as specified in various standards: first the classical reconstruction of spanning trees was proposed in 802.1d; later 802.w specified RSTP to reduce the convergence time required in the STP protocol. Recently, the use of multiple spanning tree was suggested in 802.1s standard. In addition, there have been several proposals to implement multiple tree based restoration. Even though the results are promising they fall short of elevating Ethernet to a carrier grade technology. In this paper, we develop a distributed fast failure recovery spanning tree scheme, which restores lost facilities within tens of milliseconds. Recovery algorithm is localized around the point of failure on the spanning tree, thus avoiding disruption of the entire network. Failures are repaired using pre-configured sub spanning trees which are computed based on traffic requirements and resource availability. This paper also proposes possible enhancements to the failure recovery method using IEEE link aggregation standard to further reduce restoration time and provide differentiated survivability.