Photonic Network Communications

, Volume 8, Issue 3, pp 239–249

Shared Sub-Path Protection Algorithm in Traffic-Grooming WDM Mesh Networks

Authors

  • Rongxi He
    • College of Information EngineeringDalian Maritime University, Dalian 116026
  • Haibo Wen
    • Key Lab of Broadband Optical Fiber Transmission and Communication NetworksUniversity of Electronic Science and Technology of China
  • Lemin Li
    • Key Lab of Broadband Optical Fiber Transmission and Communication NetworksUniversity of Electronic Science and Technology of China
  • Guangxing Wang
    • College of Information EngineeringDalian Maritime University, Dalian 116026
Article

DOI: 10.1023/B:PNET.0000041236.17592.b4

Cite this article as:
He, R., Wen, H., Li, L. et al. Photonic Network Communications (2004) 8: 239. doi:10.1023/B:PNET.0000041236.17592.b4

Abstract

In this paper, we investigate the problem of dynamically establishing dependable connections in wavelength division multiplexing (WDM) mesh networks with traffic-grooming capabilities. We first develop a new wavelength-plane graph (WPG) to represent the current state of the network. We then propose a dynamic shared sub-path protection (SSPP) scheme based on this WPG. To establish a dependable connection, SSPP first searches a primary path for each connection request, and then it segments the found path into several equal-length sub-paths, and computes their corresponding backup paths, respectively. If two sub-paths in SSPP are fiber-disjoint then their backup paths can share backup resources to obtain optimal spare capacity. Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations. The results show that SSPP can make the tradeoffs between resource utilization and restoration time.

WDM mesh networkstraffic groomingshared protectionwavelength-plane graphsub-path protection

Copyright information

© Kluwer Academic Publishers 2004