1 / 12

Node-Inclusive Span Survivability in Optical Mesh Network

This paper presents a novel approach to network survivability, combining span and path restoration to protect against node failures, with operational efficiency and lower spare capacity requirements. The system is tested on various network topologies and traffic demands, demonstrating improved protection capabilities in a cost-effective manner.

mio
Télécharger la présentation

Node-Inclusive Span Survivability in Optical Mesh Network

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Node-InclusiveSpanSurvivability in an Optical Mesh Transport Network John Doucette and Wayne D. Grover TRLabs and University of Alberta Edmonton, AB, Canada john.doucette@trlabs.ca, grover@trlabs.ca NFOEC 2003 Orlando, FL, USA 7-11 September 2003

  2. Introduction • Span Restoration • Localized and shorter restoration paths • Faster and easier control of transmission effects • Less capacity efficient • No ability to recover from node failures • End-to-End Path Restoration • More capacity efficient • Inherent ability to recover from node failures • Operationally more complicated • Many nodes involved, and restoration paths are lengthy • Greater average delay • Can we modify span restoration to protect node failures? • Will this combine benefits of span and path restoration?

  3. Span Restoration Path Restoration B B custodial nodes X X custodial node X C X C custodial node A Z A Z Y Y D D Node-Inclusive Span Survivability NA NZ custodial regions B X X C A Z Y node-inclusive span entity D Node-Inclusive Span Survivability Concept

  4. X X A A B B C C D D E E A B C D E Node Failure Recovery: X NISS Operational Details Span Failure Recovery:

  5. restoration route custodial node B Y D custodial node A Z O X X X C X custodial node D custodial regions custodial node O restoration route NISS Operational Details(2)

  6. Integer Linear Programming Model Objective Function: • Minimize cost of spare capacity Subject To: • Restoration flow for all span failure scenarios • Spare capacity allocation for span failures • including stub release • Restoration flow for all node failure scenarios • Spare capacity allocation for node failures • including stub release

  7. Computational Aspects • Test networks • Group A: Nine small test networks (9-node 17-span to 11-node 26-span) • Group B: Three families of networks of varying average nodal degree (15-node to 25-node) • Traffic demands • Group A: Various, as per networks’ sources • Group B: Uniform random demands from 1 to 10 wavelengths • Working capacity is shortest path routed • Eligible route enumeration • At least five eligible restoration routes per failure scenario • ILP solution method • Implemented in AMPL and solved using CPLEX 7.1 MIP • 4-processor UltraSparc Sun Server, 450 MHz, 4 GB RAM • Solved to within 0.01% of optimality • Most problems solved in several seconds or minutes

  8. Results Test Networks: Group A

  9. Results (2) Test Networks: Group B 15-node family

  10. Results (3) Test Networks: Group B 20-node family

  11. Results (4) Test Networks: Group B 25-node family

  12. Concluding Remarks • Node failure protection is inherent • and we can explicitly guarantee it • Spare capacity requirements are good • significantly below span restoration • approaching path restoration (within 0% to 10%) • Easily amenable to dynamic service provisioning • working capacity envelope can apply • Localized restoration paths make operational aspects much easier than path restoration

More Related