Path-based Protection in WDM Networks with Differentiated Quality-of-Protection

The design of a survivable network with path-protection involves the provisioning of a primary and a backup path for every connection request. To optimize bandwidth usage under path-based protection, backup paths are allowed to share bandwidth under single failure model. However, path-based protection does not guarantee fast recovery as switches along a shared backup path may need to be reconfigured according to the particular primary path that needs to be recovered. Pre-cross-connected trail (PXT) addresses this problem by ensuring that backup paths are pre-connected. In practice, different requests may have different tolerance for recovery time. However, PXT does not consider differentiated tolerance and thus may block connections that may tolerate longer recovery times. In this paper, we address the problem of provisioning WDM networks with differentiated quality of protection under the path-based protection scheme. We formulate the problem of path protection with Differentiated Quality-of-Protection (DQoP) under single failure model, and develop an on-line algorithm that relaxes the PXT scheme by enabling the provisioning of requests under two classes of protection services. We consider both node failures as well as link failures. Extensive simulation results on several network topologies and under different traffic models confirm a reduction of up to 13% in blocking probability and up to 4% in bandwidth usage compared to the conventional PXT scheme.

[1]  Wayne D. Grover,et al.  Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles , 2002, IEEE/LEOS Summer Topi All-Optical Networking: Existing and Emerging Architecture and Applications/Dynamic Enablers of Next-Generation Optical Communications Systems/Fast Optical Processing in Optical.

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

[3]  Steven S. Lumetta,et al.  Capacity-efficient protection with fast recovery in optically transparent mesh networks , 2004, First International Conference on Broadband Networks.

[4]  Wayne D. Grover,et al.  Extending the p-cycle concept to path segment protection for span and node failure recovery , 2003, IEEE J. Sel. Areas Commun..

[5]  Demetrios Stamatelakis,et al.  Theory and Algorithms for Preconfiguration of Spare Capacity in Mesh Restorable Networks , 1997 .

[6]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[7]  C. Siva Ram Murthy,et al.  Efficient algorithms for routing dependable connections in WDM optical networks , 2001, TNET.

[8]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. Part I-Protection , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  S. Ramamurthy,et al.  Survivable WDM Mesh Networks, Part II-Restoration , 1999 .

[10]  Wayne D. Grover.  Bridging the Ring-Mesh Dichotomy With P-Cycles , 2000 .

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

[12]  Achim Autenrieth,et al.  Optimal configuration of p-cycles in WDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[13]  Marco Listanti,et al.  Impact of transmission performance on path routing in all-optical transport networks , 1998 .

[14]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks. II. Restoration , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[15]  Fabián A. Chudak,et al.  Fast optical Layer mesh protection using pre-cross-connected trails , 2002, IEEE/ACM Transactions on Networking.