Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels
IEEE/ACM Transactions on Networking (TON)
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
ACM-SE 33 Proceedings of the 33rd annual on Southeast regional conference
Achieving sub-50 milliseconds recovery upon BGP peering link failures
IEEE/ACM Transactions on Networking (TON)
Bandwidth sensitive fast failure recovery scheme for Metro Ethernet
Computer Networks: The International Journal of Computer and Telecommunications Networking
Metro ethernet
Label space reduction in MPLS networks: how much can a single stacked label do?
IEEE/ACM Transactions on Networking (TON)
A resilient transparent optical network design with a pre-configured extended-tree scheme
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Issues and approaches on extending Ethernet beyond LANs
IEEE Communications Magazine
IEEE Communications Magazine
Ethernet ring protection for carrier ethernet networks
IEEE Communications Magazine
Routing bandwidth guaranteed paths with local restoration in label switched networks
IEEE Journal on Selected Areas in Communications
Lightpath restoration in WDM optical networks
IEEE Network: The Magazine of Global Internetworking
Traffic engineering in metro Ethernet
IEEE Network: The Magazine of Global Internetworking
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Ethernet is becoming a preferred technology to be extended to metropolitan area networks (MANs) due to its low cost, simplicity, and ubiquity. However, current Ethernet lacks a fast failure recovery mechanism as it reconstructs the spanning tree after the failure is detected, which commonly requires tens of seconds. Some fast failure-handling methods based on multiple spanning trees have been proposed in the literature, but these approaches are either centralized or require periodic message broadcasting over the entire network. In this paper, we propose a local restoration mechanism for metro Ethernet using multiple spanning trees, which is distributed and fast and does not need failure notification. Upon failure of a single link, the upstream switch locally restores traffic to preconfigured backup spanning trees. We propose two restoration approaches, connection-based and destination-based, to select backup trees. We formulate the tree preconfiguration problem that includes working spanning tree assignment and backup spanning tree configuration. We prove that the preconfiguration problem is NP-complete and develop an integer linear programming model. We also develop heuristic algorithms for each restoration approach to reduce the computation complexity. To evaluate the effectiveness of our heuristic algorithms, we carry out the simulation on grid and random networks. The simulation results show that our heuristic algorithms have comparable performance close to the optimal solutions, and both restoration approaches can efficiently utilize the network bandwidth to handle single link failures.