Skip to main content
SpringerLink
Log in

Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

In sparse light splitting all-optical WDM networks, the more destinations a light-tree can accommodate, the fewer light-trees and wavelengths a multicast session will require. In this article, a Hypo-Steiner light-tree algorithm (HSLT) is proposed to construct a HSLT light-tree to include as many destinations as possible. The upper bound cost of the light-trees built by HSLT is given as N(N − 1)/2, where N is the number of nodes in the network. The analytical model proves that, under the same condition, more destinations could be held in a HSLT than a Member-Only (Zhang et al., J. Lightware Technol, 18(12), 1917–1927 2000.) light-tree. Extensive simulations not only validate the proof but also show that the proposed heuristic outperforms the existing multicast routing algorithms by a large margin in terms of link stress, throughput, and efficiency of wavelength usage.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Turner J.S.: New directions in communications (or which way to the information age?). IEEE Commun. Mag. 40(5), 50–57 (2002)

    Article  Google Scholar 

  2. Sahasrabuddhe L.H., Mukherjee B.: Light-trees: optical multicasting for improved performance in wavelength-routed networks. IEEE Commun. Mag. 37(2), 67–73 (1999)

    Article  Google Scholar 

  3. Mukherjee B.: WDM optical communication networks: progress and challenges. IEEE J. Sel. Areas Commun. 18(10), 1810–1824 (2000)

    Article  Google Scholar 

  4. Malli R., Zhang X., Qiao C.: Benefit of multicasting in all-optical networks. SPIE Proc. All-Optical Netw. 2531, 209–220 (1998)

    Article  Google Scholar 

  5. Ali M., Deogun J.S.: Cost-effective implementation of multicasting in wavelength-routed networks. IEEE/OSA J. Lightwave Technol. 18(12), 1628–1638 (2000)

    Article  Google Scholar 

  6. Desurvire E.: Erbium-doped fiber amplifiers: principles and applications. Wiley, New York, NY, USA (1991)

    Google Scholar 

  7. Yan S., Deogun J.S., Ali M.: Network routing in sparse splitting optical networks with multicast traffic. Comput. Netw. 41, 89–113 (2003)

    Article  MATH  Google Scholar 

  8. Zhang X., Wei J., Qiao C.: Constrained multicast routing in WDM networks with sparse light splitting. IEEE/OSA J. Lightware Technol. 18(12), 1917–1927 (2000)

    Article  Google Scholar 

  9. Jia X., Du D., Hu X., Lee M., Gu J.: Optimization of wavelength assignment for QoS multicast in WDM networks. IEEE Trans. Commun. 49(2), 341–350 (2001)

    Article  MATH  Google Scholar 

  10. Zhou F., Molna’ar M., Cousin B.: Avoidance of multicast incapable branching nodes for multicast routing in wdm networks. Photon. Netw. Commun. 18(3), 378–392 (2009)

    Article  Google Scholar 

  11. Zhou F., Molna’ar M., Cousin B.: Is Light-tree Structure Optimal for multicast routing in sparse light splitting WDM Networks?. The 18th International Conference on Computer Communications and Networks, pp 1–7, San Francisco, USA (2009)

    Google Scholar 

  12. Zhou, F., Molna’ar, M., Cousin, B.: Distance priority based multicast routing in WDM networks considering sparse light splitting. The 11th IEEE International Conference on Communication System, pp 709–714, Guangzhou, China, November 2008

  13. Takahashi H., Matsuyama A.: An approximate solution for the Steiner problem in graphs. Math. Japonica 24(6), 573–577 (1980)

    MathSciNet  MATH  Google Scholar 

  14. Hamad A., Wu T., Kamal A.E., Somani A.K.: On multicasting in wavelength-routing mesh networks. Comput. Netw. 50, 3105–3164 (2006)

    Article  MATH  Google Scholar 

  15. Sreenath N., Satheesh K., Mohan G., SivaRam Murthy C.: Virtual source based multicast routing in wdm optical networks. Photon. Netw. Commun. 3(3), 213–226 (2001)

    Article  Google Scholar 

  16. Barbehenn M.: A note on the complexity of Dijkstra’s algorithm for graphs with weighted vertices. IEEE Trans. Comput. 47(2), 263 (1998)

    Article  MathSciNet  Google Scholar 

  17. Zhu Y., Rouskas G.N., Perros H.G.: A comparison of allocation policies in wavelength routing networks. Photon. Netw. Commun. 2(3), 265–293 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Campus de Beaulieu, Rennes, 35042, France

    Fen Zhou, Miklós Molnár & Bernard Cousin

  2. INSA Rennes, 20, Avenue des Buttes de Coësmes, Rennes, 35042, France

    Fen Zhou & Miklós Molnár

  3. University of Rennes 1, Campus de Beaulieu, Rennes, 35042, France

    Bernard Cousin

Authors
  1. Fen Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Miklós Molnár
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bernard Cousin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fen Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, F., Molnár, M. & Cousin, B. Hypo-Steiner heuristic for multicast routing in all-optical WDM mesh networks. Photon Netw Commun 20, 33–42 (2010). https://doi.org/10.1007/s11107-010-0243-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-010-0243-5

Keywords

Search

Navigation