Skip to main content
Log in

Delay-constrained survivable multicast routing problem in WDM networks with shared segment-based protection

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

For a delay-constrained multicast transmission request, the goal of delay-constrained survivable multicast routing problem is to provide the primary multicast tree and the tree protecting sparse resources. The shared segment-based protection (SSBP) method is used in this article to protect the delay-constrained multicast transmission. Two heuristic methods are proposed to find the delay-constrained primary tree and the backup segments with delay constraint. Experiments are conducted to evaluate the performance of the proposed methods, and the performance to be evaluated includes wavelength efficiency ratio (WER), blocking ratio (BR), and executing time. Simulations show that the SSBP method can get better BR and WER than the previous results demonstrated Din and Jiang (Comput Commun 35(10):1172–1184, 2012).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Mukherjee, B.: Optical WDM Networks. Springer, Berlin (2006)

    Google Scholar 

  2. Yan, A., Ali, M., Deogun, J.: Routing optimization of multicast sessions in sparse light-splitting optical networks. In: Proceedings of IEEE global telecommunications conference (Globecom’2001), pp. 2134–2138, 2001

  3. Din, D.-R.: Heuristic algorithms for finding light-forest of multicast routing on WDM network. J. Inform. Sci. Eng. 25(1), 83–103 (2009)

    Google Scholar 

  4. Din, D.-R.: Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM network. Artif. Intell. Rev. 29, 195–222 (2008)

    Article  Google Scholar 

  5. Singhal, N.K., Ou, C., Mukherjee, B.: Cross-sharing versus self-sharing trees for protecting multicast sessions in mesh networks. Comput. Netw. 50(2), 200–206 (2006)

    Article  MATH  Google Scholar 

  6. Singhal, N.K., Mukherjee, B.: Protecting multicast sessions in WDM optical mesh networks. IEEE J. Lightware Technol. 21(4), 884–892 (2003)

    Article  Google Scholar 

  7. Medard, M., Finn, S.G., Barry, R.A., Gallager, R.G.: Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Trans. Netw. 7(5), 641–652 (1999)

    Article  Google Scholar 

  8. Rahman, T., Ellinas, G.: Protection of multicast sessions in WDM mesh optical networks. In: Proceedings of optical fiber communications (OFC’05). Anaheim, CA, p. 3, March 2005

  9. Leelarusmee, P., Boworntummarat, C., Wuttisittikulkij, L.: Design and analysis of five protection schemes for preplanned recovery in multicast WDM networks. In: Proceedings of IEEE SAWWC’04, pp. 167–170. Princeton, NJ, April 2004

  10. Luo, H.B., Yu, H.F., Li, L.M., Wang, S.: On protecting dynamic multicast sessions in survivable mesh WDM networks. In: Proceedings of Optical Fiber Communications (OFC’06), p. 3. Anaheim, CA, March 2006

  11. Singhal, N.K., Sahasrabuddhe, L.H., Mukherjee, B.: Provisioning of survivable multicast sessions against single link failures in optical WDM mesh networks. IEEE J. Lightware Technol. 21(11), 2587–2594 (2003)

    Article  Google Scholar 

  12. Singhal, N.K., Mukhejee, B.: Dynamic provisioning of survivable multicast sessions in optical WDM mesh networks. In: Proceedings of optical fiber, communications (OFC’03), pp. 207–209, March 2003.

  13. Lu, C., Luo, H., Wang, S., Li, L.M.: A novel shared segment protection algorithm for multicast sessions in mesh WDM networks. ETRI J. 28, 329–336 (2006)

    Article  Google Scholar 

  14. Liao, L., Li, L., Wang, S.: Dynamic segment shared protection for multicast traffic in meshed wavelength division multiplexing optical networks. J. Opt. Netw. 5(12), 1084–1096 (2006)

    Article  Google Scholar 

  15. Grover, W.D., Stamatelakis, D.: Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In: Proceedings of IEEE ICC 1998, pp. 537–543, June (1998)

  16. Zhang, F., Zhong, W.D., a Jin, Y.: Optimizations of p-cycle-based protection of optical multicast sessions. IEEE J. Lightware Technol. 26(19), 3298–3306 (2008)

    Article  Google Scholar 

  17. Wang, X., Wang, S., Li, L., Xu, S.: Achieving shared multicast protection in WDM networks with sparse light-splitting constraint. J. Opt. Netw. 7(1), 1–14 (2008)

    Article  MathSciNet  Google Scholar 

  18. Din, D.-R., Jiang, J.-Y.: Delay-constrained survivable multicast routing problem in WDM networks. Comput. Commun. 35(10), 1172–1184 (2012)

    Article  Google Scholar 

  19. Dijkstra, E.: A note on two problems in connation with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. In: Proceedings of IEEE 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), pp. 338–346, 1984.

  21. Eppstein, David: Finding the \(k\) shortest paths. SIAM J. Comput. 28(2), 652–673 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  22. Victor, M. Jimenez Andres Marzal: Computing the K shortest paths: a new algorithm and experimental comparison. In: Proceedings of 3rd International Workshop, (WAE’99) also in LNCS, 1668, pp. 15–29 (1999)

  23. http://www.boost.org/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Der-Rong Din.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Din, DR., Hong, CY., Yen, HS. et al. Delay-constrained survivable multicast routing problem in WDM networks with shared segment-based protection. Photon Netw Commun 26, 150–160 (2013). https://doi.org/10.1007/s11107-013-0417-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-013-0417-z

Keywords

Navigation