A novel segment-shared protection algorithm based on dynamic domain-sequencing scheme for multi-domain optical mesh networks

Survivability has been widely recognized as an important design issue for optical networks. In practice, as the network scale keeps expanding, this design problem becomes more critical. Due to scalability and domain privacy, designing the protection scheme in multi-domain networks is more difficult than that in single domain networks. The path computation element (PCE) is known as an efficient architecture to compute optimal traffic engineering (TE) paths in multi-domain multilayer networks. Based on the PCE architecture, we first propose a new dynamic domain-sequencing scheme that considers the load balance of inter-domain links and then propose an improved segment-shared protection approach called DDSP. It can provide 100% protection ability for multiple failures that each single domain has only one failed link. Finally, the protection based on the optimal dynamic domain-sequencing scheme, called OPT, is designed, to evaluate performance of our algorithm and to provide the good bounding for the dynamic domain-sequencing scheme with limited intra TE information. Simulation evaluation shows that the proposed scheme is effective in multi-domain path protection with more efficient resource utilization, lower blocking probabilities and less inter-domain cost. Furthermore, the performance of it is near to OPT.

[1]  Yufei Wang,et al.  Optical network design and restoration , 1999, Bell Labs Technical Journal.

[2]  Eytan Modiano,et al.  Survivable lightpath routing: a new approach to the design of WDM-based networks , 2002, IEEE J. Sel. Areas Commun..

[3]  Brigitte Jaumard,et al.  Using Topology Aggregation for Efficient Shared Segment Protection Solutions in Multi-Domain Networks , 2007, IEEE Journal on Selected Areas in Communications.

[4]  Qingji Zeng,et al.  Connection provisioning with guaranteed recovery time in survivable WDM optical networks , 2006, Photonic Network Communications.

[5]  Baruch Awerbuch,et al.  Topology aggregation for directed graph , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[6]  Adrian Farrel,et al.  A Path Computation Element (PCE)-Based Architecture , 2006, RFC.

[7]  Bernard Cousin,et al.  Survivability in multi-domain optical networks using p-cycles , 2009, Photonic Network Communications.

[8]  Ariel Orda,et al.  Reliable Routing with QoS Guarantees for Multi-Domain IP/MPLS Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

[10]  Byrav Ramamurthy,et al.  Inter-domain dynamic routing in multi-layer optical transport networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[11]  Brigitte Jaumard,et al.  Using Topology Aggregation for Efficient Segment Shared Protection Solutions in Multi-Domain Network , 2006 .

[12]  Kiran R. Bhutani,et al.  Two Approaches for Aggregation of Peer Group Topology in Hierarchical PNNI Networks , 2000, Intell. Autom. Soft Comput..

[13]  Jean-Philippe Vasseur,et al.  Path-Computation-Element-Based Architecture for Interdomain MPLS/GMPLS Traffic Engineering: Overview and Performance , 2007, IEEE Network.

[14]  Lei Guo,et al.  LSSP: A novel local segment-shared protection for multi-domain optical mesh networks , 2007, Comput. Commun..

[15]  Suresh Subramaniam,et al.  Survivability in optical networks , 2000, IEEE Netw..

[16]  Eric Bouillet,et al.  Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths , 2002, Optical Fiber Communication Conference and Exhibit.

[17]  Qing Liu,et al.  Hierarchical routing in multi-domain optical networks , 2006, Comput. Commun..

[18]  Bernard Cousin,et al.  A survey of survivability in multi-domain optical networks , 2010, Comput. Commun..

[19]  Robert D. Doverspike,et al.  Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Dieu Linh Truong,et al.  Dynamic routing for shared path protection in multidomain optical mesh networks , 2006 .

[21]  Lei Guo,et al.  A novel domain-by-domain survivable mechanism in multi-domain wavelength-division-multiplexing optical networks , 2009 .

[22]  Baruch Awerbuch,et al.  Topology aggregation for directed graphs , 2001, TNET.

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

[24]  Xiaoning Zhang,et al.  On segment-shared protection for dynamic connections in multi-domain optical mesh networks , 2010 .

[25]  Yunfeng Peng,et al.  Local segment-shared protection based on source egress gateway selection for multi-domain optical mesh networks , 2010, Science China Information Sciences.

[26]  P Castoldi,et al.  Enhancing Backward Recursive PCE-based Computation (BRPC) for Inter-Domain Protected LSP Provisioning , 2008, OFC/NFOEC 2008 - 2008 Conference on Optical Fiber Communication/National Fiber Optic Engineers Conference.

[27]  Eiji Oki,et al.  Diverse path setup schemes in multi-domain optical networks , 2008, 2008 5th International Conference on Broadband Communications, Networks and Systems.

[28]  Whay Chiou Lee,et al.  Minimum equivalent subspanner algorithms for topology aggregation in ATM networks , 1999, 1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284).