Traffic Groomed Multicasting in Sparse-Splitting WDM Backbone Networks

  • Yeo-Ran Yoon
  • Tae-Jin Lee
  • Min Young Chung
  • Hyunseung Choo
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3981)


As the interest of the Internet multicasting increases, the huge portion of the future traffic in optical WDM networks is expected to be strongly related to multicast applications and thus the technology for grooming such traffics also becomes important. In this study, we investigate the problem of multicast traffic grooming in WDM optical mesh networks with sparse-splitting capability. The problem of constructing optimal multicast routing trees and grooming their traffics in WDM optical mesh networks is NP-hard. Therefore, we propose heuristic algorithms to solve the problem in an efficient manner. These reduce the link cost by constructing a minimal cost tree with multicast capable nodes and increase the traffic grooming effect based on the relationship of multicast sessions. Comprehensive simulation results demonstrate that the proposed schemes use the network resource more efficiently especially for link cost compared to the previous work [1] while maintaining the similar number of wavelengths.


Destination Node Mesh Network Wavelength Division Multiplex Multicast Tree Connection Request 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Billah, A.R.B., Wang, B., Awwal, A.A.S.: Multicast traffic Grooming In WDM Optical Mesh Networks. In: Global Telecommunications Conference, GLOBECOM 2003, vol. 5, pp. 2755–2760. IEEE, Los Alamitos (2003)Google Scholar
  2. 2.
    Kamal, A., Ul-Mustafa, R.: Multicast Traffic Grooming in WDM Networks. In: Proc. Opticomm 2003, vol. 5285, pp. 25–36 (October 2003)Google Scholar
  3. 3.
    Chowdhary, G.V., Murthy, C.: Dynamic Multicast Traffic Engineering in WDM Groomed Mesh Networks. In: BroadNets 2004. Proceedings. First International Conference on Broadband Networks, October 25-29 (2004)Google Scholar
  4. 4.
    Chiu, A.L., Modiano, E.H.: Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. J. Lightwave Technol. 18, 2–12 (2000)CrossRefGoogle Scholar
  5. 5.
    Khalil, A., Assi, C., Hadjiantonis, A., Ellinas, G., Ali, M.A.: On Multicast Traffic Grooming in WDM Networks. In: Proceedings. Ninth International Symposium on Computers and Communications ISCC 2004, June 28, vol. 1, pp. 282–287 (2004)Google Scholar
  6. 6.
    Khalil, A., Hadjiantonis, A., Ellinas, G., Ali, M.: Sequential and Hybrid Grooming Approaches for Multicast Traffic in WDM Networks. In: Global Telecommunications Conference, GLOBECOM 2004, vol. 3, pp. 1808–1812. IEEE, Los Alamitos (2004)Google Scholar
  7. 7.
    Zhu, H., Zang, H., Zhu, K., Mukherjee, B.: A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks. IEEE/ACM Trans. Networking 11, 285–299 (2003)CrossRefGoogle Scholar
  8. 8.
    Thiagarajan, S., Somani, A.K.: Capacity fairness of WDM networks with grooming capability. Opt. Networks Mag. 2(3), 24–31 (2001)Google Scholar
  9. 9.
    Zhu, K., Mukherjee, B.: On-line provisioning connections of different bandwidth granularities in WDM mesh networks. In: Proc. IEEE/OSA OFC 2002, March 2002, pp. 549–551 (2002)Google Scholar
  10. 10.
    Rodionov, A.S., Choo, H.: On generating random network structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Ali, M., Deogun, J.S.: Cost-Effective Implementation of Multicasting in Wavelength Routed Networks. IEEE/OSA Journal of Lightwave Technology 18(12), 1628–1638 (2000)CrossRefGoogle Scholar
  12. 12.
    Sahasrabuddhe, L.H., Mukherjee, B.: Light-Trees: Optical Multicasting for Improved Performance in Wavelength Routed Networks. IEEE Communications Magazine 37(2), 67–73 (1999)CrossRefGoogle Scholar
  13. 13.
    Zhang, X., Wei, J., Qiao, C.: Constrained Multicast Routing in WDM Networks with Sparse Light Splitting. IEEE/OSA Journal of Lightwave Technology 18(12), 1917–1927 (2000)CrossRefGoogle Scholar
  14. 14.
    Hsieh, C.Y., Liao, W.: All Optical Multicast Routing in Sparse-Splitting Optical Networks. In: LCN 2003, Proceedings 28th Annual IEEE International Conference on Local Computer Networks, October 20-24, pp. 162–167 (2003)Google Scholar
  15. 15.
    Takahashi, H., Matsuyame, A.: An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica 24(6), 573–577 (1980)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yeo-Ran Yoon
    • 1
  • Tae-Jin Lee
    • 1
  • Min Young Chung
    • 1
  • Hyunseung Choo
    • 1
  1. 1.Lambda Networking Center, School of Information and Communication EngineeringSungkyunkwan UniversityKorea

Personalised recommendations