Skip to main content

Advertisement

SpringerLink
Log in

Grooming of dynamic traffic in WDM star and tree networks using a genetic algorithm

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

The advances in WDM technology lead to the great interest in traffic grooming problems. As traffic often changes from time to time, the problem of grooming dynamic traffic is of great practical value. In this article, we discuss the dynamic grooming of traffic in star and tree networks. A genetic algorithm (GA) based approach is proposed to support arbitrary dynamic traffic patterns, which minimizes the number of ADMs and wavelengths. To evaluate the algorithm, tighter bounds are derived. Computer simulation results show that our algorithm is efficient in reducing both the number of ADMs and wavelengths in tree and star networks.

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. Chiu A.L. and Modiano E.H. (2000). Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE/OSA J. Lightwave Technol. 18(1): 1–12

    Article  Google Scholar 

  2. Zhang X.J. and Qiao C.M. (2000). An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings. IEEE/ACM Trans. Network. 8(5): 608–617

    Article  Google Scholar 

  3. Dutta R. and Rouskas G.N. (2002). On optimal traffic grooming in WDM rings. IEEE J. Select. Area. Commun. 20(1): 110–121

    Article  Google Scholar 

  4. Berry R. and Modiano E.H. (2000). Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic. IEEE J. Select. Area. Commun. 18(10): 1961–1971

    Article  Google Scholar 

  5. Xu Y., Xu C.S. and Wu B.X. (2003). Strictly nonblocking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithm. Comput. Network 41(2): 227–245

    Article  MATH  MathSciNet  Google Scholar 

  6. Liu K.H. and Xu Y. (2004). A new approach to improving the grooming performance with dynamic traffic in SONET rings. Comput. Network 46(2): 181–195

    Article  Google Scholar 

  7. Zhu K.Y. and Mukherjee B. (2002). Traffic grooming in an optical WDM mesh network. IEEE J. Select. Area Commun. 20(1): 122–133

    Article  Google Scholar 

  8. Wen, H., He, R., Li, L., Wang, S.: A Plane-construction traffic grooming algorithm in WDM mesh networks. Proceedings of PDCAT’2003, pp. 263–267. IEEE, Chengdu, China (2003)

  9. Lee, C.W., Park, E.K.: A genetic algorithm for traffic grooming in all-optical mesh networks. IEEE International Conference on Systems, Man and Cybernetics, vol. 7, Yasmine Hammamet, Tunisia, pp. 6–9 (2002)

  10. Jiao Y.G., Zhou B.K., Zhang H.Y. and Guo Y.L. (2005). Grooming of arbitrary traffic in optical WDM mesh networks using genetic algorithm. Photonic Network Commun. 10(2): 193–198

    Article  Google Scholar 

  11. Chen, B., Dutta, R., Rouskas, G.N.: Traffic grooming in star networks, broadnets 2004: Workshop on Traffic Grooming in WDM Networks, San Jose, California, USA, pp. 25–29, October 2004

  12. Angel, E., Bampis, E., Pascual, F.: Traffic grooming in a passive star WDM network, SIROCCO 2004, Slovakia, Czechoslovakia, LNCS 3104, pp. 1–12 (2004)

  13. Huang S., Dutta R. and Rouskas G.N. (2006). Traffic grooming in path, star, and treenetworks: complexity, bounds, and algorithms. IEEE J. Select. Area Commun. 24(4): 66–82

    Article  Google Scholar 

  14. Cheng, M.: the Intelligent analysis in the problem of grooming of traffics in WDM tree networks, Master thesis, School of Physics and OptoElectronic Technology, Fujian Normal University (2004)

  15. Xu, Y., Xu, S.C.: Heuristic Operators, Redundant Mapping and Other Issues in genetic algorithms. In Proc. of the CEC2001, Seoul, Korea, pp. 1398–1405 (2001)

  16. Liu K.H. and Xu Y. (2005). Combining GA with Splitting Methods to the Rearrangeably Nonblocking Grooming of Dynamic Traffic in SONET Ring Networks. Photonic Network Commun. 10(2): 179–192

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Intelligent Computing Lab, Hefei Institute of Intelligent Machines, Chinese Academy of Sciences, P.O. Box 1130, Hefei, Anhui, 230031, China

    Kun-Hong Liu & De-Shuang Huang

  2. Department of Automation, University of Science and Technology of China, Hefei, Anhui, 230026, China

    Kun-Hong Liu

  3. School of Medicine, The University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK

    Yong Xu

  4. Department of Physics and Electronic Information Engineering, Minjiang University, Fuzhou, 350108, China

    Min Cheng

Authors
  1. Kun-Hong Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. De-Shuang Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Min Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kun-Hong Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, KH., Xu, Y., Huang, DS. et al. Grooming of dynamic traffic in WDM star and tree networks using a genetic algorithm. Photon Netw Commun 15, 111–121 (2008). https://doi.org/10.1007/s11107-007-0103-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-007-0103-0

Keywords

Search

Navigation