Skip to main content
SpringerLink
Log in

Dynamic multicast traffic grooming in WDM networks

  • Research Article
  • Published:
Frontiers of Electrical and Electronic Engineering in China

Abstract

Dynamic multicast traffic grooming in wavelength division multiplexing (WDM) networks was analyzed to minimize networkwide costs and to increase the network resource utilization. A network model was developed for dynamic multicast traffic grooming with resource constraints and an algorithm that can provide quality of service (QoS) was proposed. The QoS is measured by the maximum number of lightpaths passing between the source and the destinations. The blocking probability of the algorithm was assessed in simulations. The results show that a higher QoS requirement results in higher blocking probability, and when the QoS requirement is low, changes in the QoS requirements have only small effects on the blocking probability.

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. Dutta R., Rouskas G., Carolina N., Traffic grooming in WDM networks: past and future, IEEE Network, 2002, 16(6): 46–56

    Article  Google Scholar 

  2. Zhu K., Mukherjee B., Traffic grooming in an optical WDM mesh network, IEEE JSAC, 2002, 20(1): 122–133

    Google Scholar 

  3. Dutta R., Rouskas G., Carolina N., On optimal traffic grooming in WDM rings, IEEE JSAC, 2002, 20(1): 110–121

    Google Scholar 

  4. Wen Hai-bo, He Rong-xi, Li Le-min et al., Dynamic traffic-grooming algorithms in wavelength-division-multiplexing mesh networks, Journal of Optical Networking, 2003, 2(4): 100–111

    Google Scholar 

  5. Kamal A., Ul-Mustafa R., Multicast traffic grooming in WDM networks, Proceedings of Opticomm03, Dallas, TX, USA: Opticomm, 2003

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electronic Engineering, Tsinghua University, Beijing, 100084, China

    Cheng Xiao-jun, Ge Ning & Feng Chong-xi

Authors
  1. Cheng Xiao-jun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ge Ning
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng Chong-xi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ge Ning.

Additional information

__________

Translated from Journal of Tsinghua University (Science and Technology), 2005, 45(4): 437–440 (in Chinese)

About this article

Cite this article

Cheng, Xj., Ge, N. & Feng, Cx. Dynamic multicast traffic grooming in WDM networks. Front. Electr. Electron. Eng. China 1, 441–444 (2006). https://doi.org/10.1007/s11460-006-0084-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11460-006-0084-2

Keywords

Search

Navigation