Dynamic Grooming Algorithms for Survivable WDM Mesh Networks
- Cite this article as:
- Wen, H., Li, L., He, R. et al. Photonic Network Communications (2003) 6: 253. doi:10.1023/A:1025627320965
- 111 Downloads
Within a WDM grooming mesh network and under the constraints of the number of transceivers per node and wavelength continuity, we propose a novel dynamic grooming graph which models the number of transceivers per node in addition to the usage of wavelength and bandwidth resources. Based on the grooming graph, we first propose a dynamic traffic-grooming algorithm called integrated grooming algorithm (IGA). And we also propose two dynamic survivable traffic-grooming algorithms, which are called protection per lightpath traffic-grooming algorithm (PPL) and protection per connection traffic-grooming algorithm (PPC). These algorithms are evaluated via simulations.