Differentiated Shared Protection Algorithm Supporting Traffic Grooming in

  • Slides: 15
Download presentation
Differentiated Shared Protection Algorithm Supporting Traffic Grooming in WDM Mesh Networks Proceedings of the

Differentiated Shared Protection Algorithm Supporting Traffic Grooming in WDM Mesh Networks Proceedings of the 2004 International Conference on Communications Circuits and Systems, 2004. ICCCAS. Reporter : Chao-Yang Lee

Outline n n n Introduction Availability Model Heuristic Algorithm Simulation Result Conclusions

Outline n n n Introduction Availability Model Heuristic Algorithm Simulation Result Conclusions

Introduction n n WDM networks have emerged as a promising candidate for next generation

Introduction n n WDM networks have emerged as a promising candidate for next generation networks. Traffic grooming can aggregate low-rate connections onto high-capacity lightpaths to make efficient use of the bandwidth.

Introduction

Introduction

Heuristic Algorithm n n To groom the low-rate connections in virtual topology, proper routing

Heuristic Algorithm n n To groom the low-rate connections in virtual topology, proper routing method such as Dijkstra must be used. For the traffic grooming based on reliability, the link cost of virtual topology should consider delay D (lightpath hops), reliability R, the bandwidth of connection Bq and link capacity Br into consideration.

Heuristic Algorithm n W is a parameter

Heuristic Algorithm n W is a parameter

Heuristic Algorithm n n Route the low-rate connections in the virtual topology. Calculate the

Heuristic Algorithm n n Route the low-rate connections in the virtual topology. Calculate the link cost value in the virtual topology according to the, reliability and bandwidth requirement of the current connection.

Heuristic Algorithm n n Route the current connection using Dijkstra algorithm. if the shortest

Heuristic Algorithm n n Route the current connection using Dijkstra algorithm. if the shortest path can be found, there exist a multi-hop lightpath to groom the low-rate connection, figure out the spare capacity along the occupied logical links

Heuristic Algorithm n n Setup primary path and corresponding partial shared protection path and

Heuristic Algorithm n n Setup primary path and corresponding partial shared protection path and construct the virtual topology. If the primary path and protection path routed successfully, construct virtual topology.

Simulation Result

Simulation Result

Simulation Result

Simulation Result

Simulation Result

Simulation Result

Simulation Result

Simulation Result

Simulation Result

Simulation Result

Conclusions n n Considering both the survivability and traffic grooming Partial Shared-path Protection algorithm

Conclusions n n Considering both the survivability and traffic grooming Partial Shared-path Protection algorithm supporting Traffic Grooming is proposed. A shared protection scheme of partial lightpath based on link reliability is presented to meet the requirement of reliability and bandwidth of connections.