Please use this identifier to cite or link to this item:
|Title:||Local restoration with multiple spanning trees in metro ethernet||Authors:||Qiu, J.
|Issue Date:||2008||Citation:||Qiu, J.,Mohan, G.,Chua, K.C.,Liu, Y. (2008). Local restoration with multiple spanning trees in metro ethernet. ONDM 2008 - 12th Conference on Optical Network Design and Modelling : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ONDM.2008.4578413||Abstract:||Ethernet is becoming a preferred technology to be extended to Metro Area Networks (MAN) due to its low cost, simplicity and ubiquity. However, current Ethernet lacks fast failure recovery mechanism. It reconstructs the spanning tree after the failure is detected, which commonly requires tens of seconds. Some researchers have proposed fast failure handling methods based on multiple spanning trees, 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, which is distributed, fast, and does not need failure notification. Upon failure of a single link, upstream switch locally restores traffic to pre-configured backup spanning trees. We propose two approaches for backup tree selection (connection based and destination based), and formulate the working spanning tree assignment and backup spanning tree configuration problem as an integer linear programming problem. We also develop heuristics for each strategy to reduce computation complexity. The simulation results show that our algorithms have comparable performance close to the optimal solutions, and both strategies can efficiently utilize the network bandwidth to handle single link failure.||Source Title:||ONDM 2008 - 12th Conference on Optical Network Design and Modelling||URI:||http://scholarbank.nus.edu.sg/handle/10635/70814||ISBN:||9783901882272||DOI:||10.1109/ONDM.2008.4578413|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 10, 2019
checked on Jun 28, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.