Heuristic routing algorithm for shared protection in connection-oriented networks

In a connection-oriented network, shared protection provides the same level of protection against single path failures as dedicated protection, with potentially higher network utilization. This paper lists the requirements of path protection and proposes a heuristic routing algorithm for shared protection provisioning. Simulations were conducted to verify the algorithm and to compare network utilization of shared protection to that of dedicated protection.

[1]  Chunming Qiao,et al.  Dynamic establishment of protection paths in WDM networks. Part I , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[2]  H.T. Mouftah,et al.  SLSP: a new path protection scheme for the optical Internet , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).

[3]  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).

[4]  C.-F. Su,et al.  Protection path routing on WDM networks , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).