Please use this identifier to cite or link to this item: https://doi.org/10.1109/TNET.2010.2079945
DC FieldValue
dc.titleLocal restoration with multiple spanning trees in metro ethernet networks
dc.contributor.authorQiu, J.
dc.contributor.authorGurusamy, M.
dc.contributor.authorChua, K.C.
dc.contributor.authorLiu, Y.
dc.date.accessioned2014-06-17T02:55:23Z
dc.date.available2014-06-17T02:55:23Z
dc.date.issued2011-04
dc.identifier.citationQiu, J., Gurusamy, M., Chua, K.C., Liu, Y. (2011-04). Local restoration with multiple spanning trees in metro ethernet networks. IEEE/ACM Transactions on Networking 19 (2) : 602-614. ScholarBank@NUS Repository. https://doi.org/10.1109/TNET.2010.2079945
dc.identifier.issn10636692
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/56508
dc.description.abstractEthernet 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. © 2006 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/TNET.2010.2079945
dc.sourceScopus
dc.subjectComputer network reliability
dc.subjectlinear programming
dc.subjectmetropolitan area networks (MANs)
dc.typeArticle
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1109/TNET.2010.2079945
dc.description.sourcetitleIEEE/ACM Transactions on Networking
dc.description.volume19
dc.description.issue2
dc.description.page602-614
dc.description.codenIEANE
dc.identifier.isiut000289845700024
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

12
checked on Feb 17, 2020

WEB OF SCIENCETM
Citations

9
checked on Feb 10, 2020

Page view(s)

62
checked on Feb 4, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.