Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/22860
DC Field | Value | |
---|---|---|
dc.title | Survivability schemes for metro ethernet networks | |
dc.contributor.author | QIU JIAN | |
dc.date.accessioned | 2011-05-31T18:01:27Z | |
dc.date.available | 2011-05-31T18:01:27Z | |
dc.date.issued | 2010-08-03 | |
dc.identifier.citation | QIU JIAN (2010-08-03). Survivability schemes for metro ethernet networks. ScholarBank@NUS Repository. | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/22860 | |
dc.description.abstract | Ethernet is becoming a preferred technology to be extended to Metro Area Networks (MANs) due to its low cost, simplicity and ubiquity. However, the traditional spanning tree based Ethernet protocol does not meet the requirements for MANs in terms of fast recovery and guaranteed protection. In this study, we firstly propose and discuss a local restoration mechanism for Metro Ethernet networks using multiple spanning trees, which is distributed, fast, and does not need failure notification. A fast spanning tree reconnection (FSTR) mechanism which has lower implementation cost to handle single link failure is then proposed. Under FSTR mechanism, a distributed failure recovery protocol is activated to reconnect the broken spanning tree using a reconnect-link not on the original spanning tree. We further improve the FSTR mechanism by a novel approach to handle double-link failures. Finally, a two-layer architecture for survivability in Ethernet over WDM networks is presented. We develop integer linear programming models (ILP) to formulate each proposed survivability schemes. We theoretically prove that the pre-configuration problem of local restoration and FSTR schemes are NP-Complete. We develop several efficient algorithms, including two heuristics for local restoration mechanism and an augmentation based algorithm for FSTR mechanism. We demonstrate the effectiveness of the proposed survivability schemes through numerical results obtained from solving ILP models and simulation results on various network topologies and scenarios. | |
dc.language.iso | en | |
dc.subject | Metropolitan Area Networks, Ethernet, Network Survivability, Spanning Tree, NP-Complete, Optimization Problem | |
dc.type | Thesis | |
dc.contributor.department | ELECTRICAL & COMPUTER ENGINEERING | |
dc.contributor.supervisor | MOHAN GURUSAMY | |
dc.contributor.supervisor | CHUA KEE CHAING | |
dc.description.degree | Ph.D | |
dc.description.degreeconferred | DOCTOR OF PHILOSOPHY | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Ph.D Theses (Open) |
Show simple item record
Files in This Item:
File | Description | Size | Format | Access Settings | Version | |
---|---|---|---|---|---|---|
qiujian_thesis_final_version.pdf | 826.88 kB | Adobe PDF | OPEN | None | View/Download |
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.