A survivable multicast routing mechanism in WDM optical networks



In Next Generation Networks (NGN), survivability and availability are becoming more and more key features. Reliability gains more importance in high- capacity networks where IP and optical technologies have converged toward a common control plane, such as GMPLS. In most previous research works, survivability aspects were mainly limited to a single fiber failure and a few considered the differentiated reliability concepts when routing new connection requests. In this article, a novel survivable multicast routing mechanism under SRLG constraints is proposed. We first formulate the problem as an Integer Linear Programming (ILP) model that is shown NP-Complete. We then propose a heuristic algorithm that alleviates the problem’s complexity by decomposing it into two sub-problems resolved separately. Compared with another algorithm proposed in the literature, our algorithm allows for higher acceptance rates even for stringent reliability requirements.


Wavelength Division Multiplexing (WDM) Shared Risk Link Group (SRLG) Differentiated reliability Survivability Mathematical programming 


  1. 1.
    Li Y., Jin Y., Li L., Li L.: On finding the multicast protection tree considering SRLG in WDM optical networks. ETRI J. 28(4), 517–520 (2006)CrossRefGoogle Scholar
  2. 2.
    Markidis G., Tzanakaki A.: Network performance improvement through differentiated survivability services in WDM optical networks. J. Opt. Netw. 7(6), 564–572 (2008). doi: 10.1364/JON.7.000564 CrossRefGoogle Scholar
  3. 3.
    Guo L., Li L.: A novel survivable routing algorithm with partial shared risk link groups (SRLGs)-disjoint protection based on differentiated reliability constraints in WDM optical mesh networks. IEEE J. Lightwave Technol. 25(6), 1410–1415 (2007). doi: 10.1109/JLT.2007.896772 CrossRefGoogle Scholar
  4. 4.
    Gui L., Cao J., Yu H., Li L.: A new shared-risk link groups (SRLG)-disjoint path provisioning with shared protection in WDM optical networks. J. Netw. Comput. Appl. 30(2), 650–661 (2007). doi: 10.1016/j.jnca.2005.12.005 CrossRefGoogle Scholar
  5. 5.
    Rostami, M.J., Khorsandi, S., Khodaparast, A.A.: Cose: A SRLG-disjoint routing algorithm. In: Proceedings of the IEEE Fourth European Conference on Universal Multiservice Networks, vol. 1, pp. 86–92 (2007)Google Scholar
  6. 6.
    Hu J.Q.: Diverse routing in optical mesh networks. IEEE Trans. Commun. 51(3), 489–494 (2003). doi: 10.1109/TCOMM.2003.809779 CrossRefGoogle Scholar
  7. 7.
    Todimala, A., Ramamurthy, B.: IMSH: An iterative heuristic for SRLG diverse routing in WDM mesh networks. In: Proceedings of the IEEE 13th Conference on Computer Communications and Networks, Vol. 1, pp. 199–204 (2004)Google Scholar
  8. 8.
    Datta, P., Somani, A.K.: Diverse routing for shared risk resource groups (SRRG) failures in WDM optical networks. In: Proceedings of the IEEE First Conference on Broadband Networks, Vol. 1, pp. 120–129 (2004)Google Scholar
  9. 9.
    Pan X., Xiao G.: Heuristics for diverse routing in wavelength-routed networks with shared risk link groups. Photonic Netw. Commun. 11, 29–38 (2006). doi: 10.1007/s11107-006-5321-3 CrossRefGoogle Scholar
  10. 10.
    Ou C., Zhang J, Zhang H.: New and improved approaches for shared-path protection in WDM mesh networks. J. Lightwave Technol. 22(5), 1223–1232 (2004). doi: 10.1109/JLT.2004.825346 CrossRefMathSciNetGoogle Scholar
  11. 11.
    Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New york (1979)MATHGoogle Scholar
  12. 12.
    ILOG, Inc. Using the CPLEX Callable Library and CPLEX Mixed Integer Library. ILOG, Inc., (2005)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Computer and Software EngineeringEcole Polytechnique de MontrealMontrealCanada

Personalised recommendations