Skip to main content

Advertisement

Log in

Partheno genetic algorithm for dynamic multi-services restoration in WDM networks

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

Dynamic restoration algorithms which support real-time and multi-services recovery are significant for the survivability of WDM (wavelength division multiplexed) networks. In this article, an intelligent dynamic restoration algorithm for multi-services in WDM networks based on the partheno genetic algorithm is proposed. In these networks, partial wavelength conversion is used. The algorithm is implemented within an interconnected multilayer-graph model and two kinds of optical networks matrix models. Compared with the basic restoration scheme, the proposed algorithm can make use of available network state information and can restore the affected multi-services fast and parallel. Simulation showed that the proposed algorithm can improve the restoration efficiency under high loads and reduce the service disruption ratio on the basis of fully utilizing resources of the network.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. ITU-T G1872: Architecture of optical transport networks

  2. Bischoff, M., Huber, M.N.: Survivability concepts for all-optical transport networks. In: Proceeding of IEEE ICCT’96, Beijing, China, 5–7 May 1996, vol. 2, pp. 884–887

  3. Chen, C., Banerjee, S.: A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. In: Proceedings IEEE INFOCOM’96, San Francisco, CA, USA, March 1996, vol. 1, pp. 164–171

  4. Mokhtar A. and Azizoglu M. (1998). Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Network. 6(2): 197–206

    Article  Google Scholar 

  5. Iraschko R.R. and Grover W.D. (2000). A highly efficient path- restoration protocol for management of optical network transport integrity. IEEE J. Select. Areas Commun. 18(5): 779–794

    Article  Google Scholar 

  6. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley (1989)

  7. Li M.-J. and Tong T.-S. (1999). A partheno genetic algorithm and analysis on its global convergence. ACTA Automatica Sin. 25(1): 68–72

    MathSciNet  Google Scholar 

  8. Na Z., Haijin S. and Naifu Z. (2006). Ant colony optimization for dynamic RWA in WDM networks with partial wavelength. Photon. Netw. Commun. 11(2): 229–236

    Article  Google Scholar 

  9. Brawn, H.: On Solving Travelling Salesman Problems by Genetic Algorithms, pp. 129–133. Morgan Kaufmann (1991)

  10. Syswerda, G.: Schedule Optimization Using Genetic Algorithm, Handbook of Genetic Algorithms, pp. 332–349. Van Nostrand Reinhold, New York (1991)

  11. Colorni, A., Dorgio, M., Maniezzo, V.: Genetic algorithm and highly constrained problems: the time-table case. In: Goos, G., Hartmanis, J. (eds.) Parallel Problem Solving form Nature, pp. 55–59. Springer-Verlag (1990)

  12. Larranga P., Kuijpers C.M.H. and Murga R.H. (1996). Learning Bayesian network structures for the best ordering with genetic algorithms. IEEE Trans. Syst. Man Cybernet. A: Syst. Hum. 26(4): 487–493

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Na Zhu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhu, N., Duan, Y. Partheno genetic algorithm for dynamic multi-services restoration in WDM networks. Photon Netw Commun 15, 183–190 (2008). https://doi.org/10.1007/s11107-007-0105-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-007-0105-y

Keywords

Navigation