Skip to main content
Log in

A game equilibrated rapid dynamic restoration strategy in ASON

  • Published:
Photonic Network Communications Aims and scope Submit manuscript

Abstract

A dynamic equilibrated heuristic algorithm based on the D* principle and mixed-strategy game theory is proposed to resolve the restoration problem at the wavelength level in an automatically switched optical network (ASON). The cost of each edge and the wavelength occupancy was taken into account comprehensively. Nash equilibration between wavelength occupancy and path cost is solved and the evaluation function of the D* algorithm is constructed dynamically using game theory with a mixed strategy. Then, the system restores broken connections rapidly through dynamic route and wavelength assignment (RWA) and ensures a more balanced distribution of network resources in the process of dynamic channel restoration. Simulation results show that the blocking probability is reduced and the restoration probability is promoted effectively by this algorithm. In addition, the rapid and intelligent performance behavior of this algorithm can meet the requirements of restoration time.

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. Mokhtar A., Azizoglu M.: Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Netw. 6(2), 197–206 (1998)

    Article  Google Scholar 

  2. Lee K.C., Li V.O.K.: A wavelength rerouting algorithm in wide-area all-optical networks. J. Lightwave Technol. 14(6), 1218–1229 (1996)

    Article  Google Scholar 

  3. Chien, C., Subrata, B.: A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. Proceedings IEEE INFCOM’96, pp. 164–171 (1996)

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

    Article  Google Scholar 

  5. Na Z., Yawei D.: Partheno genetic algorithm for dynamic multi-services restoration in WDM networks. Photonic Netw. Commun. 15(2), 183–190 (2008)

    Article  Google Scholar 

  6. Stentz, A.: Optimal and efficient path planning for partially-known environments. Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, USA, pp. 3310–3317 (1994)

  7. Stentz, A.: The focused D* algorithm for real-time replanning. In: Proceedings of the International Joint Conference on Artificial Intelligence, Montreal, pp. 1231–1239 (1995)

  8. Gibbons R.: A Primer in Game Theory, pp. 4–37. FT Prentice Hall, Harlow (1992)

    MATH  Google Scholar 

  9. Nash J. Equilibrium points in n-person games. Proc. Natl Acad. Sci. 36, 48–49

  10. Hart P., Nilsson N., Raphael B.: Correction to a formal basis for the heuristic determination of minimum cost paths. SIGART Newslett. 37, 28–29 (1972)

    Google Scholar 

  11. RFC3209-RSVP-TE: Extensions to RSVP for LSP Tunnels. Network Working Group, 2001

  12. Huimin Y., Weimin W.: Data Structure (C Language). Tsinghua University Press, Beijing (2002)

    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., Zhang, Y., Cai, Y. et al. A game equilibrated rapid dynamic restoration strategy in ASON. Photon Netw Commun 20, 83–93 (2010). https://doi.org/10.1007/s11107-010-0248-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11107-010-0248-0

Keywords

Navigation