Skip to main content
SpringerLink
Log in

Multicast multi-granular grooming based on integrated auxiliary grooming graph in optical networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

In order to improve the bandwidth utilization efficiency and reduce the blocking probability for multicast requests in optical networks, the multicast traffic grooming approach was proposed to groom a lot of low-speed traffic to a few of high-speed light-trees. At the same time, in order to save the ports and the cost of optical cross-connect, the multicast waveband grooming approach was proposed to groom multiple light-trees to a few of waveband tunnels. However, the existing approaches all did not consider the joint performances of improving bandwidth utilization efficiency, reducing blocking probability and saving ports for multicast requests. Therefore, in this article, we propose a new multicast multi-granular grooming approach to perform the hierarchical sequential grooming to improve the joint performances based on a newly developed integrated auxiliary grooming graph (IAGG) that includes multiple wavelength integrated grooming graphs (WIGGs) and one waveband virtual topology layered graph (BVLG) to support both the multicast traffic grooming and multicast waveband grooming. In order to achieve the map of light-tree to the virtual topology layer in WIGG or BVLG, we present a light-segment map method, where a light-tree will be divided to several light-segments each of which will be independently mapped to the virtual topology layer. Since different definitions of blocking probability may lead to different objectives, we define two kinds of blocking probability, mean blocking probability of requests (MBPR) and mean blocking probability of users (MBPU). According to the two definitions of blocking probability, we propose two multicast multi-granular grooming heuristic algorithms, Heuristic Algorithm with minimizing MBPR and Heuristic Algorithm with minimizing MBPU based on IAGG. Simulation results show that the two proposed algorithms are both efficient and have better performances than traditional multicast grooming algorithm.

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. Liu Y., Liang W.: Online multicasting in WDM networks with shared light splitter bank. Photon. Netw. Commun. 17(1), 1–9 (2008)

    Article  Google Scholar 

  2. Ding A., Poo G.: A survey of optical multicast over WDM networks. Comput. Commun. 26(3), 193–200 (2003)

    Article  Google Scholar 

  3. Zhou F., Molnar 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 

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

    Article  Google Scholar 

  5. Khalil, A., Assi, C., Hadjantonis, A., Ellinas, G., Ali, M.: On multicast traffic grooming in WDM networks. In: Proceedings of ISCC, Alexandria, Egypt, June 2004, pp. 282–287 (2004)

  6. Yang, D., Liao, W.: Design of light-tree based logical topologies for multicast streams in wavelength routed optical networks. In: Proceedings of INFOCOM, San Francisco, USA, April 2003, pp. 32–41 (2003)

  7. Huang X., Farahmand F., Jue J.: Multicast traffic grooming in wavelength-routed WDM mesh networks using dynamically changing light-trees. J. Lightw. Technol. 23(10), 3178– 3187 (2005)

    Article  Google Scholar 

  8. Liao L., Wen H., Li L., Wang S.: New dynamic grooming approaches for multicast traffic in meshed wavelength-division-multiplexing networks. Opt. Eng. 46(2), 025004 (2007)

    Article  Google Scholar 

  9. Lu, C., Li, L.: Dynamic multicast traffic grooming for survivable WDM mesh networks. In: Proceedings of ICCCAS, Xiamen, China, May 2008, pp. 567–571 (2008)

  10. Lee, S., Yen, H., Chen, A.: Traffic grooming for IP multicast over WDM networks using light-path and light-tree schemes. In: Proceedings of ICN, French Alps, France, April 2010, pp. 291–293 (2010)

  11. Cao X., Anand V., Qiao C.: Waveband switching in optical networks. IEEE Commun. Mag. 41(4), 105–112 (2003)

    Article  Google Scholar 

  12. Kolarov, A., Sengupta, B.: A study of waveband routing and wavelength assignment in multi-granular hybrid optical networks. In: Proceedings of ICC, Seoul, Korea, May 2005, pp. 239–243 (2005)

  13. Li M., Ramamurthy B.: Dynamic waveband switching in WDM mesh networks based on a generic auxiliary graph model. Photon. Netw. Commun. 10(3), 309–331 (2005)

    Article  Google Scholar 

  14. Guo L., Wang X., Ji W., Hou W., Yang T.: A new waveband switching method for reducing the number of ports in wavelength-division-multiplexing optical networks. Opt. Fiber Technol. 15(1), 5–9 (2009)

    Article  Google Scholar 

  15. Guo L., Wang X., Hou W., Li Y., Wang H., Li H., Wang C.: A new integrated auxiliary graph based routing algorithm in waveband switching optical networks. AEU-Int. J. Electron. Commun. 64(1), 87–91 (2010)

    Article  Google Scholar 

  16. Wang Y., Cao X.: Multi-granular waveband assignment and protection in WDM networks. J. Lightw. Technol. 28(13), 2004–2013 (2010)

    Article  Google Scholar 

  17. Guo, L., Wang, X., Jiang, D., Pang, L.: Multicast waveband routing and grooming algorithm in optical WDM network. In: Proceedings of ICCET, Chengdu, China, April 2010, pp. 610–614 (2010)

  18. Hou, W., Guo, L., Wang, X., Cao, J., Wu, J., Li, Y.: A new routing algorithm based on integrated grooming auxiliary graph in multi-granularity optical networks. In: Proceedings of NCM, Seoul, Korea, Aug 2009, pp. 462–467 (2009)

  19. Kamal A.: Algorithms for multicast traffic grooming in WDM mesh networks. IEEE Commun. Mag. 44(11), 96–105 (2006)

    Article  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Information Science and Engineering, Northeastern University, Shenyang, 110819, China

    Lei Guo, Weigang Hou, Jingjing Wu & Yan Li

  2. State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    Lei Guo

Authors
  1. Lei Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weigang Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jingjing Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Weigang Hou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, L., Hou, W., Wu, J. et al. Multicast multi-granular grooming based on integrated auxiliary grooming graph in optical networks. Photon Netw Commun 24, 103–117 (2012). https://doi.org/10.1007/s11107-012-0371-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-012-0371-1

Keywords

Search

Navigation