Please use this identifier to cite or link to this item:
|Title:||Handling double-link failures in metro ethernet networks using fast spanning tree reconnection||Authors:||Qiu, J.
|Issue Date:||2009||Citation:||Qiu, J.,Mohan, G.,Chua, K.C.,Liu, Y. (2009). Handling double-link failures in metro ethernet networks using fast spanning tree reconnection. GLOBECOM - IEEE Global Telecommunications Conference : -. ScholarBank@NUS Repository. https://doi.org/10.1109/GLOCOM.2009.5425321||Abstract:||Ethernet is becoming a preferred technology to be deployed in metro domain due to its low cost, simplicity and ubiquity. However, traditional spanning tree based Ethernet protocol does not meet the requirement for Metro Area Networks in terms of network resilience. In , we proposed a Fast Spanning Tree Reconnection (FSTR) mechanism for Metro Ethernet networks to handle single link failures. Upon failure of a link on a spanning tree, FSTR mechanism activates a reconnect-link to reconnect the broken spanning tree. FSTR mechanism has the features of fast recovery, simplicity, and guaranteed protection. However, when more than one link fail in the network, the FSTR mechanism would generate unexpected loops and cannot function properly. In this paper, we propose a fast spanning tree reconnection mechanism to handle double-link failures with protection grade guarantees. The mechanism is distributed and can alleviate the problem in previous FSTR mechanism. We formulate the reconnect-link pre-configuration problem for double-link failures as an integer linear programming problem. Through numerical results we demonstrate that the proposed mechanism can satisfy the protection grade required for each connection by efficiently utilizing the network capacity.||Source Title:||GLOBECOM - IEEE Global Telecommunications Conference||URI:||http://scholarbank.nus.edu.sg/handle/10635/70450||ISBN:||9781424441488||DOI:||10.1109/GLOCOM.2009.5425321|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.