Photonic Network Communications

, Volume 6, Issue 3, pp 253–263

Dynamic Grooming Algorithms for Survivable WDM Mesh Networks

  • Haibo Wen
  • Lemin Li
  • Rongxi He
  • Hongfang Yu
  • Sheng Wang
  • Na Song
Article

DOI: 10.1023/A:1025627320965

Cite this article as:
Wen, H., Li, L., He, R. et al. Photonic Network Communications (2003) 6: 253. doi:10.1023/A:1025627320965

Abstract

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.

traffic grooming wavelength division multiplexing grooming graph path protection 

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Haibo Wen
    • 1
  • Lemin Li
    • 1
  • Rongxi He
    • 1
  • Hongfang Yu
    • 1
  • Sheng Wang
    • 1
  • Na Song
    • 1
  1. 1.National Key Lab of Broadband Optical Fiber Transmission and Communication NetworksUniversity of Electronic Science and Technology of ChinaChina

Personalised recommendations