Journal of Northeastern University ›› 2003, Vol. 24 ›› Issue (7): 647-650.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Sub-path protection algorithms in WDM grooming networks

He, Rong-Xi (1); Wang, Guang-Xing (1)   

  1. (1) Sch. of Info. Sci. and Eng., Northeastern Univ., Shenyang 110004, China
  • Received:2013-06-24 Revised:2013-06-24 Online:2003-07-15 Published:2013-06-24
  • Contact: He, R.-X.
  • About author:-
  • Supported by:
    -

Abstract: The problem of dynamically establishing dependable connections in wavelength division multiplexing (WPM) mesh networks with traffic grooming capabilities was investigated. A disjoint routing scheme under shared risk link groups (SRLG) constraints was proposed. It was called multi-granularity shared sub-path protection (MSSP) scheme. The scheme searches a primary path for each connection request firstly, and then segments the path into several equal length sub-paths, and calculates their SRLG-disjoint backup paths. In order to obtain the optimal spare capacity, MSSP makes use of the backup multiplexing technology to share backup bandwidth among different backup paths if their corresponding primary sub-paths are SRLG-disjoint. Based on dynamic traffic with different load, the performance of MSSP was investigated via simulations. MSSP can improve the performance of the network significantly and make the tradeoffs between the resource utilization and recovery times.

CLC Number: