Efficient node-disjoint paths search in WDM networks with asymmetric nodes

We present an efficient node-disjoint paths search method considering asymmetric nodes. Through simulation results, we show that the proposed method significantly improves the success rate of path search.

[1]  J. Martensson,et al.  Modeling WDM Wavelength Switching Systems for Use in GMPLS and Automated Path Computation , 2009, IEEE/OSA Journal of Optical Communications and Networking.

[2]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[3]  Chunming Qiao,et al.  Trap avoidance and protection schemes in networks with shared risk link groups , 2003 .

[4]  Yi Zhu,et al.  Node-disjoint paths search in WDM networks with asymmetric nodes , 2011, 15th International Conference on Optical Network Design and Modeling - ONDM 2011.

[5]  Ramesh Bhandari,et al.  Optimal physical diversity algorithms and survivable networks , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[6]  A. Todimala,et al.  IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).