Traffic recovery time constrained shared sub-path protection algorithm in survivable WDM networks

With the development of real-time applications, the traffic recovery time, which is defined as the duration between the failure occurrence on the working path and the interruptive traffic has been successfully switched to the backup path, has become the basic Quality-of-Service (QoS) requirement in survivable WDM networks. In this paper, we address the problem of shared sub-path protection with considering the constraint of traffic recovery time and propose a new heuristic algorithm called Traffic recovery time Constrained Shared Sub-Path Protection (TC_SSPP) to compute the working path and the Shared-Risk-Link-Group (SRLG)-disjoint backup sub-paths. The main target of our work is to improve the resource utilization ratio and reduce the blocking probability for dynamic network environment. By properly setting the delay parameter for each link and running the Delay Constrained Shortest Path Algorithm (DCSPA) to compute the backup sub-paths, TC_SSPP can effectively guarantee the traffic recovery time. Simulation results show that the proposed TC_SSPP can outperform the traditional algorithms.

[1]  Chunming Qiao,et al.  Novel algorithms for shared segment protection , 2003, IEEE J. Sel. Areas Commun..

[2]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..

[3]  Biswanath Mukherjee,et al.  A review of fault management in WDM mesh networks: basic concepts and research challenges , 2004, IEEE Netw..

[4]  Marwan Krunz,et al.  Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[5]  Sy-Yen Kuo,et al.  Dynamic sub-mesh protection under dynamic traffic demands in dense WDM networks , 2004, 18th International Conference on Advanced Information Networking and Applications, 2004. AINA 2004..

[6]  Biswanath Mukherjee,et al.  Subpath protection for scalability and fast recovery in optical WDM mesh networks , 2004, IEEE Journal on Selected Areas in Communications.

[7]  Tibor Cinkler,et al.  Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels , 2004, IEEE/ACM Transactions on Networking.

[8]  Lemin Li,et al.  Shared Sub-Path Protection Algorithm in Traffic-Grooming WDM Mesh Networks , 2004, Photonic Network Communications.

[9]  Sheng Wang,et al.  Dynamic Grooming Algorithms for Survivable WDM Mesh Networks , 2003, Photonic Network Communications.

[10]  Chunming Qiao,et al.  A new PROMISE algorithm in networks with shared risk link groups , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  B. Mukherjee,et al.  New and improved approaches for shared-path protection in WDM mesh networks , 2004, Journal of Lightwave Technology.

[12]  Krishna P. Gummadi,et al.  An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks , 2003, TNET.

[13]  Fernando A. Kuipers,et al.  An overview of constraint-based path selection algorithms for QoS routing , 2002 .

[14]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .