Skip to main content
SpringerLink
Log in

Traffic Groomed Multicasting in Sparse-Splitting WDM Backbone Networks

  • Conference paper
Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3981))

Included in the following conference series:

Abstract

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.

This research was supported by the Ministry of Information and Communication, Korea under the Information Technology Research Center support program supervised by the Institute of Information Technology Assessment, IITA-2005-(C1090-0501-0019).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. 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)

    Article  Google Scholar 

  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. 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. 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)

    Article  Google Scholar 

  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. 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. 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)

    Chapter  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. Takahashi, H., Matsuyame, A.: An Approximate Solution for the Steiner Problem in Graphs. Mathematica Japonica 24(6), 573–577 (1980)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lambda Networking Center, School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Yeo-Ran Yoon, Tae-Jin Lee, Min Young Chung & Hyunseung Choo

Authors
  1. Yeo-Ran Yoon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tae-Jin Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Min Young Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hyunseung Choo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  2. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. OptimaNumerics Ltd., Cathedral House, 23-31 Waring Street, BT1 2DX, Belfast, UK

    C. J. Kenneth Tan

  5. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  6. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  7. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  8. School of Information and Communication Engineering, Sungkyunkwan University, Korea

    Hyunseung Choo

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yoon, YR., Lee, TJ., Chung, M.Y., Choo, H. (2006). Traffic Groomed Multicasting in Sparse-Splitting WDM Backbone Networks. In: Gavrilova, M.L., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3981. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751588_56

Download citation

  • DOI: https://doi.org/10.1007/11751588_56

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34072-0

  • Online ISBN: 978-3-540-34074-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation