1. Survivable Traffic Grooming with Differentiated End-to-End Availability Guarantees in WDM Mesh Networks Proceedings of the 13th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2004. Reporter : Chao-Yang Lee

2. Outline Introduction Availability Model Survivable Grooming Algorithms Numerical Results and Analysis Conclusions

3. Introduction WDM technology provides huge bandwidth in a fiber by allowing simultaneous transmission of traffic on multiple wavelengths in the fiber. Traffic grooming is an essential functionality to provision sub- wavelength connections in WDM optical MANs.

4. Introduction Traffic grooming is to aggregate low speed traffic connections onto high-speed wavelength channels in a resource-efficient way. To minimize the resources consumed when the connection requests to be satisfied are given or to maximize the network throughput when the resources are given.

5. Introduction Reliability is critical for optical networks because a single failure may affect a large volume of traffic. The reliability requirement is usually decided by the customer application.

6. Introduction Path protection is often used for connections with high reliability requirement. In WDM mesh grooming networks, the protection schemes can be applied either at lightpath granularity or connection granularity.

7. Availability Model A general equation to calculate the availability of a component is A=MTTF/(MTTF+MTTR) A is the availability. MTTF is the mean time to failure. MTTR is the mean time to repair the component.

8. Availability Model

9. The dedicated-PAL and Shared-PAL

10. Survivable Grooming Algorithms

11. Availability Model The dedicated-PAC and Shared-PAC

12. Availability Model

13. Survivable Grooming Algorithms All the three algorithms presented are based on a link bundled auxiliary graph (LBAG) model. Using the LBAG model, the algorithms can calculate the shortest path currently available in the network for a connection request.

14. Survivable Grooming Algorithms Link Bundled Auxiliary Graph (LBAG) model

15. Grooming with No Protection (GNP) algorithm Calculate the shortest path as the candidate path using the LBAG model. Calculate the availability of the candidate path. If it meets the availability requirement, then satisfy the request using the path; otherwise, block the request.

16. Grooming with Protection at Lightpath level (GPL) algorithm Calculate the shortest path as the candidate path using the LBAG model. If the candidate path does not contain new lightpath, calculate availability of the candidate path. If it meets the availability requirement, then satisfy the request using the path; other block the request.

17. Grooming with Protection at Lightpath level (GPL) algorithm If the candidate path contains new lightpaths, then use the LBAG model to calculate the shortest link-disjoint paths to serve as the backup paths. Calculate availability of the new lightpaths.

18. Grooming with Protection at Lightpath level (GPL) algorithm Calculate availability of the candidate paths. If it meets the availability requirement, then satisfy the request using the path; other block the request.

19. Grooming with Protection at Connection level (GPC) Step1. Calculate the shortest path which meets the availability requirement using the LBAG model. If successful, then satisfy the connection request using a single primary path without protection; otherwise, go to step 2.

20. Grooming with Protection at Connection level (GPC) Step 2. Calculate the shortest path and its shortest link-disjoint path as the primary path and backup path respectively. Calculate the overall availability of the path pair.

21. Grooming with Protection at Connection level (GPC) If this path pair meets the availability requirement, then satisfy the connection request using the path pair. Otherwise, block the request.

22. Numerical Results and Analysis The connection bandwidth requirement is distributed uniformly between 1 and 4. The bandwidth capacity of a lightpath is 16. Each node has 32 transceivers and each fiber link supports 16 wavelengths. Full wavelength conversion capability.

23. Numerical Results and Analysis

26. Numerical Results and Analysis - GPL

27. Numerical Results and Analysis - GPC

28. Conclusions From the availability model, it is obvious that applying protection at either lightpath level or connection level can increase the availability of a connection. The simulations demonstrate that shared protection is more resource- efficient than dedicated protection.

29. Conclusions The dedicated protection generates higher availability than shared protection. The dedicated protection is needed for connections with high availability. The GPC can provision connections in a more flexible way than GPL.