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.
Similar content being viewed by others
References
Mokhtar A., Azizoglu M.: Adaptive wavelength routing in all-optical networks. IEEE/ACM Trans. Netw. 6(2), 197–206 (1998)
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)
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)
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)
Na Z., Yawei D.: Partheno genetic algorithm for dynamic multi-services restoration in WDM networks. Photonic Netw. Commun. 15(2), 183–190 (2008)
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)
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)
Gibbons R.: A Primer in Game Theory, pp. 4–37. FT Prentice Hall, Harlow (1992)
Nash J. Equilibrium points in n-person games. Proc. Natl Acad. Sci. 36, 48–49
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)
RFC3209-RSVP-TE: Extensions to RSVP for LSP Tunnels. Network Working Group, 2001
Huimin Y., Weimin W.: Data Structure (C Language). Tsinghua University Press, Beijing (2002)
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-010-0248-0