Please use this identifier to cite or link to this item:
|Title:||Fast spanning tree reconnection for resilient metro Ethernet networks||Authors:||Qiu, J.
|Issue Date:||2009||Citation:||Qiu, J.,Liu, Y.,Mohan, G.,Kee, C.C. (2009). Fast spanning tree reconnection for resilient metro Ethernet networks. IEEE International Conference on Communications : -. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2009.5199031||Abstract:||Ethernet is becoming a preferred technology to be deployed in metro domain due to its low cost, simplicity and ubiquity. However, spanning tree based Ethernet protocol does not meet the requirement for Metro Area Networks 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 any single link failure, which has features of fast recovery, backup capacity guarantees and ease of implementation. 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 not on the spanning tree. 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. The optimization results show that with lower implementation cost, fast spanning tree reconnection mechanism can achieve comparative or considerably better performance than other resilient mechanisms for Metro Ethernet networks. ©2009 IEEE.||Source Title:||IEEE International Conference on Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/70310||ISBN:||9781424434350||ISSN:||05361486||DOI:||10.1109/ICC.2009.5199031|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 15, 2019
checked on May 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.