Please use this identifier to cite or link to this item:
|Title:||Fast spanning tree reconnection mechanism for resilient Metro Ethernet networks||Authors:||Qiu, J.
|Keywords:||Metropolitan Area Networks
|Issue Date:||25-Aug-2011||Citation:||Qiu, J., Liu, Y., Mohan, G., Chua, K.C. (2011-08-25). Fast spanning tree reconnection mechanism for resilient Metro Ethernet networks. Computer Networks 55 (12) : 2717-2729. ScholarBank@NUS Repository. https://doi.org/10.1016/j.comnet.2011.05.002||Abstract:||The low cost, high transmission rate and ubiquity of current Ethernet lead to the possibility of bringing Ethernet into Metropolitan Area Networks (MANs). However, the traditional spanning tree based Ethernet protocol does not meet the requirement for MANs in terms of network resilience, despite the advancement of Ethernet standardization and commercialization. In this paper, we propose a fast spanning tree reconnection (FSTR) mechanism for Metro Ethernet networks to handle single link failure. Upon failure of a link on a spanning tree, a distributed failure recovery protocol is activated to reconnect the broken spanning tree using a reconnect-link. We present the details of the protocol, including failure notification and forwarding table reconfiguration procedures. The pre-configuration of the reconnect-links to reconnect each spanning tree is formulated as an integer linear programming (ILP) problem. We prove that the pre-configuration problem is NP-complete. We develop an efficient algorithm based on 2-edge connectivity augmentation that can achieve close approximation to the optimal solutions. The numerical results of FSTR mechanism on different network topologies show its features of efficiency and fast recovery. © 2011 Elsevier B.V. All rights reserved.||Source Title:||Computer Networks||URI:||http://scholarbank.nus.edu.sg/handle/10635/56021||ISSN:||13891286||DOI:||10.1016/j.comnet.2011.05.002|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 16, 2019
WEB OF SCIENCETM
checked on Oct 8, 2019
checked on Oct 13, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.